arXiv (All)
open access
On the pseudorandomness of simple quantum processes
Can simple processes appear highly complex? Gowers (Comb. Prob. Comp. '96) conjectured that repeatedly composing local random reversible operations can yield global permutations that are indistinguishable from random. In this work, we study the unitary quantum analog of this question, in an attempt
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 pseudorandomness of simple quantum processes#1160916
- Generating quantum ensembles via reverse-time quantum diffusions#1035514
- Pseudo Entropy in Quantum Spin Chains: from Integrability to Chaos#798434
- Pseudo Entropy in Quantum Spin Chains: from Integrability to Chaos#797021
- Causal-Order Identification of Memoryless Sequential Quantum Processes from Restricted Projective Data#1011093
Record · ID 1157448
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