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
Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.865 · Cited by 10,118
Kimble, H. J. (2008) · Nature · doi:10.1038/nature07127 · Cited by 6,023
“With relatively modest processing capabilities, one could even envision a ‘quantum internet’ that could accomplish tasks that are otherwise impossible within the realm of classical physics, including the distribution of ‘quantum software’ [8, 9].”
BackgroundA scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880
“The result is based on using entangled states prepared non-deterministically and quantum teleportatio”
MethodRaussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Linear optical quantum computing with photonic qubits
Kok, P., Munro, W. J., Nemoto, K., Ralph, T. C., Dowling, J. P., & Milburn, G. J. (2007) · Reviews of Modern Physics · doi:10.1103/revmodphys.79.135 · Cited by 2,904
“In 1999, Gottesman and Chuang proposed a trick that removes the probabilistic gate from the quantum circuit, and places it in the resources that can be prepared offline (Gottesman and Chuang 1999).”
BackgroundGühne, O., & Tóth, G. (2009) · Physics Reports · doi:10.1016/j.physrep.2009.02.004 · Cited by 2,401
“These include entanglement enhanced spectroscopy and quantum metrology [198,199], quantum secret sharing [200], open destination teleportation [201], quantum computation [202] and cryptographic protocols [203,204].”
O'Brien, J. L., Furusawa, A., & Vučković, J. (2009) · Nature Photonics · doi:10.1038/nphoton.2009.229 · Cited by 2,388
“The idea is to teleport the control and target qubits onto the output of a non-deterministic gate only after the successful detection event has indicated that the gate has succeede”
BackgroundMeasurement-based quantum computation on cluster states
Raussendorf, R., Browne, D. E., & Briegel, H. J. (2003) · Physical Review A · doi:10.1103/physreva.68.022312 · Cited by 1,655
“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.”
MethodIntegrated photonic quantum technologies
Wang, J., Sciarrino, F., Laing, A., & Thompson, M. G. (2020) · Nature Photonics · doi:10.1038/s41566-019-0532-1 · Cited by 1,576
Encoding a qubit in an oscillator
Gottesman, D., Kitaev, A., & Preskill, J. (2001) · Physical Review A · doi:10.1103/physreva.64.012310 · Cited by 1,532
Self-citationUniversal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525
Improved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515
“end ofthe computation? It is known that, if we allowclassicalpostprocessing and control of future quantum operations conditioned on measurement results, then universal quantum computation is possible [27, 13]. However, if all measurements are delayed until the end of the computation, then the quantum part of such a ci…”
BackgroundInfluentialSelf-citationTrapped-ion quantum computing: Progress and challenges
Bruzewicz, C. D., Chiaverini, J., McConnell, R., & Sage, J. M. (2019) · Applied Physics Reviews · doi:10.1063/1.5088164 · Cited by 1,483
Multiphoton entanglement and interferometry
Pan, J.-W., Chen, Z.-B., Lu, C.-Y., Weinfurter, H., Zeilinger, A., & Żukowski, M. (2012) · Reviews of Modern Physics · doi:10.1103/revmodphys.84.777 · Cited by 1,410
“Quantum teleportation is indeed not only a critical ingredient for quantum computation (Gottesman and Chuang, 1999; Knill, Laflamme, and Milburn, 2001) and communication, its experimental realization allows new studies of the fundamentals of quantum theory.”
BackgroundQuantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
“Such gates in C ð 3 Þ [and similarly gates in C ð j Þ for j > 3 ] can be realized with ancillas and Clifford group gates using quantum teleportation ideas (Gottesman and Chuang, 1999; Zhou, Leung, and Chuang, 2000).”
Quantum register based on individual electronic and nuclear spin qubits in diamond
Dutt, M. V. G., Childress, L., Jiang, L., Togan, E., Maze, J., Jelezko, F., Zibrov, A. S., Hemmer, P. R., & Lukin, M. D. (2007) · Science · doi:10.1126/science.1139831 · Cited by 1,287
Chitambar, E., & Gour, G. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.025001 · Cited by 1,276
“In fact, this technique is universal in that any non-stabilizer operation can be implemented in such a way, provided the non-stabilizer state consumed belongs to the class of socalled magic states (Bravyi and Kitaev, 2005; Gottesman and Chuang, 1999; Knill, 2005).”
BackgroundExperimental one-way quantum computing
Walther, P., Resch, K. J., Rudolph, T., Schenck, E., Weinfurter, H., Vedral, V., Aspelmeyer, M., & Zeilinger, A. (2005) · Nature · doi:10.1038/nature03347 · Cited by 1,273
O'Brien, J. L. (2007) · Science · doi:10.1126/science.1142892 · Cited by 1,221
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
“The principle is as explained in [18] for unitary gates, but generalized to measurements.”
BackgroundQuantum computing with trapped ions
HAFFNER, H., ROOS, C., & BLATT, R. (2008) · Physics Reports · doi:10.1016/j.physrep.2008.09.003 · Cited by 1,154
“…quantum computing, entanglement purification can alleviate thus the stringent requirements for quantum communication (Bennett et al., 1996; Gottesman and Chuang, 1999): first many entangled states of a relatively moderate fidelity are created and shared between the two communicating…”
BackgroundInfluentialMeasurement-based quantum computation
Briegel, H. J., Browne, D. E., Dür, W., Raussendorf, R., & Van den Nest, M. (2009) · Nature Physics · doi:10.1038/nphys1157 · Cited by 1,090
Demonstration of an all-optical quantum controlled-NOT gate
O'Brien, J. L., Pryde, G. J., White, A. G., Ralph, T. C., & Branning, D. (2003) · Nature · doi:10.1038/nature02054 · Cited by 992
“This gate can be made efficiently deterministic (scalable) by a teleportation protocol 12 .”
Cavity-based quantum networks with single atoms and optical photons
Reiserer, A., & Rempe, G. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.1379 · Cited by 1,000
Deterministic quantum teleportation of atomic qubits
Barrett, M. D., Chiaverini, J., Schaetz, T., Britton, J., Itano, W. M., Jost, J. D., Knill, E., Langer, C., Leibfried, D., Ozeri, R., et al. (2004) · Nature · doi:10.1038/nature02608 · Cited by 975
Ground-to-satellite quantum teleportation
Ren, J.-G., Xu, P., Yong, H.-L., Zhang, L., Liao, S.-K., Yin, J., Liu, W.-Y., Cai, W.-Q., Yang, M., Li, L., et al. (2017) · Nature · doi:10.1038/nature23675 · Cited by 848
Deterministic quantum teleportation with atoms
Riebe, M., Häffner, H., Roos, C. F., Hänsel, W., Benhelm, J., Lancaster, G. P. T., Körber, T. W., Becher, C., Schmidt-Kaler, F., James, D. F. V., et al. (2004) · Nature · doi:10.1038/nature02570 · Cited by 925
“; besides being a compelling benchmark algorithm for a three-qubit quantum computer, teleportation is a possible primitive for large-scale device”
BackgroundQuantum teleportation between light and matter
Sherson, J. F., Krauter, H., Olsson, R. K., Julsgaard, B., Hammerer, K., Cirac, I., & Polzik, E. S. (2006) · Nature · doi:10.1038/nature05136 · Cited by 863
“Using equations (1) and (3) and the input–output beamsplitter relations(12), we can link the measurement of the verifying pulse on the S2detector to the atomic mean values: y ver c 1⁄4 k 2 P tele A 1⁄4 gPk 2 Q, y s 1⁄4 k 2 X tele A 1⁄4 gXk 2 Y.”
BackgroundLounis, B., & Orrit, M. (2005) · Reports on Progress in Physics · doi:10.1088/0034-4885/68/5/r04 · Cited by 908
“Gottesman and Chuang (1999) have proposed a gate operation based on teleportation which can solve this difficulty.”
BackgroundCreation of a six-atom ‘Schrödinger cat’ state
Leibfried, D., Knill, E., Seidelin, S., Britton, J., Blakestad, R. B., Chiaverini, J., Hume, D. B., Itano, W. M., Jost, J. D., Langer, C., et al. (2005) · Nature · doi:10.1038/nature04251 · Cited by 805
Advances in quantum teleportation
Pirandola, S., Eisert, J., Weedbrook, C., Furusawa, A., & Braunstein, S. L. (2015) · Nature Photonics · doi:10.1038/nphoton.2015.154 · Cited by 894
Quantum Algorithms for Quantum Chemistry and Quantum Materials Science
Bauer, B., Bravyi, S., Motta, M., & Chan, G. K.-L. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.9b00829 · Cited by 848
Controlled collisions for multi-particle entanglement of optically trapped atoms
Mandel, O., Greiner, M., Widera, A., Rom, T., Hänsch, T. W., & Bloch, I. (2003) · Nature · doi:10.1038/nature02008 · Cited by 789
Scaling the Ion Trap Quantum Processor
Monroe, C., & Kim, J. (2013) · Science · doi:10.1126/science.1231298 · Cited by 786
Quantum error correction for beginners
Devitt, S. J., Munro, W. J., & Nemoto, K. (2013) · Reports on Progress in Physics · doi:10.1088/0034-4885/76/7/076001 · Cited by 759
Photonic quantum information processing: a review
Flamini, F., Spagnolo, N., & Sciarrino, F. (2019) · Reports on Progress in Physics · doi:10.1088/1361-6633/aad5b2 · Cited by 770
Quantum teleportation of multiple degrees of freedom of a single photon
Wang, X.-L., Cai, X.-D., Su, Z.-E., Chen, M.-C., Wu, D., Li, L., Liu, N.-L., Lu, C.-Y., & Pan, J.-W. (2015) · Nature · doi:10.1038/nature14246 · Cited by 761
“(4) With an equal probability of 1/16, photons 1 and 2 can also be projected onto one of the other 15 hyper-entangled Bell states (Methods).”
BackgroundLarge-scale modular quantum-computer architecture with atomic memory and photonic interconnects
Monroe, C., Raussendorf, R., Ruthven, A., Brown, K. R., Maunz, P., Duan, L.-M., & Kim, J. (2014) · Physical Review A · doi:10.1103/physreva.89.022317 · Cited by 700
Quantum computation with optical coherent states
Ralph, T. C., Gilchrist, A., Milburn, G. J., Munro, W. J., & Glancy, S. (2003) · Physical Review A · doi:10.1103/physreva.68.042319 · Cited by 713
Photonic quantum information processing: a concise review
Slussarenko, S., & Pryde, G. J. (2019) · Applied Physics Reviews · doi:10.1063/1.5115814 · Cited by 644
“39,40 –333 Creating verified communication links capable of sharing and transmitting entanglement is essential for networking quantum computers, and also quantum secure communication, small communication-based processing tasks (quantum communication complexity 334,335 ), and quantum networks for…”
BackgroundTheory of quantum secret sharing
Gottesman, D. (2000) · Physical Review A · doi:10.1103/physreva.61.042311 · Cited by 618
Self-citationOptical Quantum Computation Using Cluster States
Nielsen, M. A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040503 · Cited by 614
Experimental demonstration of five-photon entanglement and open-destination teleportation
Zhao, Z., Chen, Y.-A., Zhang, A.-N., Yang, T., Briegel, H. J., & Pan, J.-W. (2004) · Nature · doi:10.1038/nature02643 · Cited by 602
“Another key process in distributed quantum information processin”
BackgroundA categorical semantics of quantum protocols
Abramsky, S., & Coecke, B. (2004) · Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004. · doi:10.1109/lics.2004.1319636 · Cited by 541
All-photonic quantum repeaters
Azuma, K., Tamaki, K., & Lo, H.-K. (2015) · Nature Communications · doi:10.1038/ncomms7787 · Cited by 583
Quantum repeaters: From quantum networks to the quantum internet
Azuma, K., Economou, S. E., Elkouss, D., Hilaire, P., Jiang, L., Lo, H.-K., & Tzitrin, I. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045006 · Cited by 559
Characterization of Gaussian operations and distillation of Gaussian states
Giedke, G., & Ignacio Cirac, J. (2002) · Physical Review A · doi:10.1103/physreva.66.032316 · Cited by 569
Quantum Teleportation Between Distant Matter Qubits
Olmschenk, S., Matsukevich, D. N., Maunz, P., Hayes, D., Duan, L.-M., & Monroe, C. (2009) · Science · doi:10.1126/science.1167209 · Cited by 458
“In addition, the ability to teleport quantum information is an essential ingredient for the long-distance quantum communication afforded by quantum repeaters [28] and may be a vital component to quantum computation [148].”
BackgroundLong-distance teleportation of qubits at telecommunication wavelengths
Marcikic, I., de Riedmatten, H., Tittel, W., Zbinden, H., & Gisin, N. (2003) · Nature · doi:10.1038/nature01376 · Cited by 528
Fault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513
Experimental entanglement purification of arbitrary unknown states
Pan, J.-W., Gasparoni, S., Ursin, R., Weihs, G., & Zeilinger, A. (2003) · Nature · doi:10.1038/nature01623 · Cited by 512
The resource theory of stabilizer quantum computation
Veitch, V., Hamed Mousavian, S. A., Gottesman, D., & Emerson, J. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/1/013009 · Cited by 501
“A celebrated scheme for overcoming this limitation is the magic state model of quantum computation [19, 42] where the additional resource is a set of ancilla systems prepared in some (generally noisy) non-stabilizer quantum state.”
MethodSelf-citationQudits and High-Dimensional Quantum Computing
Wang, Y., Hu, Z., Sanders, B. C., & Kais, S. (2020) · Frontiers in Physics · doi:10.3389/fphy.2020.589504 · Cited by 478
“(44) The π/8 gate, with its close relation to the Clifford group, has many applications and utilities in teleportation-based UQC [66]; transversal implementation [50, 162]; learning an unknown gate [105]; or securing assisted quantum computation [28].”
MethodInfluentialOptimal architectures for long distance quantum communication
Muralidharan, S., Li, L., Kim, J., Lütkenhaus, N., Lukin, M. D., & Jiang, L. (2016) · Scientific Reports · doi:10.1038/srep20463 · Cited by 440
“Then, an encoded Bell pair between adjacent stations can be created using teleportation-based non-local CNOT gates 19,20 applied to each physical qubit in the encoded block using the entangled pairs generated through HEG process.”
MethodDemonstration of Blind Quantum Computing
Barz, S., Kashefi, E., Broadbent, A., Fitzsimons, J. F., Zeilinger, A., & Walther, P. (2012) · Science · doi:10.1126/science.1214707 · Cited by 475
Quantum scissors: Teleportation of single-mode optical states by means of a nonlocal single photon
Babichev, S. A., Ries, J., & Lvovsky, A. I. (2003) · Europhysics Letters (EPL) · doi:10.1209/epl/i2003-00504-y · Cited by 450
Direct Fidelity Estimation from Few Pauli Measurements
Flammia, S. T., & Liu, Y.-K. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.230501 · Cited by 449
Probabilistic quantum logic operations using polarizing beam splitters
Pittman, T. B., Jacobs, B. C., & Franson, J. D. (2001) · Physical Review A · doi:10.1103/physreva.64.062311 · Cited by 434
Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning
Coecke, B., & Kissinger, A. (2017) · Cambridge University Press eBooks · doi:10.1017/9781316219317 · Cited by 413
Taylor, J. M., Engel, H.-A., Dür, W., Yacoby, A., Marcus, C. M., Zoller, P., & Lukin, M. D. (2005) · Nature Physics · doi:10.1038/nphys174 · Cited by 433
“Finally, for scalable architectures, teleportation-based gates may be use”
MethodA Categorical Semantics of Quantum Protocols
Abramsky, S., & Coecke, B. (2004) · CERN Document Server (European Organization for Nuclear Research) · Cited by 410
Quantum accuracy threshold for concatenated distance-3 code
Aliferis, P., Gottesman, D., & Preskill, J. (2006) · Quantum Information and Computation · doi:10.26421/qic6.2-1 · Cited by 412
Self-citationFusion-based quantum computation
Bartolucci, S., Birchall, P., Bombín, H., Cable, H., Dawson, C., Gimeno-Segovia, M., Johnston, E., Kieling, K., Nickerson, N., Pant, M., et al. (2023) · Nature Communications · doi:10.1038/s41467-023-36493-1 · Cited by 371
Efficient quantum computation using coherent states
Jeong, H., & Kim, M. S. (2002) · Physical Review A · doi:10.1103/physreva.65.042305 · Cited by 398
Spatial correlations in parametric down-conversion
Walborn, S. P., Monken, C. H., Pádua, S., & Souto Ribeiro, P. H. (2010) · Physics Reports · doi:10.1016/j.physrep.2010.06.003 · Cited by 399
Development of quantum interconnects (QuICs) for next-generation information technologies
Awschalom, D., Berggren, K. K., Bernien, H., Bhave, S., Carr, L. D., Davids, P., Economou, S. E., Englund, D., Faraon, A., Fejer, M., et al. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.017002 · Cited by 392
Application of a Resource Theory for Magic States to Fault-Tolerant Quantum Computing
Howard, M., & Campbell, E. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.090501 · Cited by 387
Quantum coherence and entanglement with ultracold atoms in optical lattices
Bloch, I. (2008) · Nature · doi:10.1038/nature07126 · Cited by 381
Classical command of quantum systems
Reichardt, B. W., Unger, F., & Vazirani, U. (2013) · Nature · doi:10.1038/nature12035 · Cited by 294
High-speed linear optics quantum computing using active feed-forward
Prevedel, R., Walther, P., Tiefenbacher, F., Böhi, P., Kaltenbaek, R., Jennewein, T., & Zeilinger, A. (2007) · Nature · doi:10.1038/nature05346 · Cited by 373
“Outcome measured (red) and ideal (grey) Linear(3) cluster”
BackgroundInfluentialOverhead and noise threshold of fault-tolerant quantum error correction
Steane, A. M. (2003) · Physical Review A · doi:10.1103/physreva.68.042322 · Cited by 372
Self-testing of quantum systems: a review
Šupić, I., & Bowles, J. (2020) · Quantum · doi:10.22331/q-2020-09-30-337 · Cited by 365
Quantum teleportation across the Danube
Ursin, R., Jennewein, T., Aspelmeyer, M., Kaltenbaek, R., Lindenthal, M., Walther, P., & Zeilinger, A. (2004) · Nature · doi:10.1038/430849a · Cited by 286
Methodology for quantum logic gate construction
Zhou, X., Leung, D. W., & Chuang, I. L. (2000) · Physical Review A · doi:10.1103/physreva.62.052316 · Cited by 355
Self-citationRandom Compiler for Fast Hamiltonian Simulation
Campbell, E. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.070503 · Cited by 355
Introduction to Optical Quantum Information Processing
Kok, P., & Lovett, B. W. (2010) · doi:10.1017/cbo9781139193658 · Cited by 273
Distributed quantum computation based on small quantum registers
Jiang, L., Taylor, J. M., Sørensen, A. S., & Lukin, M. D. (2007) · Physical Review A · doi:10.1103/physreva.76.062323 · Cited by 337
Colloidal Quantum Dots as Platforms for Quantum Information Science
Kagan, C. R., Bassett, L. C., Murray, C. B., & Thompson, S. M. (2021) · Chemical Reviews · doi:10.1021/acs.chemrev.0c00831 · Cited by 331
Experimental investigation of continuous-variable quantum teleportation
Bowen, W. P., Treps, N., Buchler, B. C., Schnabel, R., Ralph, T. C., Bachor, H.-A., Symul, T., & Lam, P. K. (2003) · Physical Review A · doi:10.1103/physreva.67.032302 · Cited by 309
Valence-bond states for quantum computation
Verstraete, F., & Cirac, J. I. (2004) · Physical Review A · doi:10.1103/physreva.70.060302 · Cited by 333
Layered architecture for quantum computing
Jones, N. C., Van Meter, R., Fowler, A. G., McMahon, P. L., Kim, J., Ladd, T. D., & Yamamoto, Y. (2012) · Physical Review X · doi:10.1103/physrevx.2.031007 · Cited by 332
“• “Teleportation gates” [29] can yield very fast quantum circuits, but typically a special purpose ancilla required for each such gate must be computed in advance, which demands a larger and more complex quantum computer; teleportation gates that increase performance in large-scale quantum computing are used extensive…”
BackgroundSecure Continuous Variable Teleportation and Einstein-Podolsky-Rosen Steering
He, Q., Rosales-Zárate, L., Adesso, G., & Reid, M. D. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.180502 · Cited by 333
Chip-to-chip quantum teleportation and multi-photon entanglement in silicon
Llewellyn, D., Ding, Y., Faruque, I. I., Paesani, S., Bacco, D., Santagati, R., Qian, Y.-J., Li, Y., Xiao, Y.-F., Huber, M., et al. (2020) · Nature Physics · doi:10.1038/s41567-019-0727-x · Cited by 331
Entanglement purification and quantum error correction
Dür, W., & Briegel, H. J. (2007) · Reports on Progress in Physics · doi:10.1088/0034-4885/70/8/r03 · Cited by 327
Strawberry Fields: A Software Platform for Photonic Quantum Computing
Killoran, N., Izaac, J., Quesada, N., Bergholm, V., Amy, M., & Weedbrook, C. (2019) · Quantum · doi:10.22331/q-2019-03-11-129 · Cited by 323
“First described by Gottesman and Chuang [73] in the case of qubits, gate teleportation was generalised for the CV case by Bartlett and Munro [74] (see Fig.”
BackgroundQuantum repeater with encoding
Jiang, L., Taylor, J. M., Nemoto, K., Munro, W. J., Van Meter, R., & Lukin, M. D. (2009) · Physical Review A · doi:10.1103/physreva.79.032325 · Cited by 328
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
Bremner, M. J., Jozsa, R., & Shepherd, D. J. (2011) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2010.0301 · Cited by 308
“For example, the constructions in [13, 14] (exploiting the notion of gate teleportation [19]) imply that the power of quantum circuits of depth 4 (i.”
BackgroundOne-Way Quantum Computing in the Optical Frequency Comb
Menicucci, N. C., Flammia, S. T., & Pfister, O. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.130501 · Cited by 311
Big privacy: challenges and opportunities of privacy study in the age of big data
Yu, S. (2016) · IEEE Access · doi:10.1109/access.2016.2577036 · Cited by 307
“The recently proposed measurement based model of quantum computation [84] provide a promising diagram to achieve blind computing, meaning a client can delegate a computation to a quantum server, and the server can execute the task without gaining any knowledge about the input, output, and the client.”
MethodMultiphoton quantum optics and quantum state engineering
Dell’Anno, F., De Siena, S., & Illuminati, F. (2006) · Physics Reports · doi:10.1016/j.physrep.2006.01.004 · Cited by 310
Practical Characterization of Quantum Devices without Tomography
da Silva, M. P., Landon-Cardinal, O., & Poulin, D. (2011) · Physical Review Letters · doi:10.1103/physrevlett.107.210404 · Cited by 310
Simulation of quantum circuits by low-rank stabilizer decompositions
Bravyi, S., Browne, D., Calpin, P., Campbell, E., Gosset, D., & Howard, M. (2019) · Quantum · doi:10.22331/q-2019-09-02-181 · Cited by 302
“[28]).”
Micius quantum experiments in space
Lu, C.-Y., Cao, Y., Peng, C.-Z., & Pan, J.-W. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.035001 · Cited by 295
Symmetry analyzer for nondestructive Bell-state detection using weak nonlinearities
Barrett, S. D., Kok, P., Nemoto, K., Beausoleil, R. G., Munro, W. J., & Spiller, T. P. (2005) · Physical Review A · doi:10.1103/physreva.71.060302 · Cited by 300
Deterministic quantum teleportation with feed-forward in a solid state system
Steffen, L., Salathe, Y., Oppliger, M., Kurpiers, P., Baur, M., Lang, C., Eichler, C., Puebla-Hellmann, G., Fedorov, A., & Wallraff, A. (2013) · Nature · doi:10.1038/nature12422 · Cited by 301
Deterministic quantum teleportation of photonic quantum bits by a hybrid technique
Takeda, S., Mizuta, T., Fuwa, M., van Loock, P., & Furusawa, A. (2013) · Nature · doi:10.1038/nature12366 · Cited by 268
“It is essential for long-distance quantum communication by means of quantum repeaters [2] and it ha s also been shown to be a useful tool for realizing universal quantum logic gates in a measurement-based fashion [3].”
Entanglement Phase Transitions in Measurement-Only Dynamics
Ippoliti, M., Gullans, M. J., Gopalakrishnan, S., Huse, D. A., & Khemani, V. (2021) · Physical Review X · doi:10.1103/physrevx.11.011030 · Cited by 243
Detecting quantum entanglement
Terhal, B. M. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00139-1 · Cited by 273
Deterministic teleportation of a quantum gate between two logical qubits
Chou, K. S., Blumoff, J. Z., Wang, C. S., Reinhold, P. C., Axline, C. J., Gao, Y. Y., Frunzio, L., Devoret, M. H., Jiang, L., & Schoelkopf, R. J. (2018) · Nature · doi:10.1038/s41586-018-0470-y · Cited by 272
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning
Amy, M., Maslov, D., & Mosca, M. (2014) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2014.2341953 · Cited by 274
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.