What is Quantum Computing?

Overview

Quantum computing is a model of computation in which information is stored in quantum states and evolves according to the rules of quantum physics. It matters because the same physical world that limits classical devices also provides a different kind of information processing—one that uses superposition and interference rather than only deterministic bit flips.

Intuition

A classical computer represents information with bits that are either 0 or 1 at any moment. A quantum computer represents information with states that behave more like arrows (vectors) than like switches. When you combine and transform these arrows, they can reinforce or cancel each other. That reinforcement and cancellation—interference—is the central intuition.

It is helpful to think of a quantum program as a carefully controlled sequence of transformations. Instead of directly “trying many answers at once,” you prepare a state, apply transformations that reshape it, and then extract a classical answer by measuring.

Formal Description

The smallest unit of quantum information is a qubit. Formally, a qubit is described by a normalized vector in a two-dimensional complex vector space. Using the computational basis $\{|0\rangle, |1\rangle\}$, any pure qubit state can be written as

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

where $\alpha$ and $\beta$ are complex numbers called amplitudes. The connection to probabilities comes from normalization:

$$|\alpha|^2 + |\beta|^2 = 1.$$

Quantum computation (before measurement) is modeled as a sequence of reversible linear transformations. A common formal description is

$$|\psi_{\text{out}}\rangle = U|\psi_{\text{in}}\rangle,$$

where $U$ is a unitary operator (a matrix) that preserves normalization.

Finally, measurement converts a quantum state into a classical outcome. If you measure $|\psi\rangle$ in the computational basis, the outcomes are random with probabilities determined by the squared magnitudes of the amplitudes.

Worked Example

Consider a single qubit initialized to $|0\rangle$. Apply a transformation that maps $|0\rangle$ to a balanced superposition:

$$|0\rangle \mapsto \tfrac{1}{\sqrt{2}}(|0\rangle + |1\rangle).$$

Now measure in the computational basis. The probability of seeing 0 is $\tfrac{1}{2}$ and the probability of seeing 1 is $\tfrac{1}{2}$ because the amplitudes are equal in magnitude.

This example is intentionally simple: it demonstrates the basic pipeline of quantum computing—state preparation → transformation → measurement—without claiming any computational advantage yet.

Turtle Tip

Common Pitfalls

Quick Check

What’s Next

Now that you know what quantum computing is at a high level, the next question is: why bother? The next page explains what quantum computing is plausibly useful for, what it is not useful for, and why expectations need to be realistic.