arXiv (All)
open access
Robust exponential lower bounds for fermionic and bosonic Gaussian ranks
The power and limitations of classical simulation are central to understanding quantum computational advantages. A leading simulation paradigm is based on coherent decomposition into classically tractable free states where the decomposition rank determines the simulation complexity. Proving strong l
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
- On the Interaction of Compressibility and Adversarial Robustness#1118405
- Full-Rank Noise Forbids Long-Range Entanglement Swapping#998589
- Channel Estimation for Beyond Diagonal RIS Exploiting Core Tensor Sparsity#670507
- Channel Estimation for Beyond Diagonal RIS Exploiting Core Tensor Sparsity#668442
- Accidental accuracy and vertex corrections in $GW$: Exact benchmarks for the extended Hubbard model#1063993
Record · ID 1157520
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