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 301–400 of 1,005
Quantum Computation with Topological Codes: From Qubit to Topological Fault-Tolerance
Fujii, K. (2015) · SpringerBriefs in mathematical physics · doi:10.1007/978-981-287-996-7 · Cited by 112
Pauli spectrum and nonstabilizerness of typical quantum many-body states
Turkeshi, X., Dymarsky, A. Y., & Sierant, P. (2025) · Physical review. B./Physical review. B · doi:10.1103/physrevb.111.054301 · Cited by 147
Magic state distillation with low space overhead and optimal asymptotic input count
Haah, J., Hastings, M. B., Poulin, D., & Wecker, D. (2017) · Quantum · doi:10.22331/q-2017-10-03-31 · Cited by 62
“[14], and any gate in the third level of Clifford hierarchy [15].”
BackgroundMethodInfluentialThe Clifford group fails gracefully to be a unitary 4-designPreprint
Zhu, H., Kueng, R., Grassl, M., & Gross, D. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1609.08172 · Cited by 200
“3 Pauli group, Clifford group, and stabilizer codes The Pauli group and Clifford group play a crucial role in quantum computation [32, 33, 64, 12], quantum error correction [32, 64], randomized benchmarking [53, 59, 81], and quantum state tomography with compressed sensing [39, 35, 49].”
BackgroundDiagonal gates in the Clifford hierarchy
Cui, S. X., Gottesman, D., & Krishna, A. (2017) · Physical Review A · doi:10.1103/physreva.95.012329 · Cited by 135
“Gottesman and Chuang [5] explored what gates could be implemented via teleportation-based state injection.”
BackgroundSelf-citationSimulating realistic non-Gaussian state preparation
Quesada, N., Helt, L. G., Izaac, J., Arrazola, J. M., Shahrokhshahi, R., Myers, C. R., & Sabapathy, K. K. (2019) · Physical Review A · doi:10.1103/physreva.100.022341 · Cited by 71
Entanglement Purification and Protection in a Superconducting Quantum Network
Yan, H., Zhong, Y., Chang, H.-S., Bienfait, A., Chou, M.-H., Conner, C. R., Dumur, É., Grebel, J., Povey, R. G., & Cleland, A. N. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.080504 · Cited by 100
Sympathetic Electromagnetically-Induced-Transparency Laser Cooling of Motional Modes in an Ion Chain
Lin, Y., Gaebler, J. P., Tan, T. R., Bowler, R., Jost, J. D., Leibfried, D., & Wineland, D. J. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.153002 · Cited by 70
Quantum Teleportation of Optical Quantum Gates
Bartlett, S. D., & Munro, W. J. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.117901 · Cited by 84
Neural network decoder for topological color codes with circuit level noise
Baireuther, P., Caio, M. D., Criger, B., Beenakker, C. W. J., & O’Brien, T. E. (2019) · New Journal of Physics · doi:10.1088/1367-2630/aaf29e · Cited by 65
“This is not yet computationally universal, but can be rendered universal using gate teleportation [14] and magic state distillation [15].”
BackgroundBidirectional imperfect quantum teleportation with a single Bell state
Kiktenko, E. O., Popov, A. A., & Fedorov, A. K. (2016) · Physical Review A · doi:10.1103/physreva.93.062305 · Cited by 72
Transmission of optical coherent-state qubits
Glancy, S., Vasconcelos, H. M., & Ralph, T. C. (2004) · Physical Review A · doi:10.1103/physreva.70.022317 · Cited by 83
“It is possible to protect the qubits from destruction when the Hadamard gate fails by using a second layer of teleportation as described in [6].”
MethodInfluentialTeleportation-based realization of an optical quantum two-qubit entangling gate
Gao, W.-B., Goebel, A. M., Lu, C.-Y., Dai, H.-N., Wagenknecht, C., Zhang, Q., Zhao, B., Peng, C.-Z., Chen, Z.-B., Chen, Y.-A., et al. (2010) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1005720107 · Cited by 69
“[2] Gottesman D, Chuang IL (1999) Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations.”
BackgroundGeometric Rényi Divergence and its Applications in Quantum Channel Capacities
Fang, K., & Fawzi, H. (2021) · Communications in Mathematical Physics · doi:10.1007/s00220-021-04064-4 · Cited by 112
Yan, Z., Qin, J., Qin, Z., Su, X., Jia, X., Xie, C., & Peng, K. (2021) · Fundamental Research · doi:10.1016/j.fmre.2020.11.005 · Cited by 70
A protocol for quantum energy distribution
Hotta, M. (2008) · Physics Letters A · doi:10.1016/j.physleta.2008.07.007 · Cited by 78
Predojević, A., & Mitchell, M. W. (2015) · Nano-optics and nanophotonics · doi:10.1007/978-3-319-19231-4 · Cited by 80
“tive for quantum communication networks [2, 3], and distributed quantum computation [38, 39, 40].”
BackgroundArithmetic on a distributed-memory quantum multicomputer
Meter, R. V., Munro, W. J., Nemoto, K., & Itoh, K. M. (2008) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/1324177.1324179 · Cited by 65
“Gottesman and Chuang showed that teleportation can be used to construct a control-NOT (CNOT) gate [Gottesman and Chuang 1999].”
MethodInfluentialHigh-performance cavity-enhanced quantum memory with warm atomic cell
Ma, L., Lei, X., Yan, J., Li, R., Chai, T., Yan, Z., Jia, X., Xie, C., & Peng, K. (2022) · Nature Communications · doi:10.1038/s41467-022-30077-1 · Cited by 83
ARQUIN: Architectures for Multinode Superconducting Quantum Computers
Ang, J., Carini, G. A., Chen, Y., Chuang, I. L., Demarco, M., Economou, S. E., Eickbusch, A., Faraon, A., Fu, K. C., Girvin, S. M., et al. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3674151 · Cited by 124
Self-citationMultiphoton entanglement through a Bell-multiport beam splitter
Lim, Y. L., & Beige, A. (2005) · Physical Review A · doi:10.1103/physreva.71.062311 · Cited by 65
Fundamental limitations on distillation of quantum channel resources
Regula, B., & Takagi, R. (2021) · Nature Communications · doi:10.1038/s41467-021-24699-0 · Cited by 90
Alexander, R. N., Wang, P., Sridhar, N., Chen, M., Pfister, O., & Menicucci, N. C. (2016) · Physical Review A · doi:10.1103/physreva.94.032327 · Cited by 66
“As is standard in MBQC, once the entangled resource state is prepared, quantum computation proceeds solely through adaptive local measurements.”
BackgroundInfluentialQuantum Computation-Based Image Representation, Processing Operations and Their Applications
Yan, F., Iliyasu, A. M., & Jiang, Z. (2014) · Entropy · doi:10.3390/e16105290 · Cited by 72
Demonstration of feed-forward control for linear optics quantum computation
Pittman, T. B., Jacobs, B. C., & Franson, J. D. (2002) · Physical Review A · doi:10.1103/physreva.66.052305 · Cited by 64
Catalytic Quantum Teleportation
Lipka-Bartosik, P., & Skrzypczyk, P. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.080502 · Cited by 89
Discrete Wigner functions and the phase-space representation of quantum teleportation
Paz, J. P. (2002) · Physical Review A · doi:10.1103/physreva.65.062311 · Cited by 68
Quantum Computation Beyond the Circuit ModelPreprint
Jordan, S. P. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0809.2307 · Cited by 78
“Building on previous work[84, 138, 121], Raussendorf and Briegel showed in [145] that one can perform universal quantum computation by performing a series of singlequbit projective measurements on a special entangled initial state.”
BackgroundRamette, J., Sinclair, J., Vendeiro, Z., Rudelis, A., Cetina, M., & Vuletić, V. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010344 · Cited by 87
“Executing a teleported CNOT gate [45,46] between any two qubits within our architecture requires the following steps, shown in Fig.”
BackgroundQiu, X., Guo, H., & Chen, L. (2023) · Nature Communications · doi:10.1038/s41467-023-43950-4 · Cited by 78
Demonstration of a Controlled-Phase Gate for Continuous-Variable One-Way Quantum Computation
Ukai, R., Yokoyama, S., Yoshikawa, J.-I., van Loock, P., & Furusawa, A. (2011) · Physical Review Letters · doi:10.1103/physrevlett.107.250501 · Cited by 64
Beating the One-Half Limit of Ancilla-Free Linear Optics Bell Measurements
Zaidi, H., & van Loock, P. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.260501 · Cited by 77
Ralph, T. C., Söllner, I., Mahmoodian, S., White, A. G., & Lodahl, P. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.173603 · Cited by 81
Demonstration of Controlled Quantum Teleportation for Discrete Variables on Linear Optical Devices
Barasiński, A., Černoch, A., & Lemr, K. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.170501 · Cited by 72
Hofmann, H. F. (2004) · Physical Review A · doi:10.1103/physreva.70.023812 · Cited by 69
Quantum communication with itinerant surface acoustic wave phonons
Dumur, É., Satzinger, K. J., Peairs, G. A., Chou, M.-H., Bienfait, A., Chang, H.-S., Conner, C. R., Grebel, J., Povey, R. G., Zhong, Y., et al. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00511-1 · Cited by 79
Quantum Computing for Computer Architects
Metodi, T. S., & Chong, F. T. (2006) · Synthesis lectures on computer architecture · doi:10.1007/978-3-031-01718-6 · Cited by 62
Two-qubit gates using adiabatic passage of the Stark-tuned Förster resonances in Rydberg atoms
Beterov, I., Saffman, M., Yakshina, E., Tetryakov, D. B., Entin, V., Bergamini, S., Kutsetsova, E. A., & Ryabtsev, I. (2016) · Physical Review A · doi:10.1103/physreva.94.062307 · Cited by 59
Secret sharing of quantum information via entanglement swapping in cavity QED
Zhang, Y.-Q., Xing-Ri, J., & Zhang, S. (2005) · Physics Letters A · doi:10.1016/j.physleta.2005.05.020 · Cited by 62
New Limits on Fault-Tolerant Quantum Computation
Buhrman, H., Cleve, R., Laurent, M., Linden, N., Schrijver, A., & Unger, F. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06) · doi:10.1109/focs.2006.50 · Cited by 59
“Finally, we note that our work is related to, and partly stimulated by, the circle of ideas surrounding measurement-based quantum computation that was largely initiated by [10, 17].”
BackgroundAsavanant, W., Nakashima, K., Shiozawa, Y., Yoshikawa, J.-I., & Furusawa, A. (2017) · Optics Express · doi:10.1364/oe.25.032227 · Cited by 75
Towards Low Overhead Magic State Distillation
Krishna, A., & Tillich, J. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.070507 · Cited by 109
“aoeuidhtnspyfgcrlqjkxbmw Gottesman and Chuang introduced the Clifford hierarchy [11], which is defined recursively as”
BackgroundParallelism for quantum computation with qudits
O’Leary, D. P., Brennen, G. K., & Bullock, S. S. (2006) · Physical Review A · doi:10.1103/physreva.74.032334 · Cited by 67
Scalable Fault-Tolerant Quantum Technologies with Silicon Color Centers
Simmons, S. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.010102 · Cited by 91
“…in the form of BPs is delivered to the spins, this entanglement can be used as a resource to construct cluster states to be consumed for computation within the measurement-based computing paradigm [93, 94] or tele-ported gates in the traditional gate model of quantum computing [95, 96].”
MethodNonlocal photonic quantum gates over 7.0 km
Liu, X., Hu, X.-M., Zhu, T.-X., Zhang, C., Xiao, Y., Miao, J.-L., Ou, Z.-W., Li, P.-Y., Liu, B., Zhou, Z., et al. (2024) · Nature Communications · doi:10.1038/s41467-024-52912-3 · Cited by 89
“Here, we employ multiple degree of freedoms (DOFs) to encode four qubits with two photons to implement the teleportation-based nonlocal two-qubit gates 14 .”
BackgroundMethodInfluentialSecure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
Dupuis, F., Nielsen, J. B., & Salvail, L. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14623-7_37 · Cited by 64
Bacon, D., & Flammia, S. T. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.120504 · Cited by 73
Anticoncentration theorems for schemes showing a quantum speedup
Hangleiter, D., Bermejo-Vega, J., Schwarz, M., & Eisert, J. (2018) · Quantum · doi:10.22331/q-2018-05-22-65 · Cited by 58
Quantum Computer Systems: Research for Noisy Intermediate-Scale Quantum Computers
Ding, Y., & Chong, F. T. (2020) · Synthesis lectures on computer architecture · doi:10.2200/s01014ed1v01y202005cac051 · Cited by 74
Combining quantum processors with real-time classical communication
Vazquez, A. C., Tornow, C., Ristè, D., Woerner, S., Takita, M., & Egger, D. J. (2024) · Nature · doi:10.1038/s41586-024-08178-2 · Cited by 157
“By contrast, to implement LOCC, we consume virtual Bell pairs in a teleportation circuit to create two-qubit gates 19,20 .”
Arithmetic on a Distributed-Memory Quantum Multicomputer
Van Meter, R., Munro, W. J., Nemoto, K., & Itoh, K. M. (2006) · CERN Document Server (European Organization for Nuclear Research) · Cited by 58
Harris, N. C., Grassani, D., Simbula, A., Pant, M., Galli, M., Baehr-Jones, T. W., Hochberg, M. J., Englund, D., Bajoni, D., & Galland, C. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1409.8215 · Cited by 54
Quantum Error Correction and Fault Tolerant Quantum Computing
Grassl, M., & Rötteler, M. (2009) · Springer eBooks · doi:10.1007/978-0-387-30440-3_435 · Cited by 61
Resource theory of quantum scrambling
Garcia, R. J., Bu, K., & Jaffe, A. (2023) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2217031120 · Cited by 79
“We compute the OTOC magic for two examples of gates in the Clifford hierarchy (92).”
MethodOptimal Probabilistic Storage and Retrieval of Unitary Channels
Sedlák, M., Bisio, A., & Ziman, M. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.170502 · Cited by 83
Experimental certification for nonclassical teleportation
Hu, X., Zhang, C., Zhang, C., Liu, B., Huang, Y., Han, Y., Li, C., & Guo, G. (2019) · Quantum Engineering · doi:10.1002/que2.13 · Cited by 59
On Optimality of CSS Codes for Transversal T
Rengaswamy, N., Calderbank, R., Newman, M., & Pfister, H. D. (2020) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2020.3012914 · Cited by 91
“The [[6, 2, 2]] code is not just a corner case where the transversal T gate realizes the logical identity.”
BackgroundMethodInfluentialHigh-Rate and High-Fidelity Modular Interconnects between Neutral Atom Quantum Processors
Li, Y.-Y., & Thompson, J. D. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020363 · Cited by 73
“The basic building block of a modular computer is a Bell pair between physical qubits in two modules, which can be used as a resource to teleport quantum states or gates between the modules [7–10].”
BackgroundSwiadek, F., Shillito, R., Magnard, P., Remm, A., Hellings, C., Lacroix, N., Ficheux, Q., Zanuz, D. C., Norris, G. J., Blais, A., et al. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.040326 · Cited by 115
Quantum Computation by Local Measurement
Raussendorf, R., & Wei, T.-C. (2011) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-020911-125041 · Cited by 78
Universality of quantum computation with cluster states and (X, Y)-plane measurements
Mantri, A., Demarie, T. F., & Fitzsimons, J. F. (2017) · Scientific Reports · doi:10.1038/srep42861 · Cited by 65
“[13] Daniel Gottesman and Isaac L Chuang.”
Teleportation of general finite-dimensional quantum systems
Albeverio, S. A., & Fei, S.-M. (2000) · Physics Letters A · doi:10.1016/s0375-9601(00)00659-9 · Cited by 70
Multiparty quantum coin flipping
Ambainis, A., Buhrman, H., Dodis, Y., & Röhrig, H. (2004) · doi:10.1109/ccc.2004.19 · Cited by 56
Error rates and resource overheads of repetition cat qubits
Guillaud, J., & Mirrahimi, M. (2021) · Physical Review A · doi:10.1103/physreva.103.042413 · Cited by 55
Solid-State Circuit for Spin Entanglement Generation and Purification
Taylor, J. M., Dür, W., Zoller, P., Yacoby, A., Marcus, C. M., & Lukin, M. D. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.236803 · Cited by 59
Enhancing quantum teleportation efficacy with noiseless linear amplification
Zhao, J., Jeng, H., Conlon, L. O., Tserkis, S., Shajilal, B., Liu, K., Ralph, T. C., Assad, S. M., & Lam, P. K. (2023) · Nature Communications · doi:10.1038/s41467-023-40438-z · Cited by 68
“In Supplementary Note 2, we show that our protocol can be applied to purify non-classical input states such as single photon states and Schrödinger cat states.”
BackgroundInfluentialTime-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
Yamasaki, H., & Koashi, M. (2024) · Nature Physics · doi:10.1038/s41567-023-02325-8 · Cited by 131
Deutsch-Jozsa Algorithm Using Triggered Single Photons from a Single Quantum Dot
Scholz, M., Aichele, T., Ramelow, S., & Benson, O. J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.180501 · Cited by 59
Recursive quantum repeater networks
Meter, R. V., Touch, J. D., & HORSMAN, C. (2011) · Progress in Informatics · doi:10.2201/niipi.2011.8.8 · Cited by 71
“teleported gates to execute the circuit in a remote fashion [33].”
BackgroundMethodAn Algebraic Language for Distributed Quantum Computing
Ying, M., & Feng, Y. (2009) · IEEE Transactions on Computers · doi:10.1109/tc.2009.13 · Cited by 54
Multimode higher-order antibunching and squeezing in trio coherent states
An, N. B. (2002) · Journal of Optics B Quantum and Semiclassical Optics · doi:10.1088/1464-4266/4/3/310 · Cited by 59
Wei, T.-C., Affleck, I. K., & Raussendorf, R. (2012) · Physical Review A · doi:10.1103/physreva.86.032328 · Cited by 68
Experimental Quantum Networking Protocols via Four-Qubit Hyperentangled Dicke States
Chiuri, A., Greganti, C., Paternostro, M., Vallone, G., & Mataloni, P. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.173604 · Cited by 70
Tripartite Entanglement: Foundations and Applications
Cunha, M. M., Fonseca, A., & Silva, E. O. (2019) · Universe · doi:10.3390/universe5100209 · Cited by 71
“In [118], it was demonstrated that a GHZ state can be uses as an ingredient in the construction of a universal quantum computer.”
BackgroundIntegrated optical approach to trapped ion quantum computation
Kim, J., & Kim, C. (2009) · Quantum Information and Computation · doi:10.26421/qic9.3-4-1 · Cited by 52
“Once remote entanglement is generated, quantum logic operations can be performed by teleportation gates [28].”
BackgroundProtecting an optical qubit against photon loss
Wasilewski, W., & Banaszek, K. (2007) · Physical Review A · doi:10.1103/physreva.75.042316 · Cited by 65
Key ideas in quantum error correction
Raussendorf, R. (2012) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2011.0494 · Cited by 68
Multiparty quantum coin flipping
Ambainis, A., Buhrman, H., Dodis, Y., & Röhrig, H. (2004) · IEEE Conference on Computational Complexity (CCC) · doi:10.1109/ccc.2004.1313848 · Cited by 53
“Furthermore, we can even assume that the cheating action is done after the correction circuit of teleportation (this is similar to the teleportation of quantum gates [10]) and, hence, amounts to cheating on a pairwise quantum channel.”
BackgroundEntangled photon pair generation from an InP membrane micro-ring resonator
Kumar, R. R., Raevskaia, M., Pogoretskii, V., Jiao, Y., & Tsang, H. K. (2019) · Applied Physics Letters · doi:10.1063/1.5080397 · Cited by 52
Quantum NETwork: from theory to practice
Fang, K., Zhao, J., Li, X., Li, Y., & Duan, R. (2023) · Science China Information Sciences · doi:10.1007/s11432-023-3773-4 · Cited by 67
“Some frameworks for compiling distributed quantum programs have been recently proposed in [289–292], where non-local operations are replaced with local operations on shared entanglement [293, 294].”
BackgroundQuantum entanglement of four distant atoms trapped in different optical cavities
Zou, X., Pahlke, K., & Mathis, W. (2004) · Physical Review A · doi:10.1103/physreva.69.052314 · Cited by 54
Qudit-Teleportation for photons with linear optics
Goyal, S. K., Boukama-Dzoussi, P. E., Ghosh, S., Roux, F. S., & Konrad, T. (2014) · Scientific Reports · doi:10.1038/srep04543 · Cited by 50
Unifying Gate Synthesis and Magic State Distillation
Campbell, E. T., & Howard, M. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.060501 · Cited by 53
The controlled SWAP test for determining quantum entanglement
Foulds, S., Kendon, V. M., & Spiller, T. P. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abe458 · Cited by 73
Quantum Teleportation by Particle-Hole Annihilation in the Fermi Sea
Beenakker, C. W. J., & Kindermann, M. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.056801 · Cited by 66
Classical simulability, entanglement breaking, and quantum computation thresholds
Virmani, S., Huelga, S. F., & Plenio, M. B. (2005) · Physical Review A · doi:10.1103/physreva.71.042328 · Cited by 51
Barz, S. (2015) · Journal of Physics B: Atomic, Molecular and Optical Physics · doi:10.1088/0953-4075/48/8/083001 · Cited by 52
Hybrid architecture for encoded measurement-based quantum computation
Zwerger, M., Briegel, H. J., & Dür, W. (2014) · Scientific Reports · doi:10.1038/srep05364 · Cited by 53
Transport quantum logic gates for trapped ions
Leibfried, D., Knill, E., Ospelkaus, C., & Wineland, D. J. (2007) · Physical Review A · doi:10.1103/physreva.76.032324 · Cited by 54
Efficient Classical Simulation of Clifford Circuits with Nonstabilizer Input States
Bu, K., & Koh, D. E. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.170502 · Cited by 68
Quantum transport of high-dimensional spatial information with a nonlinear detector
Sephton, B., Vallés, A., Nape, I. M., Cox, M. A., Steinlechner, F., Konrad, T., Torres, J. P., Roux, F. S., & Forbes, A. (2023) · Nature Communications · doi:10.1038/s41467-023-43949-x · Cited by 59
Effects of noises on joint remote state preparation via a GHZ-class channel
Liang, H.-Q., Liu, J., Shang-Shen, F., Chen, J.-G., & Xu, X. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1078-x · Cited by 51
Disjointness of Stabilizer Codes and Limitations on Fault-Tolerant Logical Gates
Jochym-O’Connor, T., Kubica, A., & Yoder, T. J. (2018) · Physical Review X · doi:10.1103/physrevx.8.021047 · Cited by 48
“[18] Daniel Gottesman and Isaac L Chuang, “Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations,” Nature 402, 390 (1999).”
MethodCommunication Links for Distributed Quantum Computation
Van Meter, R., Nemoto, K., & Munro, W. (2007) · IEEE Transactions on Computers · doi:10.1109/tc.2007.70775 · Cited by 53
Pseudo-randomness and Learning in Quantum ComputationPreprint
Low, R. A. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1006.5227 · Cited by 100
T-Count Optimization and Reed–Muller Codes
Amy, M., & Mosca, M. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2906374 · Cited by 49
“, in Shor’s algorithm [7] and the Clifford hierarchy [30].”
MethodCatalysis in quantum information theory
Lipka-Bartosik, P., Wilming, H., & Ng, N. H. Y. (2024) · Reviews of Modern Physics · doi:10.1103/revmodphys.96.025005 · Cited by 100
Probabilistic exact universal quantum circuits for transforming unitary operations
Quintino, M. T., Dong, Q., Shimbo, A., Soeda, A., & Murao, M. (2019) · Physical Review A · doi:10.1103/physreva.100.062339 · Cited by 81
“5) and has applications in fault tolerant quantum computation [51].”
BackgroundScheme for atomic-state teleportation between two bad cavities
Zheng, S., & Guo, G. (2006) · Physical Review A · doi:10.1103/physreva.73.032329 · Cited by 49
Single-mode operation of a high-brightness narrow-band single-photon source
Scholz, M., Koch, L., Ullmann, R., & Benson, O. J. (2009) · Applied Physics Letters · doi:10.1063/1.3139768 · Cited by 51
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.