arXiv (All)
open access
Classical Verification of a Remote Quantum Processor via Degenerate Concordant Computations: An Application to Randomness Generation
A client who rents a cloud quantum processor cannot easily tell whether the bitstrings it receives came from a quantum device. Certification by random circuit sampling runs on present hardware, but scoring each returned sample costs the client time $O(2^n)$. We give a protocol in which the client sc
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Polynomial-time additive-error estimation of output probabilities for shallow quantum circuits#1157494
- Security of quantum key distribution with source and detector imperfections through phase-error estimation#799869
- Random Quantum Circuits Beyond Moment Matching#1157483
- Gibbs resampling transitions and structured fast-measurement protocols#1037108
- Implementation and verification of coherent error suppression using randomized compiling for Grover's algorithm on a trapped-ion device#997951
Record · ID 1217920
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive