arXiv (All)
open access
Pseudoentanglement in constant depth: How trivial states can have non-trivial entanglement structure
We construct a family of 2D-local constant-depth quantum circuits that output states whose entanglement entropy across a specified cut cannot be estimated in quantum polynomial time. As constant-depth quantum circuits can be learned from polynomially many quantum samples, our resulting pseudoentangl
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
- Edge-Local and Qubit-Efficient Quantum Graph Learning for the NISQ Era#792704
- Edge-Local and Qubit-Efficient Quantum Graph Learning for the NISQ Era#788704
- Engineering non-Markovianity from spectral shaping of bosonic and fermionic baths#1083788
- Ancilla-assisted nondestructive discrimination of distributed GHZ-class states#975148
- Predicting Multipartite Entanglement in Quantum Circuits using Transformer#784765
Record · ID 1155221
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