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

Applications of Quantum Algorithms in Analyzing Higher-Order Network Data

Caesnan Marendra Grahan Leditto

Published Nov 11, 2026• 0 citations
Publisher

Abstract

This thesis examines how quantum computers can help analyse complex systems shaped by group or higher-order interactions, including collective decisions, coordinated brain activity, disease transmission, and synchronized behaviour. It develops algorithms run on quantum computers to process data on such systems, including ranking alternatives and studying the stability of coupled oscillators. The results show that, under suitable conditions, these methods may provide an advantage over the approaches run on conventional computers. The thesis also identifies practical limitations related to end-to-end implementation of the algorithms. It therefore provides examples of how quantum computers can be used to study networks with more complex interactions and their real-world applications.

DOI
10.26180/34933326

Related papers

Efficient Quantum Algorithms for Higher-Order Coupled Oscillators

Caesnan M. G. Leditto, Angus Southwell, Muhammad Usman +1 more

Higher-order networks with multiway interactions can exhibit collective dynamical phenomena that are absent in traditional pairwise network models. However, analyzing such dynamics becomes computationally prohibitive as their state space grows combinatorially in the multiway interaction order. Here we develop quantum algorithms for two central tasks -- synchronization estimation and certification of the no-phase-locking regime -- in the simplicial Kuramoto model. This model is a higher-order generalization of the celebrated Kuramoto model for coupled oscillators on graph-based networks. Under explicit assumptions on data access and types, and simplicial structure, we derive end-to-end quantum gate complexities and identify regimes with polynomial quantum advantage for synchronization estimation and super-polynomial quantum advantage for no-phase-locking certification over classical methods. More broadly, these results extend quantum algorithms for higher-order networks from structural analysis to nonlinear dynamical diagnostics, easing a major computational bottleneck and opening a route to quantum methods for probing higher-order phenomena beyond the reach of direct classical approaches.

quant-pharXiv:2604.20108•Apr 23, 2026•2 citations

Quantum Complexity of Solving Linear Equations on Higher-Order Networks

Caesnan M. G. Leditto

Higher-order networks (HONs) represent interactions among groups of objects, supporting the study of collective behaviour that pairwise models can miss. In simplicial models of these networks, Hodge Laplacian linear systems provide a common mathematical framework for analysis, for example, for solving statistical ranking problems and investigating long-term stability in coupled oscillator systems. The large number of variables associated with edges, triangles, and higher-dimensional simplices can make these systems costly to solve. Recent quantum algorithms address this bottleneck. However, comparisons with particular classical algorithms do not decision output whether solving these linear system problems establishes a quantum complexity foundation for provable quantum advantage. We prove that preparing a quantum state encoding the normalized minimum-norm solution of Hodge Laplacian linear systems is $\mathsf{BQP}$-hard under the specified sparse oracle model and parameter promises. Our sequence of reductions maps an arbitrary polynomial-time bounded-error quantum computation to such linear systems. Each reduction allows efficient recovery of the normalized minimum-norm solution of the preceding linear system. Together with an efficient quantum algorithm for the associated decision problem from the approximate solution state, we show that this problem is $\mathsf{BQP}$-complete. These results provide a worst-case complexity foundation for evaluating quantum advantage in HON analysis and show that the $\mathsf{BQP}$-hardness of the quantum linear system problem (QLSP) persists even when the matrices are restricted to Hodge Laplacians.

quant-pharXiv:2610.05806•Oct 6, 2026•0 citations

Quantum Computing and Its Implications for Complex System Analysis

Kiran Iqbal, Omar Ahmad, Arnes Yuli Vandika

Quantum computing has emerged as a transformative technology capable of solving complex problems beyond the reach of classical computing. Its unique properties, such as superposition and entanglement, enable efficient processing of vast datasets, making it especially valuable for analyzing complex systems. This research aims to explore the implications of quantum computing for complex system analysis, particularly in fields such as physics, biology, and finance. The goal is to identify how quantum algorithms can enhance the understanding and modeling of intricate systems. A systematic literature review was conducted, examining recent advancements in quantum algorithms and their applications to complex system analysis. Comparative analyses were performed between classical and quantum computing approaches, focusing on specific case studies to illustrate the advantages of quantum solutions. The findings indicate that quantum computing significantly accelerates certain computations, leading to improved accuracy and efficiency in modeling complex systems. Case studies in quantum simulations of molecular interactions and financial modeling demonstrate substantial performance gains over classical methods. Quantum computing holds great promise for advancing the analysis of complex systems across various disciplines. Continued research and development in this area are essential to fully harness the capabilities of quantum technologies, ultimately leading to breakthroughs in understanding and solving complex problems.

