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

arXiv:2507.08157

Topological network analysis using a programmable photonic quantum processor

Yu Shang, Jinzhao Sun, Zhenghao Li, Ewan Mer, Yazeed K. Alwehaibi, Oscar Scholin, Gerard J. Machado, Kuan‐Cheng Chen, Aonan Zhang, Raj B. Patel, Ying Dong, Ian Walmsley, Vlatko Vedral, Ginestra Bianconi A

Published Jul 10, 2025• 0 citations
arXivHTMLPDF

Abstract

Understanding topological features in networks is crucial for unravelling complex phenomena across fields such as neuroscience, condensed matter, and high-energy physics. However, identifying higher-order topological structures -- such as $k$-cliques, fundamental building blocks of complex networks -- remains a significant challenge. Here we develop a universal programmable photonic quantum processor that enables the encoding of arbitrary complex-weight networks, providing a direct pathway to uncovering their topological structures. We demonstrate how this quantum approach can identify weighted $k$-cliques and estimate Betti numbers by leveraging the Gaussian boson sampling algorithm's ability to preferentially select high-weight, dense subgraphs. The unique capabilities of our programmable quantum processor allow us to observe topological phase transitions and identify clique percolation phenomena directly from the entropy of the sampling results. These findings showcase how photonic quantum computing can be applied to analyse the topological characteristics of real-world complex networks, opening new possibilities for quantum-enhanced data analysis.

DOI
10.48550/arxiv.2507.08157

Related papers

Demonstration of Topological Data Analysis on a Quantum Processor

He-Liang Huang, Xi‐Lin Wang, Peter P. Rohde +7 more

Topological data analysis offers a robust way to extract useful information from noisy, unstructured data by identifying its underlying structure. Recently, an efficient quantum algorithm was proposed [Lloyd, Garnerone, Zanardi, Nat. Commun. 7, 10138 (2016)] for calculating Betti numbers of data points -- topological features that count the number of topological holes of various dimensions in a scatterplot. Here, we implement a proof-of-principle demonstration of this quantum algorithm by employing a six-photon quantum processor to successfully analyze the topological features of Betti numbers of a network including three data points, providing new insights into data analysis in the era of quantum computing.

arXiv:1801.06316•Jan 19, 2018•6 citations

Demonstration of topological data analysis on a quantum processor

He-Liang Huang, Xi‐Lin Wang, Peter P. Rohde +7 more

Topological data analysis offers a robust way to extract useful information from noisy, unstructured data by identifying its underlying structure. Recently, an efficient quantum algorithm was proposed [Lloyd, Garnerone, Zanardi, Nat. Commun. 7, 10138 (2016)] for calculating Betti numbers of data points -- topological features that count the number of topological holes of various dimensions in a scatterplot. Here, we implement a proof-of-principle demonstration of this quantum algorithm by employing a six-photon quantum processor to successfully analyze the topological features of Betti numbers of a network including three data points, providing new insights into data analysis in the era of quantum computing.

Optica•Feb 9, 2018•44 citations

Quantum-Enhanced Topological State Analysis

Jincheng Zhang

Quantum-enhanced topological state analysis represents a paradigm shift in our ability to understand and manipulate complex systems, particularly those exhibiting topological properties. This research proposes a novel technique leveraging quantum algorithms to dramatically enhance sensitivity and precision in the analysis of topological states, offering a pathway to uncover subtle structural changes previously inaccessible through conventional methods. The core mechanism centers around the application of quantum computing to a specialized set of topological analysis tasks, yielding a significantly improved understanding of these systems. We aim to establish a robust framework for investigating complex topological phenomena, potentially unlocking new advancements across diverse fields, including materials science, cryptography, and fundamental physics. The paper will detail the theoretical underpinnings of the quantum-enhanced approach, showcase its implementation with illustrative examples, and discuss the expected impact on current research practices.

•Sep 3, 2026•0 citations

Quantum topological data analysis via the estimation of the density of states

Stefano Scali, Chukwudubem Umeano, Oleksandr Kyriienko

