Towards verifiable quantum advantage with random circuits: Observables that survive concentration
quant-ph
Submitted: 2026-09-29
Updated: 2026-09-29
Terminology
Sources
- Characterizing Quantum Supremacy in Near-Term Devices
- Quantum Supremacy and the Complexity of Random Circuit Sampling
- Classical Verification of Quantum Computations
- Verifiable Quantum Advantage without Structure
- On verifiable quantum advantage with peaked circuit sampling
- Sampling hard circuits with verifiably high fidelity
- Architectures for quantum simulation showing a quantum speedup
- Sample complexity of device-independently certified "quantum supremacy"
- A Framework for Quantum Advantage
- A simplified version of the quantum OTOC$^{(2)}$ problem
- Observable Estimation in the Absence of Classical Verification
- Barren plateaus in quantum neural network training landscapes
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Equivalence of quantum barren plateaus to cost concentration and narrow gorges
- Constructive interference at the edge of quantum ergodic dynamics
- Black holes and the butterfly effect
- A bound on chaos
- Chaos in quantum channels
- Scrambling Dynamics and Out-of-Time Ordered Correlators in Quantum Many-Body Systems: a Tutorial
- Tensor Networks with Belief Propagation Cannot Feasibly Simulate Google's Quantum Echoes Experiment
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