arXiv (All)
open access
Quantitative Quantum Soundness for Bipartite Compiled Bell Games via the Sequential NPA Hierarchy
Compiling Bell games under cryptographic assumptions replaces the need for physical separation, allowing nonlocality to be probed with a single untrusted device. While Kalai et al. (STOC'23) showed that this compilation preserves quantum advantages, its quantitative quantum soundness has remained an
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
- Equivalence of non-local computation tasks beyond Clifford operations#1117482
- Scaling Quantum Optimization to the Thousand-Qubit Scale with Distributed Quantum Sampling#1247699
- Natural Argument by a Quantum Computer#759791
- Compiling Together: High-Throughput Distributed Quantum Computing via Multi-Compilation#1187938
- Empirical Investigation of Quantum Computing Toolchains and Algorithms : Mining Stack Overflow Repository#31343
Record · ID 1388288
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