The DOI matches its Crossref record.
Quantum computing: a gentle introduction
Abstract
The combination of two of the twentieth centurys most influential and revolutionary scientific theories, information theory and quantum mechanics, gave rise to a radically new view of computing and information. Quantum information processing explores the implications of using quantum mechanics instead of classical mechanics to model information and its processing. Quantum computing is not about changing the physical substrate on which computation is done from classical to quantum but about changing the notion of computation itself, at the most basic level. The fundamental unit of computation is no longer the bit but the quantum bit or qubit. This comprehensive introduction to the field offers a thorough exposition of quantum computing and the underlying concepts of quantum physics, explaining all the relevant mathematics and offering numerous examples. With its careful development of concepts and thorough explanations, the book makes quantum computing accessible to students and professionals in mathematics, computer science, and engineering. A reader with no prior knowledge of quantum physics (but with sufficient knowledge of linear algebra) will be able to gain a fluent understanding by working through the book. The text covers the basic building blocks of quantum information processing, quantum bits and quantum gates, showing their relationship to the key quantum concepts of quantum measurement, quantum state transformation, and entanglement between quantum subsystems; it treats quantum algorithms, discussing notions of complexity and describing a number of simple algorithms as well as the most significant algorithms to date; and it explores entanglement and robust quantum computation, investigating such topics as quantifying entanglement, decoherence, quantum error correction, and fault tolerance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., & Biswas, R. (2019) · Algorithms · doi:10.3390/a12020034 · Cited by 772
Advances in Magnetics Roadmap on Spin-Wave Computing
Chumak, A. V., Kabos, P., Wu, M., Abert, C., Adelmann, C., Adeyeye, A. O., Akerman, J., Aliev, F. G., Anane, A., Awad, A., et al. (2022) · IEEE Transactions on Magnetics · doi:10.1109/tmag.2022.3149664 · Cited by 477
Qubit Coupled Cluster Method: A Systematic Approach to Quantum Chemistry on a Quantum Computer
Ryabinkin, I. G., Yen, T.-C., Genin, S. N., & Izmaylov, A. F. (2018) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.8b00932 · Cited by 287
When Entanglement Meets Classical Communications: Quantum Teleportation for the Quantum Internet
Cacciapuoti, A. S., Caleffi, M., Van Meter, R., & Hanzo, L. (2020) · IEEE Transactions on Communications · doi:10.1109/tcomm.2020.2978071 · Cited by 292
Distributed quantum computing: A survey
Caleffi, M., Amoretti, M., Ferrari, D., Illiano, J., Manzalini, A., & Cacciapuoti, A. S. (2024) · Computer Networks · doi:10.1016/j.comnet.2024.110672 · Cited by 256
Metadata
- Venue
- Choice Reviews Online
- Publisher
- American Library Association
- Published
- 2011-10-01
- Volume
- 49
- Issue
- 02
- Pages
- 49-0911-49-0911
- ISSN
- 0009-4978 (ISSN-L)
- 1523-8253
- OpenAlex
- W2165384475
- Cited by
- 347
- References
- 0
- Type
- book review
- Language
- en
- Open access
- closed
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 computing: a gentle introduction. https://app.cochat.ai/papers/10.5860/choice.49-0911
- The paper
- Quantum computing: a gentle introduction. (2011). Choice Reviews Online. https://doi.org/10.5860/choice.49-0911
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.