Papers › Quantum Geometric Machine Learning
Quantum Geometric Machine Learning
Elija Perrier
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The use of geometric and symmetry techniques in quantum and classical information processing has a long tradition across the physical sciences as a means of theoretical discovery and applied problem solving. In the modern era, the emergent combination of such geometric and symmetry-based methods with quantum machine learning (QML) has provided a rich opportunity to contribute to solving a number of persistent challenges in fields such as QML parametrisation, quantum control, quantum unitary synthesis and quantum proof generation. In this thesis, we combine state-of-the-art machine learning methods with techniques from differential geometry and topology to address these challenges. We present a large-scale simulated dataset of open quantum systems to facilitate the development of quantum machine learning as a field. We demonstrate the use of deep learning greybox machine learning techniques for estimating approximate time-optimal unitary sequences as geodesics on subRiemannian symmetric space manifolds. Finally, we present novel techniques utilising Cartan decompositions and variational methods for analytically solving quantum control problems for certain classes of Riemannian symmetric space. Owing to its multidisciplinary nature, this work contains extensive supplementary background information in the form of Appendices. Each supplementary Appendix is tailored to provide additional background material in a relatively contained way for readers whom may be familiar with some, but not all, of these diverse scientific disciplines. The Appendices reproduce or paraphrase standard results in the literature with source material identified at the beginning of each Appendix. Proofs are omitted for brevity but can be found in the cited sources and other standard texts.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections