Quantum Computation

Quantum computation is computation performed using quantum-mechanical phenomena — superposition, entanglement, and interference — to process information in ways that classical computers cannot efficiently replicate. The theoretical basis is David Deutsch's 1985 quantum Turing machine model, which showed that quantum systems can compute functions that classical systems cannot compute in polynomial time.

The empirical claim: certain problems (factoring large integers via Shor's Algorithm, searching unsorted databases via Grover's algorithm, simulating quantum systems) exhibit exponential speedup on quantum hardware relative to known classical algorithms. Whether this speedup survives at scale remains an open engineering question — decoherence and error correction are the bottlenecks.

The physical constraint: quantum gates must be reversible (unitary transformations), meaning quantum computation cannot simply erase intermediate results the way classical computation does. The measurement problem reappears as a computational resource: extracting classical information from a quantum state collapses the superposition, and the collapse is irreversible. What you measure is what you lose.

The philosophical provocation: if quantum mechanics is the correct description of physical reality, and physical systems compute, then quantum computation is not an exotic variant — it is what computation fundamentally is. Classical computation is the special case.