Optimal Query Complexity for Ground-State Preparation
quant-ph, cs.CC, cs.DS
Submitted: 2026-09-28
Updated: 2026-10-01
Terminology
Sources
- Variations on Quantum Adversary
- Fast quantum algorithms for traversing paths of eigenstates
- A new quantum ripple-carry addition circuit
- Quantum singular value transformation without block encodings: Near-optimal complexity with minimal ancilla
- Dissipative ground state preparation and the Dissipative Quantum Eigensolver
- Multi-level quantum signal processing with applications to ground state preparation using fast-forwarded Hamiltonian evolution
- Optimal Ground-State Preparation with a Guiding State
- Quantum Algorithms for Ground-State Preparation and Green's Function Calculation
- Optimal Lower Bound for Ground-State Energy Estimation with a Guiding State
- Sharp Remez inequality
- Trade-offs between Quantum and Classical Resources in the Linear Combination of Unitaries
- Randomized Quantum Singular Value Transformation
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
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity