Computing Library › Quantum Foundations
Quantum Foundations

Why Classical Simulation of Quantum Systems Is Hard

Simulating a general quantum system classically needs memory exponential in the number of particles, motivating quantum computers.

The exponential wall

A general n-qubit state requires 2^n complex amplitudes to describe. This exponential growth of the state space is the root reason classical computers struggle to simulate quantum systems, and it is the original argument, made by Feynman, for building quantum computers in the first place.

The memory problem

Kronos motion — classical vs quantum

Storing a 50-qubit state vector needs about 2^50 complex numbers — over a petabyte. Each additional qubit doubles the requirement. Beyond roughly 50 qubits, exact state-vector simulation exceeds the memory of the largest supercomputers, and the barrier is fundamental to the representation, not a matter of better engineering.

When classical methods still work

So not every quantum computation is hard to simulate. The hard cases are highly entangled states produced by non-Clifford gates — precisely where quantum advantage is expected.

The connection to quantum advantage

A classically hard-to-simulate quantum process is a candidate for quantum speedup, because a real quantum device evolves through those states natively while a classical machine cannot track them. Simulating quantum chemistry, materials, and many-body dynamics — including strongly coupled plasmas — falls in this regime, which is why simulation is among the most promising near-term applications.

A grounded note

The exponential state space does not mean quantum computers are exponentially faster at everything. As quantum parallelism makes clear, the answer must still be extracted through interference and measurement. Simulation is favourable because the thing being computed — quantum dynamics — is itself naturally expressed by a quantum system, aligning the problem with the machine.