arXiv (All)
open access
Optimal Query Complexity for Ground-State Preparation
We determine the optimal query complexity of ground-state preparation to trace-distance error $\varepsilon$ when an energy threshold in the spectral gap is known. Let $U_H$ be an $α$-block-encoding of a Hamiltonian with unique ground state $|ψ_0\rangle$, and suppose $|\langleψ_0|U_I|0\rangle|\geγ$ f
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Ground and excited-state energies with analytic errors and short time evolution on a quantum computer#629798
- Ground and excited-state energies with analytic errors and short time evolution on a quantum computer#627936
- Preparation of Hamming-Weight-Preserving Quantum States with Log-Depth Quantum Circuits#1131408
- Fundamental error bound for entanglement generation between interacting Rydberg atoms#635697
- Fundamental error bound for entanglement generation between interacting Rydberg atoms#633348
Record · ID 1130321
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive