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 801–900 of 1,005
One-Shot Yield-Cost Relations in General Quantum Resource Theories
Takagi, R., Regula, B., & Wilde, M. M. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010348 · Cited by 26
Routing in quantum communication networks using reinforcement machine learning
Roik, J., Bartkiewicz, K., Černoch, A., & Lemr, K. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04287-z · Cited by 21
“One promising approach is the so-called teleportation-based quantum networks facilitated by standard or controlled teleportation [9, 10].”
Optoacoustic Entanglement in a Continuous Brillouin-Active Solid State System
Zhu, C., Genes, C., & Stiller, B. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.203602 · Cited by 27
“It is therefore a resource not only for a plethora of emerging quantum technologies [2–4] such as quantum cryptography [5, 6], quantum teleportation [7, 8], and quantum computation [9], but also offers a tool to deeper study and understand the classical-to-quantum boundary [10].”
No-Go Theorems for Universal Entanglement Purification
Zang, A., Chen, X., Chitambar, E., Suchara, M., & Zhong, T. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.190803 · Cited by 30
“For example, quantum state teleportation [25] and gate teleportation [70], operations required for distributed quantum computing [19, 20], both consume EPR pairs, and quantum sensing [22] with beyond standard quantum limit performance consumes multi-partite entangled states such as spin-squeezed…”
Marek, P., & Kim, M. S. (2008) · Physical Review A · doi:10.1103/physreva.78.022309 · Cited by 16
Four-dimensional entangled state generation in remote cavities
Song, J., Xia, Y., Song, H. S., & Liu, B. (2008) · The European Physical Journal D · doi:10.1140/epjd/e2008-00182-3 · Cited by 15
Quantum teleportation in space and frequency using entangled pairs of photons from a frequency comb
Song, H., Yonezawa, H., Kuntz, K. B., Heurs, M., & Huntington, E. H. (2014) · Physical Review A · doi:10.1103/physreva.90.042337 · Cited by 15
Kato, G., Owari, M., & Hayashi, M. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3078812 · Cited by 19
Approximate stabilizer rank and improved weak simulation of Clifford-dominated circuits for qudits
Huang, Y., & Love, P. J. (2019) · Physical Review A · doi:10.1103/physreva.99.052307 · Cited by 25
Moroni, S. T., Varo, S., Juška, G., Chung, T., Gocalinska, A. M., & Pelucchi, E. (2018) · Journal of Crystal Growth · doi:10.1016/j.jcrysgro.2018.10.005 · Cited by 16
Controlled generation of genuine multipartite entanglement in Floquet Ising spin models
Naik, G. K., Singh, R., & Mishra, S. K. (2019) · Physical Review A · doi:10.1103/physreva.99.032321 · Cited by 18
Hou, Q., Yang, C.-J., Chen, C.-Y., An, J., Yang, W. L., & Feng, M. (2019) · Physical Review A · doi:10.1103/physreva.100.032302 · Cited by 16
Generating Greenberger-Horne-Zeilinger states with squeezing and postselection
Alexander, B. J., Bollinger, J. J., & Uys, H. (2020) · Physical Review A · doi:10.1103/physreva.101.062303 · Cited by 16
“Due to their high level of entanglement, the GHZ states are of importance in various applications such as metrology [11], quantum teleportation [15], quantum computing [16] and quantum secret sharing [17].”
BackgroundCross-Verification of Independent Quantum Devices
Greganti, C., Demarie, T. F., Ringbauer, M., Jones, J. A., Saggio, V., Calafell, I. A., Rozema, L. A., Erhard, A., Meth, M., Postler, L., et al. (2021) · Physical Review X · doi:10.1103/physrevx.11.031049 · Cited by 22
Probabilistic teleportation of a quantum dot spin qubit
Kojima, Y., Nakajima, T., Noiri, A., Yoneda, J., Otsuka, T., Takeda, K., Li, S., Bartlett, S. D., Ludwig, A., Wieck, A. D., et al. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00403-4 · Cited by 15
Steady-state entanglement generation for nondegenerate qubits
de Oliveira, M. H., Higgins, G. T., Zhang, C., Predojević, A., Hennrich, M., Bachelard, R., & Villas-Bôas, C. J. (2023) · Physical Review A · doi:10.1103/physreva.107.023706 · Cited by 17
Quantum information transfer between a two-level and a four-level quantum systems
Feng, T., Xu, Q., Zhou, L., Luo, M., Zhang, W., & Zhou, X. (2022) · Photonics Research · doi:10.1364/prj.461283 · Cited by 18
Teleportation using squeezed single photons
Brańczyk, A. M., & Ralph, T. C. (2008) · Physical Review A · doi:10.1103/physreva.78.052304 · Cited by 15
Quantum error correction with mixed ancilla qubits
Criger, B., Moussa, O., & Laflamme, R. (2012) · Physical Review A · doi:10.1103/physreva.85.044302 · Cited by 15
Order 3 symmetry in the Clifford hierarchy
Bengtsson, I., Blanchfield, K., Campbell, E. T., & Howard, M. (2014) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/47/45/455302 · Cited by 16
“Motivated by teleportation-based QC, Gottesman and Chuang [11] introduced the so-called Clifford hierarchy, nested sets of unitary operators, the smallest two sets of which are comprised of Pauli operators and Clifford operators.”
BackgroundMethodInfluentialOptimal Joint Remote State Preparation of Arbitrary Equatorial Multi-qudit States
Cai, T., & Jiang, M. (2016) · International Journal of Theoretical Physics · doi:10.1007/s10773-016-3219-0 · Cited by 15
Teleportation of a ququart system using hyperentangled photons assisted by atomic-ensemble memories
Luo, M., Li, H.-R., Lai, H., & Wang, X. (2016) · Physical Review A · doi:10.1103/physreva.93.012332 · Cited by 17
Quantum teleportation mediated by surface plasmon polariton
Jiang, X.-H., Chen, P., Qian, K., Chen, Z., Xu, S., Xie, Y.-B., Zhu, S. N., & Ma, X. (2020) · Scientific Reports · doi:10.1038/s41598-020-67773-1 · Cited by 19
Quantum information processing with hyperentangled photon states
Walborn, S. P., de Almeida, M. P., Ribeiro, P. H. S., & Monken, C. H. (2006) · Quantum Information and Computation · doi:10.26421/qic6.4-5-3 · Cited by 23
Three-qubit thermal entanglement via entanglement swapping on two-qubit Heisenberg XY chains
Kao, Z. C., Ng, J., & Yeo, Y. (2005) · Physical Review A · doi:10.1103/physreva.72.062302 · Cited by 15
Wang, X.-W., Xiang, L., & Fang, M.-F. (2006) · Chinese Physics · doi:10.1088/1009-1963/15/4/004 · Cited by 16
Group theory for quantum gates and quantum coherence
Planat, M. R. P., & Jorrand, P. (2008) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/41/18/182001 · Cited by 20
“Since the inception of the field, fault-tolerant procedures such as universal bases of gates [1], quantum codes [2] or quantum teleportation based protocols [ 3 ] have been proposed.”
BackgroundOn the Duality of Teleportation and Dense Coding
Chitambar, E., & Leditzky, F. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3331821 · Cited by 21
Resource-efficient fault-tolerant one-way quantum repeater with code concatenation
Wo, K. J., Avis, G., Rozpędek, F., Mor-Ruiz, M. F., Pieplow, G., Schröder, T., Jiang, L., Sørensen, A. S., & Borregaard, J. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00792-8 · Cited by 25
“The teleported CNOT gate involves heralding a Bell pair between two emitters via the transmission and subsequent re fl ection of a photon 44 – 47 (see Fig.”
Zhang, Y., Gopalakrishnan, S., & Styliaris, G. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.040304 · Cited by 33
“Also, the concept of “gluing” product resource states to perform certain tasks also appears in other quantum computing literature such as the teleportation quantum computation [35, 36] and fusion-based quantum computation [37].”
BackgroundMethodBoosted Bell-state measurements for photonic quantum computation
Hauser, N., Bayerbach, M. J., D’Aurelio, S. E., Weber, R., Santandrea, M., Kumar, S. P., Dhand, I., & Barz, S. (2025) · npj Quantum Information · doi:10.1038/s41534-025-00986-2 · Cited by 36
Observation of Residual Entanglement in Entanglement Purification
Zhou, L., Huang, C.-X., Sheng, Y., Guo, Y., Hu, X.-M., Huang, Y., Li, C., Guo, G., & Liu, B. (2025) · Physical Review Letters · doi:10.1103/kbw2-fdqn · Cited by 23
Towers of generalized divisible quantum codes
Haah, J. (2018) · Physical Review A · doi:10.1103/physreva.97.042327 · Cited by 27
Optimal Multi-port-based Teleportation Schemes
Mozrzymas, M., Studziński, M., & Kopszak, P. (2021) · Quantum · doi:10.22331/q-2021-06-17-477 · Cited by 22
“1 Introduction Quantum teleportation introduced originally in [5] is one of the building blocks of many quantum processing and communication protocols, as well as it gives us a deeper understanding of quantum physics [6, 11, 12, 15, 23, 25, 30].”
BackgroundQuantum teleportation is a reversal of quantum measurement
Lee, S.-W., Im, D.-G., Kim, Y.-H., Nha, H., & Kim, M. S. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033119 · Cited by 17
“[2], we can implement an arbitrary gate operation Ĝ under the influence of noise without requiring additional qubits.”
MethodMitigating Coherent Noise by Balancing Weight-2 Z-Stabilizers
Hu, J., Liang, Q., Rengaswamy, N., & Calderbank, R. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3130155 · Cited by 20
“The Clifford Hierarchy The Clifford hierarchy of unitary operators was introduced in [7].”
BackgroundMethodIntrinsic decoherence dynamics and dense coding in dipolar spin system
Khedif, Y., & Muthuganesan, R. (2022) · Applied Physics B · doi:10.1007/s00340-022-07956-y · Cited by 15
“It is worth mentioning that the considered physical model is useful in realization of quantum gates [50].”
BackgroundZhou, Y., Wang, W., Song, T., Wang, X., Zhu, Q., Zhang, K., Liu, S., & Jing, J. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.060801 · Cited by 19
Transversal diagonal logical operators for stabiliser codes
Webster, M. A., Quintavalle, A. O., & Bartlett, S. D. (2023) · New Journal of Physics · doi:10.1088/1367-2630/acfc5f · Cited by 41
“The [[56,14,6]] code is not globally 3-colourable as there is no valid colour assignment for faces 2 and 4 in the diagram above.”
BackgroundMeasurement-Based Infused Circuits for Variational Quantum Eigensolvers
Chan, A., Shi, Z., Dellantonio, L., Dür, W., & Muschik, C. A. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.240601 · Cited by 35
Quantum routing with teleportation
Devulapalli, D., Schoute, E., Bapat, A., Childs, A. M., & Gorshkov, A. V. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033313 · Cited by 30
“A swap between the ends of a path can be performed by teleporting the qubit at each end to the opposite end, or by performing gate teleportation [33] of a swap gate.”
BackgroundValidating and certifying stabilizer states
Kalev, A., Kyrillidis, A., & Linke, N. M. (2019) · Physical Review A · doi:10.1103/physreva.99.042337 · Cited by 15
Limitations of teleporting a qubit via a two-mode squeezed state
Lie, S. H., & Jeong, H. (2019) · Photonics Research · doi:10.1364/prj.7.0000a7 · Cited by 17
“For example, quantum computation schemes based on linear optics and photodetectors [2] are based on the gate-teleportation protocol [3].”
Projective measurement of the two-photon polarization state: Linear optics approach
Grudka, A., & Wójcik, A. (2002) · Physical Review A · doi:10.1103/physreva.66.064303 · Cited by 14
Interaction-free quantum computation
Azuma, H. (2004) · Physical Review A · doi:10.1103/physreva.70.012318 · Cited by 15
“Gottesman and Chuang showed that we can construct the CNOT gate by preparing a state |χ〉 = (1/2)[(|00〉+ |11〉)|00〉+ (|01〉+ |10〉)|11〉], (12) executing the Bell-basis measurement twice, and carrying out one-qubit gate operations according to results of the Bell-basis measurement [5].”
MethodSpectral effects of strong χ(2) nonlinearity for quantum processing
Leung, P. M., Munro, W. J., Nemoto, K., & Ralph, T. C. (2009) · Physical Review A · doi:10.1103/physreva.79.042307 · Cited by 15
Thresholds for linear optics quantum computing with photon loss at the detectors
Silva, M., Rötteler, M., & Zalka, C. (2005) · Physical Review A · doi:10.1103/physreva.72.032307 · Cited by 14
Quantum cryptography: theory and practicePreprint
Ma, X. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0808.1385 · Cited by 38
“It has already been known that one can realize quantum gates by quantum teleportation [33].”
BackgroundLogic Synthesis for Fault-Tolerant Quantum ComputersPreprint
Jones, N. C. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.7290 · Cited by 24
“n trap architectures, and Isailovic et al. [12, 46] have studied interconnection and data throughput issues in similar ion trap systems, with an emphasis on preparing ancillas for teleportation gates [47]. Other work has studied quantum computer architectures with only nearest-neighbor coupling between qubits in an ar…”
BackgroundMethodInfluentialQuantum teleportation of a silicon nanophotonic CNOT gate
Chang, K.-C., Cheng, X., Ribuot-Hirsch, F., Sarihan, M. C., Chen, Y. J., Flores, J. G. F., Yu, M., Lo, P. G.-Q., Kwong, D., & Wong, C. W. (2025) · Optica Quantum · doi:10.1364/opticaq.554577 · Cited by 20
State stabilization for gate-model quantum computers
Gyöngyösi, L., & Imre, S. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2397-0 · Cited by 13
Oumennana, M., Chaouki, E., & Mansour, M. (2022) · International Journal of Theoretical Physics · doi:10.1007/s10773-022-05255-y · Cited by 14
“The dipolar spin system can be manipulated to create quantum gates [41] and it may constitute a valuable quantum channel in quantum communication [42].”
BackgroundFiurášek, J. (2024) · Optics Express · doi:10.1364/oe.506757 · Cited by 14
Quantum computing with subwavelength atomic arrays
Shah, F., Patti, T. L., Rubies-Bigordà, O., & Yelin, S. F. (2024) · Physical Review A · doi:10.1103/physreva.109.012613 · Cited by 21
Source-independent quantum secret sharing with entangled photon pair networks
Xiao, Y.-R., Jia, Z.-Y., Song, Y.-C., Bao, Y., Fu, Y., Yin, H., & Chen, Z. (2024) · Optics Letters · doi:10.1364/ol.527857 · Cited by 15
“QSS promises the unconditional security and plays a crucial role in protecting secret information, such as secure operations of multiparty computation [15], creating joint checking accounts containing quantum money [16] and so on.”
BackgroundTeleportation of a genuine single-rail vacuum-one-photon qubit generated via a quantum dot source
Polacchi, B., Hoch, F., Rodari, G., Savo, S., Carvacho, G., Spagnolo, N., Giordani, T., & Sciarrino, F. (2024) · npj Nanophotonics · doi:10.1038/s44310-024-00046-1 · Cited by 14
“Such a protocol, together with entanglement swapping 4,5 , is at the core of several quantum computation 6,7 and quantum communication schemes ranging from quantum repeaters 8,9 , quantum gate teleportation 10 – 12 , measurement-based quantum computing 13 – 15 as well as port-based quantum…”
Route-Forcing: Scalable Quantum Circuit Mapping for Scalable Quantum Computing Architectures
Escofet, P., Gonzalvo, A., Alarcón, E., Almudéver, C. G., & Abadal, S. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00110 · Cited by 27
“Specifically, theoretical studies have considered leveraging quantum teleportation [52] even in single-core architectures.”
BackgroundChip-to-Chip Quantum Photonic Controlled-not Gate Teleportation
Feng, L.-T., Zhang, M., Liu, D., Cheng, Y., Song, X., Ding, Y., Daoxin Dai, A., Guo, G., Guo, G., & Ren, X. (2025) · Physical Review Letters · doi:10.1103/d53g-v8q6 · Cited by 25
Optical zeno gate: bounds for fault tolerant operation
Leung, P. M., & Ralph, T. C. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/7/224 · Cited by 15
Enhancing the fidelity of remote state preparation by partial measurements
Yang, R.-Y., & Liu, J. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1575-1 · Cited by 13
“Quantum entanglements as an important physical resource play an essential role in quantum communication [1–4] and quantum computation [5].”
BackgroundConverse bounds for quantum and private communication over Holevo–Werner channels
Cope, T., Goodenough, K., & Pirandola, S. (2018) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aae964 · Cited by 15
Podoshvedov, S. A., & Podoshvedov, M. S. (2021) · Journal of the Optical Society of America B · doi:10.1364/josab.415137 · Cited by 15
Symmetric Finite-Time Preparation of Cluster States via Quantum Pumps
Tantivasadakarn, N., & Vishwanath, A. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.090501 · Cited by 16
Scalable two- and four-qubit parity measurement with a threshold photon counter
Govia, L. C. G., Pritchett, E., Plourde, B. L. T., Vavilov, M., McDermott, R., & Wilhelm, F. K. (2015) · Physical Review A · doi:10.1103/physreva.92.022335 · Cited by 13
Wang, X., Zhang, K., & Wang, J. (2023) · Classical and Quantum Gravity · doi:10.1088/1361-6382/acc829 · Cited by 18
“Above description is similar to the concept of teleportation-based quantum computation [66], in which there are some single- or two-qubit gates applied before the teleportation or entanglement swapping processes.”
QUANTUM TELEPORTATION OF AN ARBITRARY N-QUBIT STATE VIA NON-MAXIMALLY ENTANGLED STATE
Yu-Ling, L., Man, Z., & Xia, Y. (2007) · International Journal of Quantum Information · doi:10.1142/s0219749907003122 · Cited by 13
Entanglement sharing with separable states
Mišta, L. (2013) · Physical Review A · doi:10.1103/physreva.87.062326 · Cited by 14
Zhang, X., Jiang, R., Bell, B. A., Choi, D., Chae, C., & Xiong, C. (2016) · Technologies · doi:10.3390/technologies4030025 · Cited by 14
“In the past two decades, quantum photonic technology has attracted significant attention due to its huge potential in applications such as secure communication [1], super-resolution metrology [2], and quantum computation [3].”
BackgroundEfficient Superdense Coding with W States
Zhou, Y., Wang, F., & Luo, M.-X. (2018) · International Journal of Theoretical Physics · doi:10.1007/s10773-018-3718-2 · Cited by 14
Remote sensing and faithful quantum teleportation through non-localized qubits
Jahromi, H. R. (2021) · Physics Letters A · doi:10.1016/j.physleta.2021.127850 · Cited by 21
“[2], it has since evolved into an active and interesting area of research and is now recognized as an significant tool for many quantum protocols such as measurement-based quantum computing [3], quantum repeaters [4], and fault-tolerant quantum computation [5].”
BackgroundMethodEfficient growth of complex graph states via imperfect path erasure
Campbell, E. T., Fitzsimons, J., Benjamin, S. C., & Kok, P. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/196 · Cited by 17
Deterministic and exact entanglement teleportation via the W state
Chen, X., Qiao-yan, W., Zhong-Xu, S., Li-Ying, S., & Yang, Y. (2010) · Chinese Physics B · doi:10.1088/1674-1056/19/1/010303 · Cited by 15
Optimal state in the Knill-Laflamme-Milburn scheme of linear optical teleportation
Grudka, A., & Modławska, J. (2008) · Physical Review A · doi:10.1103/physreva.77.014301 · Cited by 13
Quantum Computing for Computer Architects, Second Edition
Metodi, T. S., Faruque, A. I., & Chong, F. T. (2011) · Synthesis lectures on computer architecture · doi:10.1007/978-3-031-01731-5 · Cited by 22
High-level interconnect model for the quantum logic array architecture
Metodi, T. S., Thaker, D., Cross, A. W., Chuang, I. L., & Chong, F. T. (2008) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/1330521.1330522 · Cited by 13
“In addition, one should not discard the possibility of designing a quantum architecture where communication and computation are not decoupled, and quantum gates are teleported rather than teleporting quantum data [Gottesman and Chuang 1999].”
BackgroundSelf-citationEntanglement of mixed macroscopic superpositions: An entangling-power study
Paternostro, M., Jeong, H., & Kim, M. S. (2006) · Physical Review A · doi:10.1103/physreva.73.012338 · Cited by 14
Teleportation of two-atom entangled state in resonant cavity quantum electrodynamics
杨贞标 (2007) · Chinese Physics · doi:10.1088/1009-1963/16/2/010 · Cited by 13
Wu, L.-A., & Lidar, D. A. (2003) · Physical Review A · doi:10.1103/physreva.67.050303 · Cited by 15
Probabilistic instantaneous quantum computation
Brukner, Č., Pan, J.-W., Simon, C., Weihs, G., & Zeilinger, A. (2003) · Physical Review A · doi:10.1103/physreva.67.034304 · Cited by 13
Flexible layout of surface code computations using AutoCCZ states
Gidney, C., & Fowler, A. G. (2019) · arXiv · doi:10.48550/arxiv.1905.08916 · Cited by 12
Verification of quantum-gate teleportation based on Bell nonlocality in a black-box scenario
Wang, Z.-Q., & Wang, T.-J. (2023) · Physical Review A · doi:10.1103/physreva.108.012434 · Cited by 12
Symbolic model checking quantum circuits in Maude
Do, C. M., & Ogata, K. (2024) · PeerJ Computer Science · doi:10.7717/peerj-cs.2098 · Cited by 17
“…by Hillery, Bužek & Berthiaume (1999) , Entanglement Swapping introduced by Zukowski et al. (1993) , Quantum Gate Teleportation introduced by Gottesman & Chuang (1999) , Two Mirror-image Teleportation introduced by Williams (2008) , and Quantum Network Coding introduced by Satoh, Gall &…”
BackgroundMethodInfluentialMalekakhlagh, M., Phung, T., Puzzuoli, D., Heya, K., Sundaresan, N., & Orcutt, J. S. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.22.024006 · Cited by 19
Classical Simulability of Quantum Circuits with Shallow Magic Depth
Zhang, Y., & Zhang, Y. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010337 · Cited by 22
Efficient fault-tolerant code switching via one-way transversal CNOT gates
Heußen, S., & Hilder, J. (2025) · Quantum · doi:10.22331/q-2025-09-03-1846 · Cited by 12
“There exist several procedures such as gate teleportation [34] or code conversion [35, 36] that vary in intricacy from both a theoretical and experimental point of view.”
Wang, X.-W., Wang, Z., & Xia, L.-X. (2007) · Communications in Theoretical Physics · doi:10.1088/0253-6102/47/2/014 · Cited by 13
Galois unitaries, mutually unbiased bases, and mub-balanced states
Appleby, D. M., Bengtsson, I., & Dang, H. B. (2015) · Quantum Information and Computation · doi:10.26421/qic15.15-16-1 · Cited by 19
Quantum teleportation with continuous measurements
Greplová, E., Mølmer, K., & Andersen, C. K. (2016) · Physical Review A · doi:10.1103/physreva.94.042334 · Cited by 12
“[3] Daniel Gottesman and Isaac L Chuang, “Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations,” Nature 402, 390–393 (1999).”
BackgroundMethodJafarzadeh, M., Jahromi, H. R., & Amniat-Talab, M. (2020) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2020.0378 · Cited by 13
Remote-controlled quantum computing by quantum entanglement
Wang, D., Liu, Y., Ding, J., Qiang, X., Liu, Y., Huang, A., Fu, X., Xu, P., Deng, M., Yang, X., et al. (2020) · Optics Letters · doi:10.1364/ol.401921 · Cited by 15
Okay, C., Zurel, M., & Raussendorf, R. (2021) · Quantum Information and Computation · doi:10.26421/qic21.13-14-2 · Cited by 22
Walls, D. F., & Milburn, G. J. (2007) · Springer eBooks · doi:10.1007/978-3-540-28574-8_16 · Cited by 22
Towards Scalable Linear-Optical Quantum Computers
Dowling, J. P., Franson, J. D., Lee, H. K., & Milburn, G. J. (2004) · Quantum Information Processing · doi:10.1007/s11128-004-9419-1 · Cited by 15
Resources for universal quantum-state manipulation and engineering
Marek, P., & Fiurášek, J. (2009) · Physical Review A · doi:10.1103/physreva.79.062321 · Cited by 13
Atom–photon entanglement beyond the multi-photon resonance condition
Kordi, Z., Ghanbari, S., & Mahmoudi, M. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1168-9 · Cited by 12
Popescu-Rohrlich correlations imply efficient instantaneous nonlocal quantum computation
Broadbent, A. (2016) · Physical Review A · doi:10.1103/physreva.94.022318 · Cited by 19
Experimental Study of Nonclassical Teleportation Beyond Average Fidelity
Carvacho, G., Andreoli, F., Santodonato, L., Bentivegna, M., D’Ambrosio, V., Skrzypczyk, P., Šupić, I., Cavalcanti, D., & Sciarrino, F. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.140501 · Cited by 14
“This protocol represents a milestone in theoretical quantum information science [12–14] and lies at the basis of many technological application such as quantum communication via quantum repeaters [16, 17] or gate teleportation [15].”
Quantum linear network coding for entanglement distribution in restricted architectures
de Beaudrap, N., & Herbert, S. (2020) · Quantum · doi:10.22331/q-2020-11-01-356 · Cited by 15
Milburn, G. J. (2012) · Springer eBooks · doi:10.1007/978-3-642-19409-2_18 · Cited by 15
Zou, X., Pahlke, K., & Mathis, W. (2004) · Physical Review A · doi:10.1103/physreva.69.013811 · Cited by 12
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.