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 601–700 of 1,005
Efficient Multi Port-Based Teleportation Schemes
Studziński, M., Mozrzymas, M., Kopszak, P., & Horodecki, M. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3187852 · Cited by 36
“Although, standard teleportation and KLM scheme are of the great importance and have fundamental meaning for the field with range of important applications [4], [5], [6], [7], [8], [9], [10], here we focus on PBT schemes.”
BackgroundInplace Access to the Surface Code Y Basis
Gidney, C. (2024) · Quantum · doi:10.22331/q-2024-04-08-1310 · Cited by 97
“Figure 9: ZX calculus diagrams and defect diagrams of using fast Y basis measurement to perform an S gate by gate teleportation [GC99].”
MethodLow-Depth Unitary Quantum Circuits for Dualities in One-Dimensional Quantum Lattice Models
Lootens, L., Delcamp, C., Williamson, D. J., & Verstraete, F. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.130403 · Cited by 27
“However, we demonstrate that constant depth can be achieved with adaptive quantum circuits [13–15] in the case of nilpotent dualities defined as dualities for which the dual symmetry is encoded into a nilpotent fusion category [16].”
Pittman, T. B., Donegan, M. M., Fitch, M. J., Jacobs, B. C., Franson, J. D., Kok, P., Lee, H., & Dowling, J. P. (2003) · IEEE Journal of Selected Topics in Quantum Electronics · doi:10.1109/jstqe.2003.820916 · Cited by 33
“form [22]”
Quantum information in the Posner model of quantum cognition
Halpern, N. Y., & Crosson, E. (2018) · Annals of Physics · doi:10.1016/j.aop.2018.11.016 · Cited by 42
Teleportation of GHZ-States in QED-Cavities without the Explicit Bell-State Measurement
Cardoso, W. B. (2007) · International Journal of Theoretical Physics · doi:10.1007/s10773-007-9524-x · Cited by 28
Atomic state teleportation: from internal to external degrees of freedom
Rameez‐ul‐Islam, Ikram, M., Ahmed, R., Khosa, A. H., & Saif, F. (2009) · Journal of Modern Optics · doi:10.1080/09500340902767421 · Cited by 28
Laforest, M., Baugh, J., & Laflamme, R. (2006) · Physical Review A · doi:10.1103/physreva.73.032323 · Cited by 30
Entanglement and off-diagonal long-range order of an η-pairing state
Fan, H., & Lloyd, S. (2005) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/38/23/014 · Cited by 35
Entanglement transfer experiment in NMR quantum information processing
Boulant, N., Fortunato, E. M., Pravia, M. A., Teklemariam, G., Cory, D. G., & Havel, T. F. (2002) · Physical Review A · doi:10.1103/physreva.65.024302 · Cited by 29
Universal fault-tolerant quantum computation with Bacon-Shor codesPreprint
Yoder, T. J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.01686 · Cited by 49
“Indeed, make the code asymmetric enough, i.e. m × m k , and a gate (namely the k -qubit-controlled Z) from the k th -level of the Clifford hierarchy [12] becomes transversal.”
BackgroundAn Introduction to Boson-Sampling
Gard, B. T., Motes, K. R., Olson, J. P., Rohde, P. P., & Dowling, J. P. (2015) · From Atomic to Mesoscale · doi:10.1142/9789814678704_0008 · Cited by 26
“To overcome this, another useful tool in LOQC is the use of quantum gate teleportation to increase the probability of success of non-deterministic gates [27, 32].”
MethodFast Stabiliser Simulation with Quadratic Form Expansions
de Beaudrap, N., & Herbert, S. (2022) · Quantum · doi:10.22331/q-2022-09-15-803 · Cited by 34
“…of stabiliser states have a certain similarity to a representation of operations by Heyfron and Campbell [34], who use a symmetric order 3 tensor S where our representation uses a symmetric Gram matrix Q , to represent certain operations from the third level of the Clifford hierarchy [35,36].”
MethodGenuine Multipartite Entanglement Detection with Imperfect Measurements: Concept and Experiment
Cao, H., Morelli, S., Rozema, L. A., Zhang, C., Tavakoli, A., & Walther, P. J. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.150201 · Cited by 35
Composite Toffoli gate with two-round error detection
Jones, C. (2013) · Physical Review A · doi:10.1103/physreva.87.052334 · Cited by 32
Noiseless Conditional Teleportation of a Single Photon
Fuwa, M., Toba, S., Takeda, S., Marek, P., Mišta, L., Filip, R., van Loock, P., Yoshikawa, J., & Furusawa, A. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.223602 · Cited by 31
Efficient Quantum Teleportation of Unknown Qubit Based on DV-CV Interaction Mechanism
Podoshvedov, S. A. (2019) · Entropy · doi:10.3390/e21020150 · Cited by 32
“Quantum teleportation protocol underlies quantum gate teleportation [7],”
BackgroundQuantumness and memory of one qubit in a dissipative cavity under classical control
Gholipour, H., Mortezapour, A., Nosrati, F., & Franco, R. L. (2020) · Annals of Physics · doi:10.1016/j.aop.2020.168073 · Cited by 28
Generation of a Maximally Entangled State Using Collective Optical Pumping
Malinowski, M., Zhang, C., Negnevitsky, V., Rojkov, I., Reiter, F., Nguyen, T. L., Stadler, M., Kienzler, D., Mehta, K. K., & Home, J. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.080503 · Cited by 33
Quantum paradox of choice: More freedom makes summoning a quantum state harder
Adlam, E., & Kent, A. (2016) · Physical Review A · doi:10.1103/physreva.93.062327 · Cited by 31
“Indeed, in the teleportation model of distributed quantum computation [12], each round of adaptive computation is essentially a summoning task: the measurement result from the previous round determines the measurement to be made in the present round, and thus plays the role of the ‘call’, while the locations of the ga…”
BackgroundInfluentialProbabilistic resumable bidirectional quantum teleportation
Gou, Y., Shi, H., Wang, X.-H., & Liu, S. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1727-3 · Cited by 29
All-Optical Storage of Phase-Sensitive Quantum States of Light
Hashimoto, Y., Toyama, T., Yoshikawa, J., Makino, K., Okamoto, F., Sakakibara, R., Takeda, S., van Loock, P., & Furusawa, A. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.113603 · Cited by 29
“More specifically, a frequently executed process like gate teleportation [4, 5], by which a probabilistically induced nonlinearity can be efficiently incorporated into a quantum protocol, relies, to a certain extent, on quantum memories in order to synchronize the probabilistically generated auxiliary resource states.”
BackgroundSequential quantum teleportation of optical coherent states
Yonezawa, H., Furusawa, A., & van Loock, P. (2007) · Physical Review A · doi:10.1103/physreva.76.032305 · Cited by 28
Preskill, J. P. (1999) · Nature · doi:10.1038/46434 · Cited by 35
Teleportation of entangled states
Горбачев, В. Н., Zhiliba, A. I., & Trubilko, A. I. (2001) · Journal of Optics B Quantum and Semiclassical Optics · doi:10.1088/1464-4266/3/1/355 · Cited by 26
The Quantum Schur Transform: I. Efficient Qudit CircuitsPreprint
Bacon, D., Chuang, I. L., & Harrow, A. W. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0601001 · Cited by 73
Self-citationEstimating the teleported initial parameters of a single- and two-qubit systems
Anouz, K. E., Allati, A. E., METWALLY, N., & Mourabit, T. (2018) · Applied Physics B · doi:10.1007/s00340-018-7122-7 · Cited by 25
Logical Clifford Synthesis for Stabilizer Codes
Rengaswamy, N., Calderbank, R., Kadhe, S., & Pfister, H. D. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3023419 · Cited by 43
“The Clifford hierarchy of unitary operators was defined to help demonstrate that universal quantum computation can be realized via the teleportation protocol [9].”
BackgroundKanari-Naish, L. A., Clarke, J., Qvarfort, S., & Vanner, M. R. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac6dfd · Cited by 27
“Indeed, quantum entanglement provides significant potential to surpass limitations set by classical physics for widespread applications, including quantum communications [1], computing [2, 3], networking [4, 5], and sensing [6, 7].”
BackgroundFrom stabilizer states to SIC-POVM fiducial states
Feng, L., & Luo, S. (2022) · Theoretical and Mathematical Physics · doi:10.1134/s004057792212008x · Cited by 29
Quantum computation with cat qubits
Guillaud, J., Cohen, J., & Mirrahimi, M. (2023) · SciPost Physics Lecture Notes · doi:10.21468/scipostphyslectnotes.72 · Cited by 62
“Note that the set of rotations {Z(θ )}θ∈[0,2π[ actually contains gates from arbitrarily high levels of the Clifford hierarchy [61, 62], as one can check that the rotation around a cardinal axis +X ,+Y,+Z of an angle θ ∈ {kπ/2}k∈Z2n is in the n-th level of the Clifford hierarchy.”
BackgroundMaximum nonlocality and minimum uncertainty using magic states
Howard, M. (2015) · Physical Review A · doi:10.1103/physreva.91.042103 · Cited by 25
“The unitaries that map the Pauli group into the Clifford group, under conjugation, define [30] the third level of the Clifford hierarchy, C3, and so on.”
BackgroundThermal entanglement and teleportation in a dipolar interacting system
Castro, C. S., Duarte, O. S., Pires, D. P., Soares-Pinto, D. O., & Reis, M. S. (2016) · Physics Letters A · doi:10.1016/j.physleta.2016.03.002 · Cited by 25
Quantum teleportation of photonic qudits using linear optics
Zhang, C., Chen, J. F., Cui, C., Dowling, J. P., Ou, Z. Y., & Byrnes, T. (2019) · Physical Review A · doi:10.1103/physreva.100.032330 · Cited by 35
Estimating the Indistinguishability of Heralded Single Photons Using Second-Order Correlation
Faruque, I. I., Sinclair, G. F., Bonneau, D., Ono, T., Silberhorn, C., Thompson, M. G., & Rarity, J. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.12.054029 · Cited by 27
Asavanant, W., Takase, K., Fukui, K., Endo, M., Yoshikawa, J., & Furusawa, A. (2021) · Physical Review A · doi:10.1103/physreva.103.043701 · Cited by 27
“The idea of our protocol is based on gate teleportation protocol [13, 14], where we have designed the non-Gaussian two-mode resource states to be equivalent to EPR state—a resource state for CV quantum teleportation—with quadrature operators (such as x̂) acting on one of its mode in the ideal limit.”
MethodChuang, I. L. (2014) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199681181.003.0007 · Cited by 25
Self-citationZou, X., Pahlke, K., & Mathis, W. (2003) · Physical Review A · doi:10.1103/physreva.68.034306 · Cited by 26
Lee, S., von Allmen, P., Oyafuso, F., Klimeck, G., & Whaley, K. B. (2005) · Journal of Applied Physics · doi:10.1063/1.1850605 · Cited by 28
Zaidi, H., Dawson, C., van Loock, P., & Rudolph, T. (2015) · Physical Review A · doi:10.1103/physreva.91.042301 · Cited by 32
Quantum teleportation of the angular spectrum of a single-photon field
Walborn, S. P., Ether, D. S., Filho, R. L. D. M., & Zagury, N. (2007) · Physical Review A · doi:10.1103/physreva.76.033801 · Cited by 26
Probabilistic Teleportation of an Arbitrary Two-particle State
Yong-Jian, G., Zheng, Y.-Z., & Guang-Can, G. (2001) · Chinese Physics Letters · doi:10.1088/0256-307x/18/12/301 · Cited by 25
Quantum computation by local measurementPreprint
Raussendorf, R., & Wei, T.-C. (2014) · Cited by 26
Cai, Z., Ren, C., Feng, T., Zhou, X., & Chen, J. (2024) · Physics Reports · doi:10.1016/j.physrep.2024.10.003 · Cited by 31
Quantum networks using rare-earth ions
Tittel, W., Afzelius, M., Kinos, A., Rippe, L., & Walther, A. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/addd93 · Cited by 40
“Deterministic entanglement swapping between qubits in repeater nodes can be achieved as long as two-qubit gates and qubit measurements can be performed on the two qubits involved in the entanglement swapping in a node [213].”
Embedding Quantum Simulators for Quantum Computation of Entanglement
Candia, R. D., Mejía, B., Castillo, H., Pedernales, J. S., Casanova, J., & Solano, E. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.240502 · Cited by 37
Chen, L. (2021) · Light Science & Applications · doi:10.1038/s41377-021-00585-8 · Cited by 30
Teleportation of atomic external states on the internal degrees of freedom
Ali, L., Rameez‐ul‐Islam, Ikram, M., Abbas, T., & Ahmad, I. (2022) · Quantum Information Processing · doi:10.1007/s11128-021-03400-w · Cited by 27
Universal fault-tolerant quantum computing with stabilizer codes
Webster, P., Vasmer, M., Scruby, T. R., & Bartlett, S. D. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013092 · Cited by 37
Quantum Data Center: Perspectives
Liu, J., & Jiang, L. (2024) · IEEE Network · doi:10.1109/mnet.2024.3397836 · Cited by 34
“More generally, people propose the idea of quantum internet [12], where one could potentially accomplish tasks that are not possible in classical physics [43], [44].”
BackgroundSecret key rates for an encoded quantum repeater
Bratzik, S., Kampermann, H., & Bruß, D. (2014) · Physical Review A · doi:10.1103/physreva.89.032335 · Cited by 25
Quantum teleportation of four-dimensional qudits
Al-Amri, M., Evers, J., & Zubairy, M. S. (2010) · Physical Review A · doi:10.1103/physreva.82.022329 · Cited by 25
Continuous-variable teleportation of a negative Wigner function
Mišta, L., Filip, R., & Furusawa, A. (2010) · Physical Review A · doi:10.1103/physreva.82.012322 · Cited by 25
Universal resources for approximate and stochastic measurement-based quantum computation
Mora, C. E., Piani, M., Miyake, A., den Nest, M. V., Dür, W., & Briegel, H. J. (2010) · Physical Review A · doi:10.1103/physreva.81.042315 · Cited by 31
Colladay, K. R., & Mueller, E. J. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aad8dd · Cited by 29
“This latter setting is the domain of “one-way” quantum computing [12].”
BackgroundMethodTransport of trapped-ion qubits within a scalable quantum processor
Blakestad, R. B. (2010) · Cited by 39
Adaptive quantum teleportation
Modławska, J., & Grudka, A. (2009) · Physical Review A · doi:10.1103/physreva.79.064302 · Cited by 24
Quantum cloning and universal NOT gate by teleportation
Sciarrino, F., Sias, C., Ricci, M., & Martini, F. D. (2004) · Physics Letters A · doi:10.1016/j.physleta.2004.01.063 · Cited by 27
Quantum gate teleportation with the superposition of causal order
Liu, W., & Wei, H. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.014064 · Cited by 28
Hybrid-system approach to fault-tolerant quantum communication
Stephens, A. M., Huang, J., Nemoto, K., & Munro, W. J. (2013) · Physical Review A · doi:10.1103/physreva.87.052333 · Cited by 27
Quantum teleportation with relativistic communication from first principles
Tjoa, E. (2022) · Physical Review A · doi:10.1103/physreva.106.032432 · Cited by 26
“Third, one of the interesting applications of quantum teleportation is the so-called gate-based teleportation [72, 73].”
BackgroundError-Detectable Bosonic Entangling Gates with a Noisy Ancilla
Tsunoda, T., Teoh, J. D., Kalfus, W. D., de Graaf, S. J., Chapman, B. J., Curtis, J. C., Thakur, N., Girvin, S. M., & Schoelkopf, R. J. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.020354 · Cited by 38
Protocols for trainable and differentiable quantum generative modeling
Kyriienko, O., Paine, A. E., & Elfving, V. E. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033291 · Cited by 50
“The idea relies on the fact that we can concatenate feature map sparsification two circuits if we use a modified quantum gate teleportation circuit [74].”
MethodQuantum information processing and quantum control with trapped atomic ions
Wineland, D. J. (2009) · Physica Scripta · doi:10.1088/0031-8949/2009/t137/014007 · Cited by 32
Simulating single photons with realistic photon sources
Yuan, X., Zhang, Z., Lütkenhaus, N., & Ma, X. (2016) · Physical Review A · doi:10.1103/physreva.94.062305 · Cited by 26
Single-shot secure quantum network coding on butterfly network with free public communication
Owari, M., Kato, G., & Hayashi, M. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa8ac4 · Cited by 23
Wei, T.-C., & Huang, C.-Y. (2017) · Physical Review A · doi:10.1103/physreva.96.032317 · Cited by 27
“In contrast, the paradigm of the measurementbased quantum computation (MBQC) [15–17], with the teleportation-based schemes [18] and the one-way quantum computer [15, 16, 19–21] as the prominent examples, offers an alternative framework, in which local measurement alone achieves the same power of computation as other m…”
BackgroundUnifying the Clifford hierarchy via symmetric matrices over rings
Rengaswamy, N., Calderbank, R., & Pfister, H. D. (2019) · Physical Review A · doi:10.1103/physreva.100.022304 · Cited by 38
“The higher levels k > 1 of the hierarchy are defined recursively as C , {U ∈ UN : UD(a, b)U † ∈ C(k−1) ∀ D(a, b) ∈ C((1))}, (6) where UN denotes the group of all N × N unitary matrices [1].”
BackgroundMethodInfluentialInteraction-free generation of entanglement
Azuma, H. (2003) · Physical Review A · doi:10.1103/physreva.68.022320 · Cited by 24
“carry out the quantum teleportation (measurement of all two qubits by the Bell basis), and execute arbitrary one-qubit unitary transformations, we can construct the controlledNOT gate, which is one of the fundamental gates[5].”
BackgroundMethodInfluentialWang, H., & Zhang, S. (2009) · The European Physical Journal D · doi:10.1140/epjd/e2009-00129-2 · Cited by 24
GENERAL CIRCUITS FOR INDIRECTING AND DISTRIBUTING MEASUREMENT IN QUANTUM COMPUTATION
GUPTA, M., Pathak, A., Srikanth, R., & PANIGRAHI, K. (2007) · International Journal of Quantum Information · doi:10.1142/s0219749907003092 · Cited by 27
Quantum nonlocality and applications in quantum-information processing of hybrid entangled states
Chen, Z., Guang, H., & Zhang, Y.-D. (2002) · Physical Review A · doi:10.1103/physreva.65.032317 · Cited by 25
Quantum Cryptography: From Theory to Practice
Ma, X. (2009) · TSpace (University of Toronto) · Cited by 24
Browne, D. E., & Briegel, H. J. (2006) · Wiley eBooks · doi:10.1002/9783527618637.ch20 · Cited by 29
Efficient Magic State Distillation by Zero-Level Distillation
(2025) · doi:10.1103/thxx-njr6 · Cited by 22
“Therefore, magic state distillation (MSD) [15] is employed to prepare a high-fidelity magic state T | + ⟩ from noisy ones, which is hence used to implement the T gate via gate teleportation [16].”
Fault-Tolerant Quantum Computation by Hybrid Qubits with Bosonic Cat Code and Single Photons
Lee, J., Kang, N., Lee, S.-H., Jeong, H., Jiang, L., & Lee, S.-W. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030322 · Cited by 47
“Z error may occur by multiple photon loss as B C only corrects single photon loss detected by the parity change.”
Quantum Internet: Technologies, Protocols, and Research Challenges
Kumar, V., Cicconetti, C., Conti, M., & Passarella, A. (2025) · The International journal of networked and distributed computing · doi:10.1007/s44227-025-00060-5 · Cited by 37
“…represented as: Here, each logical qubit is encoded using the three-qubit repetition code, where Establishing a single encoded EPR pair between two nodes involves a three-step process and requires an additional ancilla qubit for each physical qubit in the encoded EPR pair, as described in [20, 21].”
Entanglement-assisted scheme for nondemolition detection of the presence of a single photon
Bula, M., Bartkiewicz, K., Černoch, A., & Lemr, K. (2013) · Physical Review A · doi:10.1103/physreva.87.033826 · Cited by 22
Magic state parity-checker with pre-distilled components
Campbell, E. T., & Howard, M. (2018) · Quantum · doi:10.22331/q-2018-03-14-56 · Cited by 24
“algateconstructions. 1 Notation WedenoteaxialrotationsaboutthePauli-Zaxisas R(θ) = exp(iθZ) = cos(θ)1l + isin(θ)Z. (1) Iftheangleisθ= π/2‘forinteger‘thenR(θ) belongsinthe‘th leveloftheCliffordhierarchy[23]. Therefore,R(π/8) istheπ/8-phasegate,alsoknownattheTgate. Unitaries insidetheCliffordhierarchyarespecialbecausethey…”
Constructions for Quantum Indistinguishability Obfuscation
Broadbent, A., & Kazmi, R. A. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-88238-9_2 · Cited by 35
Preparation of multiphoton high-dimensional GHZ states
Xing, W.-B., Hu, X., Guo, Y., Liu, B., Li, C., & Guo, G. (2023) · Optics Express · doi:10.1364/oe.494850 · Cited by 27
Complexity of simulating constant-depth BosonSampling
Brod, D. J. (2015) · Physical Review A · doi:10.1103/physreva.91.042316 · Cited by 22
Multi-party bidirectional teleportation
Seida, C., Allati, A. E., METWALLY, N., & Hassouni, Y. (2021) · Optik · doi:10.1016/j.ijleo.2021.167784 · Cited by 22
Measurement-Based and Universal Blind Quantum Computation
Broadbent, A., Fitzsimons, J. F., & Kashefi, E. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13678-8_2 · Cited by 31
An, N. B., & Duc, T. M. (2002) · Journal of Optics B Quantum and Semiclassical Optics · doi:10.1088/1464-4266/4/1/313 · Cited by 23
Linear-optical implementations of the iSWAP and controlled NOT gates based on conventional detectors
Bartkowiak, M., & Miranowicz, A. (2010) · Journal of the Optical Society of America B · doi:10.1364/josab.27.002369 · Cited by 23
“III, we discuss other implementations of the iSWAP gate yielding P = η(4)/4 and P = η(6)/8 using as a resource the Gottesman-Chuang four-qubit entangled state [10] and a pair of Greenberger–Horne–Zeilinger (GHZ) states, respectively.”
BackgroundMethodInfluentialMiller, J., Sanders, S. K., & Miyake, A. (2017) · Physical Review A · doi:10.1103/physreva.96.062320 · Cited by 35
“In terms of the Clifford hierarchy of unitary operations [38], the pattern which emerges here is that using gadgets which implement operations at the third level of the Clifford hierarchy leads to a random byproduct group formed from Clifford gates at the second level of the Clifford hierarchy.”
BackgroundNon-locality in Categorical Quantum Mechanics
Edwards, W. (2009) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 28
Teleportation of an arbitrary multipartite state via photonic Faraday rotationPreprint
Chen, J.-J., An, J.-H., Feng, M., & Liu, G. (2016) · Cited by 22
Chip-based quantum communications
Wang, Q., Zheng, Y., Zhai, C., Li, X., Gong, Q., & Wang, J. (2021) · Journal of Semiconductors · doi:10.1088/1674-4926/42/9/091901 · Cited by 23
Approximate symmetries and quantum error correction
Liu, Z.-W., & Zhou, S. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00788-4 · Cited by 41
“Note that δ C = 2 min ν ∈ R max ρ | Tr( H S E S ← L ( ρ )) − Tr(( H L − ν 1 ) ρ ) | , where we allow a constant offset on the definitions of charges.”
Free-electron interactions with photonic GKP states: Universal control and quantum error correction
Baranes, G., Even-Haim, S., Ruimy, R., Gorlach, A. A., Dahan, R., Diringer, A. A., Hacohen-Gourgy, S., & Kaminer, I. E. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043271 · Cited by 32
“The gates requiring feedforward, rotation R i ( φ ), and CNOT ph1 → ph2 , as shown in Table I, are based on teleported gates [62,63].”
BackgroundMethodTrace monoids with idempotent generators and measure-only quantum automata
Bertoni, A., Mereghetti, C., & Palano, B. (2009) · Natural Computing · doi:10.1007/s11047-009-9154-8 · Cited by 21
Experimental quantum teleportation over a high-loss free-space channel
Ma, X.-S., Kropatschek, S., Naylor, W., Scheidl, T., Kofler, J., Herbst, T., Zeilinger, A., & Ursin, R. (2012) · Optics Express · doi:10.1364/oe.20.023126 · Cited by 24
PROJECTED ENTANGLED STATES: PROPERTIES AND APPLICATIONS
Verstraete, F., Wolf, M. M., Pérez-García, D., & Cirac, J. I. (2006) · International Journal of Modern Physics B · doi:10.1142/s021797920603620x · Cited by 27
Efficient fluorescence collection and ion imaging with the “tack” ion trap
Shu, G., Chou, C.-K., Kurz, N., Dietrich, M., & Blinov, B. B. (2011) · Journal of the Optical Society of America B · doi:10.1364/josab.28.002865 · Cited by 32
Fermionic measurement-based quantum computation
Chiu, Y.-J., Chen, X., & Chuang, I. L. (2013) · Physical Review A · doi:10.1103/physreva.87.012305 · Cited by 22
Self-citationAsymmetric Bidirectional Controlled Teleportation via Seven-Photon Entangled State
Nie, Y.-Y., & Sang, M.-H. (2017) · International Journal of Theoretical Physics · doi:10.1007/s10773-017-3510-8 · Cited by 21
Remote entanglement stabilization and concentration by quantum reservoir engineering
Didier, N., Guillaud, J., Shankar, S., & Mirrahimi, M. (2018) · Physical Review A · doi:10.1103/physreva.98.012329 · Cited by 21
Methods to estimate entanglement in teleportation experiments
Šupić, I., Skrzypczyk, P., & Cavalcanti, D. (2019) · Physical Review A · doi:10.1103/physreva.99.032334 · Cited by 25
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.