Optimal Joint Bounds for Sparse Ground-State Energy Estimation and Ground-State Preparation

Understand this faster with AI
Quantum Physics arXiv:2611.23387 (quant-ph) [Submitted on 17 Nov 2026] Title:Optimal Joint Bounds for Sparse Ground-State Energy Estimation and Ground-State Preparation Authors:Dhrumil Patel View a PDF of the paper titled Optimal Joint Bounds for Sparse Ground-State Energy Estimation and Ground-State Preparation, by Dhrumil Patel View PDF HTML (experimental) Abstract:Ground-state energy estimation (GSEE) and ground-state preparation (GSP) are fundamental problems in quantum computing. Given a Hamiltonian $H$ with $\|H\|\le1$ and a guiding state $|\psi\rangle$ with overlap at least $\gamma>0$ with the ground space of $H$, the goal in GSEE is to estimate the ground-state energy of $H$ to additive error $\delta$ with failure probability at most $\varepsilon$, while in GSP it is to prepare a state with ground-space weight at least $1-\varepsilon$, given a gap lower bound $\Delta$. Their costs are measured by quantum query complexity, i.e., the number of oracle calls needed to access $H$. Recent work proved optimal bounds $\Theta(\log(1/\varepsilon)/(\gamma\delta))$ for GSEE and $\Theta(\log(1/\varepsilon)/(\gamma\Delta))$ for GSP in the time-evolution and block-encoding models. However, these models do not directly account for the sparsity of $H$, measured by the maximum number $s$ of nonzero entries in any row or column. In the sparse-access model, oracles instead return the locations and values of these entries. This introduces the additional parameter $s$, and it remained open how query complexity depends jointly on $s$, $\gamma$, $\delta$ or $\Delta$, and $\varepsilon$. We resolve this by proving sparse-query lower bounds $\Omega(\sqrt{s}\log(1/\varepsilon)/(\gamma\delta))$ for GSEE and $\Omega(\sqrt{s}\log(1/\varepsilon)/(\gamma\Delta))$ for GSP, even for stoquastic Hamiltonians. We also show that these constructions recover the earlier time-evolution and block-encoding lower-bound scalings. We then give matching upper-bound algorithms in the reversible in-place sparse-location model. Thus, we obtain $\Theta(\sqrt{s}\log(1/\varepsilon)/(\gamma\delta))$ for GSEE and $\Theta(\sqrt{s}\log(1/\varepsilon)/(\gamma\Delta))$ for GSP, showing that $\sqrt{s}$ is necessary and sufficient and completing the joint dependence on all problem parameters. Comments: Subjects: Quantum Physics (quant-ph); Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS) Cite as: arXiv:2611.23387 [quant-ph] (or arXiv:2611.23387v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2611.23387 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Dhrumil Patel [view email] [v1] Tue, 17 Nov 2026 19:00:05 UTC (75 KB) Full-text links: Access Paper: View a PDF of the paper titled Optimal Joint Bounds for Sparse Ground-State Energy Estimation and Ground-State Preparation, by Dhrumil PatelView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-11 Change to browse by: cs cs.CC cs.DS References & Citations INSPIRE HEP SciXGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
Tags
Source Information
Discussion
0 professional contributions
Sign in to join this professional discussion.
Be the first to add a constructive contribution.
