Quantum algorithm approximates k-th spectral gap Δ_k and midpoint μ_k of Hermitian matrix to εΔ_k error with O(N²/(ε² Δ_k²) polylog) QRAM complexity, claiming speedup for large gaps, plus Ω(N²) black-box lower bound.
The varia- tional quantum eigensolver: a review of methods and best practices.Physics Reports, 986:1–128, 2022
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Spectral Gaps with Quantum Counting Queries and Oblivious State Preparation
Quantum algorithm approximates k-th spectral gap Δ_k and midpoint μ_k of Hermitian matrix to εΔ_k error with O(N²/(ε² Δ_k²) polylog) QRAM complexity, claiming speedup for large gaps, plus Ω(N²) black-box lower bound.