Unconditional quantum advantage with noisy planar architectures

arXiv:2609.40050 · quant-ph · Submitted 2026-09-30 · Read on arXiv

quant-ph

Submitted: 2026-09-30

Updated: 2026-09-30

Terminology

• Quantum Circuits — 6× in this paper · explained in 2 episodes
• Entanglement — 2× in this paper · explained in 3 episodes
• Abstraction — 1× in this paper · explained in 1 episode
• Adaptivity — 1× in this paper · explained in 1 episode
• Fidelity — 1× in this paper · explained in 2 episodes
• Redundancy — 1× in this paper · explained in 2 episodes
• Temporal Correlations — 1× in this paper · explained in 2 episodes
• Trace — 1× in this paper · explained in 2 episodes
• Verifiability — 1× in this paper · explained in 2 episodes

Sources

• Fault-Tolerant Quantum Computation with Constant Overhead
• Interactive quantum advantage with noisy, shallow Clifford circuits
• Fault-Tolerant One-Shot Entanglement Generation with Constant-Sized Quantum Devices in the Plane
• Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals

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