arXiv (All)
open access
Proof of hiding conjecture in Gaussian boson sampling
Gaussian boson sampling (GBS) is a promising protocol for demonstrating quantum computational advantage. One of the key steps in the argument for classical hardness of GBS is the so-called ``hiding conjecture'', which asserts that one can ``hide'' a complex Gaussian matrix as a submatrix of the symm
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
- Anticoncentration and entanglement in Gaussian boson sampling#821196
- Time-of-flight images of Mott insulators in the Hofstadter-Bose-Hubbard model#954755
- Quantitative universality for products of i.i.d. random matrices#998474
- Algebraic power scaling in a slowly-quenched bosonic quantum battery#1049708
- A Complete Proof of Mueller--Ho Conjecture#1249627
Record · ID 1186342
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