Verification Complexity and Extension of Classical Shadows
quant-ph
Submitted: 2026-09-30
Updated: 2026-09-30
Terminology
Sources
- The Quantum Schur Transform: I. Efficient Qudit Circuits
- Perfect zero knowledge for quantum multiprover interactive proofs
- On the Complexity of Pure-State Consistency of Local Density Matrices
- Classical shadows with symmetries
- Quantum Computational Complexity
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