Classical Verification of a Remote Quantum Processor via Degenerate Concordant Computations: An Application to Randomness Generation
quant-ph
Submitted: 2026-10-06
Updated: 2026-10-06
Comments: 17 pages, 2 figures
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Quantum And Relativistic Protocols For Secure Multi-Party Computation
- Certified Randomness from Quantum Supremacy
- Certified randomness using a trapped-ion quantum processor
- Anti-Forging Quantum Data: Cryptographic Verification of Quantum Computational Power
- On verifiable quantum advantage with peaked circuit sampling
- Efficiently verifiable quantum advantage using error correction
- Heuristic Quantum Advantage with Peaked Circuits
- Simulating Concordant Computations
- Quantum correlations as probes of chaos and ergodicity
- Objectivity, basis ambiguity, and the classical simulability of concordant quantum computation
- Quantum-to-classical transition and the emergence of trajectory level Darwinism with measurements distributed in time: a path integral approach
- The Heisenberg Representation of Quantum Computers
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