A Near-Optimal Joint Lower Bound for Sparse Quantum Linear System Solvers

arXiv:2609.22445 · quant-ph · Submitted 2026-09-18 · Read on arXiv

quant-ph

Submitted: 2026-09-18

Updated: 2026-09-18

Comments: 21 pages

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Sparsity — 16× in this paper · explained in 4 episodes
• Query Complexity — 14× in this paper · explained in 2 episodes
• Trace — 4× in this paper · explained in 2 episodes
• Adjacency Matrix — 3× in this paper · explained in 1 episode
• Algorithmic Primitives — 2× in this paper · explained in 1 episode
• Block Encoding — 2× in this paper · explained in 4 episodes
• Hilbert Space — 2× in this paper · explained in 2 episodes
• Trace Distance — 2× in this paper · explained in 3 episodes
• Decode — 1× in this paper · explained in 2 episodes

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