A gate-time feasibility analysis of quantum breadth-first search for maximum flow problems

arXiv:2604.24962 · quant-ph · Submitted 2026-04-27 · Read on arXiv

quant-ph

Submitted: 2026-04-27

Updated: 2026-10-12

Terminology

• Benchmarking — 1× in this paper · explained in 4 episodes
• Core — 1× in this paper · explained in 2 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
• A quasiparticle-protected superconducting qubit
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians