Asymptotic teleportation scheme as a universal programmable quantum processor
Satoshi Ishizaka, Tohya Hiroshima

TL;DR
The paper presents an asymptotic quantum teleportation scheme using multiple entangled pairs, achieving near-perfect fidelity for large N, and functions as a universal programmable quantum processor.
Contribution
It introduces a protocol employing N entangled pairs and the square-root measurement to realize asymptotic teleportation with universal processing capabilities.
Findings
Perfect teleportation fidelity asymptotically achieved as N increases
Optimal measurement is the square-root measurement
Scheme functions as a universal programmable quantum processor
Abstract
We consider a scheme of quantum teleportation where a receiver has multiple (N) output ports and obtains the teleported state by merely selecting one of the N ports according to the outcome of the sender's measurement. We demonstrate that such teleportation is possible by showing an explicit protocol where N pairs of maximally entangled qubits are employed. The optimal measurement performed by a sender is the square-root measurement, and a perfect teleportation fidelity is asymptotically achieved for a large N limit. Such asymptotic teleportation can be utilized as a universal programmable processor.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
