The DOI matches its Crossref record.
Quantum Computation and Quantum Information
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
“The purity of a quantum state can be estimated through a SWAP test [17].”
From Simple formulation of no-cloning and no-hiding that admits efficient and robust verification (2024) · cites this paper as [17]
In the citing paper
“any quantum logic circuit can be realized using a combination of only single-qubit and two-qubit gates 13”
From Integrated-optics heralded controlled-NOT gate for polarization-encoded qubits (2018) · cites this paper as [13]
In the citing paper
“Quantum error correction becomes practically realizable once the physical error rate is below a threshold value that depends on the choice of quantum code, syndrome measurement circuit and decoding algorithm5.”
From High-threshold and low-overhead fault-tolerant quantum memory (2024) · cites this paper as [5]
In the citing paper
“For two unknown quantum states, ρ and σ , the following circuit performs a SWAP test of the states |0 0| H H Z ρ σ (45 ) giving Z = tr[ρσ ], for the expectation value of Pauli Z measured on the first qubit.”
From Simple formulation of no-cloning and no-hiding that admits efficient and robust verification (2024) · cites this paper as [17]
In the citing paper
“Together, these concepts-superposition, rotation, and entanglement-constitute the foundational principles of quantum computation and enable the creation of highly efficient learning models [23].”
From Enhancing Deepfake Detection Through Quantum Transfer Learning and Class-Attention Vision Transformer Architecture (2025) · cites this paper as [23]
5 more claims about this paper
Create a free account to see every claim other papers make about this one.
Citations
Cited by
Spintronics: Fundamentals and applications
Žutić, I., Fabian, J., & Das Sarma, S. (2004) · Reviews of Modern Physics · doi:10.1103/revmodphys.76.323 · Cited by 11,268
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
Kimble, H. J. (2008) · Nature · doi:10.1038/nature07127 · Cited by 6,023
Theory of open quantum systems
Xu, R., & Yan, Y. (2002) · The Journal of Chemical Physics · doi:10.1063/1.1474579 · Cited by 5,922
Electromagnetically induced transparency: Optics in coherent media
Fleischhauer, M., Imamoglu, A., & Marangos, J. P. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.77.633 · Cited by 5,189
Metadata
- Authors
- Nielsen, M. A., Chuang, I., & Grover, L. K.
- Venue
- American Journal of Physics
- Published
- 2002-05-01
- Volume
- 70
- Issue
- 5
- Pages
- 558-559
- ISSN
- 0002-9505 (ISSN-L)
- 1943-2909
- OpenAlex
- W1631356911
- Cited by
- 21,895
- References
- 0
- Citations by year
- 2026: 48 · 2025: 105 · 2024: 159 · 2023: 255 · 2022: 431 · 2021: 1141 · 2020: 1075 · 2019: 956 · 2018: 723 · 2017: 839 · 2016: 959 · 2015: 1184 · 2014: 1245 · 2013: 1212 · 2012: 1173
- Type
- book review
- Language
- en
- Open access
- closed
- Locations
- American Journal of Physics (publishedVersion)
- 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
- quantum computing, quantum information, quantum mechanics, quantum algorithms
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: Quantum Computation and Quantum Information. https://app.cochat.ai/papers/10.1119/1.1463744
- The paper
- Nielsen, M. A., Chuang, I., & Grover, L. K. (2002). Quantum Computation and Quantum Information. American Journal of Physics. https://doi.org/10.1119/1.1463744
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.