Hardness of Pathfinding in a Welded Tree

arXiv:2609.20651 · quant-ph, cs.CC · Submitted 2026-09-17 · Read on arXiv

quant-ph, cs.CC

Submitted: 2026-09-17

Updated: 2026-09-17

Terminology

• Verification — 8× in this paper · explained in 2 episodes
• Query Complexity — 4× in this paper · explained in 2 episodes
• Hilbert Space — 3× in this paper · explained in 2 episodes
• Verifier — 3× in this paper · explained in 2 episodes
• Consistency — 2× in this paper · explained in 3 episodes
• Generalization — 2× in this paper · explained in 13 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