Quantum Teleportation is a Universal Computational Primitive
Daniel Gottesman, Isaac L. Chuang

TL;DR
This paper introduces a method to implement universal quantum gates via teleportation, enabling quantum computation with minimal operations and fault-tolerance, simplifying quantum computer design.
Contribution
It demonstrates how to construct universal and fault-tolerant quantum gates using teleportation with entangled states, reducing the complexity of quantum computing architectures.
Findings
Universal quantum gates can be implemented through teleportation.
Fault-tolerant gate constructions are achievable with this method.
Quantum computers can be built using only single qubit operations, Bell measurements, and GHZ states.
Abstract
We present a method to create a variety of interesting gates by teleporting quantum bits through special entangled states. This allows, for instance, the construction of a quantum computer based on just single qubit operations, Bell measurements, and GHZ states. We also present straightforward constructions of a wide variety of fault-tolerant quantum gates.
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Neural Networks and Reservoir Computing