We develop a quantum topological data analysis (QTDA) protocol based on the estimation of the density of states (DOS) of the combinatorial Laplacian. Computing topological features of graphs and simplicial complexes is crucial for analyzing data sets and building explainable artificial intelligence solutions. This task becomes computationally hard for simplicial complexes with over 60 vertices and high-degree topological features due to a combinatorial scaling. We propose to approach the task by embedding underlying hypergraphs as effective quantum Hamiltonians and evaluating their density of states from the time evolution. Specifically, we compose propagators as quantum circuits using the Cartan decomposition of effective Hamiltonians and sample overlaps of time-evolved states using multifidelity protocols. Next we develop various postprocessing routines and implement a Fourier-like transform to recover the rank (and kernel) of Hamiltonians. This enables us to estimate the Betti numbers, revealing the topological features of simplicial complexes. We test our protocol on noiseless and noisy quantum simulators and run examples on IBM quantum processors. We observe the resilience of the proposed QTDA approach to real-hardware noise even in the absence of error mitigation, showing the promise for near-term device implementations and highlighting the utility of global DOS-based estimators. Published by the American Physical Society 2024

arXiv:2312.07115•Physical Review A•Oct 15, 2024•5 citations

基于非线性量子纠缠的拓扑结构分析

Jincheng Zhang

This paper investigates the application of non-linear quantum entanglement to improve the efficiency and accuracy of topological structure analysis. Traditional methods often struggle with complex systems, while our framework offers a fundamentally new approach leveraging the unique properties of entangled quantum states to enhance analysis. We explore a novel methodology utilizing entangled qubit states to uncover subtle topological features within data sets, ultimately providing a more robust and insightful tool for modeling complex systems. The core claim centers on the potential to significantly accelerate and refine topological structure analysis through the integration of quantum entanglement. This work presents a theoretical framework and preliminary experimental demonstrations focusing on the analysis of graph networks, demonstrating promising results in identifying critical topological structures. The paper concludes with a discussion of future research directions and the potential impact of this approach on various fields.

•Aug 31, 2026•0 citations

Algorithmic Quantum Sampling for Complex Network Analysis

Jincheng Zhang

This paper investigates the application of algorithmic quantum sampling to enhance the analysis of complex networks. Complex networks, characterized by their intricate relationships between nodes and edges, offer immense opportunities for understanding societal, economic, and biological systems. However, traditional computational methods struggle to efficiently explore the vast state space of these networks, limiting our ability to uncover subtle patterns and correlations. This research proposes a novel quantum sampling algorithm designed to overcome these limitations, leveraging quantum superposition to rapidly explore the network's potential states and facilitate the discovery of hidden structures. The core mechanism involves employing quantum superposition to effectively sample the entire network state space, significantly accelerating the analysis process. We demonstrate the algorithm's effectiveness through simulations and preliminary results, highlighting its potential to provide a fundamentally new approach to complex network analysis.

