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.
Block-encoding structured matrices for data input in quantum computing.Quantum, 8:1226, 2024
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
Encoding strategies for quantum fluid simulations trade off compactness against practicality in state preparation, measurement, boundary conditions, and nonlinear operations, with no single approach being universally optimal.
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.
-
Encoding strategies for quantum enhanced fluid simulations: opportunities and challenges
Encoding strategies for quantum fluid simulations trade off compactness against practicality in state preparation, measurement, boundary conditions, and nonlinear operations, with no single approach being universally optimal.