Operator dynamics in k-Markov random circuits

Abstract:We demonstrate that $k$-Markov sequences of unitary gates provide low-cost handles to manipulate the rate and structure of information spreading compared to traditional random, 0-Markov, circuits. For SWAP gates and brickwork circuits, we use graph cover time to demonstrate how $k$-Markov processes can be used to control operator transport. With SWAP gates and the set of Clifford gates that can change operator weight, we show how $k$-Markov sequences can be used to manipulate scrambling time and generate novel structures of spatial-temporal correlations across a qubit network. We show that $k$-Markov circuits constructed from PSWAP gates at fixed angle are equivalent to standard brickwork circuits with PSWAP angle drawn from non-uniform distributions generated by the $k$-Markov process. In those circuits, the time evolution of the average Hamming weight and the space-time correlation structure that remains after one-point quantities equilibrate again vary significantly from the 0-Markov case, depending on the transition probabilities of the process. More broadly, these results identify finite temporal memory as a control handle distinct from a circuit's degree of quantum chaos. For gate sets that fall short of volume-law scrambling, the equilibrium reached by one-point diagnostics is fixed by the gates alone, while the choice of $k$-Markov rule controls the approach to equilibrium and the structure of persistent, late-time correlations.

arXiv:2603.18217 [quant-ph]

(or arXiv:2603.18217v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2603.18217 Focus to learn more arXiv-issued DOI via DataCite

Phys. Rev. Research 8, 043016 (2026)

https://doi.org/10.1103/p2cj-1kkl Focus to learn more DOI(s) linking to related resources

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.