arXiv (OAI Expanded)
open access
Quantum Stochastic Walks on the Permutation Group
How rapidly does order give way to randomness, and can quantum coherence accelerate this process? We address these questions through the paradigmatic problem of card shuffling, formulated as a random walk on the symmetric group $S_n$. We first recast the random-transposition walk studied by Diaconis
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
- Pin Classes I: Growth Rates#1141394
- Faster Computation with the Generalized Laplacian Quantum Walk#997312
- Enhanced entanglement from quantum ergodicity#1128508
- Coherence-Induced Deep Thermalization Transition in Random Permutation Quantum Dynamics#495582
- Baxter permuton and Liouville quantum gravity#1130424
Record · ID 1160765
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