A new universal and fault-tolerant quantum basis
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?
If quantum behavior cannot be simulated efficiently by classical systems (BPP = BQP), then increasing the noise causes a transition from quantum computational behavior to classical computational behavior.
“Suppose that indeed quantum behavior cannot be simulated efficiently by classical systems, an idea suggested by Feynmann[27] which originated quantum computation. In other words, suppose BPP = BQP . Then, increasing the noise, a transition from the quantum computational behavior to classical computational behavior occurs.”
From Fault-Tolerant Quantum Computation with Constant Error Rate (2008) · cites this paper as [27]
Cites
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830 · see citing works
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
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
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
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860 · see citing works
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424 · see citing works
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284 · see citing works
Fault-tolerant quantum computation with constant error
Aharonov, D., & Ben-Or, M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258579 · Cited by 631 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860 · see citing works
Encoding a qubit in an oscillator
Gottesman, D., Kitaev, A., & Preskill, J. (2001) · Physical Review A · doi:10.1103/physreva.64.012310 · Cited by 1,532 · see citing works
Universal Computation by Quantum Walk
Childs, A. M. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.180501 · Cited by 1,002 · see citing works
Quantum algorithms for algebraic problems
Childs, A. M., & van Dam, W. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.1 · Cited by 344 · see citing works
Quantum Universality from Magic States Distillation Applied to CSS Codes
Reichardt, B. W. (2005) · Quantum Information Processing · doi:10.1007/s11128-005-7654-8 · Cited by 143 · see citing works
Anticoncentration theorems for schemes showing a quantum speedup
Hangleiter, D., Bermejo-Vega, J., Schwarz, M., & Eisert, J. (2018) · Quantum · doi:10.22331/q-2018-05-22-65 · Cited by 58 · see citing works
The Dirac Information Carrier for Relativistic Quantum Computation
Sanders, B. C. (2026) · arXiv · doi:10.48550/arxiv.2608.11647
“Such a gate set is said to provide full single-carrier controllability if the subgroup that it generates is dense in the target unitary group with respect to the operator-norm topology [1, 16, 17].”
- Authors
- Boykin, P. O., Mor, T., Pulver, M., Roychowdhury, V., & Vatan, F.
- Affiliations
- University of California, Los Angeles (US)
- Corresponding author
- Vatan, Farrokh
- Venue
- Information Processing Letters
- Publisher
- Elsevier BV
- Published
- 2000-08
- Volume
- 75
- Issue
- 3
- Pages
- 101-107
- ISSN
- 0020-0190 (ISSN-L)
- OpenAlex
- W2159673235
- Cited by
- 194
- References
- 9
- Citations by year
- 2026: 4 · 2025: 12 · 2024: 15 · 2023: 22 · 2022: 6 · 2021: 11 · 2020: 13 · 2019: 9 · 2018: 8 · 2017: 6 · 2016: 3 · 2015: 3 · 2014: 10 · 2013: 4 · 2012: 5
- FWCI
- 2.50
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Information Processing Letters (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
- fault-tolerant quantum computing, universal quantum gate set, single-qubit gates, Hadamard gate, CNOT gate, Toffoli gate
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
