Uniform Quantum Average-Case Fine-Grained Hardness of Arithmetized k-Orthogonal Vectors
cs.CC
Submitted: 2026-11-10
Updated: 2026-11-10
Terminology
Sources
- Quantum Worst-Case to Average-Case Reduction for Matrix-Vector Multiplication
- Improved Quantum Random Self-Reduction for Linear Problems
- A Quantum Algorithm for Finding the Minimum
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?