Improved Quantum Random Self-Reduction for Linear Problems

arXiv:2609.39823 · quant-ph, cs.CC · Submitted 2026-09-30 · Read on arXiv

quant-ph, cs.CC

Submitted: 2026-09-30

Updated: 2026-09-30

Terminology

• Verifier — 51× in this paper · explained in 2 episodes
• Verification — 38× in this paper · explained in 2 episodes
• Consistency — 19× in this paper · explained in 3 episodes
• Core — 2× in this paper · explained in 2 episodes
• Fingerprinting — 2× in this paper · explained in 2 episodes
• Sparsity — 2× in this paper · explained in 4 episodes
• Annual ACM-SIAM Symposium on Discrete Algorithms — 1× in this paper
• Arbitrary Superpositions — 1× in this paper · explained in 1 episode
• Proceedings of Symposium on Theory of Computing — 1× in this paper

Sources

• Quantum Worst-Case to Average-Case Reduction for Matrix-Vector Multiplication

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