The DOI matches its Crossref record.
Classical and Quantum Computation
Abstract
Introduction Classical computation Quantum computation Solutions Elementary number theory Bibliography Index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
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?
In the citing paper
“It is now known that this problem -along with many others -is Quantum Merlin -Arthur (QMA)-complete. 79,80”
From Quantum algorithms: an overview (2016) · cites this paper as [79]
In the citing paper
“most of the available quantum processors utilize gate-based models of quantum computation34,35 for realizing desired computations.”
In the citing paper
“Despite these pessimistic beliefs, Shor discovered a scheme to reduce the effect of decoherence[63].”
From Fault-Tolerant Quantum Computation with Constant Error Rate (2008) · cites this paper as [63]
In the citing paper
“A diverse set of experimental groups worldwide have already implemented various variational quantum algorithms on their physical systems 52-59 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [54]
Citations
Cites
Still being checked.
Cited by
Non-Abelian anyons and topological quantum computation
Nayak, C., Simon, S. H., Stern, A., Freedman, M., & Das Sarma, S. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1083 · Cited by 6,861
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Error bounds for approximations with deep ReLU networks
Yarotsky, D. (2017) · Neural Networks · doi:10.1016/j.neunet.2017.07.002 · Cited by 1,085
Quantum algorithms: an overview
Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071
Metadata
- Authors
- Kitaev, A., Shen, A., & Vyalyi, M.
- Affiliations
- California Institute of Technology (US)
- Independent University of Moscow (RU)
- Venue
- Graduate Studies in Mathematics
- Publisher
- American Mathematical Society
- Published
- 2002-05-31
- ISSN
- 1065-7339 (ISSN-L)
- OpenAlex
- W2084019889
- Cited by
- 1,387
- References
- 0
- Citations by year
- 2026: 40 · 2025: 85 · 2024: 85 · 2023: 85 · 2022: 68 · 2021: 93 · 2020: 74 · 2019: 72 · 2018: 58 · 2017: 46 · 2016: 49 · 2015: 62 · 2014: 51 · 2013: 59 · 2012: 58
- FWCI
- 6.61
- Type
- book
- Language
- en
- Open access
- closed
- Locations
- Graduate studies in mathematics (publishedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- 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 › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Keywords
- classical computing, quantum computing, elementary number theory, quantum algorithms, computational complexity
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Classical and Quantum Computation. https://app.cochat.ai/papers/10.1090/gsm/047
- The paper
- Kitaev, A., Shen, A., & Vyalyi, M. (2002). Classical and Quantum Computation. Graduate Studies in Mathematics. https://doi.org/10.1090/gsm/047
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.