Realizable Universal Quantum Logic Gates
Abstract
We identify a 2-bit quantum gate that is sufficient to build any quantum logic network. The existence of such a 2-bit universal gate considerably simplifies the search for physical realizations of quantum computational networks. We propose an explicit construction of this gate, which is based on cavity QED techniques and may be realizable with current technology.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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?
A wide variety of physical systems-ranging from nearest neighbor Ising models to quantum electrodynamics and conformal field theories-are known to be computationally universal.
“Although computational universality might at first seem to be a stringent demand on a physical system, a wide variety of physical systems - ranging from nearest neighbor Ising models 52 to quantum electrodynamics 84 and conformal field theories 86 - are known to be computationally universal 51 -53 , 55 -65 .”
From Ultimate physical limits to computation (2000) · cites this paper as [58]
Cites
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · see citing works
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597 · see citing works
Elementary 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 · see citing works
Self-citationQuantum Computations with Cold Trapped Ions
Cirac, J. I., & Zoller, P. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4091 · Cited by 3,733 · see citing works
Quantum mechanical Hamiltonian models of Turing machines
Benioff, P. (1982) · Journal of Statistical Physics · doi:10.1007/bf01342185 · Cited by 402 · see citing works
Structural basis of multistationary quantum systems. II. Effective few-particle dynamics
Teich, W. G., Obermayer, K., & Mahler, G. (1988) · Physical Review B · doi:10.1103/physrevb.37.8111 · Cited by 64 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472 · see citing works
Elementary 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 · see citing works
Self-citationPolynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904 · see citing works
Quantum Computations with Cold Trapped Ions
Cirac, J. I., & Zoller, P. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4091 · Cited by 3,733 · see citing works
New High-Intensity Source of Polarization-Entangled Photon Pairs
Kwiat, P. G., Mattle, K., Weinfurter, H., Zeilinger, A., Sergienko, A. V., & Shih, Y. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.4337 · Cited by 3,102 · see citing works
Self-citationLloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · see citing works
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · see citing works
DiVincenzo, D. P. (1995) · Science · doi:10.1126/science.270.5234.255 · Cited by 1,651 · see citing works
Demonstration of a Fundamental Quantum Logic Gate
Monroe, C., Meekhof, D. M., King, B. E., Itano, W. M., & Wineland, D. J. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.4714 · Cited by 1,586 · see citing works
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 · see citing works
Self-citationQuantum computation and Shor's factoring algorithm
Ekert, A., & Jozsa, R. (1996) · Reviews of Modern Physics · doi:10.1103/revmodphys.68.733 · Cited by 1,354 · see citing works
Ultimate physical limits to computation
Lloyd, S. (2000) · Nature · doi:10.1038/35023282 · Cited by 1,120 · see citing works
Lounis, B., & Orrit, M. (2005) · Reports on Progress in Physics · doi:10.1088/0034-4885/68/5/r04 · Cited by 908 · see citing works
Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
Abrams, D. S., & Lloyd, S. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.2586 · Cited by 745 · see citing works
Semiclassical Fourier Transform for Quantum Computation
Griffiths, R. B., & Niu, C.-S. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.3228 · Cited by 431 · see citing works
Geometric theory of nonlocal two-qubit operations
Zhang, J., Vala, J., Sastry, S., & Whaley, K. B. (2003) · Physical Review A · doi:10.1103/physreva.67.042313 · Cited by 415 · see citing works
Bulk quantum computation with nuclear magnetic resonance: theory and experiment
Chuang, I. L., Gershenfeld, N., Kubinec, M. G., & Leung, D. W. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0170 · Cited by 316 · see citing works
Efficient networks for quantum factoring
Beckman, D., Chari, A. N., Devabhaktuni, S., & Preskill, J. (1996) · Physical Review A · doi:10.1103/physreva.54.1034 · Cited by 268 · see citing works
Interferometric Bell-state analysis
Michler, M., Mattle, K., Weinfurter, H., & Zeilinger, A. (1996) · Physical Review A · doi:10.1103/physreva.53.r1209 · Cited by 161 · see citing works
Self-citationPostselection-free energy-time entanglement
Strekalov, D. V., Pittman, T. B., Sergienko, A. V., Shih, Y. H., & Kwiat, P. G. (1996) · Physical Review A · doi:10.1103/physreva.54.r1 · Cited by 119 · see citing works
Calculating the thermal rate constant with exponential speedup on a quantum computer
Lidar, D. A., & Wang, H. (1999) · Physical Review E · doi:10.1103/physreve.59.2429 · Cited by 115 · see citing works
Five two-qubit gates are necessary for implementing the Toffoli gate
Yu, N., Duan, R., & Ying, M. (2013) · Physical Review A · doi:10.1103/physreva.88.010304 · Cited by 77 · see citing works
Realization of a quantum algorithm using a trapped electron
Ciaramicoli, G., Marzoli, I., & Tombesi, P. (2001) · Physical Review A · doi:10.1103/physreva.63.052307 · Cited by 24 · see citing works
- Authors
- Sleator, T., & Weinfurter, H.
- Affiliations
- New York University (US)
- Universität Innsbruck (AT)
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 1995-05-15
- Volume
- 74
- Issue
- 20
- Pages
- 4087-4090
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2064109805
- Semantic Scholar
- da8f405575021581cefcb8f7f27b4285f2162d29
- Cited by
- 515
- References
- 6
- Citations by year
- 2026: 3 · 2025: 7 · 2024: 12 · 2023: 16 · 2022: 16 · 2021: 9 · 2020: 14 · 2019: 10 · 2018: 16 · 2017: 8 · 2016: 21 · 2015: 20 · 2014: 18 · 2013: 13 · 2012: 13
- FWCI
- 36.70
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Physical Review Letters (publishedVersion)
- PubMed (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- universal quantum gates, quantum computing, cavity quantum electrodynamics
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.
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
