arXiv CS
open access
Breaking the Bounded Entanglement Barrier for Quantum Position Verification
Position verification, introduced by Chandran et al. (SIAM J. Computing 2014), allows verifiers to test a prover's claimed position by an interactive protocol. Classical position verification is impossible. Even for Quantum Position Verification (QPV), there always exists an LOCC (Local Operations a
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
- Breaking the Bounded Entanglement Barrier for Quantum Position Verification#1144201
- Optimal Quantum Likelihood Estimation#924449
- Optimal Quantum Likelihood Estimation#920218
- QGB-W$k$NN: Quantum Granular-Ball Learning for Robust Classification#973567
- Non-stabilizerness and violations of CHSH inequalities#984041
Record · ID 1136774
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