Quantum Phase Estimation
Phase estimation reads out the eigenvalue of a unitary operation as a binary number: put a counting register in superposition, apply controlled powers of the unitary so each qubit picks up a multiple of the unknown phase, then an inverse QFT converts those phases into measurable bits. It is the engine inside Shor's algorithm and most proposed quantum-chemistry algorithms — and at useful precision it needs circuit depths only a fault-tolerant machine can run.
| Task | Best classical | Quantum |
|---|---|---|
| Ground-state energy of an m-qubit Hamiltonian (worst case) | Exponential in m — the matrix has 2^m rows | Polynomial-size circuits per run, if you can prepare a state close to the eigenstate (theory; that preparation can itself be hard) |
| One extra bit of precision | n/a | One more counting qubit — and double the controlled-U applications |
What problem does phase estimation solve?
Every unitary operation U has eigenstates it leaves unchanged except for a phase: U|ψ⟩ = e^(2πiφ)|ψ⟩. Phase estimation finds φ as a binary fraction, to as many bits as you have counting qubits.
Why care about an invisible phase? Because important answers hide in eigenvalues. The energy levels of a molecule are eigenvalues of its Hamiltonian, reachable through the phases of its time-evolution operator. The period that Shor's algorithm needs is encoded in the eigenphases of modular multiplication. Phase estimation is the general-purpose tool that converts "eigenvalue of a quantum process" into "number on a screen".
The classical baseline
For a matrix you can write down, eigenvalues are routine numerical work. The problem is that an m-qubit system's matrix has 2^m rows: 40 qubits already means a trillion-row matrix. Exact methods hit a wall around 50 qubits' worth of state.
Honesty requires the flip side: classical approximation methods — Lanczos, DMRG, tensor networks, quantum Monte Carlo — are excellent for many physically relevant systems, and they keep improving. Phase estimation's advantage is proven only against exact classical computation of generic systems, not against the best classical heuristics on the systems chemists actually care about.
The quantum approach
Three moves:
- Superpose the counting register. Hadamards put n counting qubits into all 2ⁿ values at once.
- Controlled powers of U. Counting qubit k controls U^(2^k) applied to the eigenstate. By phase kickback, that qubit's relative phase becomes 2^k·φ — the register now holds φ, 2φ, 4φ… in its phases.
- Inverse QFT. This phase pattern is exactly what a QFT produces from a binary number, so the inverse QFT converts it back into bits, which you measure.
The honest caveats: you must be able to prepare the eigenstate (or a state with large overlap — otherwise you get a random mixture of eigenphases), and you must be able to implement controlled U^(2^k) efficiently. For n bits of precision the last power is U applied 2ⁿ⁻¹ times, so depth grows exponentially with precision.
Run it: estimating the phase of a P(π/4) gate
What happens when the phase doesn't fit
Same circuit estimating P(1.0), whose phase φ = 1/(2π) ≈ 0.159 is not a multiple of 1/8. Now only ~78% of shots read the nearest value (counting register 1); the rest leak into neighbouring values, mostly 2 (~11%). Three bits give three bits of precision, no more — each extra bit costs a qubit and doubles the controlled-U work.
Limitations
- Eigenstate preparation. The output is only meaningful in proportion to your overlap with the eigenstate you want. Preparing good ground-state approximations for hard molecules is an open research problem, not a solved step.
- Exponential depth in precision. n bits of phase requires ~2ⁿ controlled applications of U. Chemical accuracy (~1 milli-Hartree) implies circuit depths in the millions to billions of operations — see why depth is the binding constraint.
- Controlled time-evolution is expensive. For chemistry, U is a Hamiltonian simulation circuit; making it controlled and repeating it 2ⁿ times multiplies an already large cost.
- NISQ-incompatible. These depths are precisely why near-term work retreated to VQE, which trades phase estimation's guarantees for shallow circuits.
On hardware today
Phase estimation has been demonstrated exactly as you see it here: a few counting qubits estimating the phase of a single hand-picked gate, on superconducting, trapped-ion and photonic devices. That is a demonstration of the circuit, not of the capability — the unitary's answer was known in advance and the whole run fits in a few dozen gates.
No hardware has run phase estimation on a problem whose answer was not already easy to compute classically. Chemistry-grade phase estimation is a fault-tolerant-era algorithm on every serious roadmap. Run the 4-qubit demo in the lab and compare against today's device specs at hardware/qpus.