Teleportation as a quantum computation

1996/05/23 by Gilles Brassard, Samuel L. Braunstein, Richard Cleve · 1 citation
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph

paper · pdf · doi:10.1016/s0167-2789(98)00043-8

published as Physica D120 (1998) 43-47 · 3 pages, LaTeX2e, PhysComp 96 submission

arxiv created 1996/05/23 · openalex publication_date 1998/09/01 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

An explicit quantum circuit is given to implement quantum teleportation. This circuit makes teleportation straightforward to anyone who believes that quantum computation is a reasonable proposition. It could also be genuinely used inside a quantum computer if teleportation is needed to move quantum information around. An unusual feature of this circuit is that there are points in the computation at which the quantum information can be completely disrupted by a measurement (or some types of interaction with the environment) without ill effects: the same final result is obtained whether or not these measurements takes place.

Citations

• Semiclassical Fourier Transform for Quantum Computation
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• Reversible quantum operations and their application to teleportation
• Quantum mechanical computers
• Elementary gates for quantum computation
• Good Quantum Error-Correcting Codes Exist
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Algorithms for quantum computation: discrete logarithms and factoring
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Cited by

• Quantum teleportation [wikipedia]