Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations
Open accessThe DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index; 2 of the 10 sources its claims cite were checked for support.
Abstract
Algorithms such as quantum factoring and quantum search illustrate the great theoretical promise of quantum computers; but the practical implementation of such devices will require careful consideration of the minimum resource requirements, together with the development of procedures to overcome inevitable residual imperfections in physical systems. Many designs have been proposed, but none allow a large quantum computer to be built in the near future. Moreover, the known protocols for constructing reliable quantum computers from unreliable components can be complicated, often requiring many operations to produce a desired transformation. Here we show how a single technique—a generalization of quantum teleportation—reduces resource requirements for quantum computers and unifies known protocols for fault-tolerant quantum computation. We show that single quantum bit (qubit) operations, Bell-basis measurements and certain entangled quantum states such as Greenberger–Horne–Zeilinger (GHZ) states—all of which are within the reach of current technology—are sufficient to construct a universal quantum computer. We also present systematic constructions for an infinite class of reliable quantum gates that make the design of fault-tolerant quantum computers much more straightforward and methodical.
Overview
CoChat Summary
TL;DR
The paper shows that quantum teleportation through specially prepared entangled states can implement nonlocal gates, including CNOT, using only single-qubit operations, Bell measurements, and GHZ states. It extends this to fault-tolerant quantum computation by teleporting into ancilla states to perform Clifford and higher gates, giving an infinite family \(C_k\).
Key findings
- A controlled-NOT between two qubits can be deterministically accomplished by teleportation using classically controlled single-qubit operations, prior entanglement, and Bell-basis measurements; the required \(|\chi\rangle\) state can be created from two EPR pairs or two GHZ states.
- Any gate \(U\) that preserves the Pauli group under conjugation, i.e. the Clifford group \(C_2\), can be performed fault-tolerantly on stabilizer codes; for \(U \in C_3\), one constructs \(|\Psi^n_U\rangle\), Bell-measures the input with its upper half, and applies a correction \(R'_{xz} \in C_2\). \(C_3\) includes the Toffoli gate, the \(\pi/8\) gate, and the controlled-phase gate.
- The construction defines an infinite family \(C_k \equiv \{U \mid U C_1 U^\dagger \subseteq C_{k-1}\}\), all performable fault-tolerantly; every \(C_k\) contains interesting gates such as the \(\pi/2^k\) rotations used in Shor’s factoring algorithm. The states \(|\Psi^n_U\rangle\) needed for a gate in \(C_k\) are exponentially difficult in \(k\) to construct, but may be prepared offline.
- Fault-tolerant preparation uses cat states and recursive measurement; for \(r\) inner measurement trials, a total of \(r/2\) errors are required to ruin every majority calculation, and a single error propagates to at most one qubit in the data block.
Methods
- Theoretical quantum-circuit construction and algebraic analysis: teleportation, Bell-basis measurements, Pauli/Clifford group conjugation, and stabilizer codes; no experimental data are reported.
- Fault-tolerant protocol: encode an \(n\)-qubit state with a stabilizer code, such as the 7-qubit CSS code, prepare \(|\Psi^n_U\rangle\) as the \(+1\) eigenstate of \(M_i = X_i \otimes U X_i U^\dagger\) and \(N_i = Z_i \otimes U Z_i U^\dagger\), and measure these operators fault-tolerantly using cat states and recursive trials.
- Main analysis is by direct computation and circuit identities, with recursive nesting of the measurement procedure for \(C_4\) and higher gates.
Limitations
- Stated: the states \(|\Psi^n_U\rangle\) for \(C_k\) are exponentially difficult in \(k\) to construct; the precise set of gates forming \(C_k\) is still under investigation; and fault-tolerant measurement of \(M_i\) and \(N_i\) is the hard part, deferred to the Appendix.
- Stated: for general stabilizer codes there is no simple transversal implementation of \(M\), and recursive measurement requires multiple cat states, repeated trials, and error correction between trials.
- Evident: the paper is a theoretical proposal with no experimental demonstration; optical viability is argued from existing components and prior experiments, not implemented here.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
2 Valid · 1 Not valid · 8 Not checked · 27 Own results and interpretations
Every source the paper cites for this claim was checked and supports it.
In the paper
“using single photons as qubits and current optical technology, one can perform nearly perfect Bell basis measurements [20], quantum teleportation [21], almost create GHZ states [22], and certainly perform single qubit operations [19].”
What the sources say
- Supportedcites [22] Bouwmeester, D. et al. , 'Observation of three-photon Greenberger-Horne-Zeilinger entanglement,' Phys. Rev. Lett., 82 , 1345-9 (1999). source
The Abstract of Bouwmeester et al. (1999) reports the experimental observation of polarization entanglement of three spatially separated photons — a GHZ state (Eq. 11) — produced from two entangled pairs by parametric down-conversion with a Ti-sapphire laser and BBO crystals, i.e. single-photon qubits and contemporary optical technology. The paper itself marks the achievement as near- rather than fully perfect: the closing note states that 'rigorously speaking, this erasure technique is perfect, hence produces a pure GHZ state, only in the limit of infinitesimal pulse duration and infinitesimal filter bandwidth,' while their actual pulse and filter values suffice for 'a clearly observable entanglement'; the Discussion adds that GHZ entanglement is observed only conditioned on detection of the trigger plus three photons, with a fourfold-coincidence efficiency of order 10^-10 (about one event per 150 s) and a desired-to-undesired intensity ratio of 12:1. This matches the citing sentence's hedge 'almost create GHZ states'. (LLM, conf=0.85)
plainstates a possible cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“using single photons as qubits and current optical technology, one can perform nearly perfect Bell basis measurements [20], quantum teleportation [21], almost create GHZ states [22], and certainly perform single qubit operations [19].”
What the sources say
- Supportedcites [21] Bouwmeester D. et al. , 'Experimental quantum teleportation,' Nature 390 , 575-9 (1997). source
The paper states in its introduction (p. 1) that it reports 'the first experimental verification of quantum teleportation', transferring the polarization state of one photon to another using entangled photon pairs from parametric down-conversion and two-photon interferometry — i.e., single photons as qubits with ordinary optical technology (EXPERIMENTAL REALIZATION, p. 3; Fig. 1(b) set-up, p. 2). The RESULTS (pp. 4-6) confirm teleportation of +45, -45, 0, 90 and circular polarizations with visibilities 0.57-0.70, so the unqualified assertion that teleportation can be performed this way is supported. Note the source's own limitation — only two of the four Bell states can be identified (p. 3) — but the citing sentence attaches 'nearly perfect' to Bell basis measurements [20], not to this teleportation citation. (LLM, conf=0.90)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The same basic idea can be used to teleport two qubits through a cnot gate (a two-qubit gate which flips the 'target' qubit whenever the 'control' qubit is a | 1 〉 ); that is, the reconstructed qubits are the original ones transformed by a cnot gate operation.”
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, our teleportation construction provides a straightforward way to produce any gate in C 3 , as shown in Fig. 4.”
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
In the paper
“Moreover, | χ 〉 can be created from two pairs of GHZ [10] states (Fig. 3).”
What the sources say
- Not checked yetcites [10] Greenberger, D., Horne, M., Shimony A., and Zeilinger, A., 'Bell's theorem without inequalities,' Amer. J. Phys. 58 , 1131-43 (1990). source
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
27 more claims
Create a free account to see all 38 claims and to verify the 8 references still open.
- Probably not a substantial claim. 2
- It may state two separate claims as one. 4
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“BQC uses the concept of one-way quantum computing [33-37], a measurement-based model of computation [38, 39] which represents a paradigm shift in the understanding of complex data processing by clearly separating the classical and quantum parts of a computation.”
From Demonstration of Blind Quantum Computing (2012) · cites this paper as [38]
Experimental — accuracy not yet measuredThe check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Notwithstanding, two approaches exist to circumvent these issues: reducing the transmission loss using free-space communication [43,96,105,348,350,351,393-399] and decoherencefree subspaces [42,116,385,386,[388][389][390][391], or employing quantum repeaters.”
From Photonic quantum information processing: a review (2019) · cites this paper as [350]
Experimental — accuracy not yet measuredIn the citing paper
“In principle, this problem can be eliminated by frequently applying known but random Pauli products, thus modulating the Pauli frame and reducing the likelihood of coherent addition. This also has the beneficial effect of decoupling 17 weakly interacting environments.”
From Quantum computing with realistically noisy devices (2005) · cites this paper as [17]
Citations
Cites
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
Experimental quantum teleportation
Bouwmeester, D., Pan, J.-W., Mattle, K., Eibl, M., Weinfurter, H., & Zeilinger, A. (1997) · Nature · doi:10.1038/37539 · Cited by 5,545 · cited 1×
“For example, using single photons as qubits and current optical technology, one can perform nearly perfect Bell basis measurements [20], quantum teleportation [21], almost create GHZ states [22], and certainly perform single qubit operations [19].”
MethodElementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311 · cited 1×
“As any quantum computation can be performed using single-qubit operations and CNOT gate”
MethodError Correcting Codes in Quantum Theory
Steane, A. M. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.793 · Cited by 2,677 · cited 1×
“To see how this is accomplished, consider an n -qubit state | ψ i , in which each qubit is encoded using a stabilizer code, such as the 7-qubit CSS code [15,16].”
MethodBell’s theorem without inequalities
Greenberger, D. M., Horne, M. A., Shimony, A., & Zeilinger, A. (1990) · American Journal of Physics · doi:10.1119/1.16243 · Cited by 2,404 · cited 2×
“We show, for instance, that a quantum computer can be constructed using just single quantum bit (qubit) operations, Bell-basis measurements, and Greenberger-Horne-Zeilinger states [10].”
BackgroundMethodMultiple-particle interference and quantum error correction
(1996) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1996.0136 · Cited by 1,284 · cited 1×
“To see how this is accomplished, consider an n -qubit state | ψ i , in which each qubit is encoded using a stabilizer code, such as the 7-qubit CSS code [15,16].”
MethodObservation of Three-Photon Greenberger-Horne-Zeilinger Entanglement
Bouwmeester, D., Pan, J.-W., Daniell, M., Weinfurter, H., & Zeilinger, A. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.1345 · Cited by 1,061 · cited 1×
“For example, using single photons as qubits and current optical technology, one can perform nearly perfect Bell basis measurements [20], quantum teleportation [21], almost create GHZ states [22], and certainly perform single qubit operations [19].”
MethodPreskill, J. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0167 · Cited by 994 · cited 2×
“…of algorithms such as quantum factoring [1] and quantum search [2] will require both a design for a large system capable of very accurate controlled unitary evolution, and good fault-tolerant procedures to overcome inevitable residual imperfections in the physical realization of this system [3–5].”
BackgroundTheory of fault-tolerant quantum computation
Gottesman, D. (1998) · Physical Review A · doi:10.1103/physreva.57.127 · Cited by 947 · cited 4×
“…of algorithms such as quantum factoring [1] and quantum search [2] will require both a design for a large system capable of very accurate controlled unitary evolution, and good fault-tolerant procedures to overcome inevitable residual imperfections in the physical realization of this system [3–5].”
BackgroundInfluentialSelf-citationFault-tolerant quantum computation
Shor, P. W. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548464 · Cited by 892 · cited 3×
“Cat-state control is the method utilized in [7] and [23] to provide fault-tolerant measurement of Pauli operators (elements of C 1 ).”
BackgroundMethod
Research works printed but not linked: 1
- Shor, P., 'Algorithms for quantum computation: discrete logarithms and factoring,' Proc. 35 th Ann. Symp. on Found. of Computer Science (IEEE Comp. Soc. Press, Los Alamitos, CA, 1994) 124-134, quant-ph/9508027. · arXiv
Cited by
Items 101–200 of 1,005
Progress in quantum teleportation
Hu, X.-M., Guo, Y., Liu, B.-H., Li, C.-F., & Guo, G.-C. (2023) · Nature Reviews Physics · doi:10.1038/s42254-023-00588-x · Cited by 261
Physics, Topology, Logic and Computation: A Rosetta Stone
Baez, J., & Stay, M. (2010) · Lecture Notes in Physics · doi:10.1007/978-3-642-12821-9_2 · Cited by 254
Demonstration of a Simple Entangling Optical Gate and Its Use in Bell-State Analysis
Langford, N. K., Weinhold, T. J., Prevedel, R., Resch, K. J., Gilchrist, A., O’Brien, J. L., Pryde, G. J., & White, A. G. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.210504 · Cited by 262
Hyperentanglement-assisted Bell-state analysis
Walborn, S. P., Pádua, S., & Monken, C. H. (2003) · Physical Review A · doi:10.1103/physreva.68.042313 · Cited by 245
On-demand quantum state transfer and entanglement between remote microwave cavity memories
Axline, C. J., Burkhart, L. D., Pfaff, W., Zhang, M., Chou, K., Campagne-Ibarcq, P., Reinhold, P., Frunzio, L., Girvin, S. M., Jiang, L., et al. (2018) · Nature Physics · doi:10.1038/s41567-018-0115-y · Cited by 244
“Entanglement is a critical resource in quantum networks, and its rapid and on-demand generation will enable high-level operations between remote modules such as non-local gates 34 and entanglement distillation 35,36 .”
BackgroundUniversal Resources for Measurement-Based Quantum Computation
Van den Nest, M., Miyake, A., Dür, W., & Briegel, H. J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.150504 · Cited by 238
Measurement-based quantum computation beyond the one-way model
Gross, D., Eisert, J., Schuch, N., & Perez-Garcia, D. (2007) · Physical Review A · doi:10.1103/physreva.76.052315 · Cited by 236
Toward large-scale fault-tolerant universal photonic quantum computing
Takeda, S., & Furusawa, A. (2019) · APL Photonics · doi:10.1063/1.5100160 · Cited by 234
“Furthermore, the success probability is shown to be increased based on the technique of quantum teleportation 27,28 , a process whereby an unknown state of a qubit is transferred to another qubit.”
Memory-built-in quantum teleportation with photonic and atomic qubits
Chen, Y.-A., Chen, S., Yuan, Z.-S., Zhao, B., Chuu, C.-S., Schmiedmayer, J., & Pan, J.-W. (2008) · Nature Physics · doi:10.1038/nphys832 · Cited by 205
Deterministic multi-qubit entanglement in a quantum network
Zhong, Y., Chang, H.-S., Bienfait, A., Dumur, É., Chou, M.-H., Conner, C. R., Grebel, J., Povey, R. G., Yan, H., Schuster, D. I., et al. (2021) · Nature · doi:10.1038/s41586-021-03288-7 · Cited by 213
Experimental quantum teleportation of a two-qubit composite system
Zhang, Q., Goebel, A., Wagenknecht, C., Chen, Y.-A., Zhao, B., Yang, T., Mair, A., Schmiedmayer, J., & Pan, J.-W. (2006) · Nature Physics · doi:10.1038/nphys417 · Cited by 221
“As shown in equations (2) and (3), the projection measurements onto 13 + Φ”
BackgroundGauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes
Bombín, H. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/8/083002 · Cited by 217
A quantum-logic gate between distant quantum-network modules
Daiss, S., Langenfeld, S., Welte, S., Distante, E., Thomas, P., Hartung, L., Morin, O., & Rempe, G. (2021) · Science · doi:10.1126/science.abe3150 · Cited by 214
“Towards this goal, gate teleportation has been proposed [14].”
BackgroundMagic-State Distillation in All Prime Dimensions Using Quantum Reed-Muller Codes
Campbell, E. T., Anwar, H., & Browne, D. E. (2012) · Physical Review X · doi:10.1103/physrevx.2.041021 · Cited by 164
Simple scheme for efficient linear optics quantum gates
Ralph, T. C., White, A. G., Munro, W. J., & Milburn, G. J. (2001) · Physical Review A · doi:10.1103/physreva.65.012314 · Cited by 205
Distributed quantum computing across an optical network link
Main, D., Drmota, P., Nadlinger, D. P., Ainley, E. M., Agrawal, A., Nichol, B. C., Srinivas, R., Araneda, G., & Lucas, D. M. (2025) · Nature · doi:10.1038/s41586-024-08404-x · Cited by 192
“Photons, however, make natural carriers of quantum information since they can travel long distances without significant degradation of their quantum state.”
Long-Distance Measurement-Device-Independent Multiparty Quantum Communication
Fu, Y., Yin, H.-L., Chen, T.-Y., & Chen, Z.-B. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.090501 · Cited by 207
Low-overhead constructions for the fault-tolerant Toffoli gate
Jones, C. (2013) · Physical Review A · doi:10.1103/physreva.87.022328 · Cited by 204
“One can readily verify that only four T gates are required in this procedure [2, 20].”
BackgroundMethodQuantum Software Engineering: Landscapes and HorizonsPreprint
Zhao, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.07047 · Cited by 307
“Among them, Gottesman and Chuang [111] proposed an inter-”
BackgroundInfluentialDeterministic quantum teleportation between distant atomic objects
Krauter, H., Salart, D., Muschik, C. A., Petersen, J. M., Shen, H., Fernholz, T., & Polzik, E. S. (2013) · Nature Physics · doi:10.1038/nphys2631 · Cited by 192
Quantum teleportation on a photonic chip
Metcalf, B. J., Spring, J. B., Humphreys, P. C., Thomas-Peter, N., Barbieri, M., Kolthammer, W. S., Jin, X.-M., Langford, N. K., Kundys, D., Gates, J. C., et al. (2014) · Nature Photonics · doi:10.1038/nphoton.2014.217 · Cited by 188
“Whilst integrated photonics offers a feasible route to larger-scale LOQC, this work shows that continuing advances in waveguide and photon source technology will be critical in addressing the challenges posed by complex integrated circuits - coping with the increased loss and identifying and correcting component error…”
BackgroundMethodInfluentialDanos, V., Kashefi, E., & Panangaden, P. (2007) · Journal of the ACM · doi:10.1145/1219092.1219096 · Cited by 195
“Recently physicists have introduced novel ideas based on the use of measurement and entanglement to perform computation [ GC99 , RB01, RBB03, Nie03].”
BackgroundMethodInfluentialA new universal and fault-tolerant quantum basis
Boykin, P. O., Mor, T., Pulver, M., Roychowdhury, V., & Vatan, F. (2000) · Information Processing Letters · doi:10.1016/s0020-0190(00)00084-3 · Cited by 194
“Gottesman and Chuang [11] present a technique for the general construction of our faulttolerant implementation of the gates outside of the normalizer group.”
MethodTeleportation improvement by conditional measurements on the two-mode squeezed vacuum
Cochrane, P. T., Ralph, T. C., & Milburn, G. J. (2002) · Physical Review A · doi:10.1103/physreva.65.062306 · Cited by 196
Orbital angular momentum multiplexed deterministic all-optical quantum teleportation
Liu, S., Lou, Y., & Jing, J. (2020) · Nature Communications · doi:10.1038/s41467-020-17616-4 · Cited by 188
Charge Detection Enables Free-Electron Quantum Computation
Beenakker, C. W. J., DiVincenzo, D. P., Emary, C., & Kindermann, M. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.020501 · Cited by 195
“Two Bell measurements teleport the cnot operation into the computation [23], when needed.”
MethodCao, G., Li, H.-O., Tu, T., Wang, L., Zhou, C., Xiao, M., Guo, G.-C., Jiang, H.-W., & Guo, G.-P. (2013) · Nature Communications · doi:10.1038/ncomms2412 · Cited by 186
Liu, Z.-W., & Winter, A. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020333 · Cited by 166
3/4-Efficient Bell Measurement with Passive Linear Optics and Unentangled Ancillae
Ewert, F., & van Loock, P. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.140403 · Cited by 185
Probabilistic quantum teleportation
Agrawal, P., & Pati, A. K. (2002) · Physics Letters A · doi:10.1016/s0375-9601(02)01383-x · Cited by 183
Experimental Teleportation of a Quantum Controlled-NOT Gate
Huang, Y.-F., Ren, X.-F., Zhang, Y.-S., Duan, L.-M., & Guo, G.-C. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.240501 · Cited by 180
Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
Zhang, X.-M., Li, T., & Yuan, X. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.230504 · Cited by 173
Coherence depletion in the Grover quantum search algorithm
Shi, H.-L., Liu, S.-Y., Wang, X.-H., Yang, W.-L., Yang, Z.-Y., & Fan, H. (2017) · Physical Review A · doi:10.1103/physreva.95.032307 · Cited by 180
Coecke, B. (2010) · Contemporary Physics · doi:10.1080/00107510903257624 · Cited by 176
Enhanced Fault-Tolerant Quantum Computing ind-Level Systems
Campbell, E. T. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.230501 · Cited by 184
Quantum teleportation from a propagating photon to a solid-state spin qubit
Gao, W. B., Fallahi, P., Togan, E., Delteil, A., Chin, Y. S., Miguel-Sanchez, J., & Imamoğlu, A. (2013) · Nature Communications · doi:10.1038/ncomms3744 · Cited by 164
“The spin state corresponding to this measurement outcome is /jS|CS1⁄4 a|mSþb|kS, as can be verified from equation (2).”
Verification of Quantum Computation: An Overview of Existing Approaches
Gheorghiu, A., Kapourniotis, T., & Kashefi, E. (2019) · Theory of Computing Systems · doi:10.1007/s00224-018-9872-3 · Cited by 166
“This manner of performing gates is known as gate teleportation [55].”
BackgroundFault-Tolerant quantum computation with constant overhead
Gottesman, D. (2014) · Quantum Information and Computation · doi:10.26421/qic14.15-16-5 · Cited by 172
Self-citationExperimental purification of two-atom entanglement
Reichle, R., Leibfried, D., Knill, E., Britton, J., Blakestad, R. B., Jost, J. D., Langer, C., Ozeri, R., Seidelin, S., & Wineland, D. J. (2006) · Nature · doi:10.1038/nature05146 · Cited by 174
“The ion qubits of both entangled pairs are (1) rotated by R(p/2, p/4) (see Methods), (2) connected by two-ion e 5 p/4-phase gates across the pairs (marked with Z), (3) rotated by R(p, 5p/4), (4) connected by two-ion e 5 p/4-phase gates again and (5) finally rotated by R(p/2, p/4).”
BackgroundTopological phases with generalized global symmetries
Yoshida, B. (2016) · Physical review. B./Physical review. B · doi:10.1103/physrevb.93.155131 · Cited by 220
Kubica, A., Yoshida, B., & Pastawski, F. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/8/083026 · Cited by 148
Long-Range Entanglement from Measuring Symmetry-Protected Topological Phases
Tantivasadakarn, N., Thorngren, R., Vishwanath, A., & Verresen, R. (2024) · Physical Review X · doi:10.1103/physrevx.14.021040 · Cited by 297
Fault-tolerant bosonic quantum error correction with the surface–Gottesman-Kitaev-Preskill code
Noh, K., & Chamberland, C. (2020) · Physical Review A · doi:10.1103/physreva.101.012316 · Cited by 164
Fault-tolerant quantum computation with cluster states
Nielsen, M. A., & Dawson, C. M. (2005) · Physical Review A · doi:10.1103/physreva.71.042323 · Cited by 161
Complete Quantum Teleportation with a Kerr Nonlinearity
Vitali, D., Fortunato, M., & Tombesi, P. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.445 · Cited by 164
Deterministic quantum teleportation through fiber channels
Huo, M., Qin, J., Cheng, J., Yan, Z., Qin, Z., Su, X., Jia, X., Xie, C., & Peng, K. (2018) · Science Advances · doi:10.1126/sciadv.aas9401 · Cited by 161
Fault-Tolerant Conversion between the Steane and Reed-Muller Quantum Codes
Anderson, J. T., Duclos-Cianci, G., & Poulin, D. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.080501 · Cited by 161
Yukawa, M., Miyata, K., Mizuta, T., Yonezawa, H., Marek, P., Filip, R., & Furusawa, A. (2013) · Optics Express · doi:10.1364/oe.21.005529 · Cited by 163
Quantum gate teleportation between separated qubits in a trapped-ion processor
Wan, Y., Kienzler, D., Erickson, S. D., Mayer, K. H., Tan, T. R., Wu, J. J., Vasconcelos, H. M., Glancy, S., Knill, E., Wineland, D. J., et al. (2019) · Science · doi:10.1126/science.aaw9415 · Cited by 155
“03(1) for the CNOT gates in the double-well potentials.”
BackgroundMethodInfluentialEnhancing Cavity Quantum Electrodynamics via Antisqueezing: Synthetic Ultrastrong Coupling
Leroux, C., Govia, L. C. G., & Clerk, A. A. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.093602 · Cited by 161
Secure multi-party quantum computation
Crépeau, C., Gottesman, D., & Smith, A. (2002) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/509907.510000 · Cited by 167
Self-citationEfficient magic state factories with a catalyzed | C C Z ⟩ to 2 | T ⟩ transformation
Gidney, C., & Fowler, A. G. (2019) · Quantum · doi:10.22331/q-2019-04-30-135 · Cited by 152
“Contrast with gate teleportation [18], which consumes a previously prepared Z|+〉 state in order to perform one Z operation, with a 50% chance of requiring a fixup Z−2θ operation.”
MethodNoh, K., Albert, V. V., & Jiang, L. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2873764 · Cited by 157
“(The notion of Clifford hierarchy is due to [53].”
BackgroundQuantum computation by measurement and quantum memory
Nielsen, M. A. (2003) · Physics Letters A · doi:10.1016/s0375-9601(02)01803-0 · Cited by 150
Zhao, Z., Zhang, A.-N., Chen, Y.-A., Zhang, H., Du, J.-F., Yang, T., & Pan, J.-W. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.030501 · Cited by 141
Experimental on-demand recovery of entanglement by local operations within non-Markovian dynamics
Orieux, A., D'Arrigo, A., Ferranti, G., Franco, R. L., Benenti, G., Paladino, E., Falci, G., Sciarrino, F., & Mataloni, P. (2015) · Scientific Reports · doi:10.1038/srep08575 · Cited by 161
“From (18) and (19), we can derive the entanglement of formation by means of Eq.”
BackgroundClassification of Topologically Protected Gates for Local Stabilizer Codes
Bravyi, S., & König, R. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.170503 · Cited by 151
Faster quantum chemistry simulation on fault-tolerant quantum computers
Cody Jones, N., Whitfield, J. D., McMahon, P. L., Yung, M.-H., Meter, R. V., Aspuru-Guzik, A., & Yamamoto, Y. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/11/115023 · Cited by 145
“The CNOT ladder is a sparse network of Clifford gates, so we show how it may be implemented in constant time using teleportation [46, 47].”
MethodOptical hybrid approaches to quantum information
van Loock, P. (2011) · Laser & Photonics Review · doi:10.1002/lpor.201000005 · Cited by 177
Lee, S.-W., & Jeong, H. (2013) · Physical Review A · doi:10.1103/physreva.87.022326 · Cited by 161
“A teleportation protocol is necessary to perform near-deterministic Hadamard and CZ operations [19].”
BackgroundMethodQuantum advantage with noisy shallow circuits
Bravyi, S., Gosset, D., König, R., & Tomamichel, M. (2020) · Nature Physics · doi:10.1038/s41567-020-0948-z · Cited by 144
Teleportation via thermally entangled states of a two-qubit HeisenbergXXchain
Yeo, Y. (2002) · Physical Review A · doi:10.1103/physreva.66.062312 · Cited by 149
Multipartite entanglement for entanglement teleportation
Lee, J., Min, H., & Oh, S. D. (2002) · Physical Review A · doi:10.1103/physreva.66.052318 · Cited by 146
Large gradients via correlation in random parameterized quantum circuits
Volkoff, T., & Coles, P. J. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abd891 · Cited by 143
“, quantum communication protocols that rely on collective measurements for their efficiency [31]), variational versions require new approaches for avoiding BPL.”
Scalable quantum computing in the presence of large detected-error rates
Knill, E. (2005) · Physical Review A · doi:10.1103/physreva.71.042322 · Cited by 138
Zeilinger, A., Weihs, G., Jennewein, T. D., & Aspelmeyer, M. (2005) · Nature · doi:10.1038/nature03280 · Cited by 169
Lower bounds on the non-Clifford resources for quantum computations
Beverland, M., Campbell, E., Howard, M., & Kliuchnikov, V. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8963 · Cited by 140
“Measurement with probability 1/2 We can further tighten some lower bounds in a common restricted setting [21, 23, 25, 32] where arbitrary single-qubit Pauli measurements are not permitted, but only those measurements with outcomes which occur with probability one half.”
BackgroundEntangling logical qubits with lattice surgery
Erhard, A., Poulsen Nautrup, H., Meth, M., Postler, L., Stricker, R., Stadler, M., Negnevitsky, V., Ringbauer, M., Schindler, P., Briegel, H. J., et al. (2021) · Nature · doi:10.1038/s41586-020-03079-6 · Cited by 134
Preparation of Entangled and Antiferromagnetic States by Dissipative Rydberg Pumping
Carr, A., & Saffman, M. E. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.033607 · Cited by 156
Repeat-until-success quantum computing using stationary and flying qubits
Lim, Y. L., Barrett, S. D., Beige, A., Kok, P., & Kwek, L. C. (2006) · Physical Review A · doi:10.1103/physreva.73.012304 · Cited by 138
Quantum Teleportation with a Quantum Dot Single Photon Source
Fattal, D., Diamanti, E., Inoue, K., & Yamamoto, Y. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.037904 · Cited by 138
Quantifying the magic of quantum channels
Wang, X., Wilde, M. M., & Su, Y. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab451d · Cited by 190
“Furthermore, by the method of state injection [39, 94], one can generate a T gate by acting with stabilizer operations on the T state | T (cid:105) .”
BackgroundMethodA practical architecture for reliable quantum computers
Oskin, M., Chong, F. T., & Chuang, I. L. (2002) · Computer · doi:10.1109/2.976922 · Cited by 137
Self-citationTheory of channel simulation and bounds for private communication
Pirandola, S., Braunstein, S. L., Laurenza, R., Ottaviani, C., Cope, T. P. W., Spedalieri, G., & Banchi, L. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aac394 · Cited by 143
Unified derivations of measurement-based schemes for quantum computation
Childs, A. M., Leung, D. W., & Nielsen, M. A. (2005) · Physical Review A · doi:10.1103/physreva.71.032318 · Cited by 137
“au to fault-tolerant quantum computation in which measurements and simple quantum gates are used to implement other quantum gates that are difficult to apply directly [6, 7, 8, 9, 10, 11, 12].”
BackgroundMethodInfluentialQuantum computation, quantum theory and AI
Ying, M. (2009) · Artificial Intelligence · doi:10.1016/j.artint.2009.11.009 · Cited by 159
Probabilistic Quantum Teleportation
Agrawal, P., & Pati, A. K. (2002) · CERN Document Server (European Organization for Nuclear Research) · Cited by 131
High-Fidelity Quantum Logic Operations Using Linear Optical Elements
Franson, J. D., Donegan, M. M., Fitch, M. J., Jacobs, B. C., & Pittman, T. B. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.137901 · Cited by 91
Hierarchy of Topological Order From Finite-Depth Unitaries, Measurement, and Feedforward
Tantivasadakarn, N., Vishwanath, A., & Verresen, R. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.020339 · Cited by 220
Effective Fault-Tolerant Quantum Computation with Slow Measurements
DiVincenzo, D. P., & Aliferis, P. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.020501 · Cited by 135
Integrated Source of Spectrally Filtered Correlated Photons for Large-Scale Quantum Photonic Systems
Harris, N. C., Grassani, D., Simbula, A., Pant, M., Galli, M., Baehr-Jones, T., Hochberg, M., Englund, D., Bajoni, D., & Galland, C. (2014) · Physical Review X · doi:10.1103/physrevx.4.041047 · Cited by 115
Piroli, L., Styliaris, G., & Cirac, J. I. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.220503 · Cited by 211
Review of Distributed Quantum Computing: From single QPU to High Performance Quantum Computing
Barral, D., Cardama, F. J., Díaz-Camacho, G., Faílde, D., Llovo, I. F., Juane, M. M., Vázquez-Pérez, J., Villasuso, J., Piñeiro, C., Costas, N., et al. (2025) · Computer Science Review · doi:10.1016/j.cosrev.2025.100747 · Cited by 243
“Quantum gate teleportation, also known as telegate, reduces the topological requirements by substituting two-qubit gates with other cost-e ff ective resources: auxiliary entangled states, local measurements, and single-qubit operations [45].”
Generalized measurements by linear elements
Calsamiglia, J. (2002) · Physical Review A · doi:10.1103/physreva.65.030301 · Cited by 122
Repeated multi-qubit readout and feedback with a mixed-species trapped-ion register
Negnevitsky, V., Marinelli, M., Mehta, K. K., Lo, H.-Y., Flühmann, C., & Home, J. P. (2018) · Nature · doi:10.1038/s41586-018-0668-z · Cited by 134
Generalized flow and determinism in measurement-based quantum computation
Browne, D. E., Kashefi, E., Mhalla, M., & Perdrix, S. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/8/250 · Cited by 125
“teleportation-based models [ 14 , 15]), since there exist compositional embeddings from the one-way model to all other MQC models [6].”
Teleportation Systems Toward a Quantum Internet
Valivarthi, R., Davis, S. I., Peña, C., Xie, S., Lauk, N., Narváez, L., Allmaras, J. P., Beyer, A. D., Gim, Y., Hussein, M., et al. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020317 · Cited by 159
Quantum information with top quarks in QCD
Afik, Y., & de Nova, J. R. M. (2022) · Quantum · doi:10.22331/q-2022-09-29-820 · Cited by 204
Dark Entangled Steady States of Interacting Rydberg Atoms
Rao, D. D. B., & Mølmer, K. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.033606 · Cited by 135
Adaptive Quantum Computation, Constant Depth Quantum Circuits and Arthur-Merlin Games
Terhal, B. M., & DiVincenzo, D. P. (2004) · Quantum Information and Computation · doi:10.26421/qic4.2-5 · Cited by 107
Continuous-variable quantum computing in the quantum optical frequency comb
Pfister, O. (2020) · Journal of Physics B: Atomic, Molecular and Optical Physics · doi:10.1088/1361-6455/ab526f · Cited by 123
Identifying Phases of Quantum Many-Body Systems That Are Universal for Quantum Computation
Doherty, A. C., & Bartlett, S. D. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.020506 · Cited by 147
QUANTUM COMPUTATION BY MEASUREMENTS
LEUNG, D. W. (2004) · International Journal of Quantum Information · doi:10.1142/s0219749904000055 · Cited by 85
Universal transversal gates with color codes: A simplified approach
Kubica, A., & Beverland, M. E. (2015) · Physical Review A · doi:10.1103/physreva.91.032330 · Cited by 128
Complete Conditions for Entanglement Transfer
Paternostro, M., Son, W., & Kim, M. S. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.197901 · Cited by 136
Entanglement Purification for Quantum Computation
Dür, W., & Briegel, H.-J. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.067901 · Cited by 123
Towards Large-scale Functional Verification of Universal Quantum Circuits
Amy, M. (2019) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.287.1 · Cited by 170
“In this work we propose a novel framework for the formal specification and functional verification of unitary (i.e., measurement-free) quantum circuits over a universal gate set – specifically, the Clifford group extended with Z -axis rotations taken from the Clifford hierarchy [17].”
MethodHeim, B., Soeken, M., Marshall, S., Granade, C., Roetteler, M., Geller, A., Troyer, M., & Svore, K. M. (2020) · Nature Reviews Physics · doi:10.1038/s42254-020-00245-7 · Cited by 158
Discrete Wigner functions and quantum computational speedup
Galvão, E. F. (2005) · Physical Review A · doi:10.1103/physreva.71.042302 · Cited by 144
Kuang, L., & Zhou, L. (2003) · Physical Review A · doi:10.1103/physreva.68.043606 · Cited by 121
Metadata
- Authors
- Gottesman, D., & Chuang, I. L.
- Affiliations
- Microsoft (United States) (US)
- IBM Research - Almaden (US)
- Corresponding author
- Chuang, Isaac L.
- Venue
- Nature
- Published
- 1999-11
- Volume
- 402
- Issue
- 6760
- Pages
- 390-393
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W1490521149
- Semantic Scholar
- c29d001749ee295c1bc36572a862342f9d56d44b
- Cited by
- 1,860
- References
- 27
- Citations by year
- 2026: 80 · 2025: 158 · 2024: 126 · 2023: 93 · 2022: 91 · 2021: 103 · 2020: 84 · 2019: 87 · 2018: 62 · 2017: 59 · 2016: 61 · 2015: 79 · 2014: 54 · 2013: 59 · 2012: 41
- FWCI
- 28.04
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Nature (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- Funders
- Space Telescope Science Institute
- Kempe Foundation
- Defense Advanced Research Projects Agency
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- universal quantum computation, fault-tolerant quantum computing, quantum teleportation, single-qubit operations, Bell-basis measurement, GHZ states, entanglement, resource requirements, quantum error correction
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-07, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-07 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (qwen3.8-omni-flash).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.