arXiv (All)
open access
Incompressibility and spectral gaps of random circuits
Random reversible and quantum circuits form random walks on the alternating group $\mathrm{Alt}(2^n)$ and unitary group $\mathrm{SU}(2^n)$, respectively. Known bounds on the spectral gap for the $t$-th moment of these random walks have inverse-polynomial dependence in both $n$ and $t$. We prove that
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
- Limit theorems for linear spectrum statistics of orthogonal polynomial ensembles and their applications in random matrix theory#366889
- Exponential decay for the random connection model using asymptotic transitivity#1063783
- Spectral Criterion for Disorder-Free Localization of Quantum Walks on Hypercube: QBN Approach#975318
- Spectral extremes under exact cycle conditioning#1071133
- Polynomial Decay in Absorbing Continuous-Time Markov Chains#1063546
Record · ID 1051965
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