Degree Balance as a Fine-Grained Complexity Boundary for Quantum SAT

arXiv:2609.36464 · quant-ph, cs.CC, cs.DS · Submitted 2026-09-29 · Read on arXiv

quant-ph, cs.CC, cs.DS

Submitted: 2026-09-29

Updated: 2026-09-29

Terminology

• Frustration — 26× in this paper · explained in 2 episodes
• Verification — 15× in this paper · explained in 2 episodes
• Ancilla Qubits — 14× in this paper · explained in 1 episode
• Hilbert Space — 6× in this paper · explained in 2 episodes
• Strong Exponential Time Hypothesis — 5× in this paper
• Effective Hamiltonian — 2× in this paper · explained in 2 episodes
• Pruning — 1× in this paper · explained in 4 episodes
• Sparsity — 1× in this paper · explained in 4 episodes

Sources

• Efficient algorithm for a quantum analogue of 2-SAT
• Quantum Computing: Lecture Notes
• Dequantizing Short-Path Quantum Algorithms
• Achieving perfect completeness for one- and two-message quantum proof systems

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