Digital quantum state preparation by nucleation
quant-ph
Submitted: 2026-09-29
Updated: 2026-09-29
Comments: 10 pages, 7 figures
License: http://creativecommons.org/licenses/by/4.0/
The gist: Quantum state preparation is crucial for quantum algorithms, and improved state preparation methods can reduce resource requirements by orders of magnitude.
Terminology
Abstract
Quantum state preparation is crucial for quantum algorithms, and improved state preparation methods can reduce resource requirements by orders of magnitude. In this work, we introduce a state preparation method for lattice Hamiltonians on digital quantum computers inspired by nucleation. In our method, the exact ground state of a small lattice Hamiltonian is prepared in a quantum circuit, then a series of growth stages are performed via Trotterized adiabatic evolution to increase the size of the lattice to the desired model. Using the adiabatic theorem and Trotter error bounds, we provide sufficient conditions on the total evolution time and number of Trotter steps required for nucleation to prepare an initial state with desired fidelity. In addition, we introduce optimized nucleation which considers variational optimization on top of the nucleation structure. For a two-dimensional Ising model, we show that optimized nucleation can outperform a current leading method for state preparation on digital quantum computers.
Sources
- Quantum measurements and the Abelian Stabilizer Problem
- Analysis of quantum Krylov algorithms with errors
- Sequential Generation of Matrix-Product States in Cavity QED
- Encoding of Matrix Product States into Quantum Circuits of One- and Two-Qubit Gates
- QFactor: A Domain-Specific Optimizer for Quantum Circuit Instantiation
- Quantum State Preparation with Resolution Refinement
- The density-matrix renormalization group in the age of matrix product states
- A class of quantum many-body states that can be efficiently simulated
- Adiabatic ground state preparation in an expanding lattice
- Site-by-site quantum state preparation algorithm for preparing vacua of fermionic lattice field theories
- Layerwise learning for quantum neural networks
- Barren plateaus in quantum neural network training landscapes
- Hierarchical Fusion Method for Scalable Quantum Eigenstate Preparation
- Quantum Computing in the NISQ era and beyond
- Beyond NISQ: The Megaquop Machine
- Mitiq: A software package for error mitigation on noisy quantum computers
- Quantum Algorithms for Quantum Field Theories
- Quantum Algorithms for Fermionic Quantum Field Theories
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians