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 701–800 of 1,005
Universal limitations on implementing resourceful unitary evolutions
Takagi, R., & Tajima, H. (2020) · Physical Review A · doi:10.1103/physreva.101.022315 · Cited by 22
“However, since Clifford gates do not form a universal gate set, some non-Clifford gate needs to be implemented fault-tolerantly, and a popular way of realizing it is via the gate teleportation [77], in which “magic states” [78] are injected as resources of “non-Cliffordness”.”
BackgroundDevice-independent quantum key distribution from computational assumptions
Metger, T., Dulek, Y., Coladangelo, A., & Arnon-Friedman, R. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac304b · Cited by 26
“We can remove the need for this non-local operation using gate teleportation with pre-shared EPR pairs [34].”
MethodActivating hidden teleportation power: Theory and experiment
Li, J.-Y., Fang, X., Zhang, T., Tabia, G. N. M., Lu, H., & Liang, Y.-C. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.023045 · Cited by 26
“In universal quantum computing with linear optics, it enables neardeterministic two-qubit gates [14] and makes assembling cluster states more efficient [15, 16].”
BackgroundGeneration of four-atom cluster states in thermal cavity and implementing remote controlled not gate
Yang, R., Li, H., Chen, M., & Xiu, L. (2006) · Chinese Physics · doi:10.1088/1009-1963/15/10/020 · Cited by 21
Bibliographic guide to the foundations of quantum mechanics and quantum informationPreprint
Cabello, A. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0012089 · Cited by 33
Proposal for optomechanical quantum teleportation
Li, J., Wallucks, A., Benevides, R., Fiaschi, N., Hensen, B., Alegre, T. P. M., & Gröblacher, S. (2020) · Physical Review A · doi:10.1103/physreva.102.032402 · Cited by 23
Magic state distillation from entangled states
Bao, N., Cao, C., & Su, V. P. (2022) · Physical Review A · doi:10.1103/physreva.105.022602 · Cited by 27
Hyperentanglement teleportation through external momenta states
Ali, L., Rameez‐ul‐Islam, Ikram, M., Abbas, T., & Ahmad, I. (2021) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/1361-6455/ac42dc · Cited by 21
Performance metrics for the continuous distribution of entanglement in multiuser quantum networks
Iñesta, Á. G., & Wehner, S. (2023) · Physical Review A · doi:10.1103/physreva.108.052615 · Cited by 26
“These applications range from basic routines, such as quantum teleportation [1, 2], to more complex tasks, such as quantum key distribution [3, 4] and entanglement-assisted distributed sensing [5, 6].”
BackgroundConstant-overhead magic state distillation
Wills, A., Hsieh, M.-H., & Yamasaki, H. (2025) · Nature Physics · doi:10.1038/s41567-025-03026-0 · Cited by 119
“This requires, however, U to be a gate in the third level of the Clifford hierarchy: a concept introduced by Gottesman and Chuang 15 .”
Lee, S.-W., Ki-min Park, B., Ralph, T. C., & Jeong, H. (2015) · Physical Review A · doi:10.1103/physreva.92.052324 · Cited by 23
Teleportation of an arbitrary multipartite state via photonic Faraday rotation
Chen, J.-J., An, J.-H., Feng, M., & Liu, G. (2010) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/0953-4075/43/9/095505 · Cited by 26
Kilmer, T., & Guha, S. (2019) · Physical Review A · doi:10.1103/physreva.99.032302 · Cited by 28
SAQIP: A Scalable Architecture for Quantum Information Processors
Sargaran, S., & Mohammadzadeh, N. (2019) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3311879 · Cited by 22
“Isailovic et al. [41, 42] studied interconnection networks and communication channel bandwidth for such architectures with emphasis on the ancilla preparation for teleportation-based communication [43].”
BackgroundEfficient entanglement distillation for quantum channels with polarization mode dispersion
Ruan, L., Kirby, B. T., Brodsky, M., & Win, M. Z. (2021) · Physical Review A · doi:10.1103/physreva.103.032425 · Cited by 23
High-fidelity linear optical quantum computing with polarization encoding
Spedalieri, F. M., Lee, H., & Dowling, J. P. (2006) · Physical Review A · doi:10.1103/physreva.73.012334 · Cited by 22
Generalized Teleportation and Entanglement Recycling
Strelchuk, S., Horodecki, M., & Oppenheim, J. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.010505 · Cited by 29
Production of multipartite entanglement for electron spins in quantum dots
Bodoky, F., & Blaauboer, M. (2007) · Physical Review A · doi:10.1103/physreva.76.052309 · Cited by 20
Distributed Arithmetic on a Quantum Multicomputer
Meter, R. V., Nemoto, K., Munro, W. J., & Itoh, K. M. (2006) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca.2006.19 · Cited by 31
Probabilistic teleportation of a non-symmetric three-particle state
Chen, X., Qiao-yan, W., & Zhu, F.-C. (2006) · Chinese Physics · doi:10.1088/1009-1963/15/10/009 · Cited by 20
Coecke, B. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-06880-0_13 · Cited by 23
Multi-party Quantum ComputationPreprint
Smith, A. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0111030 · Cited by 26
Hierarchical memories: Simulating quantum LDPC codes with local gates
Pattison, C. A., Krishna, A., & Preskill, J. (2023) · arXiv · doi:10.48550/arxiv.2303.04798 · Cited by 20
Entanglement in coupled harmonic oscillators studied using a unitary transformation
Jellal, A., Madouri, F., & Merdaci, A. (2011) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2011/09/p09015 · Cited by 29
QUANTUM CIRCUITS FOR PROBABILISTIC ENTANGLEMENT TELEPORTATION VIA A PARTIALLY ENTANGLED PAIR
Chen, X., Wen, Q., & Zhu, F.-C. (2007) · International Journal of Quantum Information · doi:10.1142/s021974990700316x · Cited by 19
Residual entanglement with negativity for pure four-qubit quantum states
Oliveira, D. S., & Ramos, R. V. (2009) · Quantum Information Processing · doi:10.1007/s11128-009-0154-5 · Cited by 19
Continuous variable quantum entanglement in optomechanical systems: A short review
Sarma, A. K., Chakraborty, S., & Kalita, S. (2021) · AVS Quantum Science · doi:10.1116/5.0022349 · Cited by 23
Dogma and heresy in quantum computing
Divincenzo, D. P. (2001) · doi:10.5555/2016994.2016996 · Cited by 26
Rudolph, T., & Virmani, S. (2005) · New Journal of Physics · doi:10.1088/1367-2630/7/1/228 · Cited by 21
Quantum Logic Between Distant Trapped IonsPreprint
Olmschenk, S., Hayes, D., Matsukevich, D., Maunz, P., Moehring, D. L., & Monroe, C. R. (2013) · Cited by 19
Optimality of T-gate for generating magic resource
Li, X., & Luo, S. (2023) · Communications in Theoretical Physics · doi:10.1088/1572-9494/acaf28 · Cited by 19
Quantum teleportation in Heisenberg chain with magnetic-field gradient under intrinsic decoherence
Hosseiny, S. M., Seyed‐Yazdi, J., Norouzi, M., & Livreri, P. (2024) · Scientific Reports · doi:10.1038/s41598-024-60321-1 · Cited by 22
Stabilizing Remote Entanglement via Waveguide Dissipation
Shah, P. S., Yang, F., Joshi, C., & Mirhosseini, M. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030346 · Cited by 30
“On shorter length scales, entanglement between distant non-interacting modules can help realize non-local gate operations in a quantum computer [4–7].”
BackgroundLearning how to dynamically decouple by optimizing rotational gates
Rahman, A., Egger, D. J., & Arenz, C. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.22.054074 · Cited by 31
“For instance, Bell pairs enable quantum gate teleportation [49] and similar known states generated in a factory of resources enable circuit cutting [22].”
Long-Range Z Z Interaction via Resonator-Induced Phase in Superconducting Qubits
Deng, X. B., Zheng, W., Liao, X., Zhou, H., Ge, Y., Zhao, J., Lan, D., Tan, X., Zhang, Y., Li, S., et al. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.020801 · Cited by 36
Gyöngyösi, L., & Imre, S. (2025) · Quantum Information and Computation · doi:10.2478/qic-2025-0006 · Cited by 40
Lin, X., Chen, Z., Lin, G.-W., Chen, X., & Ni, B. (2009) · Optics Communications · doi:10.1016/j.optcom.2009.04.065 · Cited by 19
Unity fidelity multiple teleportation using partially entangled states
Rigolin, G. (2009) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/0953-4075/42/23/235504 · Cited by 18
Quantum teleportation between light and matter
Polzik, E. S. (2007) · Quantum Electronics and Laser Science Conference · doi:10.1109/cleoe-iqec.2007.4386929 · Cited by 18
Strong and uniform convergence in the teleportation simulation of bosonic Gaussian channels
Wilde, M. M. (2018) · Physical Review A · doi:10.1103/physreva.97.062305 · Cited by 19
“The teleportation primitive has been extended in multiple non-trivial ways, including a method to simulate an unideal channel using a noisy, mixed resource state [4, Section V] (see also [5–8]) and as a way to implement nonlocal quantum gates [9, 10].”
MethodClassical Coding Problem from Transversal T Gates
Rengaswamy, N., Calderbank, R., Newman, M., & Pfister, H. D. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174408 · Cited by 28
“The Clifford hierarchy is a hierarchy of unitary operators first defined by Gottesman and Chuang [21] to demonstrate universal quantum computation via teleportation.”
BackgroundZhang, W., Li, B., & Zhang, Z. (2020) · Laser Physics Letters · doi:10.1088/1612-202x/abc071 · Cited by 20
Teleportation-based noiseless quantum amplification of coherent states of light
Fiurášek, J. (2021) · Optics Express · doi:10.1364/oe.443389 · Cited by 18
Generation of N-atom W-class states in spatially separated cavities
Lu, M., Xia, Y., Song, J., & An, N. B. (2013) · Journal of the Optical Society of America B · doi:10.1364/josab.30.002142 · Cited by 18
“Entanglement, a fundamental feature in quantum mechanics, is a key resource for quantum information processing (QIP) [1,2], such as quantum teleportation [3], quantum dense coding [4], quantum cryptography [5], and quantum computation [6].”
BackgroundSplitting four ensembles of two-qubit quantum information via three Einstein-Podolsky-Rosen pairs
Zhang, W., Liu, Y. M., Yin, X.-F., & Zhang, Z. J. (2009) · The European Physical Journal D · doi:10.1140/epjd/e2009-00180-y · Cited by 18
Performances and robustness of quantum teleportation with identical particles
Marzolino, U., & Buchleitner, A. (2016) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2015.0621 · Cited by 24
Measurement-based quantum communication with resource states generated by entanglement purification
Wallnöfer, J., & Dür, W. (2017) · Physical Review A · doi:10.1103/physreva.95.012303 · Cited by 19
Teleportation simulation of bosonic Gaussian channels: strong and uniform convergence
Pirandola, S., Laurenza, R., & Braunstein, S. L. (2018) · The European Physical Journal D · doi:10.1140/epjd/e2018-90253-1 · Cited by 21
State-independent teleportation of an atomic state between two cavities
Zheng, S.-B. (2008) · Physical Review A · doi:10.1103/physreva.77.044303 · Cited by 18
Information Free Quantum Bus for Generating Stabiliser States
Devitt, S. J., Greentree, A. D., & Hollenberg, L. C. L. (2007) · Quantum Information Processing · doi:10.1007/s11128-007-0055-4 · Cited by 27
Berry, D. W., & Sanders, B. C. (2003) · Physical Review A · doi:10.1103/physreva.68.032312 · Cited by 24
Multisplitter Interaction for Entanglement Distribution
Paternostro, M., McAneney, H., & Kim, M. S. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.070501 · Cited by 18
Kirilyuk, A. P. (2002) · arXiv (Cornell University) · Cited by 18
Optimal Quantum Circuits for Nearest-Neighbor Architectures
Rosenbaum, D. J. (2012) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.tqc.2013.294 · Cited by 31
Experimental Efficient Source-Independent Quantum Secret Sharing against Coherent Attacks
Xiao, Y.-R., Yin, H., Hua, W.-J., Cao, X., & Chen, Z.-B. (2025) · Physical Review Letters · doi:10.1103/7wrk-p6gl · Cited by 28
“Combined with other quantum cryptographic protocols, QSS plays a crucial role in enabling various quantum network applications, ranging from multiparty quantum computing [38] to quantum blockchain [39, 40].”
Optimal joint cutting of two-qubit rotation gates
Ufrecht, C., Herzog, L. S., Scherer, D. D., Periyasamy, M., Rietsch, S., Plinge, A., & Mutschler, C. (2024) · Physical Review A · doi:10.1103/physreva.109.052440 · Cited by 36
QUANTUM LOGIC BETWEEN DISTANT TRAPPED IONS
OLMSCHENK, S., Hayes, D., MATSUKEVICH, D. N., MAUNZ, P., MOEHRING, D. L., & MONROE, C. (2010) · International Journal of Quantum Information · doi:10.1142/s0219749910006381 · Cited by 19
“In addition, the ability to teleport quantum information is an essential ingredient for the long-distance quantum communication afforded by quantum repeaters(31) and may be a vital component to quantum computation.(101) Previous demonstrations of quantum teleportation have been accomplished separately using optical sy…”
BackgroundThe effects of vacuum fluctuations on teleportation of quantum Fisher information
Jin, Y. (2017) · Scientific Reports · doi:10.1038/srep40193 · Cited by 17
“where σ σ σ = ⊗ i i (1) 0, σ σ σ = ⊗ i i (2) 0 , with σi (i = 1, 2, 3) being the Pauli matrices and σ0 being the 2 × 2 unit matrix.”
Constructive simulation and topological design of protocols
Jaffe, A., Liu, Z., & Wozniakowski, A. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa5b57 · Cited by 18
Relational time in anyonic systems
Nikolova, A., Brennen, G. K., Osborne, T. J., Milburn, G. J., & Stace, T. M. (2018) · Physical Review A · doi:10.1103/physreva.97.030101 · Cited by 18
Magic state distillation with the ternary Golay code
Prakash, S. (2020) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2020.0187 · Cited by 31
“if UZ is in the third level of the Clifford hierarchy [48,49].”
BackgroundVerification of Distributed Quantum Programs
Feng, Y., Li, S., & Ying, M. (2022) · ACM Transactions on Computational Logic · doi:10.1145/3517145 · Cited by 24
Long-distance distribution of qubit-qubit entanglement using Gaussian-correlated photonic beams
Agustí, J., Minoguchi, Y., Fink, J. M., & Rabl, P. (2022) · Physical Review A · doi:10.1103/physreva.105.062454 · Cited by 29
“Once established, entanglement can be locally purified [7–11] and used for quantum teleportation and remote gate operation protocols that then require classical communication only [12].”
BackgroundKirdi, M. E., Slaoui, A., Hadfi, H. E., & Mohammed Daoud, A. (2023) · Applied Physics B · doi:10.1007/s00340-023-08039-2 · Cited by 18
Two different types of optical hybrid qubits for teleportation in a lossy environment
Kim, H., Lee, S.-W., & Jeong, H. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1408-7 · Cited by 18
Deterministic exact teleportation via two partially entangled pairs of particles
Gu, Y. (2005) · Optics Communications · doi:10.1016/j.optcom.2005.08.024 · Cited by 17
Shahriar, M. S., Pati, G. S., & Salit, K. (2007) · Physical Review A · doi:10.1103/physreva.75.022323 · Cited by 17
Milburn, G. J. (2009) · Physica Scripta · doi:10.1088/0031-8949/2009/t137/014003 · Cited by 27
Accuracy of a teleported trapped field state inside a single bimodal cavity
de Queirós, I. P., Souza, S., Cardoso, W. B., & de Almeida, N. G. (2007) · Physical Review A · doi:10.1103/physreva.76.034101 · Cited by 17
Mizel, A. (2004) · Physical Review A · doi:10.1103/physreva.70.012304 · Cited by 21
Probabilistic teleportation of multi-particle partially entangled state
Chen, X., Jian-zhong, D., Qiao-yan, W., & Zhu, F.-C. (2008) · Chinese Physics B · doi:10.1088/1674-1056/17/3/006 · Cited by 18
Das, R., Bhattacharyya, R., & Kumar, A. (2004) · Journal of Magnetic Resonance · doi:10.1016/j.jmr.2004.07.008 · Cited by 20
Stabilizer Rényi Entropy and Conformal Field Theory
Hoshino, M., Oshikawa, M., & Ashida, Y. (2026) · Physical Review X · doi:10.1103/ylsz-dm3y · Cited by 76
“An understanding of nonstabilizer-ness in many-body systems has direct practical implications for determining state preparation costs [14], improving magic state distillation efficiency [15–18], and assessing computational complexity in many-body simulations [19, 20].”
Magic state distillation and gate compilation in quantum algorithms for quantum chemistry
Trout, C. J., & Brown, K. R. (2015) · International Journal of Quantum Chemistry · doi:10.1002/qua.24856 · Cited by 17
Optimal diagonal qutrit gates for creating Wigner negativity
Li, X., & Luo, S. (2023) · Physics Letters A · doi:10.1016/j.physleta.2022.128620 · Cited by 18
Kondappan, M., Chaudhary, M., Ilo-Okeke, E. O., Ivannikov, V., & Byrnes, T. (2023) · Physical Review A · doi:10.1103/physreva.107.042616 · Cited by 22
Deterministic Bell state measurement with a single quantum memory
Kamimaki, A., Wakamatsu, K., Mikata, K., Sekiguchi, Y., & Kosaka, H. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00771-z · Cited by 20
Exceptional Entanglement and Quantum Sensing with a Parity‐Time‐Symmetric Two‐Qubit System
Zhang, J., Zhou, Y., Zuo, Y., Zhang, H.-L., Chen, P., Jing, H., & Kuang, L. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300350 · Cited by 20
Stable Symmetry-Protected Topological Phases in Systems with Heralded Noise
Chirame, S., Burnell, F. J., Gopalakrishnan, S., & Prem, A. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.010403 · Cited by 30
“These steady-state phases have a non-vanishing string-order parameter, ensuring that the mixed state remains a resource for quantum teleportation [37] and measurement-based quantum computation (MBQC) [38, 39].”
BackgroundChen, L., & She, W. (2011) · Physical Review A · doi:10.1103/physreva.83.032305 · Cited by 16
Two-way quantum communication: ‘secure quantum information exchange’
Mishra, M. K., Maurya, A. K., & Prakash, H. (2011) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/0953-4075/44/11/115504 · Cited by 20
Experimental Monte Carlo Quantum Process Certification
Steffen, L., Silva, M. P. D., Fedorov, A., Baur, M., & Wallraff, A. J. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.260506 · Cited by 21
Elementary quantum gates in different bases
Podoshvedov, S. A. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1375-z · Cited by 21
“Note only the mechanism works directly without use of teleportation protocol [26].”
BackgroundMethodEntangling and assisted entangling power of bipartite unitary operations
Chen, L., & Yu, L. Z. (2016) · Physical Review A · doi:10.1103/physreva.94.022307 · Cited by 20
Operational advantages provided by nonclassical teleportation
Lipka-Bartosik, P., & Skrzypczyk, P. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.023029 · Cited by 22
Un-Weyl-ing the Clifford Hierarchy
Pllaha, T., Rengaswamy, N., Tirkkonen, O., & Calderbank, R. (2020) · Quantum · doi:10.22331/q-2020-12-11-370 · Cited by 37
Efficient quantum gate teleportation in higher dimensions
de Silva, N. (2021) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2020.0865 · Cited by 35
“Gottesman-Chuang [6] introduced the technique of quantum gate teleportation, a variation on standard quantum teleportation, that enables performing certain non-Clifford gates on an input state once given access to an appropriate magic state.”
MethodDirectly Measuring a Multiparticle Quantum Wave Function via Quantum Teleportation
Chen, M.-C., Li, Y., Liu, R., Wu, D., Su, Z.-E., Wang, X., Li, L., Liu, N.-L., Lu, C., & Pan, J.-W. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.030402 · Cited by 18
Critical Analysis of Big Data Privacy Preservation Techniques and Challenges
Madan, S., Bhardwaj, K., & Gupta, S. (2021) · Advances in intelligent systems and computing · doi:10.1007/978-981-16-3071-2_23 · Cited by 16
Towards quantum state preparation with materials science: An analytical review
Sood, V., & Chauhan, R. P. (2023) · International Journal of Quantum Chemistry · doi:10.1002/qua.27148 · Cited by 17
Miyazaki, J., Hajdušek, M., & Murao, M. (2015) · Physical Review A · doi:10.1103/physreva.91.052302 · Cited by 16
Cluster-based architecture for fault-tolerant quantum computation
Fujii, K., & Yamamoto, K. (2010) · Physical Review A · doi:10.1103/physreva.81.042324 · Cited by 20
Coherent manipulation of single quantum systems in the solid state
Childress, L. (2007) · Cited by 26
Error rates and resource overheads of encoded three-qubit gates
Takagi, R., Yoder, T. J., & Chuang, I. L. (2017) · Physical Review A · doi:10.1103/physreva.96.042302 · Cited by 19
Self-citationEntanglement in three coupled harmonic oscillators
Merdaci, A., & Jellal, A. (2019) · Physics Letters A · doi:10.1016/j.physleta.2019.126134 · Cited by 21
Characterising port-based teleportation as universal simulator of qubit channels
Pereira, J. L., Banchi, L., & Pirandola, S. (2021) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/abe67a · Cited by 19
“Such protocols have applications in quantum communications protocols (for example, superdense coding [4]) as well as in quantum computing (quantum gate teleportation [11]), and they can be used as a mathematical tool for the simulation of quantum channels [12, 13] and quantum networks [14, 15].”
MethodSecure multiparty quantum computation with few qubits
Lipińska, V., Ribeiro, J., & Wehner, S. (2020) · Physical Review A · doi:10.1103/physreva.102.022405 · Cited by 23
Ghiu, I., Bourennane, M., & Karlsson, A. (2001) · Physics Letters A · doi:10.1016/s0375-9601(01)00446-7 · Cited by 17
Some entanglement features of a three-atom Tavis–Cummings model: a cooperative case
Youssef, M., METWALLY, N., & Obada, A. ‐. F. (2010) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/0953-4075/43/9/095501 · Cited by 17
Rotational abstractions for verification of quantum Fourier transform circuits
Govindankutty, A., Srinivasan, S. K., & Mathure, N. (2023) · IET Quantum Communication · doi:10.1049/qtc2.12055 · Cited by 15
“The race to build large scale Quantum computers with 1,000 qubits and beyond is in full steam [1] [2].”
Background
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.