arXiv (All)
open access
Strong matchgate designs in nearly optimal depth
Understanding the resources required to generate approximately random unitaries over various groups is a natural goal of quantum information theory. With respect to one notion of approximation, that of a design, it is known that the full unitary group can be approximated in logarithmic depth by one-
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
- Shallow Approximate Unitary Designs from Relative Entropy Decay of Unstructured Random Circuits#635658
- Shallow Approximate Unitary Designs from Relative Entropy Decay of Unstructured Random Circuits#633309
- Captured weight and boundary leakage bound the error of sample-based spectral functions#1106019
- The Fine-Tuning Objection to Superdeterminism Conflates Specificity with Complexity: How Algorithmic Probability Dissolves the Primary Argument Against Violating Statistical Independence#167420
- Information as a Physical Resource: Quantum Maxwell Demon Arrays and the Thermodynamics of Measurement#108786
Record · ID 1062564
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