Research of Scientia Naturalis•Dec 27, 2024•1 citation

Quantum algorithms: an overview

Ashley Montanaro

Abstract Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems and solving large systems of linear equations. Here we briefly survey some known quantum algorithms, with an emphasis on a broad overview of their applications rather than their technical details. We include a discussion of recent developments and near-term applications of quantum algorithms.

arXiv:1511.04206•npj Quantum Information•Jan 12, 2016•1,217 citations

Construction and Application to Complex Networks

Francesc Comellas

We review the main ndings on the ranking capabilities of the recently proposed Quantum PageRank algorithm (1,2) applied to large complex networks. The algorithm has been shown to identify unambiguously the underlying topology of the network and to be capable of clearly highlighting the struc- ture of secondary hubs of networks. Furthermore it can resolve the degeneracy in importance of the low lying part of the list of rankings. Examples of applications include real world instances from the WWW, which typically display a scale-free network structure and models of hierarchical networks. The quantum algorithm has been shown to display an increased stability with respect to a variation of the damping parameter, present in the Google algorithm, and a more clearly pronounced power-law behaviour in the distribution of importance among the nodes, as compared to the classical algorithm.

•Jan 1, 2014•0 citations

Quantum methods for machine learning and classical dynamics

Alice Barthe

All the data stored and processed by our computers is encoded as sequences of zeros and ones, called bits. Quantum computers offer an alternative to this traditional way of encoding and manipulating information. The information in a collection of qubits can be a combination, also called a superposition, over many possible sequences of zeros and ones. Where classical computation consists of flipping zeros and ones, quantum computation consists of manipulating high-dimensional vectors called quantum states. Researchers have found ways to use this to engineer quantum algorithms that solve some tasks much faster than any classical computer would. These are called quantum advantages, and are proven for specific tasks, such as breaking some encryption schemes and solving certain large linear systems. The goal of this thesis was to find new tasks for which quantum computers provably have an advantage over classical computers. In this thesis, I present two such advantages and associated results. The first one revolves around a physically relevant learning task. In other words, I explore how quantum computers can be used to help solve specialized machine learning tasks. The second one addresses the simulation of classical systems. One of the first high-potential and natural uses of quantum computers was the simulation of quantum systems. A lot of real-world problems, however, are ruled by classical physics. It turns out that quantum computers are well suited for the simulation of some exponentially large classical systems. In this thesis, I add a new problem to this list.

