Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Characterizing quantum morphology through topological data analysis

Gregory Hamilton

Published Dec 13, 2022• 0 citations
OpenAlex

Abstract

The onslaught of machine learning approaches to many-body problems has demonstrated the power of data-analytic tools in describing phenomena where standard techniques fail.One niche in this new regime of scientific study is topological data analysis (TDA), a field firmly rooted in algebraic topology and only recently explored in the context of quantum information and many-body physics.TDA offers a topological lens to quantum information amenable to direct computation and inputtable to machine learning pipelines.Given its relative lack of application in condensed matter physics, TDA poses a tantalizing route towards observables and insights invisible to traditional approaches.In this thesis we explore applications of this burgeoning field to identify and describe the "shape" of quantum information.Three broad topics comprise our testbed to evaluate TDA's efficacy: many-body localization, relativistic heavy-ion collisions, and multipartite entanglement.While diverse and largely orthogonal, each of these areas of research can be probed by tools from TDA, illustrating its flexibility and versatility.The outline of this thesis is as follows.In Ch. 1, we give an overview of the primary tool of topological data analysis, persistent homology.Through numerous examples we plot out how TDA can be leveraged Grad school is a study in sitzfleisch.By this I mean a lot of sitting, of course, but also a resolve to keep with projects long after the enthusiasm burns away and long before meaningful results appear.It requires a great deal of descending down rabbitholes, ruminating in them, and then quickly exiting before several weeks have passed.Grad school is also a study in via negativa.To learn what questions aren't worth answering, code not worth writing, and projects not worth completing is a failure-induced, ever-evolving skill set.The best lesson I gleaned from grad school is how to recover from failure quickly, as quite late in my career I chose to focus on a niche, relatively unexplored field.With that choice came the terror of finding nothing interesting, coupled with the possibility of profound discovery.There are a lot of people to thank for helping me not fail (which I term a success).Prof. Bryan Clark took me in after I left another research group, and from the beginning he was willing to sit down and read my mangled code and suggest corrections.Prof. Clark could see several steps beyond my half-baked ideas to potential pitfalls, and this foresight certainly smoothed the path.He largely gave me carte blanche to pursue projects that interested me, to which I am grateful.I owe a thanks to my former advisor, Prof. Matthew Gilbert, for accepting me into his research group as a very green first year.My first real research colleagues (Mark Hirsbrunner, Timothy

Related papers

Quantum-Inspired Algorithms for Topological Data Analysis

Jincheng Zhang

Topological data analysis (TDA) has emerged as a powerful tool for uncovering hidden patterns and structures within complex datasets. However, traditional TDA algorithms can be computationally intensive, particularly when dealing with high-dimensional data. This paper explores the application of quantum-inspired algorithms to enhance TDA, aiming to improve both efficiency and accuracy. We propose a framework that leverages concepts from quantum mechanics, such as entanglement and superposition, to simulate and manipulate topological data structures. The core mechanism involves the use of quantum-inspired simulation techniques to represent and process persistent homology calculations, resulting in a potential acceleration of the algorithm. We demonstrate the theoretical feasibility and outline a potential implementation strategy, suggesting that this approach could unlock new insights within TDA and provide a pathway toward more scalable and robust topological analysis methods. The primary focus is on developing a computational model that mimics aspects of quantum computation without requiring actual quantum hardware, focusing instead on algorithmic design inspired by quantum principles. This work establishes a foundational approach for integrating quantum-inspired techniques into the domain of TDA, paving the way for future research and development in this exciting area.

•Aug 31, 2026•0 citations

Topological Data Analysis of Quantum State Tomography

Jincheng Zhang

Quantum state tomography (QST) is a crucial technique for characterizing the state of a quantum system. However, the data generated by QST—typically a large, dense measurement matrix—presents significant challenges for analysis and interpretation. This work proposes a novel approach leveraging Topological Data Analysis (TDA), specifically persistent homology, to extract meaningful insights from these complex quantum state data. We demonstrate that the underlying topological structure of the measurement matrices can reveal fundamental characteristics of the quantum state, including entanglement properties and the degree of coherence. The core idea involves treating the measurement matrix as a high-dimensional point cloud and applying persistent homology to uncover persistent loops and connected components, which directly correspond to topological features of the quantum state. This method offers a new perspective on QST data analysis, potentially leading to improved state characterization and a deeper understanding of quantum entanglement. The application of TDA provides a robust and geometric interpretation of the measurement data, moving beyond traditional statistical methods.

•Sep 7, 2026•0 citations

Title: Quantum-Enhanced Topological Data Analysis for Novel Materials

Jincheng Zhang

Quantum-enhanced topological data analysis (TDA) represents a paradigm shift in materials discovery, offering the potential to uncover hidden relationships and guide the design of novel materials with unprecedented properties. This paper introduces a novel technique leveraging quantum entanglement to analyze topological data, demonstrating its ability to reveal complex patterns and correlations that are currently inaccessible through traditional methods. We propose a framework wherein entangled states are used to map the topological landscape of materials, providing insights into their inherent behavior and facilitating the identification of materials with unique characteristics. The underlying mechanisms of this approach, focusing on entanglement-induced correlation analysis, are thoroughly discussed. This work establishes a foundation for a fundamentally new analytical tool with significant implications for materials science and beyond.

•Aug 31, 2026•0 citations

Quantum Techniques in Machine Learning (QTML conference 2023)

Vedran Dunjko

<!--HTML-->Abstract: Although still a relatively niche field in classical machine learning, topological data analysis has raised substantial interest from the perspective of quantum algorithms in the last few years. In this talk we will introduce the topic of topological data analysis, and discuss the state-of-art of quantum algorithms for this problem, together with their promises and limitations, possible generalisations and connections to many-body physics.

•Jan 1, 2023•0 citations

Quantum Topological Data Analysis Beyond Betti Numbers: Complexity Hardness $\&$ An Algorithm for Torsion Witness

Nhat A. Nghiem, Dominic W. Berry, Trung V. Phan

Recent advances have revealed an interplay between quantum computing and topological data analysis (TDA). Most quantum TDA has focused on Betti numbers, which characterize the connectivity and ``holes'' of a dataset. Homology, however, contains additional information in the form of torsion: a nontrivial cycle can become trivial after being repeated finitely, revealing global constraints on how cycles combine and wrap around one another. Beyond applications in biomolecular studies, torsion appears in physical settings including homological quantum rotor codes, discrete charges, and gauge sectors. We study torsion from both classical and quantum perspectives. Given a graph $G$ and its clique complex $K = \mathrm{Cl}(G)$, we first prove that, for fixed $r$ and prime $p$, deciding whether $H_r(K,\mathbb{Z})$ contains $p$-torsion is NP-hard. As a corollary, when a homological rotor code is specified by $G$, deciding whether the code has a finite-dimensional logical sector of a given order is NP-hard. We discuss related problems, including the Bockstein homomorphism, Smith normal form, lattice saturation, and cohomology. Second, for a finite set of primes $P$, we develop a quantum algorithm that serves as a one-sided torsion witness. For fixed $r$, it outputs WITNESS or INCONCLUSIVE, i.e. WITNESS certifies that either $H_r(K,\mathbb{Z})$ or $H_{r-1}(K,\mathbb{Z})$ contains $p$-torsion for some $p\in P$ while INCONCLUSIVE makes no claim about its presence or absence. We identify a regime in which the algorithm achieves a near-quadratic quantum speedup over the corresponding classical algorithm under the same input model. Our NP-hardness result complements recent hardness results for estimating Betti numbers, adding a complexity-theoretic perspective to quantum TDA. Together, these results demonstrate that integral homology, beyond its Betti numbers, can be computationally challenging.

quant-pharXiv:2609.28112•Sep 24, 2026•1 citation

Quantum-Inspired Algorithm for Topological Data Analysis of Network Graphs

Jincheng Zhang

Topological data analysis (TDA) provides powerful tools for uncovering hidden patterns and structures within complex datasets, particularly network graphs. Persistent homology, a cornerstone of TDA, calculates the persistence of topological features – such as connected components, cycles, and cavities – as the scale of analysis increases. Traditional persistent homology calculations can be computationally intensive, especially for large networks. This paper proposes a novel quantum-inspired algorithm designed to accelerate this process. The algorithm leverages concepts from quantum sampling and superposition to efficiently identify and quantify topological features, significantly reducing the computational burden. We demonstrate the feasibility of this approach, outlining the core claim, mechanism, and potential impact of combining quantum-inspired techniques with TDA. The primary goal is to explore the possibility of faster persistent homology calculations, ultimately enhancing the scalability and applicability of TDA to real-world network datasets.

•Sep 3, 2026•0 citations
The onslaught of machine learning approaches to many-body problems has demonstrated the power of data-analytic tools in describing phenomena where standard techniques fail.One niche in this new regime of scientific study is topological data analysis (TDA), a field firmly rooted in algebraic topology and only recently explored in the context of quantum information and many-body physics.TDA offers a topological lens to quantum information amenable to direct computation and inputtable to machine learning pipelines.Given its relative lack of application in condensed matter physics, TDA poses a tantalizing route towards observables and insights invisible to traditional approaches.In this thesis we explore applications of this burgeoning field to identify and describe the "shape" of quantum information.Three broad topics comprise our testbed to evaluate TDA's efficacy: many-body localization, relativistic heavy-ion collisions, and multipartite entanglement.While diverse and largely orthogonal, each of these areas of research can be probed by tools from TDA, illustrating its flexibility and versatility.The outline of this thesis is as follows.In Ch. 1, we give an overview of the primary tool of topological data analysis, persistent homology.Through numerous examples we plot out how TDA can be leveraged Grad school is a study in sitzfleisch.By this I mean a lot of sitting, of course, but also a resolve to keep with projects long after the enthusiasm burns away and long before meaningful results appear.It requires a great deal of descending down rabbitholes, ruminating in them, and then quickly exiting before several weeks have passed.Grad school is also a study in via negativa.To learn what questions aren't worth answering, code not worth writing, and projects not worth completing is a failure-induced, ever-evolving skill set.The best lesson I gleaned from grad school is how to recover from failure quickly, as quite late in my career I chose to focus on a niche, relatively unexplored field.With that choice came the terror of finding nothing interesting, coupled with the possibility of profound discovery.There are a lot of people to thank for helping me not fail (which I term a success).Prof. Bryan Clark took me in after I left another research group, and from the beginning he was willing to sit down and read my mangled code and suggest corrections.Prof. Clark could see several steps beyond my half-baked ideas to potential pitfalls, and this foresight certainly smoothed the path.He largely gave me carte blanche to pursue projects that interested me, to which I am grateful.I owe a thanks to my former advisor, Prof. Matthew Gilbert, for accepting me into his research group as a very green first year.My first real research colleagues (Mark Hirsbrunner, Timothy
Topological data analysis (TDA) has emerged as a powerful tool for uncovering hidden patterns and structures within complex datasets. However, traditional TDA algorithms can be computationally intensive, particularly when dealing with high-dimensional data. This paper explores the application of quantum-inspired algorithms to enhance TDA, aiming to improve both efficiency and accuracy. We propose a framework that leverages concepts from quantum mechanics, such as entanglement and superposition, to simulate and manipulate topological data structures. The core mechanism involves the use of quantum-inspired simulation techniques to represent and process persistent homology calculations, resulting in a potential acceleration of the algorithm. We demonstrate the theoretical feasibility and outline a potential implementation strategy, suggesting that this approach could unlock new insights within TDA and provide a pathway toward more scalable and robust topological analysis methods. The primary focus is on developing a computational model that mimics aspects of quantum computation without requiring actual quantum hardware, focusing instead on algorithmic design inspired by quantum principles. This work establishes a foundational approach for integrating quantum-inspired techniques into the domain of TDA, paving the way for future research and development in this exciting area.
Quantum state tomography (QST) is a crucial technique for characterizing the state of a quantum system. However, the data generated by QST—typically a large, dense measurement matrix—presents significant challenges for analysis and interpretation. This work proposes a novel approach leveraging Topological Data Analysis (TDA), specifically persistent homology, to extract meaningful insights from these complex quantum state data. We demonstrate that the underlying topological structure of the measurement matrices can reveal fundamental characteristics of the quantum state, including entanglement properties and the degree of coherence. The core idea involves treating the measurement matrix as a high-dimensional point cloud and applying persistent homology to uncover persistent loops and connected components, which directly correspond to topological features of the quantum state. This method offers a new perspective on QST data analysis, potentially leading to improved state characterization and a deeper understanding of quantum entanglement. The application of TDA provides a robust and geometric interpretation of the measurement data, moving beyond traditional statistical methods.
Quantum-enhanced topological data analysis (TDA) represents a paradigm shift in materials discovery, offering the potential to uncover hidden relationships and guide the design of novel materials with unprecedented properties. This paper introduces a novel technique leveraging quantum entanglement to analyze topological data, demonstrating its ability to reveal complex patterns and correlations that are currently inaccessible through traditional methods. We propose a framework wherein entangled states are used to map the topological landscape of materials, providing insights into their inherent behavior and facilitating the identification of materials with unique characteristics. The underlying mechanisms of this approach, focusing on entanglement-induced correlation analysis, are thoroughly discussed. This work establishes a foundation for a fundamentally new analytical tool with significant implications for materials science and beyond.
Quantum Topological Data Analysis Beyond Betti Numbers: Complexity Hardness &\&& An Algorithm for Torsion Witness
Recent advances have revealed an interplay between quantum computing and topological data analysis (TDA). Most quantum TDA has focused on Betti numbers, which characterize the connectivity and ``holes'' of a dataset. Homology, however, contains additional information in the form of torsion: a nontrivial cycle can become trivial after being repeated finitely, revealing global constraints on how cycles combine and wrap around one another. Beyond applications in biomolecular studies, torsion appears in physical settings including homological quantum rotor codes, discrete charges, and gauge sectors. We study torsion from both classical and quantum perspectives. Given a graph GGG and its clique complex K=Cl(G)K = \mathrm{Cl}(G)K=Cl(G), we first prove that, for fixed rrr and prime ppp, deciding whether Hr(K,Z)H_r(K,\mathbb{Z})Hr​(K,Z) contains ppp-torsion is NP-hard. As a corollary, when a homological rotor code is specified by GGG, deciding whether the code has a finite-dimensional logical sector of a given order is NP-hard. We discuss related problems, including the Bockstein homomorphism, Smith normal form, lattice saturation, and cohomology. Second, for a finite set of primes PPP, we develop a quantum algorithm that serves as a one-sided torsion witness. For fixed rrr, it outputs WITNESS or INCONCLUSIVE, i.e. WITNESS certifies that either Hr(K,Z)H_r(K,\mathbb{Z})Hr​(K,Z) or Hr−1(K,Z)H_{r-1}(K,\mathbb{Z})Hr−1​(K,Z) contains ppp-torsion for some p∈Pp\in Pp∈P while INCONCLUSIVE makes no claim about its presence or absence. We identify a regime in which the algorithm achieves a near-quadratic quantum speedup over the corresponding classical algorithm under the same input model. Our NP-hardness result complements recent hardness results for estimating Betti numbers, adding a complexity-theoretic perspective to quantum TDA. Together, these results demonstrate that integral homology, beyond its Betti numbers, can be computationally challenging.
Topological data analysis (TDA) provides powerful tools for uncovering hidden patterns and structures within complex datasets, particularly network graphs. Persistent homology, a cornerstone of TDA, calculates the persistence of topological features – such as connected components, cycles, and cavities – as the scale of analysis increases. Traditional persistent homology calculations can be computationally intensive, especially for large networks. This paper proposes a novel quantum-inspired algorithm designed to accelerate this process. The algorithm leverages concepts from quantum sampling and superposition to efficiently identify and quantify topological features, significantly reducing the computational burden. We demonstrate the feasibility of this approach, outlining the core claim, mechanism, and potential impact of combining quantum-inspired techniques with TDA. The primary goal is to explore the possibility of faster persistent homology calculations, ultimately enhancing the scalability and applicability of TDA to real-world network datasets.