Quantum Telecomputation

TL;DR

This paper explores how quantum non-local effects enable distributed computation with minimal communication, demonstrating a faster quantum algorithm for mean estimation and its efficient parallelization using remote quantum processors.

Contribution

It introduces a quantum algorithm for mean estimation that surpasses classical methods and shows how to efficiently parallelize it with minimal communication.

Findings

Quantum algorithm for mean estimation is faster than classical algorithms.

Remote quantum processors can be coordinated with just one bit of communication.

Efficient parallelization of quantum algorithms using EPR pairs.

Abstract

Quantum mechanics permits certain kinds of non-local effects. This paper demonstrates how these can be used for distributed computation with minimal communication between various processors. The problem considered is that of estimating the mean of N items to a certain precision. First a serial quantum mechanical algorithm for this is presented that is faster than any classical algorithm. Next it is shown how this can be efficiently parallelized with quantum mechanical processors that are remotely located. These processors consist of coupled EPR particles. Each processor has just to communicate one bit of classical information to a central location at the end of its local computation.