TopicBeginnerEstablished concept

Bit vs Qubit

Bit vs Qubit

A classical bit takes the value 0 or 1, whereas a qubitQubit: The qubit is the unit of quantum information: a two-level system whose state is a unit vector α0⟩+β1⟩ in ℂ^2.'s state is $\alpha|0\rangle+\beta|1\rangle$ with complex amplitudes, yet measuring it returns only a single bit.

A bit is a system with two distinct states, 0 and 1. A qubit, or quantum bit, is a two-level quantum system whose general state is $$|\psi\rangle=\alpha|0\rangle+\beta|1\rangle,\qquad |\alpha|^2+|\beta|^2=1,$$ where $|0\rangle$ and $|1\rangle$ are the computational basis states and $\alpha,\beta\in\mathbb{C}$. Physical examples include two energy levels in a superconducting circuit, two levels in a trapped ion, or the polarisation of a photon.

Because the global phase is not observable, any pure state can be written as $\cos\tfrac{\theta}{2}|0\rangle+e^{i\varphi}\sin\tfrac{\theta}{2}|1\rangle$, i.e. with two real numbers that represent a point on the Bloch sphereBloch Sphere: The Bloch sphere is a geometric representation of single-qubit states: pure states are points on the surface of a unit sphere, mixed states are points inside it, and sin…. This may suggest that a qubit "stores" an infinite amount of information, a common mistake: when the qubit is measured in the computational basis we get 0 with probability $|\alpha|^2$ or 1 with probability $|\beta|^2$, and the state collapses to the outcome. $\alpha$ and $\beta$ cannot be extracted from a single copy; many copies must be prepared and measured (state tomography) to estimate them statistically.

This fact is stated precisely by the Holevo bound: no more than $n$ classical bits can be transmitted by sending $n$ qubits if the two parties share no prior entanglement. Superdense codingSuperdense Coding: Superdense coding sends two classical bits by transmitting a single qubit, provided an entangled pair was shared in advance; it is the logical "counterpart" of teleporta… sends two bits with one qubit, but it consumes a pre-shared entangled pair, so it does not contradict the bound.

So the difference is not in the "amount" of readable information, but in the structure of the computation: a qubit can be in superposition, several qubits can become entangled, gates act linearly on all amplitudes together, and the interference between them is what algorithms exploit. Similarly, $n$ classical bits are in one of $2^n$ states at any moment, while the state of $n$ qubits needs $2^n$ amplitudes to describe it.

Geometrically, the pure states of a qubit correspond to the points of the surface of the Bloch sphere, with $|0\rangle$ and $|1\rangle$ at its north and south poles, and orthogonal states at opposite ends of a diameter. A probabilistic classical bit is represented by a point on a line segment between 0 and 1. This geometric difference, the existence of extra phase directions, is what rotation gates and interference exploit.

|0⟩|1⟩θφ|ψ⟩
Bloch sphere: the qubit state is a vector on the sphere's surface with two angles θ and φ

Mathematical formulation

$$|\psi\rangle=\alpha|0\rangle+\beta|1\rangle,\quad |\alpha|^2+|\beta|^2=1$$

Worked example

Let $|\psi\rangle=\tfrac{\sqrt3}{2}|0\rangle+\tfrac12|1\rangle$.

  1. Checking normalisation: $\tfrac34+\tfrac14=1$.
  1. Measurement probabilities: $P(0)=\tfrac34=0.75$ and $P(1)=\tfrac14=0.25$. After measurement the state becomes $|0\rangle$ or $|1\rangle$ and no trace of $\alpha,\beta$ remains.
  1. Bloch angles: $\cos\tfrac{\theta}{2}=\tfrac{\sqrt3}{2}$, so $\theta=\tfrac{\pi}{3}$ (60°), and $\varphi=0$. It can be prepared from $|0\rangle$ with an $R_Y(\pi/3)$ gate.

Try it yourself: Qubit Simulator

Loading the simulator…

The full experiment page

Test your understanding

The quiz needs JavaScript.

Related topics

References

  1. 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.
  2. Microsoft (2025). The Qubit in Quantum Computing. Azure Quantum documentation learn.microsoft.com
  3. John Watrous / IBM Quantum (2025). Basics of Quantum Information (course). IBM Quantum Learning quantum.cloud.ibm.com