Skip to main content
v2026.1714 entries · CC-BY 4.0
CASRAI

Data science & AI · Reference

What is quantum computing?

Quantum computing is a form of computation that uses the principles of quantum mechanics — such as superposition and entanglement — to process information in ways that classical computers cannot efficiently replicate for certain problems.

Qubits, superposition and entanglement

A classical computer stores information in bits, each definitely 0 or 1. A quantum computer uses qubits, which by superposition can exist in a combination of 0 and 1 until measured. Entanglement links qubits so that the state of one is correlated with another, even at a distance, and interference lets amplitudes reinforce or cancel. These properties let a quantum computer represent and manipulate a large space of possibilities at once — but measurement yields only a definite outcome, so algorithms must be designed to make the right answer likely.

How quantum computers differ from classical

Quantum computing does not make every task faster. Its advantage is confined to problems with structure that quantum algorithms can exploit.

Notable examples include Shor's algorithm (1994) for factoring large integers, which has implications for cryptography, and Grover's algorithm (1996) for searching unstructured data. For most everyday computing, classical computers remain more practical, and quantum machines are best understood as specialised, complementary devices rather than universal replacements.

Current status

Quantum computing is an emerging technology. Today's devices are often described as noisy intermediate-scale quantum (NISQ) machines: they have limited numbers of qubits that are prone to errors from decoherence and noise. A major research goal is quantum error correction, which would combine many physical qubits into more reliable logical qubits. Claims of "quantum advantage" on narrowly defined tasks have been reported, but a large-scale, fault-tolerant quantum computer for general practical problems does not yet exist. The field warrants sober, evidence-based description rather than hype.

Relevance to research

For research computing, quantum methods are studied as potential tools for simulating quantum systems in chemistry and materials science, for certain optimisation problems, and for parts of machine learning. At present these are largely exploratory. Researchers also study the implications for cryptography: because a sufficiently powerful quantum computer could break some widely used encryption, work on post-quantum cryptography — classical algorithms resistant to quantum attack — is underway, with standards being developed by bodies such as NIST.

Key facts

At a glance

  • Basis: quantum mechanics (superposition, entanglement, interference)
  • Basic unit: the qubit (vs the classical bit)
  • Advantage: limited to specific structured problems
  • Shor's algorithm (1994): integer factoring
  • Grover's algorithm (1996): unstructured search
  • Current era: noisy intermediate-scale quantum (NISQ)

Common questions

FAQ

What is a qubit?+

A qubit is the basic unit of quantum information. Unlike a classical bit, which is either 0 or 1, a qubit can be in a superposition of both states until it is measured, which is one source of a quantum computer's distinctive behaviour.

Is quantum computing faster than classical computing?+

Only for certain problems. Quantum algorithms offer advantages on specific structured tasks, such as factoring or some simulations, but for most everyday computing classical computers remain more practical. Quantum machines are specialised, not universal replacements.

Does a practical large-scale quantum computer exist yet?+

No. Current devices are noisy and limited in scale. Building a large, fault-tolerant quantum computer for general practical problems remains an open research challenge, and claims should be assessed soberly against the specific task demonstrated.

The step most authors miss

Doing CRediT right? Don’t stop at the statement.

A CRediT statement credits you inside one paper. The recognition CRediT was built for happens when those roles are tied to you, persistently. Sign in with your ORCID — free — and claim your CRediT contributions on casrai.org, the home of the standard. They become a verified, portable part of your identity, not a line that disappears into one PDF.

Free: claim your contributions, then export a journal-ready CRediT statement, schema.org structured data, JATS XML, CSV or BibTeX — and preview your public profile. A membership publishes that profile publicly and verifies the journals you serve.

Referenced across the research world

University of Cambridge logoColumbia University logoUniversity of Edinburgh logoHarvard University logoUniversity of Oxford logoPrinceton University logoStanford School of Medicine logoUniversity College London logoORCID logoCrossref logoUniversity of Cambridge logoColumbia University logoUniversity of Edinburgh logoHarvard University logoUniversity of Oxford logoPrinceton University logoStanford School of Medicine logoUniversity College London logoORCID logoCrossref logo
  • University of Cambridge logo
  • Columbia University logo
  • University of Edinburgh logo
  • Harvard University logo
  • University of Oxford logo
  • Princeton University logo
  • Stanford School of Medicine logo
  • University College London logo
  • ORCID logo
  • Crossref logo

View CASRAI adoption →