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 401–500 of 1,005
Quantum optical systems for the implementation of quantum information processing
Ralph, T. C. (2006) · Reports on Progress in Physics · doi:10.1088/0034-4885/69/4/r01 · Cited by 59
Lee, S.-W., Ki-min Park, B., Ralph, T. C., & Jeong, H. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.113603 · Cited by 60
Entanglement in a one-dimensional critical state after measurements
Yang, Z., Mao, D., & Jian, C. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.108.165120 · Cited by 77
Iterated Gate Teleportation and Blind Quantum Computation
Pérez-Delgado, C. A., & Fitzsimons, J. F. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.220502 · Cited by 47
Practical Experimental Certification of Computational Quantum Gates Using a Twirling Procedure
Moussa, O., Silva, M. P. D., Ryan, C. A., & Laflamme, R. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.070504 · Cited by 61
Port-based teleportation in arbitrary dimension
Studziński, M., Strelchuk, S., Mozrzymas, M., & Horodecki, M. (2017) · Scientific Reports · doi:10.1038/s41598-017-10051-4 · Cited by 74
“To evaluate the performance of the PBT scheme explicitly, we need to characterize the spectral properties of the above operator given in (3).”
MethodDual-species, multi-qubit logic primitives for Ca+/Sr+ trapped-ion crystals
Bruzewicz, C., McConnell, R., Stuart, J., Sage, J., & Chiaverini, J. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0218-z · Cited by 55
Optimal teleportation via noisy quantum channels without additional qubit resources
Im, D.-G., Lee, C.-H., Kim, Y., Nha, H., Kim, M. S., Lee, S.-W., & Kim, Y.-H. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00426-x · Cited by 58
Zou, X., Pahlke, K., & Mathis, W. (2002) · Physical Review A · doi:10.1103/physreva.65.064305 · Cited by 44
Quantum Science and Metrology with Mixed-Species Ion Chains
Home, J. P. (2013) · Advances In Atomic, Molecular, and Optical Physics · doi:10.1016/b978-0-12-408090-4.00004-9 · Cited by 44
MEASUREMENT-BASED QUANTUM COMPUTATION WITH CLUSTER STATES
Raussendorf, R. (2009) · International Journal of Quantum Information · doi:10.1142/s0219749909005699 · Cited by 51
“To mention a non-standard variant of the network model, in [22] it was shown that universal quantum computation can be performed using Bell measurements, local unitary transformations and certain entangled quantum states such as the Greenberger-HorneZeilinger (GHZ) state.”
MethodNew Genuinely Multipartite Entanglement
Luo, M. (2020) · Advanced Quantum Technologies · doi:10.1002/qute.202000123 · Cited by 51
Chen, X., Chung, H., Cross, A. W., Zeng, B., & Chuang, I. L. (2008) · Physical Review A · doi:10.1103/physreva.78.012353 · Cited by 46
Self-citationQuantum-computer architecture using nonlocal interactions
Brennen, G. K., Song, D., & Williams, C. J. (2003) · Physical Review A · doi:10.1103/physreva.67.050302 · Cited by 47
Quantum Benchmark for Teleportation and Storage of Squeezed States
Adesso, G., & Chiribella, G. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.170503 · Cited by 46
Ogawa, H., Ohdan, H., Miyata, K., Taguchi, M., Makino, K., Yonezawa, H., Yoshikawa, J., & Furusawa, A. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.233602 · Cited by 55
Weaving quantum optical frequency combs into continuous-variable hypercubic cluster states
Wang, P., Chen, M., Menicucci, N. C., & Pfister, O. (2014) · Physical Review A · doi:10.1103/physreva.90.032325 · Cited by 55
Gong, C., Juan, D., Dong, Z., Guo, Z., Gani, A., Zhao, L., & Qi, H. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-2603-0 · Cited by 45
Quantum teleportation of physical qubits into logical code spaces
Luo, Y.-H., Chen, M.-C., Erhard, M., Zhong, H.-S., Wu, D., Tang, H.-Y., Zhao, Q., Wang, X.-L., Fujii, K., Li, L., et al. (2021) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2026250118 · Cited by 45
“gate [14], which is also indicated in Fig.”
Wang, H., Wen, J.-J., Zhu, A., Zhang, S., & Yeon, K.-H. (2013) · Physics Letters A · doi:10.1016/j.physleta.2013.09.005 · Cited by 46
Two-qubit Projective Measurements are Universal for Quantum ComputationPreprint
Leung, D. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0111122 · Cited by 65
“This leads to many important results on gate construction [11, 12, 8, 13, 14, 15, 16, 17, 18] in the context of fault-tolerant implementation or storage of quantum gates, and alternative computation models.”
BackgroundDemonstration of controlled high-dimensional quantum teleportation
Lv, M.-Y., Hu, X., Gong, N.-F., Wang, T.-J., Guo, Y., Liu, B., Huang, Y., Li, C., & Guo, G. (2024) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-023-2286-8 · Cited by 51
Reducing the quantum-computing overhead with complex gate distillation
Duclos-Cianci, G., & Poulin, D. (2015) · Physical Review A · doi:10.1103/physreva.91.042315 · Cited by 44
“This distillation protocol lends itself to a recursive procedure [9] where previously distilled states |Yj〉 for j < k are used to distill states |Yk〉.”
MethodKim, T., Maunz, P., & Kim, J. (2011) · Physical Review A · doi:10.1103/physreva.84.063423 · Cited by 44
Li, Y., Zu, C., & Wei, D.-M. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2114-4 · Cited by 47
Tansuwannont, T., Chamberland, C., & Leung, D. (2020) · Physical Review A · doi:10.1103/physreva.101.012342 · Cited by 41
Quantum State Transfer over 1200 km Assisted by Prior Distributed Entanglement
Li, B., Cao, Y. W., Li, Y.-H., Cai, W., Liu, W.-Y., Ren, J.-G., Liao, S., Wu, H.-N., Li, S.-L., Li, L., et al. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.170501 · Cited by 57
Heralded generation of multiphoton entanglement
Walther, P., Aspelmeyer, M., & Zeilinger, A. (2007) · Physical Review A · doi:10.1103/physreva.75.012313 · Cited by 45
Cluster-type entangled coherent states
Munhoz, P. P., Semião, F. L., Vidiella-Barranco, A., & Roversi, J. A. (2008) · Physics Letters A · doi:10.1016/j.physleta.2008.02.009 · Cited by 48
Fault-tolerant connection of error-corrected qubits with noisy links
Ramette, J., Sinclair, J., Breuckmann, N. P., & Vuletić, V. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00855-4 · Cited by 111
“Entanglement shared between two modules in the form of non-local Bell pairs then serves as a resource to enable teleported gates for inter-module operations 15 – 17 .”
Qudit color codes and gauge color codes in all spatial dimensions
Watson, F. H. E., Campbell, E. T., Anwar, H., & Browne, D. E. (2015) · Physical Review A · doi:10.1103/physreva.92.022312 · Cited by 55
“[39] D. Gottesman and I.L. Chuang, Nature 402, 390–393 (1999).”
BackgroundThermal States as Universal Resources for Quantum Computation with Always-On Interactions
Li, Y., Browne, D. E., Kwek, L. C., Raussendorf, R., & Wei, T.-C. (2011) · Physical Review Letters · doi:10.1103/physrevlett.107.060501 · Cited by 53
Cluster-state preparation and multipartite entanglement analyzer with fermions
Zhang, X., Feng, M., & Gao, K. (2006) · Physical Review A · doi:10.1103/physreva.73.014301 · Cited by 43
Yu, L. Z., Griffiths, R. B., & Cohen, S. M. (2010) · Physical Review A · doi:10.1103/physreva.81.062315 · Cited by 45
Quantum teleportation with identical particles
Marzolino, U., & Buchleitner, A. (2015) · Physical Review A · doi:10.1103/physreva.91.032316 · Cited by 48
Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets
Forest, S., Gosset, D., Kliuchnikov, V., & McKinnon, D. (2015) · Journal of Mathematical Physics · doi:10.1063/1.4927100 · Cited by 71
Quantum teleportation from light beams to vibrational states of a macroscopic diamond
Hou, P.-Y., Huang, Y.-Y., Yuan, X.-X., Chang, X.-Y., Zu, C., He, L., & Duan, L.-M. (2016) · Nature Communications · doi:10.1038/ncomms11736 · Cited by 41
Experimental Pauli-frame randomization on a superconducting qubit
Ware, M., Ribeill, G., Ristè, D., Ryan, C. A., Johnson, B., & da Silva, M. P. (2021) · Physical Review A · doi:10.1103/physreva.103.042604 · Cited by 43
“If the computational gates consist of Clifford group operations [23] (a set of operations sufficient for error correction), the effect of these random Pauli operations can be easily tracked [24, 25] so that the computation itself can be unrandomized by reinterpreting measurement results.”
BackgroundFault-tolerant logical gate networks for Calderbank-Shor-Steane codes
Steane, A. M., & Ibinson, B. (2005) · Physical Review A · doi:10.1103/physreva.72.052335 · Cited by 44
Examples of Gaussian cluster computation
van Loock, P. (2007) · Journal of the Optical Society of America B · doi:10.1364/josab.24.000340 · Cited by 44
Teleportation in a Noisy Environment: A Quantum Trajectories Approach
Carlo, G. G., Benenti, G., & Casati, G. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.257903 · Cited by 49
Teleportation of general finite dimensional quantum systemsPreprint
Albeverio, S. A., Fei, S.-M., Mathematik, F. F., Bochum, R.-U., & Bochum, D. (2000) · Cited by 43
Pauli topological subsystem codes from Abelian anyon theories
Ellison, T. D., Chen, Y.-A., Dua, A., Shirley, W. E., Tantivasadakarn, N., & Williamson, D. J. (2023) · Quantum · doi:10.22331/q-2023-10-12-1137 · Cited by 65
Deterministic quantum state and gate teleportation between distant superconducting chips
Qiu, J., Liu, Y., Hu, L., Wu, Y., Niu, J., Zhang, L., Huang, W., Chen, Y., Li, J., Liu, S., et al. (2024) · 中国科学通报:英文版 · doi:10.1016/j.scib.2024.11.047 · Cited by 85
Versatile relative entropy bounds for quantum networks
Rigovacca, L., Kato, G., Bäuml, S., Kim, M. S., Munro, W. J., & Azuma, K. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa9fcf · Cited by 48
All Pure Fermionic Non-Gaussian States Are Magic States for Matchgate Computations
Hebenstreit, M., Jozsa, R., Kraus, B., Strelchuk, S., & Yoganathan, M. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.080503 · Cited by 121
Modeling of measurement-based quantum network coding on a superconducting quantum processor
Pathumsoot, P., Matsuo, T., Satoh, T., Hajdušek, M., Suwanna, S., & Meter, R. V. (2020) · Physical Review A · doi:10.1103/physreva.101.052301 · Cited by 47
Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities
de Beaudrap, N., Bian, X., & Wang, Q. (2020) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.tqc.2020.11 · Cited by 69
Quantum simulation of interacting high-dimensional systems: The influence of noise
Dür, W., Bremner, M. J., & Briegel, H. J. (2008) · Physical Review A · doi:10.1103/physreva.78.052325 · Cited by 41
Tripartite interactions between two phase qubits and a resonant cavity
Altomare, F., Park, J., Cicak, K., Sillanpää, M. A., Allman, M. S., Li, D., Sirois, A. J., Strong, J., Whittaker, J. D., & Simmonds, R. W. (2010) · Nature Physics · doi:10.1038/nphys1731 · Cited by 42
“(1) A photon is inserted in the system by exciting qubit 1.”
InfluentialZeng, B., Chen, X., & Chuang, I. L. (2008) · Physical Review A · doi:10.1103/physreva.77.042313 · Cited by 79
Self-citationLiang, M. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2529-6 · Cited by 42
No-Go Theorems for Quantum Resource Purification: New Approach and Channel Theory
Fang, K., & Liu, Z.-W. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010337 · Cited by 48
Encoding Qubits in Multimode Grid States
Royer, B., Singh, S., & Girvin, S. M. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010335 · Cited by 80
“These properties are summarized in table III, where we see that for a given Hamiltonian order, GKP codes allow gates deeper in the Clifford hierarchy compared to rotation-symmetric codes [75].”
BackgroundTypes and typechecking for Communicating Quantum Processes
Gay, S. J., & Nagarajan, R. (2006) · Mathematical Structures in Computer Science · doi:10.1017/s0960129506005263 · Cited by 42
“…particularly important: it is likely to be a key enabling technology for the development of quantum repeaters (de Riedmatten et al. 2004), which will be necessary in large-scale quantum communication networks, and it has fundamental applications to quantum computation (Gottesman and Chuang 1999).”
BackgroundHigh-level methods for quantum computation and information
Abramsky, S. (2004) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.2004.1319635 · Cited by 41
“Teleportation is simply the most basic of a family of quantum protocols, including logic-gate teleportation [13], entanglement swapping [27], and quantum key exchange [12], which form the basis for novel and potentially very important applications to secure and fault-tolerant communication and computation [8, 13 , 18,…”
BackgroundThe creation and detection of arbitrary photon number states using cavity QED
Varcoe, B. T. H., Brattke, S., & WALTHER, H. (2004) · New Journal of Physics · doi:10.1088/1367-2630/6/1/097 · Cited by 41
Scheme for preparation of mulipartite entanglement of atomic ensembles
Xue, P., & Guo, G. (2003) · Physical Review A · doi:10.1103/physreva.67.034302 · Cited by 45
Continuous Variable Quantum Teleportation Network
Shi, S., Wang, Y., Tian, L., Li, W., Wu, Y., Wang, Q., Zheng, Y., & Peng, K. (2022) · Laser & Photonics Review · doi:10.1002/lpor.202200508 · Cited by 48
Direct Generation and Detection of Quantum Correlated Photons with 3.2 um Wavelength Spacing
Sua, Y. M., Fan, H., Shahverdi, A., Chen, J., & Huang, Y. (2017) · Scientific Reports · doi:10.1038/s41598-017-17820-1 · Cited by 42
Controlled teleportation against uncooperation of part of supervisors
Wang, X.-W., Yu-Huan, S., & Yang, G. (2009) · Quantum Information Processing · doi:10.1007/s11128-009-0107-z · Cited by 44
Level Reduction and the Quantum Threshold TheoremPreprint
Aliferis, P. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0703230 · Cited by 65
“The concept of gate teleportation was developed to address the problem of constructing a quantum universal set of gate gadgets satisfying properties 2 [51, 42, 32, 77].”
BackgroundMethodLower Bound for the T Count Via Unitary Stabilizer Nullity
Jiang, J., & Wang, X. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.19.034052 · Cited by 52
“This is because in many promising faulttolerant architectures, the Clifford gates can be implemented transversally [12] and the required T gate for universality can be performed via state injection [10, 13].”
BackgroundPisenti, N. C., Gaebler, C. P., & Lynn, T. W. (2011) · Physical Review A · doi:10.1103/physreva.84.022340 · Cited by 43
Recent development in quantum communication
Song, S., & Wang, C. (2012) · Chinese Science Bulletin · doi:10.1007/s11434-012-5600-6 · Cited by 42
“Quantum teleportation is a basic ingredient in quantum information architectures [9,10].”
BackgroundEntanglement Replication in Driven Dissipative Many-Body systems
Zippilli, S., Paternostro, M., Adesso, G., & Illuminati, F. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.040503 · Cited by 48
Noisy one-way quantum computations: The role of correlations
Chaves, R., & de Melo, F. (2011) · Physical Review A · doi:10.1103/physreva.84.022324 · Cited by 41
Adaptive recurrence quantum entanglement distillation for two-Kraus-operator channels
Ruan, L., Dai, W., & Win, M. Z. (2018) · Physical Review A · doi:10.1103/physreva.97.052332 · Cited by 44
Nondestructive discrimination of a new family of highly entangled states in IBM quantum computer
Satyajit, S., Srinivasan, K., Behera, B. K., & Panigrahi, P. K. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1976-9 · Cited by 45
Local unitary versus local Clifford equivalence of stabilizer and graph states
Zeng, B., Chung, H., Cross, A. W., & Chuang, I. L. (2007) · Physical Review A · doi:10.1103/physreva.75.032325 · Cited by 57
Self-citationWigner crystals of ions as quantum hard drives
Taylor, J. M., & Calarco, T. (2008) · Physical Review A · doi:10.1103/physreva.78.062331 · Cited by 39
Wiring up trapped ions to study aspects of quantum information
Daniilidis, N., Lee, T., Clark, R., Narayanan, S., & Häffner, H. (2009) · Journal of Physics B: Atomic, Molecular and Optical Physics · doi:10.1088/0953-4075/42/15/154012 · Cited by 42
Estimating the fidelity of T gates using standard interleaved randomized benchmarking
Harper, R., & Flammia, S. T. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa5f8d · Cited by 40
Probabilistic quantum cloning via Greenberger-Horne-Zeilinger states
Zhang, C., Li, C.-F., Wang, Z.-Y., & Guo, G.-C. (2000) · Physical Review A · doi:10.1103/physreva.62.042302 · Cited by 40
Continuous-variable quantum teleportation of entanglement
Johnson, T. J., Bartlett, S. D., & Sanders, B. C. (2002) · Physical Review A · doi:10.1103/physreva.66.042326 · Cited by 43
Vibrational coherent quantum computation
Paternostro, M., Kim, M. S., & Knight, P. L. (2005) · Physical Review A · doi:10.1103/physreva.71.022311 · Cited by 39
Bartkiewicz, K., Lemr, K., Černoch, A., & Miranowicz, A. (2017) · Physical Review A · doi:10.1103/physreva.95.030102 · Cited by 39
Advances in artificial intelligence and machine learning for quantum communication applications
Mafu, M. (2024) · IET Quantum Communication · doi:10.1049/qtc2.12094 · Cited by 43
Wang, Y., Su, X., Shen, H., Tan, A., Xie, C., & Peng, K. (2010) · Physical Review A · doi:10.1103/physreva.81.022311 · Cited by 37
Fundamental Limits on the Capacities of Bipartite Quantum Interactions
Bäuml, S., Das, S., & Wilde, M. M. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.250504 · Cited by 47
“An example of a bicovariant channel is the CNOT gate [43,44], or one that applies the CNOT gate with some probability and replaces with the maximally mixed state with the complementary probability.”
BackgroundConditional linear-optical measurement schemes generate effective photon nonlinearities
Lapaire, G. G., Kok, P., Dowling, J. P., & Sipe, J. E. (2003) · Physical Review A · doi:10.1103/physreva.68.042314 · Cited by 28
Zaidi, H., Menicucci, N. C., Flammia, S. T., Bloomer, R., Pysher, M., & Pfister, O. (2008) · Laser Physics · doi:10.1134/s1054660x08050186 · Cited by 41
Gouzien, É., Ruiz, D., Régent, F.-M. L., Guillaud, J., & Sangouard, N. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.040602 · Cited by 85
“Finally, the logical Toffoli gate CCXL is implemented using gate teleportation [39] from a “Toffoli magic state” |CCX⟩ = 12 (|000⟩ + |010⟩ + |100⟩ + |111⟩), as detailed in App.”
MethodDas, S., Bäuml, S., & Wilde, M. M. (2020) · Physical Review A · doi:10.1103/physreva.101.012344 · Cited by 47
Efficient production of large-size optical Schrödinger cat states
Mikheev, E. V., Pugin, A. S., Kuts, D., Podoshvedov, S. A., & An, N. B. (2019) · Scientific Reports · doi:10.1038/s41598-019-50703-1 · Cited by 46
Rohde, P. P. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108868815 · Cited by 56
Detecting Magic States via Characteristic Functions
Dai, H., Fu, S., & Luo, S. (2022) · International Journal of Theoretical Physics · doi:10.1007/s10773-022-05027-8 · Cited by 45
“A well-known method for universal gate synthesis is composed of stabilizer operations and some additional operations [5, 6], which can achieve universal fault-tolerant quantum computation [7–11].”
MethodProbabilistic teleportation and quantum operation
Pati, A. K., & Agrawal, P. (2004) · Journal of Optics B Quantum and Semiclassical Optics · doi:10.1088/1464-4266/6/8/034 · Cited by 44
Scalable quantum information processing with atomic ensembles and flying photons
Mei, F., Feng, M., Yu, Y., & Zhang, Z. (2009) · Physical Review A · doi:10.1103/physreva.80.042319 · Cited by 39
Protocol and quantum circuits for realizing deterministic entanglement concentration
Gu, Y., Li, W., & Guo, G. (2006) · Physical Review A · doi:10.1103/physreva.73.022321 · Cited by 38
Designing a Million-Qubit Quantum Computer Using a Resource Performance Simulator
Ahsan, M., Meter, R. V., & Kim, J. (2016) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/2830570 · Cited by 35
“The resulting EPR pair is used by the actual operand ions as a resource to perform the desired gate via quantum teleportation between two ions that cannot be connected by BSC [Gottesman and Chuang 1999].”
MethodUniversal quantum computation on the power of quantum non-demolition measurements
Nemoto, K., & Munro, W. J. (2005) · Physics Letters A · doi:10.1016/j.physleta.2005.06.060 · Cited by 39
Decoherence, Control, and Symmetry in Quantum ComputersPreprint
Bacon, D. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0305025 · Cited by 64
Learning Quantum Circuits of Some T Gates
Lai, C., & Cheng, H. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3151760 · Cited by 63
“As for the second statement, we simply use the gate teleportation technique [45], [41] to implement a Clifford circuit with a corresponding ancillary state.”
MethodLocalization effects in disordered quantum batteries
Arjmandi, M. B., Mohammadi, H., Saguia, A., Sarandy, M. S., & Santos, A. C. (2023) · Physical review. E · doi:10.1103/physreve.108.064106 · Cited by 50
An efficient magic state approach to small angle rotations
Campbell, E. T., & O’Gorman, J. (2016) · Quantum Science and Technology · doi:10.1088/2058-9565/1/1/015007 · Cited by 38
Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
Mantri, A., Demarie, T. F., Menicucci, N. C., & Fitzsimons, J. F. (2017) · Physical Review X · doi:10.1103/physrevx.7.031004 · Cited by 44
Universal MBQC with generalised parity-phase interactions and Pauli measurements
Kissinger, A., & van de Wetering, J. (2019) · Quantum · doi:10.22331/q-2019-04-26-134 · Cited by 68
A bright future for quantum communications
Ralph, T. C., & Lam, P. K. (2009) · Nature Photonics · doi:10.1038/nphoton.2009.222 · Cited by 41
Entanglement purification for arbitrary unknown ionic states via linear optics
Yang, M., Song, W., & Cao, Z. (2005) · Physical Review A · doi:10.1103/physreva.71.012308 · Cited by 36
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.