Recent results of quantum ergodicity on graphs and further investigation
Nalini Anantharaman (IRMA), Mostafa Sabri (LMO)
TL;DR
This paper reviews recent proofs of quantum ergodicity on large graphs, introduces new applications for irregular graphs, and discusses unresolved questions in the field.
Contribution
It presents recent advances in quantum ergodicity proofs and extends applications to irregular graphs, highlighting ongoing open problems.
Findings
Quantum ergodicity has been proven on large graphs.
New applications for irregular graphs are introduced.
Remaining questions in the field are discussed.
Abstract
We outline some recent proofs of quantum ergodicity on large graphs and give new applications in the context of irregular graphs. We also discuss some remaining questions.
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
TopicsQuantum Computing Algorithms and Architecture · Advanced Operator Algebra Research · Quantum Information and Cryptography