Quantum state preparation with polynomial resources: Branched-Subspaces Adiabatic Preparation (B-SAP)
Davide Cugini, Giacomo Guarnieri, Mario Motta, Dario Gerace
TL;DR
The paper tackles the challenge of efficiently preparing ground, excited, and thermal states in many-body quantum systems under limited resources. It introduces Branched-Subspaces Adiabatic Preparation (B-SAP), a hybrid framework that leverages group-theoretic irreps to explore degenerate subspaces with a polynomially bounded parameter set, followed by adiabatic evolution and classical post-processing via MC-VQE. Applied to the XYZ Heisenberg model, B-SAP achieves accurate low-energy eigenstates with circuit depths that scale polynomially with system size, and demonstrates improved performance for excited states over conventional AP. The work suggests broad implications for practical quantum simulations on near-term devices and provides a pathway toward efficient, robust state preparation beyond standard variational or adiabatic methods.
Abstract
Quantum state preparation lies at the heart of quantum computation and quantum simulations, enabling the investigation of complex manybody systems across physics, chemistry, and data science. While existing methods such as Variational Quantum Algorithms (VQAs) and Adiabatic Preparation (AP) offer viable pathways, both face substantial limitations. Here we introduce a hybrid algorithm that integrates the conceptual strengths of both VQAs and AP, enhanced via the use of group-theoretic structures and classical post-processing to approximate ground and excited states of many-body Hamiltonian models. We validate our approach by applying it to the one-dimensional XYZ Heisenberg model with periodic boundary conditions, evaluating its performance across a broad range of parameters and system sizes. Our results show accurate preparation of low-energy eigenstates, achieved with circuit depths with polynomial scaling versus system size.
