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 501–600 of 1,005
Distributed Arithmetic on a Quantum Multicomputer
Meter, R. V., Nemoto, K., Munro, W. J., & Itoh, K. M. (2006) · ACM SIGARCH Computer Architecture News · doi:10.1145/1150019.1136517 · Cited by 49
“A linear network topology performs acceptably for a broad range of system sizes and performance parameters.”
BackgroundClassical and Quantum Information Theory: An Introduction for the Telecom Scientist
Desurvire, E. (2009) · Cited by 36
Горбачев, В. Н., & Trubilko, A. I. (2005) · Laser Physics Letters · doi:10.1002/lapl.200510069 · Cited by 35
Investigating the effect of circuit cutting in QAOA for the MaxCut problem on NISQ devices
Bechtold, M., Barzen, J., Leymann, F., Mandl, A., Obst, J., Truger, F., & Weder, B. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acf59c · Cited by 60
Partitioning qubits in hypergraph product codes to implement logical gates
Quintavalle, A. O., Webster, P., & Vasmer, M. (2023) · Quantum · doi:10.22331/q-2023-10-24-1153 · Cited by 35
State preparation by shallow circuits using feed forward
Buhrman, H., Folkertsma, M., Loff, B., & Neumann, N. M. P. (2024) · Quantum · doi:10.22331/q-2024-12-09-1552 · Cited by 114
“…a four-step layout, not to do error correction, but to perform computations, can be found in the paradigm of measurement-based quantum computing [GC99; RB01; Joz06; CJL08]: A universal form of quantum computing where a quantum state is prepared and operations are performed by measuring qubits…”
Quantum teleportation of propagating quantum microwaves
Candia, R. D., Fedorov, K. G., Zhong, L., Felicetti, S., Menzel, E., Sanz, M., Deppe, F., Marx, A., Gross, R., & Solano, E. (2015) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-015-0038-9 · Cited by 44
Conditional teleportation of quantum-dot spin states
Qiao, H., Kandel, Y. P., Manikandan, S. K., Jordan, A. N., Fallahi, S., Gardner, G. C., Manfra, M. J., & Nichol, J. M. (2020) · Nature Communications · doi:10.1038/s41467-020-16745-0 · Cited by 43
Control power of high-dimensional controlled teleportation
Wang, T.-J., Yang, G.-Q., & Wang, C. (2020) · Physical Review A · doi:10.1103/physreva.101.012323 · Cited by 38
Exploiting Quantum Teleportation in Quantum Circuit Mapping
Hillmich, S., Zulehner, A., & Wille, R. (2021) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1145/3394885.3431604 · Cited by 37
Bidirectional quantum teleportation in multi-hop communication network
Zhang, Z., & Sang, Y. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03950-1 · Cited by 38
“It has contributed to various branches of quantum information [2–5], including quantum repeaters [6], distributed quantum computing [7], quantum network [8] and so on.”
BackgroundTeleportation of a controllable orbital angular momentum generator
Chen, L., & She, W. (2009) · Physical Review A · doi:10.1103/physreva.80.063831 · Cited by 35
Gachechiladze, M., Gühne, O., & Miyake, A. (2019) · Physical Review A · doi:10.1103/physreva.99.052304 · Cited by 41
Optical preparation of entangled squeezed vacuum states
Zhou, L., & Kuang, L. (2002) · Physics Letters A · doi:10.1016/s0375-9601(02)01176-3 · Cited by 40
Realization of universal optimal quantum machines by projective operators and stochastic maps
Sciarrino, F., Sias, C., Ricci, M., & De Martini, F. (2004) · Physical Review A · doi:10.1103/physreva.70.052305 · Cited by 35
Unity gain and nonunity gain quantum teleportation
Bowen, W. P., Treps, N., Buchler, B. C., Schnabel, R., Ralph, T. C., Symul, T., & Lam, P. K. (2003) · IEEE Journal of Selected Topics in Quantum Electronics · doi:10.1109/jstqe.2003.820908 · Cited by 41
Measurement-Based Quantum Computation
Wei, T.-C. (2021) · Oxford University Press eBooks · doi:10.1093/acrefore/9780190871994.013.31 · Cited by 56
“Quantum computation has the potential to perform specific computational tasks more efficiently and hence faster than current classical computers (Nielsen & Chuang, 2002).”
MethodInfluentialModular Quantum Processor with an All-to-All Reconfigurable Router
Wu, X., Yan, H., Andersson, G., Anferov, A., Chou, M.-H., Conner, C. R., Grebel, J., Joshi, Y. J., Li, S., Miller, J. M., et al. (2024) · Physical Review X · doi:10.1103/physrevx.14.041030 · Cited by 62
“A modular approach, including high-fidelity communication channels between separate modules, is one way to sidestep some of these challenges [15–19].”
BackgroundAdvancements in superconducting quantum computing
Jiang, Y.-Y., Deng, C., Fan, H., Li, B.-Y., Sun, L., Tan, X., Wang, W., Xue, G., Yan, F., Yu, H., et al. (2025) · National Science Review · doi:10.1093/nsr/nwaf246 · Cited by 85
“In addition to the continued development of novel QEC codes and precise control technologies to go far beyond the break-even point, exploring distributed quantum computation schemes for scaling up the system is also of great importance [242 ,243 ].”
Learning and testing algorithms for the Clifford group
Low, R. A. (2009) · Physical Review A · doi:10.1103/physreva.80.052314 · Cited by 56
Roy, S., Bera, A., Mal, S., De, A. S., & Sen, U. (2021) · Physics Letters A · doi:10.1016/j.physleta.2021.127143 · Cited by 44
Efficient simulatability of continuous-variable circuits with large Wigner negativity
García-Álvarez, L., Calcluth, C., Ferraro, A., & Ferrini, G. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043322 · Cited by 43
Gaussian Conversion Protocols for Cubic Phase State Generation
Zheng, Y. C., Hahn, O., Stadler, P., Holmvall, P., Quijandría, F., Ferraro, A., & Ferrini, G. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010327 · Cited by 48
Quantifying Qubit Magic Resource with Gottesman-Kitaev-Preskill Encoding
Hahn, O., Ferraro, A., Hultquist, L., Ferrini, G., & García-Álvarez, L. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.210502 · Cited by 43
“Thus we get a multiplicity of 4 n if we only consider all the elements of the n -qubit Pauli group C 1 , the first level of the Clifford hierarchy [15].”
InfluentialEffects of Pauli channels and noisy quantum operations on standard teleportation
Yeo, Y., Kho, Z.-W., & Wang, L. (2009) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/86/40009 · Cited by 37
Purification of large bicolorable graph states
Goyal, K., McCauley, A., & Raussendorf, R. (2006) · Physical Review A · doi:10.1103/physreva.74.032318 · Cited by 40
Fault-tolerant one-bit addition with the smallest interesting color code
Wang, Y., Simsek, S., Gatterman, T. M., Gerber, J. A., Gilmore, K., Gresh, D., Hewitt, N., Horst, C. V., Matheny, M., Mengle, T., et al. (2024) · Science Advances · doi:10.1126/sciadv.ado9024 · Cited by 64
“For instance, this can be done with surface code patches via lattice surgery [10], and we note that an instance of Grover’s algorithm not containing non-Clifford gates has already been implemented fault-tolerantly on two qubits [11] using the 4 , 2 , 2 code.”
Gauge color codes in two dimensions
Jones, C., Brooks, P., & Harrington, J. (2016) · Physical Review A · doi:10.1103/physreva.93.052332 · Cited by 33
Qudit quantum computation on matrix product states with global symmetry
Wang, D., Stephen, D. T., & Raussendorf, R. (2017) · Physical Review A · doi:10.1103/physreva.95.032312 · Cited by 36
Quantum circuit design for objective function maximization in gate-model quantum computers
Gyöngyösi, L., & Imre, S. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2326-2 · Cited by 40
Probabilistic teleportation without loss of information
Roa, L., & Groiseau, C. (2015) · Physical Review A · doi:10.1103/physreva.91.012344 · Cited by 36
Connectivity constrains quantum codes
Baspin, N., & Krishna, A. (2022) · Quantum · doi:10.22331/q-2022-05-13-711 · Cited by 75
Non-local classical optical correlation and implementing analogy of quantum teleportation
Sun, Y., Song, X.-B., Qin, H., Zhang, X., Yang, Z., & Zhang, X. (2015) · Scientific Reports · doi:10.1038/srep09175 · Cited by 37
Entangled coherent states versus entangled photon pairs for practical quantum-information processing
Ki-min Park, B., & Jeong, H. (2010) · Physical Review A · doi:10.1103/physreva.82.062325 · Cited by 36
Complete Bell-states analysis using hyper-entanglement
Ren, X., Guo, G., & Guo, G. (2005) · Physics Letters A · doi:10.1016/j.physleta.2005.05.074 · Cited by 37
Tokunaga, Y., Yamamoto, T., Koashi, M., & Imoto, N. (2006) · Physical Review A · doi:10.1103/physreva.74.020301 · Cited by 35
Utilizing encoding in scalable linear optics quantum computing
Hayes, A. J. F., Gilchrist, A., Myers, C. R., & Ralph, T. C. (2004) · Journal of Optics B: Quantum and Semiclassical Optics · doi:10.1088/1464-4266/6/12/008 · Cited by 28
Teleporting a state inside a single bimodal high- Q cavity
Pires, G., Avelar, A. T., Baseia, B., & de Almeida, N. G. (2005) · Physical Review A · doi:10.1103/physreva.71.060301 · Cited by 34
Decoherence in collective quantum memories for photons
Mewes, C. K. A., & Fleischhauer, M. (2005) · Physical Review A · doi:10.1103/physreva.72.022327 · Cited by 37
Fault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code
Wang, Y., Simsek, S., Gatterman, T. M., Gerber, J. A., Gilmore, K., Gresh, D., Hewitt, N., Horst, C. V., Matheny, M., Mengle, T., et al. (2023) · arXiv · doi:10.48550/arxiv.2309.09893 · Cited by 32
“For instance, this can be done with surface code patches via lattice surgery [10], and we note that an instance of Grover’s algorithm not containing non-Clifford gates has already been implemented fault-tolerantly on two qubits [11] using the 4 , 2 , 2 code.”
Entanglement-efficient bipartite-distributed quantum computing
Wu, J.-Y., Matsui, K., Forrer, T., Soeda, A., Andrés-Martínez, P., Mills, D., Henaut, L., & Murao, M. (2023) · Quantum · doi:10.22331/q-2023-12-05-1196 · Cited by 61
“One is based on quantum state teleportation [24]; the other is based on the remote implementation of quantum gates through entanglement-assisted LOCC [26–29], which is also referred to as “telegate”[30, 31].”
BackgroundMethodToward a 2D Local Implementation of Quantum Low-Density Parity-Check Codes
Berthusen, N., Devulapalli, D., Schoute, E., Childs, A. M., Gullans, M. J., Gorshkov, A. V., & Gottesman, D. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010306 · Cited by 69
“A specialization of LOCC routing that focuses on qubit and gate teleportation [55] is teleportation routing.”
Self-citationSunami, S., Tamiya, S., Inoue, R., Yamasaki, H., & Goban, A. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010101 · Cited by 73
Hierarchical memories: Simulating quantum LDPC codes with local gates
Pattison, C. A., Krishna, A., & Preskill, J. P. (2025) · Quantum · doi:10.22331/q-2025-05-05-1728 · Cited by 74
Practical position-based quantum cryptography
Chakraborty, K., & Leverrier, A. (2015) · Physical Review A · doi:10.1103/physreva.92.052304 · Cited by 56
Holographic software for quantum networks
Jaffe, A., Liu, Z., & Wozniakowski, A. (2018) · Science China Mathematics · doi:10.1007/s11425-017-9207-3 · Cited by 40
“However, it is better to construct the multipartite entangled resource state as quantum software [44, 84] at a station and teleport each component to one person by a noiseless channel.”
BackgroundHorodecki, R. (2021) · Acta Physica Polonica A · doi:10.12693/aphyspola.139.197 · Cited by 40
Regula, B., Takagi, R., & Gu, M. (2021) · Quantum · doi:10.22331/q-2021-08-09-522 · Cited by 56
Quantum teleportation with one classical bit
Parakh, A. (2022) · Scientific Reports · doi:10.1038/s41598-022-06853-w · Cited by 38
Noise-resistant quantum communications using hyperentanglement
Kim, J.-H., Kim, Y., Im, D.-G., Lee, C.-H., Chae, J.-W., Scarcelli, G., & Kim, Y.-H. (2021) · Optica · doi:10.1364/optica.442240 · Cited by 37
“Distribution of quantum entanglement to two or more distant parties is the essential operation that powers nearly all quantum information protocols, such as quantum key distribution [1–3], quantum teleportation [4–7], quantum secret sharing [8,9], quantum secure direct communications [10,11], deterministic secure quan…”
BackgroundThermodynamic Signatures of Genuinely Multipartite Entanglement
Puliyil, S., Banik, M., & Alimuddin, M. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.070601 · Cited by 46
Shorter quantum circuits via single-qubit gate approximation
Kliuchnikov, V., Lauter, K., Minko, R., Paetznick, A., & Petit, C. (2023) · Quantum · doi:10.22331/q-2023-12-18-1208 · Cited by 106
Continuous-variable quantum information processing with squeezed states of light
Yonezawa, H., & Furusawa, A. (2010) · Optics and Spectroscopy · doi:10.1134/s0030400x10020189 · Cited by 38
Ji, Q., Liu, Y., Xie, C., Yin, X., & Zhang, Z. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0759-1 · Cited by 32
Error-detection-based quantum fault tolerance against discrete Pauli noisePreprint
Reichardt, B. W. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0612004 · Cited by 44
“ng measured and any virtual error made 3The Toffoli gate is not a Clifford operator (conjugating Paulis to Paulis), but is in so-called C 3, meaning it conjugates Pauli operators into the Clifford group [GC99]. 134 real. The only exception is in the bottom-up decoding procedure of Sec. 6.2.1, in which k CNOT0s touch the…”
BackgroundInfluentialTopologically Protected Quantum Logic Gates with Valley‐Hall Photonic Crystals
He, L., Liu, D., Zhang, H., Zhang, F., Zhang, W., Feng, X., Huang, Y., Cui, K., Liu, F., Zhang, W., et al. (2024) · Advanced Materials · doi:10.1002/adma.202311611 · Cited by 37
Fast Photon-Mediated Entanglement of Continuously Cooled Trapped Ions for Quantum Networking
O'Reilly, J. P., Toh, G., Goetting, I., Saha, S., Shalaev, M. I., Carter, A. L., Risinger, A., Kalakuntla, A., Li, T., Verma, A., et al. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.090802 · Cited by 67
Quantum spin models for measurement-based quantum computation
Wei, T.-C. (2018) · Advances in Physics X · doi:10.1080/23746149.2018.1461026 · Cited by 44
“One of the important precursory works is the teleportation-based quantum computation by Gottesman and Chuang [6], which also helps to provide an alternative understanding of the cluster-state quantum computation via the valence-bond or projected entangled pair states (PEPS) byVerstraete andCirac [7].”
MethodFast Estimation of Outcome Probabilities for Quantum Circuits
Pashayan, H., Reardon-Smith, O., Korzekwa, K., & Bartlett, S. D. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020361 · Cited by 54
“It is well known that a T gate acting on a given qubit can be replaced by its gadgetized version [45, 46].”
BackgroundQuantum computers: Definition and implementations
Pérez-Delgado, C. A., & Kok, P. (2011) · Physical Review A · doi:10.1103/physreva.83.012303 · Cited by 37
“This led to the concept of gate teleportation [45], in which the quantum channel of a teleportation event is modified to induce a specific gate on the teleported qubits.”
Ideal Quantum Teleamplification up to a Selected Energy Cutoff Using Linear Optics
Guanzon, J. J., Winnel, M. S., Lund, A. P., & Ralph, T. C. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.160501 · Cited by 41
Enhancing quantum teleportation fidelity under decoherence via weak measurement with flips
Harraz, S., Cong, S., & Nieto, J. J. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00134-1 · Cited by 34
Quantum Benchmarks for Pure Single-Mode Gaussian States
Chiribella, G., & Adesso, G. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.010501 · Cited by 39
Tokunaga, Y., Yamamoto, T., Koashi, M., & Imoto, N. (2005) · Physical Review A · doi:10.1103/physreva.71.030301 · Cited by 33
Leuenberger, M. N. (2006) · Physical Review B · doi:10.1103/physrevb.73.075312 · Cited by 36
Rohde, P. P. (2015) · Physical Review A · doi:10.1103/physreva.91.012306 · Cited by 34
Optimal control of Rydberg lattice gases
Cui, J., van Bijnen, R., Pohl, T., Montangero, S., & Calarco, T. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa7daf · Cited by 33
Entanglement of group-II-like atoms with fast measurement for quantum information processing
Stock, R., Babcock, N. S., Raizen, M. G., & Sanders, B. C. (2008) · Physical Review A · doi:10.1103/physreva.78.022301 · Cited by 31
Application Scenarios for the Quantum Internet
Wang, C., Rahman, A., Li, R., Aelmans, M., & Chakraborty, K. (2024) · doi:10.17487/rfc9583 · Cited by 34
Revisiting the Mapping of Quantum Circuits: Entering the Multi-core Era
Escofet, P., Ovide, A., Bandić, M., Prielinger, L., van Someren, H., Feld, S., Alarcón, E., Abadal, S., & Almudéver, C. G. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3655029 · Cited by 54
“These entangled states ( | Φ + ) are used to transmit quantum states from one core to another, employing the principles of quantum teleportation [23], a quantum communication protocol depicted in Figure 2(a).”
Burridge, B. M., Faruque, I. I., Rarity, J. G., & Barreto, J. (2020) · Optics Letters · doi:10.1364/ol.393077 · Cited by 40
Twist: sound reasoning for purity and entanglement in Quantum programs
Yuan, C., McNally, C. M., & Carbin, M. (2022) · Proceedings of the ACM on Programming Languages · doi:10.1145/3498691 · Cited by 45
“We illustrate the value of purity and Twist with the protocol of quantum teleportation [Bennett et al. 1993], a demonstration of the power of entanglement and a building block for techniques such as gate teleportation [Gottesman and Chuang 1999].”
MethodTeleportation of an unknown bipartite state via non-maximally entangled two-particle state
Cao, H.-J., Guo, Y., & Song, H. (2006) · Chinese Physics · doi:10.1088/1009-1963/15/5/007 · Cited by 30
Informationally symmetrical Bell state preparation and measurement
Kim, Y., Pramanik, T., Cho, Y., Yang, M., Han, S.-W., Lee, S., Kang, M.-S., & Moon, S. (2018) · Optics Express · doi:10.1364/oe.26.029539 · Cited by 31
Contextuality of General Probabilistic Theories
Shähandeh, F. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010330 · Cited by 43
Generation of entangled ancilla states for use in linear optics quantum computing
Franson, J. D., Donegan, M. M., & Jacobs, B. C. (2004) · Physical Review A · doi:10.1103/physreva.69.052328 · Cited by 30
Experimental requirements for Grover’s algorithm in optical quantum computation
Dodd, J. L., Ralph, T. C., & Milburn, G. J. (2003) · Physical Review A · doi:10.1103/physreva.68.042328 · Cited by 34
Linear optical extraction of photon-number Fock states from coherent states
Sanaka, K. (2005) · Physical Review A · doi:10.1103/physreva.71.021801 · Cited by 36
Browne, D., & Briegel, H. (2016) · Quantum Information · doi:10.1002/9783527805785.ch21 · Cited by 29
Robust Estimation of the Quantum Fisher Information on a Quantum Processor
Vitale, V., Rath, A., Jurcevic, P., Elben, A., Branciard, C., & Vermersch, B. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030338 · Cited by 61
Asynchronous quantum repeater using multiple quantum memory
Li, C., Yin, H., & Chen, Z.-B. (2024) · Reports on Progress in Physics · doi:10.1088/1361-6633/ad91de · Cited by 33
“According to the entanglement swapping protocol [47], two Bell states with each having one qubit in the middle node, can be deterministically transformed into a Bell state with cnot operation, single-qubit operations, and measurements.”
Entanglement in valence-bond-solid states on symmetric graphs
Katsura, H., Kawashima, N., Kirillov, A. N., Korepin, V. E., & Tanaka, S. (2010) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/43/25/255303 · Cited by 33
Continuous joint measurement and entanglement of qubits in remote cavities
Motzoi, F., Whaley, K. B., & Sarovar, M. (2015) · Physical Review A · doi:10.1103/physreva.92.032308 · Cited by 30
Controlled quantum teleportation in the presence of an adversary
Gangopadhyay, S., Wang, T.-J., Mashatan, A., & Ghose, S. (2022) · Physical Review A · doi:10.1103/physreva.106.052433 · Cited by 36
“This idea has found applications in several quantum information schemes such as quantum gate teleportation [3], cluster state quantum computing [4] and quantum repeaters [5].”
MethodMagic of quantum hypergraph states
Chen, J., Yan, Y., & Zhou, Y. (2024) · Quantum · doi:10.22331/q-2024-05-21-1351 · Cited by 49
“The quantum state beyond stabilizer formalism owns nonstabilizerness or called “magic” [4, 5], which enables universal fault-tolerant quantum computing [6] via the magic-state-injection approach [4, 7].”
BackgroundBounds on the Power of Constant-Depth Quantum Circuits
Fenner, S., Green, F., Homer, S. T., & Zhang, Y. (2005) · Lecture notes in computer science · doi:10.1007/11537311_5 · Cited by 31
“Using the gate teleportation apparatus of Gottesmann and Chuang [13], Terhal & DiVincenzo also construct a depth-three quantum circuit C′ out of an arbitrary circuit C (over CNOT and single-qubit gates) with a similar relationship of acceptance probabilities.”
MethodInfluentialBergholm, V., & Biamonte, J. (2011) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/44/24/245304 · Cited by 29
Single photons for quantum information systems
Yamamoto, Y., Santori, C., Solomon, G. S., Vučković, J., Fattal, D. A., Waks, E., & Diamanti, E. (2005) · Progress in Informatics · doi:10.2201/niipi.2005.1.2 · Cited by 34
Complexity Classification of Conjugated Clifford Circuits
Bouland, A., Fitzsimons, J. F., & Koh, D. E. (2017) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.ccc.2018.21 · Cited by 50
Teleporting photonic qudits using multimode quantum scissors
Goyal, S. K., & Konrad, T. (2013) · Scientific Reports · doi:10.1038/srep03548 · Cited by 28
“cd{1 obtained after the transformation (3) to output modes b0 .”
BackgroundQuantifying non-stabilizerness via information scrambling
Ahmadi, A., & Greplová, E. (2024) · SciPost Physics · doi:10.21468/scipostphys.16.2.043 · Cited by 38
“These states result from quantum circuits produced by Clifford gates which are elements of the Clifford group generated by the Hadamard gate, the phase gate and the entangling control-NOT gate [9].”
BackgroundMethodEffective Compression of Quantum Braided Circuits Aided by ZX-Calculus
Hanks, M., Estarellas, M. P., Munro, W. J., & Nemoto, K. (2020) · Physical Review X · doi:10.1103/physrevx.10.041030 · Cited by 43
Multidimensional Bose quantum error correction based on neural network decoder
Wang, H., Xue, Y.-J., Qu, Y., Mu, X., & Ma, H. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00650-z · Cited by 34
“It provides an in fi nite dimension for the encoding of quantum information under Hilbert space 5 .”
BackgroundData centers with quantum random access memory and quantum networks
Liu, J., Hann, C. T., & Jiang, L. (2023) · Physical Review A · doi:10.1103/physreva.108.032610 · Cited by 42
Teleportation, braid group and Temperley–Lieb algebra
Zhang, Y. (2006) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/39/37/017 · Cited by 36
“In the extension of the present paper [49, 50], we apply our diagrammatical rules to the entanglement swapping [53], quantum computing [ 54 ] and multipartite entanglements.”
MethodZhan, Y.-B., Zhang, Q.-Y., Yu-wu, W., & MA, P.-C. (2010) · Chinese Physics Letters · doi:10.1088/0256-307x/27/1/010307 · Cited by 29
Fiber-coupled EPR-state generation using a single temporally multiplexed squeezed light source
Larsen, M. V., Guo, X., Breum, C. R., Neergaard-Nielsen, J. S., & Andersen, U. L. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0170-y · Cited by 34
Single-mode excited entangled coherent states
Xu, L., & Kuang, L. (2006) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/39/12/l04 · Cited by 29
Universal quantum computation by holonomic and nonlocal gates with imperfections
Ellinas, D., & Pachos, J. K. (2001) · Physical Review A · doi:10.1103/physreva.64.022310 · Cited by 30
A Survey of Quantum Internet Protocols From a Layered Perspective
Li, Y., Zhang, H., Zhang, C., Huang, T., & Yu, F. R. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3361662 · Cited by 55
“Teleported gates [219] based on bipartite entan-glement between nodes can prepare multipartite entanglement distributed across different nodes.”
Background
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.