Quantum Phase Estimation
Quantum Phase Estimation (QPE) · Also known as: QPE, phase kickback
Quantum Phase Estimation (QPE) is a fundamental quantum subroutine that estimates the eigenvalues of a unitary operator. Developed by Alexei Kitaev in 1995, QPE combines controlled unitary evolution with the quantum Fourier transform to extract eigenvalues from quantum states with exponential precision scaling.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
QPE is used when eigenvalue estimation is a bottleneck, particularly in variational quantum algorithms (VQE) and quantum simulation. It assumes access to a quantum state close to an eigenstate and a unitary operator whose eigenvalues are to be estimated.
Strengths & limitations
- Exponentially more precise than classical methods for eigenvalue estimation.
- Polynomial number of quantum operations; scalable overhead.
- Foundational subroutine for many quantum algorithms (Shor's, quantum simulation).
- Works for general unitary operators, not limited to specific problem structures.
- Proven quantum advantage for eigenvalue estimation.
- Requires a good initial state close to an eigenstate; requires quantum state preparation.
- Controlled unitary evolution is expensive; implementing U^(2^k) requires deep circuits.
- Phase accuracy depends on number of control qubits; precision scales as O(1/2^m) for m control qubits.
- Noise and errors accumulate with controlled unitary depth, limiting practical precision.
- Classical alternatives (QR algorithm) sufficient for small eigenvalue problems.
Frequently asked
Why is quantum phase estimation exponentially more precise than classical methods?
QPE exploits quantum superposition to sample multiple powers of the unitary simultaneously, then uses the quantum Fourier transform to extract the phase. This requires O(2^m) classical evaluations but only O(m) quantum operations for m-bit precision—exponential speedup.
What is the phase kickback mechanism?
When a controlled unitary U acts on a control qubit and an eigenstate |ψ⟩ of U with eigenvalue e^(2πiφ), the phase φ is transferred to the control qubit. Repeating with powers of U creates a superposition encoding φ, which can be extracted via QFT.
How do I choose the number of control qubits?
The number of control qubits m determines the precision: eigenvalues are estimated to 2^(-m) accuracy. For chemical accuracy (~0.001 Hartree), m ≈ 10–15 qubits. This is often the bottleneck in quantum chemistry applications.
Can QPE be used on non-unitary operators?
Not directly. Non-unitary operators (like Hermitian Hamiltonians in quantum chemistry) must be encoded into unitaries via e^(iH). This requires additional quantum resources but is achievable.
What happens if the initial state is not an eigenstate?
If the state is a superposition of eigenstates, QPE measures one eigenvalue at random with probability proportional to the overlap squared. This is still useful for computing expectation values via repeated runs.
Sources
- Kitaev, A. Y. (1995). Quantum measurements and the Abelian stabilizer problem. arXiv preprint quant-ph/9511026. link ↗
- Cleve, R., Ekert, A., Macchiavello, C., Mosca, M. (1998). Quantum algorithms revisited. Proceedings of the Royal Society A, 454, 339–354. DOI: 10.1098/rspa.1998.0164 ↗
- Aspuru-Guzik, A., Love, P. J., Love, P. J. (2005). Simulated quantum computation of molecular energies. Science, 309, 1704–1707. DOI: 10.1126/science.1113479 ↗
How to cite this page
ScholarGate. (2026, June 3). Quantum Phase Estimation (QPE). ScholarGate. https://scholargate.app/en/quantum-computing/quantum-phase-estimation
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Grover's AlgorithmQuantum Computing↔ compare
- Quantum Approximate Optimization AlgorithmQuantum Computing↔ compare
- Variational Quantum EigensolverQuantum Computing↔ compare