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 901–1,000 of 1,005
Stabilizer quantum error correction with quantum bus computation
Myers, C. R., Silva, M. P. D., Nemoto, K., & Munro, W. J. (2007) · Physical Review A · doi:10.1103/physreva.76.012303 · Cited by 14
Chung, T., Bartlett, S. D., & Doherty, A. C. (2009) · Canadian Journal of Physics · doi:10.1139/p08-112 · Cited by 15
Generation of W atomic states assisted by cavities
Becerra-Castro, E. M., Cardoso, W. B., Avelar, A. T., & Baseia, B. (2008) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/0953-4075/41/21/215505 · Cited by 12
Teleportation and dense coding via a multiparticle quantum channel of the GHZ-class
Горбачев, В. Н., Zhiliba, A. I., Trubilko, A. I., & Rodichkina, A. A. (2002) · Quantum Information and Computation · doi:10.26421/qic2.5-4 · Cited by 12
Efficient photon counting and single-photon generation using resonant nonlinear optics
Johnsson, M., & Fleischhauer, M. (2003) · Physical Review A · doi:10.1103/physreva.67.061802 · Cited by 12
Photon counting schemes and performance of non-deterministic nonlinear gates in linear optics
Bartlett, S. D., Diamanti, E., Sanders, B. C., & Yamamoto, Y. (2002) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.451332 · Cited by 19
Entanglement generation in harmonic chains: Tagging by squeezing
Paternostro, M., Kim, M. S., Park, E., & Lee, J. (2005) · Physical Review A · doi:10.1103/physreva.72.052307 · Cited by 13
The entanglement of the four-photon cluster state
Schmid, C., Kiesel, N., Wieczorek, W., & Weinfurter, H. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/7/236 · Cited by 15
Automated Quantum Program Verification in Dynamic Quantum Logic
Takagi, T., Do, C. M., & Ogata, K. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-51777-8_5 · Cited by 11
Noise mitigation in quantum teleportation
Xu, Z., & An, J. (2024) · Physical Review A · doi:10.1103/physreva.110.012442 · Cited by 13
Symmetric Clifford twirling for cost-optimal quantum error mitigation in early FTQC regime
Tsubouchi, K., Mitsuhashi, Y., Sharma, K., & Yoshioka, N. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01050-9 · Cited by 33
On Groups in the Qubit Clifford Hierarchy
Anderson, J. T. (2024) · Quantum · doi:10.22331/q-2024-06-13-1370 · Cited by 30
“The n -qubit Clifford Hierarchy [1, 10] is recursively defined as with the first level ( k = 1 ) defined as CH 1 ≡ P n , the n -qubit Pauli group.”
BackgroundCircuit Partitioning for Multi-Core Quantum Architectures with Deep Reinforcement Learning
Pastor, A., Escofet, P., Rached, S. B., Alarcón, E., Barlet‐Ros, P., & Abadal, S. (2024) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas58744.2024.10557956 · Cited by 24
“This teleportation protocol is quantum-coherence, thereby enabling the transmission of arbitrary quantum states [16].”
BackgroundMethodGroup frames via magic states with applications to SIC-POVMs and MUBs
Feng, L., & Luo, S. (2024) · Communications in Theoretical Physics · doi:10.1088/1572-9494/ad7942 · Cited by 15
Quantum teleportation via a hybrid channel and investigation of its success probability
Hosseiny, S. M., Seyed‐Yazdi, J., & Norouzi, M. (2024) · Scientific Reports · doi:10.1038/s41598-024-76220-4 · Cited by 13
Hashim, A., Carignan-Dugas, A., Chen, L., Jünger, C., Fruitwala, N., Xu, Y., Huang, G., Wallman, J. J., & Siddiqi, I. A. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010307 · Cited by 31
Stabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoders
Shi, Y. B., Patil, A., & Guha, S. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010339 · Cited by 26
“Entanglement is essential for quantum communication [1–4], quantum metrology [5–8], and distributed quantum computing [9–13], but it is severely limited by noise [14–18].”
Variational Simulation of the Lipkin-Meshkov-Glick Model on a Neutral Atom Quantum Computer
Chinnarasu, R., Poole, C., Phuttitarn, L., Noori, A., Graham, T. M., Coppersmith, S., Balantekin, A., & Saffman, M. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.020350 · Cited by 19
“Universal paradigms for enabling arbitrary connectivity rely on either moving quantum states across the processor with a sequence of swap gates[1] or using teleportation[2].”
Quantum magic in quantum electrodynamics
Liu, Q., Low, I., & Yin, Z. (2025) · Physical review. D/Physical review. D. · doi:10.1103/l8vw-kwhz · Cited by 40
Tailoring teleportation to the quantum alphabet
Cochrane, P. T., & Ralph, T. C. (2003) · Physical Review A · doi:10.1103/physreva.67.022313 · Cited by 11
Communication Cost of Quantum Processes
Yang, Y., Chiribella, G., & Hayashi, M. (2020) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2020.3016061 · Cited by 13
“Similar issues arise also in quantum computing, in particular in the tasks of quantum gate teleportation [4], [5] and delegated quantum computation [6], [7], [8], [9], when one party is asked to apply a sequence of quantum gates on an input state remotely provided by another party.”
BackgroundCharacterizing qubit channels in the context of quantum teleportation
Ghosal, A., Das, D., & Banerjee, S. (2021) · Physical Review A · doi:10.1103/physreva.103.052422 · Cited by 12
“Motivated from QT, innumerable quantum information theoretic and communication tasks ranging fromquantum repeaters [2], quantum gate teleportation [3] tomeasurement-based computing [4] have been proposed.”
BackgroundQuality of Control in the Tavis–Cummings–Hubbard Model
Düll, R., Kulagin, A., Lee, W., Ozhigov, Y. I., Miao, H., & Zheng, K. (2021) · Computational Mathematics and Modeling · doi:10.1007/s10598-021-09517-y · Cited by 15
Quantum teleportation of hybrid qubits and single-photon qubits using Gaussian resources
Bose, S., & Jeong, H. (2022) · Physical Review A · doi:10.1103/physreva.105.032434 · Cited by 16
Memory effects on bidirectional teleportation
Seida, C., Seddik, S., Hassouni, Y., & Allati, A. E. (2022) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2022.128115 · Cited by 15
Transformations of Stabilizer States in Quantum Networks
Englbrecht, M., Kraft, T., & Kraus, B. (2022) · Quantum · doi:10.22331/q-2022-10-25-846 · Cited by 13
Hosseiny, S. M. (2023) · Physica Scripta · doi:10.1088/1402-4896/acfc7a · Cited by 15
Universal resources for quantum computing
Wang, D. (2023) · Communications in Theoretical Physics · doi:10.1088/1572-9494/ad07d6 · Cited by 12
“MAGIC also depends on the Clifford hierarchy [ 109 ] .”
Entanglement generation between distant spins via quasilocal reservoir engineering
Dias, J., Wächtler, C. W., Nemoto, K., & Munro, W. J. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043295 · Cited by 11
Teleportation between distant qudits via scattering of mobile qubits
Ciccarello, F., Bose, S., & Zarcone, M. (2010) · Physical Review A · doi:10.1103/physreva.81.042318 · Cited by 11
Zhu, M.-Z., Zhao, C., & Ye, L. (2011) · Optics Communications · doi:10.1016/j.optcom.2011.07.042 · Cited by 11
Quantum logical gates with linear quadripartite cluster states of continuous variables
Tan, A., Xie, C., & Peng, K. (2009) · Physical Review A · doi:10.1103/physreva.79.042338 · Cited by 11
Quantum Teleportation of Dynamics and Effective Interactions between Remote Systems
Muschik, C. A., Hammerer, K., Polzik, E. S., & Cirac, J. I. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.020501 · Cited by 11
Wang, Z., Xia, Y., Chen, Y., & Song, J. (2016) · The European Physical Journal D · doi:10.1140/epjd/e2016-60638-3 · Cited by 11
Dark-state cooling of a trapped ion using microwave coupling
Lu, Y., Zhang, J., Cui, J., Cao, D.-Y., Zhang, S., Huang, Y., Li, C., & Guo, G. (2015) · Physical Review A · doi:10.1103/physreva.92.023420 · Cited by 12
Quantum teleportation protocol with an assistant who prepares amplitude modulated unknown qubits
Podoshvedov, S. A. (2018) · Journal of the Optical Society of America B · doi:10.1364/josab.35.000861 · Cited by 17
Analysing nonlocality robustness in multiqubit systems under noisy conditions and weak measurements
Singh, P., & Kumar, A. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2016-5 · Cited by 12
Choi states, symmetry-based quantum gate teleportation, and stored-program quantum computing
Wang, D. (2020) · Physical Review A · doi:10.1103/physreva.101.052311 · Cited by 15
Fault-tolerant quantum computation with probabilistic two-qubit gates
Goto, H., & Ichimura, K. (2009) · Physical Review A · doi:10.1103/physreva.80.040303 · Cited by 12
SCALABLE QUANTUM NETWORKS BASED ON FEW-QUBIT REGISTERS
Jiang, L., Taylor, J. M., Sørensen, A. S., & Lukin, M. D. (2010) · International Journal of Quantum Information · doi:10.1142/s0219749910006058 · Cited by 12
Constant depth fault-tolerant Clifford circuits for multi-qubit large block codes
Zheng, Y.-C., Lai, C., Brun, T. A., & Kwek, L. C. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/aba34d · Cited by 23
Kato, G., Owari, M., & Hayashi, M. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-72089-0_10 · Cited by 11
Computation with coherent states via teleportations to and from a quantum bus
Silva, M. P. D., & Myers, C. R. (2008) · Physical Review A · doi:10.1103/physreva.78.062314 · Cited by 11
Quantum teleportation with close-to-maximal entanglement from a beam splitter
Tran, N.-K., & Pfister, O. (2002) · Physical Review A · doi:10.1103/physreva.65.052313 · Cited by 12
“It is of primordial importance for communication between quantum computers, and the realization of quantum gates [4] and quantum error correction [5].”
BackgroundHomomorphic Logical Measurements
Huang, S., Jochym-O’Connor, T., & Yoder, T. J. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.030301 · Cited by 38
Transfer and teleportation of system-environment entanglement
Harlender, T., & Roszak, K. (2022) · Physical Review A · doi:10.1103/physreva.105.012407 · Cited by 12
Designing the Quantum Channels Induced by Diagonal Gates
Hu, J., Liang, Q., & Calderbank, R. (2022) · Quantum · doi:10.22331/q-2022-09-08-802 · Cited by 24
“The teleportation model of quantum computation introduced in [20] is closely related to the structure of the Clifford hierarchy (for details, see [1, 4, 5, 15, 33, 36, 42]).”
BackgroundMethodInfluentialCircuit knitting facing exponential sampling-overhead scaling bounded by entanglement cost
Jing, M., Zhu, C., & Wang, X. (2025) · Physical Review A · doi:10.1103/physreva.111.012433 · Cited by 22
C_3, semi-Clifford and genralized semi-Clifford operations
Beigi, S., & Shor, P. W. (2010) · Quantum Information and Computation · doi:10.26421/qic10.1-2-4 · Cited by 10
“(1) Gottesman and Chuang in [2] introduce these sets and show that all Ck gates can be applied fault-tolerantly via teleportation.”
BackgroundThomas, P. J., Chunnilall, C. J., Stothard, D. J. M., Walsh, D. A., & Dunn, M. H. (2010) · Optics Express · doi:10.1364/oe.18.026600 · Cited by 12
Atomic quantum information processing in low-Q cavity in the intermediate coupling region
Su, S., Guo, Q., Zhu, L., Wang, H., & Zhang, S. (2012) · Journal of the Optical Society of America B · doi:10.1364/josab.29.002827 · Cited by 10
UNITARY-CIRCUIT SEMANTICS FOR MEASUREMENT-BASED COMPUTATIONS
de Beaudrap, N. (2010) · International Journal of Quantum Information · doi:10.1142/s0219749910006113 · Cited by 14
Microscopic quantum dynamics study on the noise threshold of fault-tolerant quantum error correction
Cheng, Y., & Silbey, R. (2005) · Physical Review A · doi:10.1103/physreva.72.012320 · Cited by 11
Rossatto, D. Z., & Villas-Bôas, C. J. (2013) · Physical Review A · doi:10.1103/physreva.88.042324 · Cited by 11
Correlated Effects in Pauli Channels for Quantum Teleportation
Li, Y., Zu, C., Wei, D.-M., & Wang, C. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04027-5 · Cited by 11
Local-dimension-invariant qudit stabilizer codes
Gunderman, L. G. (2020) · Physical Review A · doi:10.1103/physreva.101.052343 · Cited by 19
Probabilistic resumable quantum teleportation in high dimensions
Chen, X., Zhang, J., & Zhang, F. (2021) · Chinese Physics B · doi:10.1088/1674-1056/ac1efb · Cited by 12
Quantum teleportation of a tripartite entangled coherent state
Kumar, S. A. (2021) · Modern Physics Letters A · doi:10.1142/s0217732321502175 · Cited by 10
Compositionality as We See It, Everywhere Around Us
Coecke, B. (2023) · Springer eBooks · doi:10.1007/978-3-031-12986-5_12 · Cited by 23
Generation of four-photon polarization entangled state based on Einstein-Podolsky-Rosen entanglers
Wang, M., & Yan, F. (2014) · The European Physical Journal D · doi:10.1140/epjd/e2013-40295-x · Cited by 10
A simple scheme for generating multi-atom GHZ state via cavity QED
Jun, W., Yu, L., & Liu, Y. (2007) · Chinese Physics · doi:10.1088/1009-1963/16/8/009 · Cited by 10
Experimental demonstration of a teleportation-based programmable quantum gate
Slodička, L., Ježek, M., & Fiurášek, J. (2009) · Physical Review A · doi:10.1103/physreva.79.050304 · Cited by 10
A repeat-until-success quantum computing scheme
Beige, A., Lim, Y. L., & Kwek, L. C. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/197 · Cited by 10
Quantum Communication and Information Processing with Quantum Dots
Yamamoto, Y. (2006) · Quantum Information Processing · doi:10.1007/s11128-006-0027-0 · Cited by 16
Hyper-parallel nonlocal CNOT operation with hyperentanglement assisted by cross-Kerr nonlinearity
Zhou, P., & Lv, L. (2019) · Scientific Reports · doi:10.1038/s41598-019-52173-x · Cited by 10
Quantum Computing for Computer Architects
Metodi, T. S., & Chong, F. T. (2006) · Synthesis lectures on computer architecture · doi:10.2200/s00066ed1v01y200610cac001 · Cited by 17
Generation and detection of Fock states of the radiation field
WALTHER, H. (2002) · Journal of Optics B Quantum and Semiclassical Optics · doi:10.1088/1464-4266/4/4/332 · Cited by 11
Amplitude damping effects on controlled teleportation of a qubit by a tripartite W state
Han, X.-P., & Liu, J. (2008) · Physica Scripta · doi:10.1088/0031-8949/78/01/015001 · Cited by 10
Generation of pure ionic entangled states via linear optics
Yang, M., & Cao, Z. (2005) · Physical Review A · doi:10.1103/physreva.72.042307 · Cited by 11
Kimble, H. J., & van Enk, S. J. (2004) · Nature · doi:10.1038/429712a · Cited by 12
Computational Distinguishability of Quantum ChannelsPreprint
Rosgen, B. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0909.3930 · Cited by 13
Wang, X. (2003) · Physical Review A · doi:10.1103/physreva.68.042304 · Cited by 12
Test of Quantumness with Small-Depth Quantum Circuits
Hirahara, S., & Gall, F. L. (2021) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.mfcs.2021.59 · Cited by 19
Hashim, A., Yuan, M., Gokhale, P., Chen, L., Jünger, C., Fruitwala, N., Xu, Y., Huang, G., Nowrouzi, K., Jiang, L., et al. (2025) · APL Quantum · doi:10.1063/5.0291637 · Cited by 25
Probing Multipartite Entanglement Through Persistent Homology
Hamilton, G. A., & Leditzky, F. (2024) · Communications in Mathematical Physics · doi:10.1007/s00220-024-04953-4 · Cited by 11
“Entanglement is a strong form of correlation between quantum systems that lies at the heart of quantum information processing, giving rise to novel protocols in quantum algorithms [51, 31], quantum communication [5, 4, 53], quantum computation [19, 34, 41, 36, 46, 47, 48], quantum cryptography [16], and quantum-enhanc…”
Linear and Non-linear Relational Analyses for Quantum Program Optimization
Amy, M., & Lunderville, J. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3704873 · Cited by 23
Mi, G., Huang, X., Fei, S., & Zhang, T. (2024) · Annalen der Physik · doi:10.1002/andp.202400308 · Cited by 9
Distributed quantum machine learning via classical communication
Hwang, K., Lim, H., Kim, Y., Park, D. K., & Kim, Y. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad9cb9 · Cited by 18
“Quantum communication, for example, enables universal quantum operations be-tween separate processors [31, 32].”
BackgroundElectrically tuning photonic topological quasiparticles in synthetic two-level system
Jia, J., Ren, J., Zhou, S., Zeng, Z., Lin, H., Hu, Y., Li, Z., Shen, Y., Chen, Z., Chen, X., et al. (2025) · Nature Physics · doi:10.1038/s41567-025-03074-6 · Cited by 13
A Multilevel Framework for Partitioning Quantum Circuits
Burt, F., Chen, K.-C., & Leung, K. K. (2026) · Quantum · doi:10.22331/q-2026-01-22-1984 · Cited by 9
“Alternatively, the e-bit can directly moderate a non-local controlled-unitary operation [61, 62], analogously referred to as gate tele-portation .”
Quantum state transformation and general design scheme on teleportation protocols
Jiang, M., Huang, X., Zhou, L., Zhou, Y., & Zeng, J. (2012) · Chinese Science Bulletin · doi:10.1007/s11434-012-5163-6 · Cited by 9
Sang, M.-H., & Nie, L.-P. (2017) · International Journal of Theoretical Physics · doi:10.1007/s10773-017-3528-y · Cited by 9
Karimi, A., & Tavassoly, M. K. (2015) · International Journal of Theoretical Physics · doi:10.1007/s10773-015-2693-0 · Cited by 9
Magic state distillation and cost analysis in fault-tolerant universal quantum computation
Liu, Y., Ma, Z., Luo, L., Du, C., Fei, Y., Wang, H., Duan, Q., & Yang, J. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ace6ca · Cited by 11
“Quantum teleportation [79, 80] can be used to establish a connection between a quantum resource state and a fault-tolerant implementation of some non-Clifford quantum gate.”
MethodTheory Behind Quantum Error Correcting Codes: An Overview
Garani, S. S., Nadkarni, P. J., & Raina, A. (2023) · Journal of the Indian Institute of Science · doi:10.1007/s41745-023-00392-7 · Cited by 10
Limitations of Classically Simulable Measurements for Quantum State Discrimination
Zhu, C., Liu, Z., Zhu, C., & Wang, X. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.010202 · Cited by 20
“However, the so-called magic state can promote the stabilizer circuits to universal quantum computation via state injection [10, 11].”
BackgroundQin, Z., Li, X., Zhou, Y., Zhang, S., Li, R., Du, C., & Xiao, Z. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad634a · Cited by 14
“There are two highly representative theories: teleportation-based quantum computation (TQC) [28] and one-way quantum computer (1WQC) [29].”
Jiawei, 王. W., Pei, 张. Z., & Cai, Y. (2024) · Chinese Journal of Lasers · doi:10.3788/cjl240894 · Cited by 11
Multiqubit nonlocality in families of 3- and 4-qubit entangled states
Ghose, S., Debnath, S., Sinclair, N. E., Kabra, A., & Stock, R. (2010) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/43/44/445301 · Cited by 11
Interconversion of pure Gaussian states requiring non-Gaussian operations
Jabbour, M. G., García−Patrón, R., & Cerf, N. J. (2015) · Physical Review A · doi:10.1103/physreva.91.012316 · Cited by 11
Generating coherent states of entangled spins
Yu, H., Luo, Y., & Yao, W. (2011) · Physical Review A · doi:10.1103/physreva.84.032337 · Cited by 9
High-fidelity Greenberger-Horne-Zeilinger state generation within nearby nodes
Vivoli, V. C., Ribeiro, J., & Wehner, S. (2019) · Physical Review A · doi:10.1103/physreva.100.032310 · Cited by 13
Efficient approximation of diagonal unitaries over the Clifford+T basis
Welch, J., Bocharov, A., & Svore, K. M. (2016) · Quantum Information and Computation · doi:10.26421/qic16.1-2-6 · Cited by 23
“First, there is the challenge that the exact methods are focused on optimizing the complexity of entanglement in exchange for the freedom to require arbitrary rotation angles which are seldom exactly implementable in the Clifford+T basis[6, 7], and hence single qubit operator approximation methods are required.”
BackgroundMethodEntanglement bounds on the performance of quantum computing architectures
Eldredge, Z., Zhou, L., Bapat, A., Garrison, J. R., Deshpande, A., Chong, F. T., & Gorshkov, A. V. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033316 · Cited by 10
Liu, S., Ran, D., Kang, Y., Shi, Z., Song, J., & Xia, Y. (2020) · Annalen der Physik · doi:10.1002/andp.202000002 · Cited by 9
Identifying genuine quantum teleportation
Chen, C.-K., Chen, S.-H., Huang, N.-N., & Li, C. (2021) · Physical Review A · doi:10.1103/physreva.104.052429 · Cited by 10
“Furthermore, teleportation can be extended to send controlled gates across different modules of a quantum processor to realize universal quantum computation [17, 18].”
BackgroundQuantum-Memory-Enhanced Preparation of Nonlocal Graph States
Zhang, S., Wu, Y.-K., Li, C., Jiang, N., Pu, Y.-F., & Duan, L.-M. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.080501 · Cited by 10
Reyes, R., Nakazato, T., Imaike, N., Matsuda, K., Tsurumoto, K., Sekiguchi, Y., & Kosaka, H. (2022) · Applied Physics Letters · doi:10.1063/5.0088155 · Cited by 11
Djordjević, I. B. (2022) · Elsevier eBooks · doi:10.1016/b978-0-12-822942-2.00001-7 · Cited by 10
Switching-free time-domain optical quantum computation with quantum teleportation
Asavanant, W., Fukui, K., Sakaguchi, A., & Furusawa, A. (2023) · Physical Review A · doi:10.1103/physreva.107.032412 · Cited by 11
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.