REVIEW 3 cited by
Quantum Telecomputation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 3 Pith papers
-
Sequential transmission at short times
The paper proves that if each coded channel is epsilon-close to the identity in diamond norm, the n-fold sequential composition has one-shot quantum capacity at least 1 - 2n epsilon minus a small entropy term.
-
Entanglement Cost of Erasure Correction in Quantum MDS Codes
For an [[n,2t-n]]_Q quantum MDS code, correcting a single erased node over a star network costs exactly 2t qudits when the replacement node is the hub and 2t minus 1 qudits when a helper node is the hub.
-
Networked Quantum Services
A survey of networked quantum services, from distributed quantum computers and cloud platforms to programming languages and standardization efforts.
Discussion (0). Continue with ORCID to comment.