Beyond NISQ Assumptions: One-time Memory in the Classically Accessible Random-Oracle Model

arXiv:2609.32603 · quant-ph, cs.CR · Submitted 2026-09-26 · Read on arXiv

quant-ph, cs.CR

Submitted: 2026-09-26

Updated: 2026-09-26

Terminology

• Verifier — 8× in this paper · explained in 2 episodes
• Decode — 7× in this paper · explained in 2 episodes
• Consistency — 2× in this paper · explained in 3 episodes
• Quantum Circuits — 2× in this paper · explained in 2 episodes
• Core — 1× in this paper · explained in 2 episodes
• Entanglement — 1× in this paper · explained in 4 episodes
• Verification — 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
• 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