Skip to content
DraconiticResearch
Search Sources API
182,460 studies31 sourcesUpdated 32 min ago
PreprintCC BY 4.0arXiv

Digital quantum state preparation by nucleation

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.

Related

  1. Imaginary-time-enhanced feedback-based quantum algorithms for ground-state preparation
    Thanh Nguyen Van Long, Lan Nguyen Tran, Le Bin Ho
    Physical Review ResearchPeer-reviewedPublisher termsFull textAtomic, molecular & optical physicsCrossrefDOAJAPS
  2. Quantum state preparation for weighted d-DNNF
    Steef Hegeman, Joon Hyung Lee, Alfons Laarman
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  3. Distinct Feedback-Strength Requirements for Quantum-State Ensemble Preparation under Channel-Equivalent Monitoring
    Haitao Huang, Qinglin Zhao, Xiaoyu Li
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  4. Counterdiabatic quantum optimization for efficient state preparation in the Schwinger model
    Ethan Laval, Bipasha Chakraborty, Stefano Cipolla
    arXivPreprintarXiv licenceFull textHigh-energy & particle physicsQuantum physics & quantum informationarXiv
  5. Natural proofs for quantum state preparation lower bounds
    Christine Li, Natalie Parham
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
BibTeX
@misc{sadia2026digital,
  title = {{Digital quantum state preparation by nucleation}},
  author = {Jean Paul Sadia and Morten Hjorth-Jensen and Dean Lee and Ryan LaRose},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.37527},
  eprint = {2609.37527},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.37527},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Digital quantum state preparation by nucleation
AU  - Jean Paul Sadia
AU  - Morten Hjorth-Jensen
AU  - Dean Lee
AU  - Ryan LaRose
PY  - 2026
DA  - 2026/09/29
PB  - arXiv
DO  - 10.48550/arxiv.2609.37527
UR  - https://arxiv.org/abs/2609.37527
AB  - 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.
ER  -