arXiv CS
open access
Verifiable quantum advantage based on polynomials with planted structures
A central question in the theory of quantum advantage is whether there are quantum advantage protocols with similar resource requirements as random circuit sampling that are also verifiable just from the classical outputs of the quantum computation. Here, we develop the idea of simulation secrets fo
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
- Verifiable quantum advantage based on polynomials with planted structures#1145085
- Verifiable Quantum Advantage and Computation via Quantum Circuit Obfuscation#1154550
- Verifiable Quantum Advantage and Computation via Quantum Circuit Obfuscation#1136751
- Decisional Monogamy-of-Entanglement for Coset States and Applications to Unclonable Cryptography with Correlated Challenges#1157301
- A homomorphic encryption-based privacy preservation for adaptive quantum cross-task optimization#240996
Record · ID 1136754
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