← Atlas

Algorithms · Kitaev iterative phase estimation

Iterative phase estimation

Estimates the eigenphase of a unitary using a single reused ancilla qubit instead of a full phase-estimation register.

Strong empiricalUpdated

Open on the mapView frozen graph

A small worked example, computed in your browser. It is not a result from this record's papers.

Phase estimation of P(3*pi/4)

3 counting qubits estimating the phase of P(3π/4), which is 2π·3/8 exactly: a phase 3-bit QPE can represent exactly.

q0q1q2q3Step 1 of 4 · XXStep 2 of 4 · Hadamard layer(3)Hadamard layer(3)Step 3 of 4 · Controlled phase powers(3)Controlled phase powers(3)Step 4 of 4 · QFT inverse(3)QFT inverse(3)

Step 1 of 4 · X

Probability of each outcome after this step

  • 1000100%
  1. Puts the target qubit into |1⟩, which is an eigenstate of P(3*pi/4): applying the gate to it multiplies it by a phase and changes nothing else. That is the whole requirement QPE places on its input.

    The whole state moves from 0000 to 1000 — one certain outcome before, one certain outcome after, no superposition either side.

  2. Spreads the 3 counting qubits over all 8 values they can hold at once. Each one will later ask about a different power of the phase.

    Probability spreads from 1 outcome to 8. All 8 are equally likely.

  3. Counting qubit k applies P(3*pi/4) to the target 2^k times, controlled on itself. The target never changes — it is an eigenstate — so the phase it would have picked up is kicked back onto the control instead. This is the step that writes the answer into the register.

    The outcome probabilities do not move at all. What this step changes is phase — 8 distinct relative phases across the state now — which no measurement can see until a later step turns it back into probability.

  4. The inverse Fourier transform reads that phase pattern back out as a binary number. Phase in, bits out.

    Probability gathers from 8 outcomes onto 1. 1011 goes from 12.5% to 100.0%.

Readout The counting register reads 011 = 3 with probability 1: angle/(2π) = 3/8, recovered exactly.

Open in Studio
  • Steps3
  • Wires2
  • Ancilla qubits1 (reused across rounds)
  • Rounds (bits of precision)t = 2 (toy instance)
  • Toy phaseφ = 1/4 (U = S gate)
  • Papers2

Kitaev's iterative phase estimation (IPE) estimates the eigenphase φ\varphi of U∣ψ⟩=e2πiφ∣ψ⟩U|\psi\rangle = e^{2\pi i\varphi}|\psi\rangle using a single ancilla qubit reused across tt sequential rounds, instead of the tt ancilla qubits plus inverse-QFT used by textbook phase estimation.

Per-round structure. Round kk (starting from the most significant bit) prepares the ancilla in ∣+⟩|+\rangle, applies a controlled U2t−1−kU^{2^{t-1-k}}, applies a phase correction e−iωe^{-i\omega} built from the bits already measured in earlier rounds (the "semiclassical" feedback), applies HH, and measures. The measured bit is the kk-th bit of the binary expansion of φ\varphi. Because the ancilla is reset and reused, only one physical qubit is needed beyond the eigenstate register, at the cost of tt sequential circuit executions instead of one wide circuit.

Small worked instance. Take U=SU=S (the phase gate) acting on its eigenstate ∣1⟩|1\rangle: S∣1⟩=eiπ/2∣1⟩=e2πi(1/4)∣1⟩S|1\rangle = e^{i\pi/2}|1\rangle = e^{2\pi i (1/4)}|1\rangle, so φ=1/4\varphi=1/4. In binary, 1/4=0.0121/4 = 0.01_2 — an exact 2-bit fraction with no truncation error. Running 2-bit IPE: round 0 (most significant bit) applies controlled-U2=S2=ZU^{2}=S^2=Z and recovers bit b1=0b_1=0; round 1 applies controlled-U1=SU^1=S with the feedback phase set from b1b_1, recovering bit b0=1b_0=1. The two measured bits reconstruct φ=0.012=1/4\varphi=0.01_2=1/4 exactly, since this particular phase happens to terminate at 2 bits.

Complexity. Both textbook QPE and IPE use O(2t)O(2^t) total controlled-UU applications to resolve tt bits of φ\varphi; IPE's advantage is O(1)O(1) coherent ancilla qubits rather than O(t)O(t), which matters on hardware where qubit count, not gate count, is the binding constraint.

References

Strong empirical
  • Verified by construction
  • Small-instance agreement
  • Peer-reviewed paper
Method
The per-round circuit (Hadamard, controlled-U^2^k, classical feedback phase, Hadamard, measure) is checked against Kitaev's single-ancilla scheme, and the exact 2-bit binary expansion of a known eigenphase is derived by hand.
Result
Pass · for U=S acting on eigenstate |1> (eigenphase φ=1/4=0.01₂), the two rounds recover bits b₁=0 then b₀=1 exactly, since 1/4 has an exact 2-bit binary expansion.
Caveat
This record verifies construction and an exactly-representable toy phase; finite-precision phases requiring many rounds and real feedback logic are not re-derived here.
Arbitrary accuracy iterative phase estimation algorithm as a two qubit benchmark ↗
Kind
curated reference
Reviewed by
Leona Quantum curation pass
License
CC BY 4.0-compatible reference metadata
phase estimationkitaevsemiclassicalsingle ancilla
  • Chemistry eigenvalue estimation on low-qubit-count near-term hardware
  • Precision phase/frequency estimation in metrology experiments
  • Resource-constrained subroutine inside larger phase-estimation-based algorithms

Atlas stars stay in the public catalog. Saving this entry to your workspace starts an unstarred private copy.