Quantum State Preparation
Getting the right input state into the quantum computer, a prerequisite for phase estimation, chemistry, and dynamics alike.
Why preparation is essential
Every simulation algorithm starts from an input state. Phase estimation needs an approximate eigenstate; dynamics needs a physically meaningful initial condition; chemistry needs a good ground-state guess. If the prepared state has poor overlap with the target, downstream results are unreliable. State preparation is therefore a first-class subproblem, not a setup detail.
Reference states
- Hartree-Fock: a single Slater determinant, prepared by simple bit-flips after Jordan-Wigner.
- Computational-basis states: trivial to prepare, useful as building blocks.
- Product and Gaussian states: efficiently preparable, capture uncorrelated physics.
- Superpositions with prescribed amplitudes: needed for loading distributions or wavefunctions.
Improving overlap
A Hartree-Fock reference may have low overlap with strongly correlated ground states, degrading phase estimation. Better states come from adiabatic preparation, variational optimization (using a VQE state as the phase-estimation input), or spectral filtering that projects out unwanted eigenstates. Overlap need not be large, only bounded below, but it sets the number of repetitions required.
Adiabatic and filtering approaches
Adiabatic state preparation starts in the easily-prepared ground state of a simple Hamiltonian and slowly deforms to the target, following the instantaneous ground state if the evolution is slow relative to the spectral gap. Eigenstate filtering, implemented via QSVT with a step-like polynomial, projects an input onto a chosen spectral window, amplifying the ground-state component.
Loading classical data
Some tasks require encoding a classical vector into amplitudes (for solving differential equations or machine learning). General amplitude loading can cost circuit depth linear in the vector size, potentially erasing algorithmic speedups, the notorious input problem. Structured data (smooth functions, sparse vectors) can be loaded far more cheaply. Because preparation cost can dominate or negate an algorithm's advantage, honest resource estimates always include it, and improving state preparation is an active research frontier across simulation, linear algebra, and machine learning.