Quantum mixing on large Schreier graphs
Charles Bordenave, Cyril Letrouit, Mostafa Sabri

TL;DR
This paper establishes quantum ergodicity and mixing for sequences of finite Schreier graphs converging to an infinite Cayley graph with absolutely continuous spectrum, using a novel framework that extends to non-regular graphs.
Contribution
It introduces a new approach based on trace identities and representation theory to prove quantum ergodicity for a broad class of Schreier graphs without requiring tree-like structures.
Findings
Quantum ergodicity holds for all orthonormal eigenbases.
Correlations between eigenvectors at different energies vanish asymptotically.
Results apply to various families of Schreier graphs from group actions.
Abstract
We prove quantum ergodicity and quantum mixing for sequences of finite Schreier graphs converging to an infinite Cayley graph whose adjacency operator has absolutely continuous spectrum. Under Benjamini-Schramm convergence (or strong convergence in distribution), we show that correlations between eigenvectors at distinct energies vanish asymptotically when tested against a broad class of local observables. Our results apply to all orthonormal eigenbases and do not require tree-like structure or periodicity of the limiting graph, unlike previous approaches based on non-backtracking operators or Floquet theory. The proof introduces a new framework for quantum ergodicity, based on trace identities, resolvent approximations and representation-theoretic techniques and extends to certain families of non-regular graphs. We illustrate the assumptions and consequences of our theorems on Schreier…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Advanced Operator Algebra Research · Quantum Information and Cryptography
