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 201–300 of 1,005
Circuit Knitting With Classical Communication
Piveteau, C., & Sutter, D. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3310797 · Cited by 110
Exploring Hilbert space: Accurate characterization of quantum information
White, A. G., James, D. F. V., Munro, W. J., & Kwiat, P. G. (2001) · Physical Review A · doi:10.1103/physreva.65.012301 · Cited by 120
Quantifying magic for multi-qubit operations
Seddon, J. R., & Campbell, E. T. (2019) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2019.0251 · Cited by 168
“More generally, the state update corresponding to any pure Choi state |ψl,j,kj 〉 can be modelled as a post-selected Bell measurement [53]:”
BackgroundYoder, T. J., & Kim, I. H. (2017) · Quantum · doi:10.22331/q-2017-04-25-2 · Cited by 98
“surgery techniques [23] supplemented with 1-bit teleportation [30] and, for non-Cliffords, magic-state injection and distillation [19].”
MethodQuantum control of bosonic modes with superconducting circuits
Ma, W.-L., Puri, S., Schoelkopf, R. J., Devoret, M., Girvin, S. M., & Jiang, L. (2021) · 中国科学通报:英文版 · doi:10.1016/j.scib.2021.05.024 · Cited by 164
“Theory: - SNAP gate [22] - Optimal control [23, 24] - E-SWAP gate [25] - CPHASE gate [26] Theory: - CPTP maps [27] - Teleported gate [28] - ET gate [29, 30] - PI gate [31] Theory: - Dissipative cat [32] - Kerr cat [33] - FT syndrome detection [34] - Bias-preserving Kerr cat [35] - Bias-preserving dissipative cat [36]…”
BackgroundCompact and reconfigurable silicon nitride time-bin entanglement circuit
Xiong, C., Zhang, X., Mahendra, A., He, J., Choi, D.-Y., Chae, C. J., Marpaung, D., Leinse, A., Heideman, R. G., Hoekman, M., et al. (2015) · Optica · doi:10.1364/optica.2.000724 · Cited by 116
“Entanglement is at the heart of photonic quantum technologies such as secure communication [1], super-resolution metrology [2], and powerful computation [3].”
BackgroundGeneration of an entangled four-photonWstate
Zou, X., Pahlke, K., & Mathis, W. (2002) · Physical Review A · doi:10.1103/physreva.66.044302 · Cited by 115
Quantum entanglement via two-qubit quantum Zeno dynamics
Wang, X., You, J. Q., & Nori, F. (2008) · Physical Review A · doi:10.1103/physreva.77.062339 · Cited by 117
Automated distribution of quantum circuits via hypergraph partitioning
Andrés-Martínez, P., & Heunen, C. (2019) · Physical Review A · doi:10.1103/physreva.100.032308 · Cited by 167
“We use an approach pioneered by Gottesman and Chuang [31] to implement multi-qubit gates across distant qubits using entangled mutipartite states and measurements.”
MethodRemote Information Concentration Using a Bound Entangled State
Murao, M., & Vedral, V. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.352 · Cited by 119
Designer Spin Pseudomolecule Implemented with Trapped Ions in a Magnetic Gradient
Khromova, A., Piltz, C., Scharfenberger, B., Gloger, T. F., Johanning, M., Varón, A. F., & Wunderlich, C. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.220502 · Cited by 117
Principles of Quantum Communication Theory: A Modern ApproachPreprint
Khatri, S., Lami, L., & Wilde, M. M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.04672 · Cited by 328
“Other papers that make use of the teleportation-simulation technique in this and other contexts include those by Horodecki et al. (1999); Gottesman and Chuang (1999); Zhou et al. (2000); Bowen and Bose (2001); Takeoka et al. (2002); Giedke and Ignacio Cirac (2002); Wolf et al. (2007); Niset et al.…”
MethodEnhancing teleportation of quantum Fisher information by partial measurements
Xiao, X. M., Yao, Y., Zhong, W.-J., Li, Y., & Xie, Y. (2016) · Physical Review A · doi:10.1103/physreva.93.012307 · Cited by 110
Qudit versions of the qubit π/8 gate
Howard, M., & Vala, J. (2012) · Physical Review A · doi:10.1103/physreva.86.022316 · Cited by 153
Probabilistic manipulation of entangled photons
Koashi, M., Yamamoto, T., & Imoto, N. (2001) · Physical Review A · doi:10.1103/physreva.63.030301 · Cited by 109
Quantum Algorithm for Spectral Measurement with a Lower Gate Count
Poulin, D., Kitaev, A., Steiger, D. S., Hastings, M. B., & Troyer, M. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.010501 · Cited by 108
“These gates share the property of belonging to the third-level of the Clifford hierarchy [31], so they can be distilled by standard methods and together with the Clifford gates they form a universal gate set.”
MethodContinuous Symmetries and Approximate Quantum Error Correction
Faist, P., Nezami, S., Albert, V. V., Salton, G., Pastawski, F., Hayden, P., & Preskill, J. (2020) · Physical Review X · doi:10.1103/physrevx.10.041018 · Cited by 107
Experimental realization of freely propagating teleported qubits
Pan, J.-W., Gasparoni, S., Aspelmeyer, M., Jennewein, T. D., & Zeilinger, A. (2003) · Nature · doi:10.1038/nature01412 · Cited by 119
Principles of Quantum Computation and Information - Volume I: Basic Concepts
Benenti, G., Casati, G., & Strini, G. (2004) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812794796 · Cited by 119
Scalable Measures of Magic Resource for Quantum Computers
Haug, T., & Kim, M. S. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.010301 · Cited by 104
Quantum structured light in high dimensions
Nape, I. M., Sephton, B., Ornelas, P., Moodley, C., & Forbes, A. (2023) · APL Photonics · doi:10.1063/5.0138224 · Cited by 113
Tokunaga, Y., Kuwashiro, S., Yamamoto, T., Koashi, M., & Imoto, N. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.210501 · Cited by 104
Generation and discrimination of a type of four-partite entangled state
Wang, X.-W., & Yang, G. (2008) · Physical Review A · doi:10.1103/physreva.78.024301 · Cited by 103
Conformal field theories are magical
White, C. D., Cao, C., & Swingle, B. (2021) · Physical Review B · doi:10.1103/physrevb.103.075145 · Cited by 93
Fault tolerance of quantum low-density parity check codes with sublinear distance scaling
Kovalev, A. A., & Pryadko, L. P. (2013) · Physical Review A · doi:10.1103/physreva.87.020304 · Cited by 107
Gapped boundaries, group cohomology and fault-tolerant logical gates
Yoshida, B. (2016) · Annals of Physics · doi:10.1016/j.aop.2016.12.014 · Cited by 132
Optimized Entanglement Purification
Krastanov, S., Albert, V. V., & Jiang, L. (2019) · Quantum · doi:10.22331/q-2019-02-18-123 · Cited by 137
“[3] Daniel Gottesman and Isaac L Chuang.”
BackgroundEfficiently Computable Bounds for Magic State Distillation
Wang, X., Wilde, M. M., & Su, Y. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.090505 · Cited by 162
Fermionic Bell-State Analyzer for Spin Qubits
Engel, H., & Loss, D. (2005) · Science · doi:10.1126/science.1113203 · Cited by 113
Hardness of Classically Simulating the One-Clean-Qubit Model
Morimae, T., Fujii, K., & Fitzsimons, J. F. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.130502 · Cited by 70
Fault-tolerant logical gates in quantum error-correcting codes
Pastawski, F., & Yoshida, B. (2015) · Physical Review A · doi:10.1103/physreva.91.012305 · Cited by 102
Quantum teleportation scheme by selecting one of multiple output ports
Ishizaka, S., & Hiroshima, T. (2009) · Physical Review A · doi:10.1103/physreva.79.042306 · Cited by 118
Brown, K. R., Clark, R. J., & Chuang, I. L. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.050504 · Cited by 98
Self-citationDeterministic implementation of weak quantum cubic nonlinearity
Marek, P., Filip, R., & Furusawa, A. (2011) · Physical Review A · doi:10.1103/physreva.84.053802 · Cited by 99
Fundamentals of universality in one-way quantum computation
Nest, M. V. D., Dür, W., Miyake, A., & Briegel, H. J. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/204 · Cited by 97
Experimental procedures for entanglement verification
van Enk, S. J., Lütkenhaus, N., & Kimble, H. J. (2007) · Physical Review A · doi:10.1103/physreva.75.052318 · Cited by 100
Demonstration of deterministic and high fidelity squeezing of quantum information
Yoshikawa, J.-I., Hayashi, T., Akiyama, T., Takei, N., Huck, A., Andersen, U. L., & Furusawa, A. (2007) · Physical Review A · doi:10.1103/physreva.76.060301 · Cited by 98
Takeda, S., & Furusawa, A. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.120504 · Cited by 120
Atom-Atom Entanglement by Single-Photon Detection
Slodička, L., Hétet, G., Röck, N., Schindler, P., Hennrich, M., & Blatt, R. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.083603 · Cited by 96
Quantum Homomorphic Encryption for Polynomial-Sized Circuits
Dulek, Y., Schaffner, C., & Speelman, F. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-53015-3_1 · Cited by 126
Universal Fault-Tolerant Gates on Concatenated Stabilizer Codes
Yoder, T. J., Takagi, R., & Chuang, I. L. (2016) · Physical Review X · doi:10.1103/physrevx.6.031039 · Cited by 73
Self-citationNo-Go Theorems for Quantum Resource Purification
Fang, K., & Liu, Z.-W. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.060405 · Cited by 127
“A standard approach is to distill high-quality magic state jTi 1⁄4 ðj0i þ eiπ=4j1iÞ= ffiffiffi 2 p from sufficiently manynoisymagic states off-line and then use an approximate jTi state to emulate each low-error logicalT gate in the circuit via a technique called state injection or gadgetization [60].”
MethodPreparation of Matrix Product States with Log-Depth Quantum Circuits
Malz, D., Styliaris, G., Wei, Z.-Y., & Cirac, J. I. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.040404 · Cited by 210
“— Local measurements and conditional local unitaries are the standard framework to perform quantum teleportation [56,57], which can be used to reduce the depth of the tree-RG circuit.”
BackgroundBroadbent, A., Gutoski, G., & Stebila, D. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-40084-1_20 · Cited by 126
Quantum information processing and metrology with trapped ions
Wineland, D. J., & Leibfried, D. G. (2011) · Laser Physics Letters · doi:10.1002/lapl.201010125 · Cited by 118
Universal Quantum Computation in Decoherence-Free Subspace with Neutral Atoms
Xue, P., & Xiao, Y. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.140501 · Cited by 101
Foundations for Near-Term Quantum Natural Language ProcessingPreprint
Coecke, B., de Felice, G., Meichanetzidis, K., & Toumi, A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.03755 · Cited by 168
“Quantum computationally, this particular scheme is known as logic-gate teleportation [56, 30].”
BackgroundOkamoto, R., O’Brien, J. L., Hofmann, H. F., & Takeuchi, S. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1018839108 · Cited by 92
“The KLM ‘recipe’ consists of two parts: an optical circuit for a CNOT gate using linear optics, single photon sources [11], and photon number resolving detectors [12]; and a scheme [13, 14] for increasing the success probability of this CNOT gate (P = 1/16) arbitrarily close to unity, where the probabilistic CNOT gate…”
MethodArchitectural implications of quantum computing technologies
Meter, R. V., & Oskin, M. (2006) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/1126257.1126259 · Cited by 96
“…quantum effects, such as quantum cryptography [Bennett and Brassard 1984; Elliott et al. 2003] and basic demonstrations of quantum teleportation [Bennett et al. 1993; Furusawa et al. 1998] (though teleportation may be used in quantum computer architectures [Gottesman and Chuang 1999; Grover 1997]).”
BackgroundExperimental Demonstration of Quantum Teleportation of Broadband Squeezing
Yonezawa, H., Braunstein, S. L., & Furusawa, A. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.110503 · Cited by 95
Okamoto, R., O'Brien, J. L., Hofmann, H. F., & Takeuchi, S. (2010) · arXiv · doi:10.48550/arxiv.1006.4743 · Cited by 92
“The KLM ‘recipe’ consists of two parts: an optical circuit for a CNOT gate using linear optics, single photon sources [11], and photon number resolving detectors [12]; and a scheme [13, 14] for increasing the success probability of this CNOT gate (P = 1/16) arbitrarily close to unity, where the probabilistic CNOT gate…”
MethodCampbell, E. T., & Howard, M. (2017) · Physical Review A · doi:10.1103/physreva.95.022316 · Cited by 91
Toward a scalable, silicon-based quantum computing architecture
Copsey, D., Oskin, M., Impens, F., Metodiev, T., Cross, A., Chong, F. T., Chuang, I. L., & Kubiatowicz, J. (2003) · IEEE Journal of Selected Topics in Quantum Electronics · doi:10.1109/jstqe.2003.820922 · Cited by 92
“approaches, using different fault-tolerant schemes (such as nonrecursive constructions), or quantum resource assisted fault tolerance [ 59 ], may lead to modifications of this bound.”
MethodSelf-citationMeasurement-only topological quantum computation via anyonic interferometry
Bonderson, P., Freedman, M. H., & Nayak, C. (2008) · Annals of Physics · doi:10.1016/j.aop.2008.09.009 · Cited by 121
Nambu, Y., Usami, K., Tsuda, Y., Matsumoto, K., & Nakamura, K. (2002) · Physical Review A · doi:10.1103/physreva.66.033816 · Cited by 93
Ricci, M., Sciarrino, F., Sias, C., & De Martini, F. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.047901 · Cited by 90
Generation of Maximally Entangled Long-Lived States with Giant Atoms in a Waveguide
Santos, A. C., & Bachelard, R. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.053601 · Cited by 107
Ultrafast Long-Distance Quantum Communication with Static Linear Optics
Ewert, F., Bergmann, M., & van Loock, P. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.210501 · Cited by 89
Yang–Baxter integrable models in experiments: from condensed matter to ultracold atoms
Batchelor, M. T., & Foerster, A. (2016) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/49/17/173001 · Cited by 93
Flexible resources for quantum metrology
Friis, N., Orsucci, D., Skotiniotis, M., Sekatski, P., Dunjko, V., Briegel, H. J., & Dür, W. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa7144 · Cited by 91
Hierarchy of universal entanglement in 2D measurement-based quantum computation
Miller, J., & Miyake, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.36 · Cited by 112
A survey on the complexity of learning quantum states
Anshu, A., & Arunachalam, S. (2023) · Nature Reviews Physics · doi:10.1038/s42254-023-00662-4 · Cited by 215
An introduction to quantum information processing: applications and realizations
Spiller, T. P., Munro, W. J., Barrett, S. D., & Kok, P. (2005) · Contemporary Physics · doi:10.1080/00107510500293261 · Cited by 90
Tools for quantum network design
Azuma, K., Bäuml, S., Coopmans, T. J., Elkouss, D., & Li, B. (2021) · AVS Quantum Science · doi:10.1116/5.0024062 · Cited by 110
Measurement-induced nonlinearity in linear optics
Scheel, S., Nemoto, K., Munro, W. J., & Knight, P. L. (2003) · Physical Review A · doi:10.1103/physreva.68.032310 · Cited by 79
Harrow, A. W. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0512255 · Cited by 211
Hamiltonian simulation with optimal sample complexity
Kimmel, S., Lin, C. Y.-Y., Low, G. H., Ozols, M., & Yoder, T. J. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0013-7 · Cited by 85
Integrated Source of Spectrally Filtered Correlated Photons for Large-Scale Quantum Photonic Systems
Grassani, D., Simbula, A., Pant, M., Galli, M., Baehr-Jones, T. W., Hochberg, M. J., Bajoni, D., Galland, C., Harris, N. C., & Englund, D. R. (2014) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 85
Baur, M., Fedorov, A., Steffen, L., Filipp, S., Silva, M. P. D., & Wallraff, A. J. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.040502 · Cited by 106
Optimal Blind Quantum Computation
Mantri, A., Pérez-Delgado, C. A., & Fitzsimons, J. F. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.230502 · Cited by 116
Entangling Many Atomic Ensembles through Laser Manipulation
Duan, L.-M. (2002) · Physical Review Letters · doi:10.1103/physrevlett.88.170402 · Cited by 87
Entangling power and operator entanglement in qudit systems
Wang, X., Sanders, B. C., & Berry, D. W. (2003) · Physical Review A · doi:10.1103/physreva.67.042323 · Cited by 85
Universal Limitations on Quantum Key Distribution over a Network
Das, S., Bäuml, S., Winczewski, M., & Horodecki, K. (2021) · Physical Review X · doi:10.1103/physrevx.11.041016 · Cited by 123
Error-Detected State Transfer and Entanglement in a Superconducting Quantum Network
Burkhart, L., Teoh, J. D., Zhang, Y., Axline, C. J., Frunzio, L., Devoret, M., Jiang, L., Girvin, S. M., & Schoelkopf, R. J. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030321 · Cited by 92
“The high-fidelity entanglement protocols enable efficient distillation and faithful teleported operations over the network [1,3].”
BackgroundDevelopment of Quantum Interconnects (QuICs) for Next-Generation Information Technologies
Awschalom, D., Berggren, K. K., Bernien, H., Bhave, S. A., Carr, L. D., Davids, P., Economou, S. E., Englund, D., Faraon, A., Fejer, M. M., et al. (2021) · DSpace@MIT (Massachusetts Institute of Technology) · doi:10.6082/33e5f-d1j97 · Cited by 70
Computer-Inspired Concept for High-Dimensional Multipartite Quantum Gates
Gao, X., Erhard, M., Zeilinger, A., & Krenn, M. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.050501 · Cited by 91
“Interestingly, the concept of encoding transformations in ancillary states is reminiscent of the first work on linear optics quantum computing by Knill, Laflamme, and Milburn [14] and by Gottesman and Chuang [19].”
ResultAll Entangled States can Demonstrate Nonclassical Teleportation
Cavalcanti, D., Skrzypczyk, P., & Šupić, I. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.110501 · Cited by 94
Universal Quantum Computing with Twist-Free and Temporally Encoded Lattice Surgery
Chamberland, C., & Campbell, E. T. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010331 · Cited by 80
“These approaches all perform non-Clifford gates by teleportation [13, 14] of magic states prepared by some distillation procedure [15–21].”
MethodQuintino, M. T., Dong, Q., Shimbo, A., Soeda, A., & Murao, M. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.210502 · Cited by 128
“We then exploit the gate teleportation scheme [18, 19], a protocol that “teleports” the action of some unitary operation, which in our case would be UT 2 on I⊗UT 2 |φ2〉, to the input-qubit.”
MethodHigh-fidelity continuous-variable quantum teleportation toward multistep quantum operations
Yukawa, M., Benichi, H., & Furusawa, A. (2008) · Physical Review A · doi:10.1103/physreva.77.022314 · Cited by 75
Shortcut to adiabatic gate teleportation
Santos, A. C., Silva, R. D., & Sarandy, M. S. (2016) · Physical Review A · doi:10.1103/physreva.93.012311 · Cited by 80
Ralph, T. C., & Pryde, G. J. (2009) · Progress in optics · doi:10.1016/s0079-6638(10)05409-0 · Cited by 98
Experimental Nonlinear Sign Shift for Linear Optics Quantum Computation
Sanaka, K., Jennewein, T., Pan, J.-W., Resch, K., & Zeilinger, A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.017902 · Cited by 78
Actively Secure Two-Party Evaluation of Any Quantum Operation
Dupuis, F., Nielsen, J. B., & Salvail, L. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32009-5_46 · Cited by 98
“This subprotocol performs the R-gate using gate teleportation[9,8] via the magic state is very similar to the fault-tolerant version of the R-gate introduced in [7,14].”
MethodFault-tolerant quantum computation for local leakage faults
Aliferis, P., & Terhal, B. M. (2007) · Quantum Information and Computation · doi:10.26421/qic7.1-2-9 · Cited by 46
Continuous-variable gate teleportation and bosonic-code error correction
Walshe, B. W., Baragiola, B. Q., Alexander, R. N., & Menicucci, N. C. (2020) · Physical Review A · doi:10.1103/physreva.102.062411 · Cited by 83
Classical algorithms for quantum mean values
Bravyi, S., Gosset, D., & Movassagh, R. (2021) · Nature Physics · doi:10.1038/s41567-020-01109-8 · Cited by 56
“For example, it can be easily shown that the mean value problem admits a polynomial time classical algorithm for Pauli-type observables and quantum circuits that belong to the 3rd level of the Clifford hierarchy [30].”
BackgroundComputation by measurements: A unifying picture
Aliferis, P., & Leung, D. W. (2004) · Physical Review A · doi:10.1103/physreva.70.062314 · Cited by 75
Bell-state measurement exceeding 50% success probability with linear optics
Bayerbach, M. J., D’Aurelio, S. E., van Loock, P., & Barz, S. (2023) · Science Advances · doi:10.1126/sciadv.adf4080 · Cited by 110
Optimal approach to quantum communication using dynamic programming
Jiang, L., Taylor, J. M., Khaneja, N., & Lukin, M. D. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0703284104 · Cited by 90
Introduction to Quantum Error CorrectionPreprint
Knill, E. H., Laflamme, R., Ashikhmin, A., Barnum, H., Viola, L., & Zurek, W. H. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0207170 · Cited by 103
“In addition, there are many tricks based on teleportation that can be used to maintain the syndrome subsystems in acceptably low-error states and to implement general operations systematically [33].”
Teleportation of entangled states without Bell-state measurement
Cardoso, W. B., Avelar, A. T., Baseia, B., & de Almeida, N. G. (2005) · Physical Review A · doi:10.1103/physreva.72.045802 · Cited by 73
Skrøvseth, S. O., & Bartlett, S. D. (2009) · Physical Review A · doi:10.1103/physreva.80.022316 · Cited by 77
How to Verify a Quantum Computation
Broadbent, A. (2018) · Theory of Computing · doi:10.4086/toc.2018.v014a011 · Cited by 106
“Indeed, one can view our protocol as performing a very basic type of quantum computing on authenticated data [16]; with hidden gates being executed via a computation-by-teleportation process [33] that is reminiscent of measurement-based quantum computation, and thus of blind quantum computation [15].”
BackgroundExperimental demonstration of a Hadamard gate for coherent state qubits
Tipsmark, A., Dong, R., Laghaout, A., Marek, P., Ježek, M., & Andersen, U. L. (2011) · Physical Review A · doi:10.1103/physreva.84.050301 · Cited by 77
Constructing qubits in physical systems
Viola, L., Knill, E. H., & Laflamme, R. (2001) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/34/35/331 · Cited by 96
Hertz-rate metropolitan quantum teleportation
Shen, S. Q., Yuan, C., Zhang, Z., Yu, H., Zhang, R., Yang, C., Li, H., Wang, Z., Wang, Y., Deng, G., et al. (2023) · Light Science & Applications · doi:10.1038/s41377-023-01158-7 · Cited by 96
Measuring nonstabilizerness via multifractal flatness
Turkeshi, X., Schirò, M., & Sierant, P. (2023) · Physical Review A · doi:10.1103/physreva.108.042408 · Cited by 99
Quantum homomorphic encryption from quantum codes
Ouyang, Y., Tan, S.-H., & Fitzsimons, J. F. (2018) · Physical Review A · doi:10.1103/physreva.98.042334 · Cited by 85
“When Vi is a unitary operation that applies the k-th non-Clifford gate T = |0〉〈0| + eiπ/4|1〉〈1| on the x-th qubit, the evaluator has to perform gate teleportation [48, 49].”
BackgroundQuantum teleportation via a two-qubit HeisenbergXYchain—effects of anisotropy and magnetic field
Yeo, Y., Liu, T., Lu, Y.-E., & Yang, Q.-Z. (2005) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/38/14/012 · Cited by 75
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.