CoChat
Sign Up
Cited by 1,391Quantum Information and CryptographyQuantum Computing Algorithms and ArchitectureQuantum Mechanics and Applications

Quantum computing

Open access
Steane, Andrew·1998·Reports on Progress in Physics
DOI 10.1088/0034-4885/61/2/002
Open this paper in CoChat — free accountOpen PDF

Abstract

The subject of quantum computing brings together ideas from classical information theory, computer science, and quantum physics. This review aims to summarize not just quantum computing, but the whole subject of quantum information theory. Information can be identified as the most general thing which must propagate from a cause to an effect. It therefore has a fundamentally important role in the science of physics. However, the mathematical treatment of information, especially information processing, is quite recent, dating from the mid-20th century. This has meant that the full significance of information as a basic concept in physics is only now being discovered. This is especially true in quantum mechanics. The theory of quantum information and computing puts this significance on a firm footing, and has led to some profound and exciting new insights into the natural world. Among these are the use of quantum states to permit the secure transmission of classical information (quantum cryptography), the use of quantum entanglement to permit reliable transmission of quantum states (teleportation), the possibility of preserving quantum coherence in the presence of irreversible noise processes (quantum error correction), and the use of controlled quantum evolution for efficient computation (quantum computation). The common theme of all these insights is the use of quantum entanglement as a computational resource. It turns out that information theory and quantum mechanics fit together very well. In order to explain their relationship, this review begins with an introduction to classical information theory and computer science, including Shannon's theorem, error correcting codes, Turing machines and computational complexity. The principles of quantum mechanics are then outlined, and the Einstein, Podolsky and Rosen (EPR) experiment described. The EPR-Bell correlations, and quantum entanglement in general, form the essential new ingredient which distinguishes quantum from classical information theory and, arguably, quantum from classical physics. Basic quantum information ideas are next outlined, including qubits and data compression, quantum gates, the `no cloning' property and teleportation. Quantum cryptography is briefly sketched. The universal quantum computer (QC) is described, based on the Church-Turing principle and a network model of computation. Algorithms for such a computer are discussed, especially those for finding the period of a function, and searching a random list. Such algorithms prove that a QC of sufficiently precise construction is not only fundamentally different from any computer which can only manipulate classical information, but can compute a small class of functions with greater efficiency. This implies that some important computational tasks are impossible for any device apart from a QC. To build a universal QC is well beyond the abilities of current technology. However, the principles of quantum information physics can be tested on smaller devices. The current experimental situation is reviewed, with emphasis on the linear ion trap, high- Q optical cavities, and nuclear magnetic resonance methods. These allow coherent control in a Hilbert space of eight dimensions (three qubits) and should be extendable up to a thousand or more dimensions (10 qubits). Among other things, these systems will allow the feasibility of quantum computing to be assessed. In fact such experiments are so difficult that it seemed likely until recently that a practically useful QC (requiring, say, 1000 qubits) was actually ruled out by considerations of experimental imprecision and the unavoidable coupling between any system and its environment. However, a further fundamental part of quantum information physics provides a solution to this impasse. This is quantum error correction (QEC). An introduction to QEC is provided. The evolution of the QC is restricted to a carefully chosen subspace of its Hilbert space. Errors are almost certain to cause a departure from this subspace. QEC provides a means to detect and undo such departures without upsetting the quantum computation. This achieves the apparently impossible, since the computation preserves quantum coherence even though during its course all the qubits in the computer will have relaxed spontaneously many times. The review concludes with an outline of the main features of quantum information physics and avenues for future research.

Integrity signals

Registry

Crossref · 10.1088/0034-4885/61/2/002

Cites

31 of 31 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • Quantum computers use superposition and entanglement to perform complex computations more efficiently or exponentially faster than classical computers.

    “Quantum computers use superposition and entanglement to perform complex computations more efficiently or “exponentially” faster than classical computers (Steane, 1998).”

    From Quantum technology for development framework as a tool for science diplomacy (2023) · cites this paper as Steane, 1998

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Steane, A.
Affiliations
University of Oxford (GB)
Corresponding author
Steane, Andrew
ORCID
Steane, Andrew
Venue
Reports on Progress in Physics
Publisher
IOP Publishing
Published
1998-02-01
Volume
61
Issue
2
Pages
117-173
ISSN
  • 0034-4885 (ISSN-L)
  • 1361-6633
DOI
10.1088/0034-4885/61/2/002
OpenAlex
W3037315640
Cited by
1,391
References
31
Citations by year
2026: 66 · 2025: 126 · 2024: 97 · 2023: 90 · 2022: 75 · 2021: 60 · 2020: 39 · 2019: 36 · 2018: 33 · 2017: 25 · 2016: 16 · 2015: 18 · 2014: 15 · 2013: 26 · 2012: 25
FWCI
111.83
Type
journal article
Language
en
Open access
Locations
  • Reports on Progress in Physics (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
quantum computing, quantum information, quantum entanglement, quantum cryptography, quantum teleportation, quantum error correction, qubits, no-cloning theorem, quantum gates, quantum algorithms, Shor's algorithm, Grover's algorithm, computational complexity, linear ion trap, optical resonators, nuclear magnetic resonance

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