•Mar 26, 2026•0 citations
This thesis examines how quantum computers can help analyse complex systems shaped by group or higher-order interactions, including collective decisions, coordinated brain activity, disease transmission, and synchronized behaviour. It develops algorithms run on quantum computers to process data on such systems, including ranking alternatives and studying the stability of coupled oscillators. The results show that, under suitable conditions, these methods may provide an advantage over the approaches run on conventional computers. The thesis also identifies practical limitations related to end-to-end implementation of the algorithms. It therefore provides examples of how quantum computers can be used to study networks with more complex interactions and their real-world applications.
Higher-order networks with multiway interactions can exhibit collective dynamical phenomena that are absent in traditional pairwise network models. However, analyzing such dynamics becomes computationally prohibitive as their state space grows combinatorially in the multiway interaction order. Here we develop quantum algorithms for two central tasks -- synchronization estimation and certification of the no-phase-locking regime -- in the simplicial Kuramoto model. This model is a higher-order generalization of the celebrated Kuramoto model for coupled oscillators on graph-based networks. Under explicit assumptions on data access and types, and simplicial structure, we derive end-to-end quantum gate complexities and identify regimes with polynomial quantum advantage for synchronization estimation and super-polynomial quantum advantage for no-phase-locking certification over classical methods. More broadly, these results extend quantum algorithms for higher-order networks from structural analysis to nonlinear dynamical diagnostics, easing a major computational bottleneck and opening a route to quantum methods for probing higher-order phenomena beyond the reach of direct classical approaches.
Higher-order networks (HONs) represent interactions among groups of objects, supporting the study of collective behaviour that pairwise models can miss. In simplicial models of these networks, Hodge Laplacian linear systems provide a common mathematical framework for analysis, for example, for solving statistical ranking problems and investigating long-term stability in coupled oscillator systems. The large number of variables associated with edges, triangles, and higher-dimensional simplices can make these systems costly to solve. Recent quantum algorithms address this bottleneck. However, comparisons with particular classical algorithms do not decision output whether solving these linear system problems establishes a quantum complexity foundation for provable quantum advantage. We prove that preparing a quantum state encoding the normalized minimum-norm solution of Hodge Laplacian linear systems is BQP\mathsf{BQP}BQP-hard under the specified sparse oracle model and parameter promises. Our sequence of reductions maps an arbitrary polynomial-time bounded-error quantum computation to such linear systems. Each reduction allows efficient recovery of the normalized minimum-norm solution of the preceding linear system. Together with an efficient quantum algorithm for the associated decision problem from the approximate solution state, we show that this problem is BQP\mathsf{BQP}BQP-complete. These results provide a worst-case complexity foundation for evaluating quantum advantage in HON analysis and show that the BQP\mathsf{BQP}BQP-hardness of the quantum linear system problem (QLSP) persists even when the matrices are restricted to Hodge Laplacians.
Quantum computing has emerged as a transformative technology capable of solving complex problems beyond the reach of classical computing. Its unique properties, such as superposition and entanglement, enable efficient processing of vast datasets, making it especially valuable for analyzing complex systems. This research aims to explore the implications of quantum computing for complex system analysis, particularly in fields such as physics, biology, and finance. The goal is to identify how quantum algorithms can enhance the understanding and modeling of intricate systems. A systematic literature review was conducted, examining recent advancements in quantum algorithms and their applications to complex system analysis. Comparative analyses were performed between classical and quantum computing approaches, focusing on specific case studies to illustrate the advantages of quantum solutions. The findings indicate that quantum computing significantly accelerates certain computations, leading to improved accuracy and efficiency in modeling complex systems. Case studies in quantum simulations of molecular interactions and financial modeling demonstrate substantial performance gains over classical methods. Quantum computing holds great promise for advancing the analysis of complex systems across various disciplines. Continued research and development in this area are essential to fully harness the capabilities of quantum technologies, ultimately leading to breakthroughs in understanding and solving complex problems.
Abstract Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems and solving large systems of linear equations. Here we briefly survey some known quantum algorithms, with an emphasis on a broad overview of their applications rather than their technical details. We include a discussion of recent developments and near-term applications of quantum algorithms.
We review the main ndings on the ranking capabilities of the recently proposed Quantum PageRank algorithm (1,2) applied to large complex networks. The algorithm has been shown to identify unambiguously the underlying topology of the network and to be capable of clearly highlighting the struc- ture of secondary hubs of networks. Furthermore it can resolve the degeneracy in importance of the low lying part of the list of rankings. Examples of applications include real world instances from the WWW, which typically display a scale-free network structure and models of hierarchical networks. The quantum algorithm has been shown to display an increased stability with respect to a variation of the damping parameter, present in the Google algorithm, and a more clearly pronounced power-law behaviour in the distribution of importance among the nodes, as compared to the classical algorithm.
All the data stored and processed by our computers is encoded as sequences of zeros and ones, called bits. Quantum computers offer an alternative to this traditional way of encoding and manipulating information. The information in a collection of qubits can be a combination, also called a superposition, over many possible sequences of zeros and ones. Where classical computation consists of flipping zeros and ones, quantum computation consists of manipulating high-dimensional vectors called quantum states. Researchers have found ways to use this to engineer quantum algorithms that solve some tasks much faster than any classical computer would. These are called quantum advantages, and are proven for specific tasks, such as breaking some encryption schemes and solving certain large linear systems. The goal of this thesis was to find new tasks for which quantum computers provably have an advantage over classical computers. In this thesis, I present two such advantages and associated results. The first one revolves around a physically relevant learning task. In other words, I explore how quantum computers can be used to help solve specialized machine learning tasks. The second one addresses the simulation of classical systems. One of the first high-potential and natural uses of quantum computers was the simulation of quantum systems. A lot of real-world problems, however, are ruled by classical physics. It turns out that quantum computers are well suited for the simulation of some exponentially large classical systems. In this thesis, I add a new problem to this list.