arXiv (All)
open access
Classical Verification of Quantum Computation with Quasilinear Resources, from Compiled Nonlocal Games
Computational self-testing gives a classical verifier command over the quantum register of a single computationally bounded prover. We use this framework to construct the first argument system for BQP with quasilinear total resource requirements in the circuit model. Our argument system is based on
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
- Classical Verification of Quantum Computation with Quasilinear Resources, from Compiled Nonlocal Games#1122185
- Entanglement cost of quantum depolarization#1154810
- Discrete Flow-Based Generative Models for Measurement Optimization in Quantum Computing#670382
- Discrete Flow-Based Generative Models for Measurement Optimization in Quantum Computing#668317
- Time-Dependent Tunneling in the Thin-Barrier Limit#1110321
Record · ID 1142358
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