Improved Quantum Query Bounds for Boolean Matrix Product Verification

arXiv:2609.40180 · quant-ph, cs.DS · Submitted 2026-09-30 · Read on arXiv

quant-ph, cs.DS

Submitted: 2026-09-30

Updated: 2026-10-05

Terminology

• Orthogonal Vectors — 37× in this paper
• Verification — 37× in this paper · explained in 2 episodes
• Query Complexity — 20× in this paper · explained in 2 episodes
• Adjacency Matrix — 9× in this paper · explained in 1 episode
• Spectral Gap — 3× in this paper · explained in 5 episodes
• ACM-SIAM Symposium on Discrete Algorithms — 1× in this paper
• Accuracy — 1× in this paper · explained in 1 episode
• Adam — 1× in this paper · explained in 2 episodes
• Approximation Bound — 1× in this paper · explained in 1 episode
• Generative AI — 1× in this paper · explained in 2 episodes

Sources

• Quantum algorithms and lower bounds for eccentricity, radius, and diameter in undirected graphs

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