Metraipolis › archive › dc_707eeb145647

Quantum Stochastic Walks on the Permutation Group — arXiv:2609.13387

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.13387
License (as archived)
CC0-1.0
Archived
2026-10-16T02:24:51.264Z
SHA-256 of the archived text
b7f179a8df4abd179c1f060a4898970fd1c6b230b594737f863aaf1c99593dbc
Stable URL of this page
https://metraipolis.com/documento/dc_707eeb145647

How to cite

Quantum Stochastic Walks on the Permutation Group — arXiv:2609.13387 — arXiv (en), https://arxiv.org/abs/2609.13387 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_707eeb145647 (Metraipolis archive dc_707eeb145647, sha256 b7f179a8df4abd179c1f060a4898970fd1c6b230b594737f863aaf1c99593dbc)
BibTeX
@misc{dc707eeb145647,
  title = {Quantum Stochastic Walks on the Permutation Group — arXiv:2609.13387},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.13387},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_707eeb145647; sha256 b7f179a8df4abd179c1f060a4898970fd1c6b230b594737f863aaf1c99593dbc},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13387. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 and Shahshahani, as well as more general walks generated by conjugacy classes of $S_n$, in continuous time. We then identify the transition matrix of each classical walk with a permutation Hamiltonian generating a corresponding unitary quantum walk. Purely unitary evolution, however, does not generically converge to the uniform distribution in the classical sense of mixing: coherence preserves information rather than erasing it. We therefore embed the problem into a quantum stochastic walk, where coherent dynamics competes with the dissipative process responsible for classical mixing. In this setting, quantum coherence assists randomization. We prove that it can only decrease the distance from the uniform distribution in the computational basis and can therefore accelerate mixing. An analysis of the slowest mode yields a criterion for the coupling strength required to produce an appreciable speedup. Finally, numerical results reveal a scaling collapse of the ratio between quantum and classical mixing times onto a simple one-parameter form. Our results illustrate how coherence and dissipation can cooperate in the emergence of randomness in walks on permutation groups.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-15 in quant-ph).
Categorie arXiv: Statistical Mechanics (cond-mat.stat-mech) ; Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.13387 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T01:57:57.123Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).