What is quantum computing, in short?
Computing with qubits governed by quantum mechanics (superposition, entanglement, interference) to solve certain problems in ways classical computers cannot.
Quantum Computing is a model of computation whose basic unit is the Qubit, whose state is a vector in a Hilbert space that evolves under unitary gates and is then measured. Three phenomena distinguish it: Superposition, Entanglement, and Interference, which allows the amplitudes of correct answers to be reinforced and those of wrong answers to be weakened.
A quantum computer is not “a computer that is faster at everything”. The advantage is known for specific problems: factoring numbers (Shor), unstructured search with a quadratic speed-up (Grover), simulating quantum systems, and some oracle problems. For many everyday tasks there is no known advantage. Current devices are small and suffer from noise, so most learning, including this lab, takes place on classical simulators.
Related topics
References
- Michael A. Nielsen; Isaac L. Chuang (2010). Quantum Computation and Quantum Information (10th Anniversary Edition). Cambridge University Press doi:10.1017/CBO9780511976667The standard reference for quantum computing; the Crossref record gives 2012 for the Cambridge Core online edition.
- John Watrous / IBM Quantum (2025). Basics of Quantum Information (course). IBM Quantum Learning quantum.cloud.ibm.com