•Sep 3, 2026•0 citations
Understanding topological features in networks is crucial for unravelling complex phenomena across fields such as neuroscience, condensed matter, and high-energy physics. However, identifying higher-order topological structures -- such as kkk-cliques, fundamental building blocks of complex networks -- remains a significant challenge. Here we develop a universal programmable photonic quantum processor that enables the encoding of arbitrary complex-weight networks, providing a direct pathway to uncovering their topological structures. We demonstrate how this quantum approach can identify weighted kkk-cliques and estimate Betti numbers by leveraging the Gaussian boson sampling algorithm's ability to preferentially select high-weight, dense subgraphs. The unique capabilities of our programmable quantum processor allow us to observe topological phase transitions and identify clique percolation phenomena directly from the entropy of the sampling results. These findings showcase how photonic quantum computing can be applied to analyse the topological characteristics of real-world complex networks, opening new possibilities for quantum-enhanced data analysis.
Topological data analysis offers a robust way to extract useful information from noisy, unstructured data by identifying its underlying structure. Recently, an efficient quantum algorithm was proposed [Lloyd, Garnerone, Zanardi, Nat. Commun. 7, 10138 (2016)] for calculating Betti numbers of data points -- topological features that count the number of topological holes of various dimensions in a scatterplot. Here, we implement a proof-of-principle demonstration of this quantum algorithm by employing a six-photon quantum processor to successfully analyze the topological features of Betti numbers of a network including three data points, providing new insights into data analysis in the era of quantum computing.
Topological data analysis offers a robust way to extract useful information from noisy, unstructured data by identifying its underlying structure. Recently, an efficient quantum algorithm was proposed [Lloyd, Garnerone, Zanardi, Nat. Commun. 7, 10138 (2016)] for calculating Betti numbers of data points -- topological features that count the number of topological holes of various dimensions in a scatterplot. Here, we implement a proof-of-principle demonstration of this quantum algorithm by employing a six-photon quantum processor to successfully analyze the topological features of Betti numbers of a network including three data points, providing new insights into data analysis in the era of quantum computing.
Quantum-enhanced topological state analysis represents a paradigm shift in our ability to understand and manipulate complex systems, particularly those exhibiting topological properties. This research proposes a novel technique leveraging quantum algorithms to dramatically enhance sensitivity and precision in the analysis of topological states, offering a pathway to uncover subtle structural changes previously inaccessible through conventional methods. The core mechanism centers around the application of quantum computing to a specialized set of topological analysis tasks, yielding a significantly improved understanding of these systems. We aim to establish a robust framework for investigating complex topological phenomena, potentially unlocking new advancements across diverse fields, including materials science, cryptography, and fundamental physics. The paper will detail the theoretical underpinnings of the quantum-enhanced approach, showcase its implementation with illustrative examples, and discuss the expected impact on current research practices.
We develop a quantum topological data analysis (QTDA) protocol based on the estimation of the density of states (DOS) of the combinatorial Laplacian. Computing topological features of graphs and simplicial complexes is crucial for analyzing data sets and building explainable artificial intelligence solutions. This task becomes computationally hard for simplicial complexes with over 60 vertices and high-degree topological features due to a combinatorial scaling. We propose to approach the task by embedding underlying hypergraphs as effective quantum Hamiltonians and evaluating their density of states from the time evolution. Specifically, we compose propagators as quantum circuits using the Cartan decomposition of effective Hamiltonians and sample overlaps of time-evolved states using multifidelity protocols. Next we develop various postprocessing routines and implement a Fourier-like transform to recover the rank (and kernel) of Hamiltonians. This enables us to estimate the Betti numbers, revealing the topological features of simplicial complexes. We test our protocol on noiseless and noisy quantum simulators and run examples on IBM quantum processors. We observe the resilience of the proposed QTDA approach to real-hardware noise even in the absence of error mitigation, showing the promise for near-term device implementations and highlighting the utility of global DOS-based estimators. Published by the American Physical Society 2024
This paper investigates the application of non-linear quantum entanglement to improve the efficiency and accuracy of topological structure analysis. Traditional methods often struggle with complex systems, while our framework offers a fundamentally new approach leveraging the unique properties of entangled quantum states to enhance analysis. We explore a novel methodology utilizing entangled qubit states to uncover subtle topological features within data sets, ultimately providing a more robust and insightful tool for modeling complex systems. The core claim centers on the potential to significantly accelerate and refine topological structure analysis through the integration of quantum entanglement. This work presents a theoretical framework and preliminary experimental demonstrations focusing on the analysis of graph networks, demonstrating promising results in identifying critical topological structures. The paper concludes with a discussion of future research directions and the potential impact of this approach on various fields.
This paper investigates the application of algorithmic quantum sampling to enhance the analysis of complex networks. Complex networks, characterized by their intricate relationships between nodes and edges, offer immense opportunities for understanding societal, economic, and biological systems. However, traditional computational methods struggle to efficiently explore the vast state space of these networks, limiting our ability to uncover subtle patterns and correlations. This research proposes a novel quantum sampling algorithm designed to overcome these limitations, leveraging quantum superposition to rapidly explore the network's potential states and facilitate the discovery of hidden structures. The core mechanism involves employing quantum superposition to effectively sample the entire network state space, significantly accelerating the analysis process. We demonstrate the algorithm's effectiveness through simulations and preliminary results, highlighting its potential to provide a fundamentally new approach to complex network analysis.