Material Insights · Understanding the Material World

Quantum computing

Qubits in superposition solve some problems, such as simulating molecules, far faster than bits.

Computing and AI · New paradigms · No. 294

  • Emerging
  • Readiness 5 of 9
  • System
Computing and AI · Technology

A chip cooled close to absolute zero ran in 200 seconds a task its makers said would take a supercomputer 10,000 years.

Chart: Illustration: Quantum computing

Where it comes from

Chart: Map of where it comes from

Richard Feynman proposed in 1981 that nature, being quantum, is best simulated by a quantum computer. Peter Shor's factoring algorithm of 1994 showed what such machines could break, and drew in governments and companies.

Three things to know
  1. Feynman proposed in 1981 that a computer built from quantum parts could simulate quantum physics.
  2. Since September 2024 the United States has controlled the export of quantum computers under a new entry, 4A906, in step with partner countries.
  3. Google has shown that each enlargement of its error-correcting code cut the error rate by a factor of about 2.1.
The journey
  1. 1 QubitA tiny superconducting circuit, ion or atom is made to hold two quantum states
  2. 2 CoolingSuperconducting chips sit in a dilution refrigerator near absolute zero
  3. 3 GatesMicrowave or laser pulses put qubits in superposition and entangle them
  4. 4 CorrectionGroups of physical qubits are combined into more reliable logical qubits
  5. 5 ReadoutMeasuring the qubits gives a result, repeated many times to build up an answer
Go deeper pick a tab to open it in full