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:2611.08593

Exploring topological signatures of quantum Fisher information scaling in graph states

Majid Hassani, Patrick Emonts, Jordi Tura

Published Nov 5, 2026• 0 citations
arXivHTMLPDF

Abstract

Graph states are a versatile resource for quantum metrology, and their quantum Fisher information (QFI) has a closed-form expression in terms of the underlying graph: it counts pairs of vertices with identical neighborhoods. It remains unclear, however, which global structural properties of a graph determine whether its QFI exceeds the standard quantum limit (SQL). Here we ask whether topological invariants, namely the Betti numbers of the graph's clique complex, capture this behavior, and we address the question numerically with two complementary approaches. First, we randomly add or delete edges in balanced complete multipartite graphs, which combine a QFI beyond the SQL with a single nonvanishing higher Betti number. Edge addition eventually destroys both the metrological advantage and the nontrivial topology. Under edge deletion, by contrast, higher Betti numbers persist well after the QFI has dropped to the SQL. Second, we start from Erdős--Rényi random graphs, whose QFI does not typically exceed the SQL, and maximize a chosen Betti number with a Monte Carlo search. The search drives the graphs toward near-extremal multipartite structures whose QFI lies well beyond the SQL. Our results show that topological optimization offers a route to metrologically useful graph states, but also that Betti numbers alone do not determine the QFI.

DOI
10.48550/arxiv.2611.08593

Related papers

Disorder-induced quantum Fisher information in topological quantum systems

Advay Burte, Keshav Das Agarwal, Leela Ganesh Chandra Lakkaraju +1 more

The topological order of the Kitaev toric code is insensitive to disorder in its couplings since all star and plaquette operators commute; consequently, the stabilizer ground-state manifold is independent of the individual coupling strengths, and the phase remains stable against weak local perturbations. This insensitivity, however, is a property of the eigenstates and not of the dynamics they generate, and we show that the disorder sensitivity of a probe prepared outside that eigenbasis can be a metrological resource. In particular, we investigate the estimation of the strength of three topological-order-breaking perturbations, the nonlinear Castelnovo-Chamon deformation, nearest-neighbor Ising interactions, and a magnetic field along horizontal edges, encoded on an initially separable probe through unitary evolution under the disordered toric code Hamiltonian. We demonstrate that the quenched average quantum Fisher information (QFI), a figure of merit for metrological precision, exceeds that of its ordered counterpart in suitable regimes of perturbation strength and encoding time. For the ordered case, we further identify optimal product probes, for which the quadratic and cubic terms of the short-time expansion vanish identically, leaving a transient quartic scaling of QFI. Interestingly, this window persists as long as the multipartite entanglement generated by the encoding continues to increase, and it survives under local dephasing, bit-flip, and amplitude damping noise acting independently on each site, with the non-unital channel being the least detrimental.

quant-pharXiv:2609.30142•Sep 25, 2026•0 citations

Hybrid quantum-classical framework for Betti-number estimation with applications to topological data analysis

Anonymous, Tzu-Chieh Wei

Topological data analysis (TDA) is a rapidly growing area that applies techniques from algebraic topology to extract robust features from large-scale data. A key task in TDA is the estimation of (normalized) Betti numbers, which capture essential topological invariants. While recent work has led to quantum algorithms for this problem, we explore an alternative direction: combining classical and quantum resources to estimate the Betti numbers of a simplicial complex more efficiently. Assuming the classical description of a simplicial complex, that is, its set of vertices and edges, we propose a hybrid quantum-classical algorithm. The classical component enumerates all simplices, and this combinatorial structure is subsequently processed by a quantum algorithm to estimate the Betti numbers. We analyze the performance of our approach and identify regimes where it potentially achieves polynomial to exponential speedups over existing quantum methods, at the trade-off of using more ancilla qubits. We further demonstrate the utility of normalized Betti numbers in concrete applications, highlighting the broader potential of hybrid quantum algorithms in topological data analysis.

arXiv:2508.01516•Physical Review A•Sep 21, 2026•6 citations

Weighted hypergraph states as a resource for quantum metrology

B. J. Alexander, M. S. Tame

Quantum correlations can be used to improve sensing precision beyond classical limits, yet the correlated resource states needed can be challenging to prepare and preserve. Here, we study the family of weighted hypergraph states and identify subclasses characterized by their underlying graph topology that exhibit enhanced metrological performance. Using the quantum Fisher information and a novel Dicke state basis representation, we show that these subclasses outperform both separable and standard weighted graph state benchmarks over broad ranges of edge weights corresponding to weak controlled operations between qubits representing the vertices of the graph. We provide analytical formulas for an arbitrary number $N$ of qubits, supplemented by a general study, while focusing a detailed analysis on the example case of $N=4$. By identifying the critical probabilities for local dephasing, we show that adding higher-order weighted hyperedges for $N$ qubits can enhance metrological robustness, allowing the resulting states to retain a quantum advantage at higher noise levels. These probe states exhibit favorable scaling, enhanced precision, and noise tolerance. Our findings establish weighted hypergraph states as viable, structurally tunable and robust resources for quantum-enhanced metrology.

quant-pharXiv:2610.42129•Nov 2, 2026•0 citations

Quantum Log-Determinant Methods for Torsion-Sensitive Topological Data Analysis

Dimitrios Thanos, Caesnan Leditto, Adam Wesolowski +2 more

Betti numbers are central to topological data analysis but fail to capture torsion in integral homology. Torsion can distinguish topological structures with identical Betti numbers, and examples from classical topological data analysis show that it can affect the topology inferred from data. Related torsion-sensitive quantities are also known to have practical applications in graph-based machine learning, including biomedical applications. We investigate how quantum spectral methods can access this additional information. Log pseudodeterminants, obtained by summing the logarithms of the nonzero boundary-Laplacian eigenvalues, summarize spectral information about a simplicial complex. Under explicit topological assumptions, an alternating combination of these quantities gives the size of a higher critical group, the higher-dimensional analogue of a graph sandpile group. With stronger certification, a related construction recovers the size of the torsion subgroup in homology itself. This is, to our knowledge, the first provably correct quantum estimator of integral-homology torsion order. We give a new quantum algorithm for estimating these quantities, with explicit dependence on how the input is queried, the required accuracy, and the spectral gaps. Exact spectra for balanced multipartite clique complexes provide favorable gaps, and a related construction gives an explicit torsion-bearing benchmark. With compact query access, the algorithm need not construct the exponentially large boundary matrices explicitly. For a restricted torsion-bearing family, a tailored amplitude-estimation routine uses quadratically fewer queries than any randomized classical algorithm given comparable access when estimating the log pseudodeterminant. Estimating the full, unnormalized quantity to fixed additive error still costs in proportion to the candidate-space dimension $D$.

quant-pharXiv:2609.40216•Oct 1, 2026•0 citations

Average-case hardness of Betti number estimation

Sergii Strelchuk, Sathyawageeswar Subramanian, Adam Wesołowski

We establish the average-case hardness of Betti number estimation on random clique complexes via a reduction from the planted clique problem. We further show that our reduction implies a series of hardness results for many problems in both classical and quantum Topological Data Analysis (qTDA). Under the classical planted clique conjecture, no randomized polynomial-time Betti number estimator achieves additive error below $\tfrac12$ with constant advantage. Under a new quantum planted clique conjecture that we introduce, the same conclusion holds for quantum polynomial-time algorithms. We also obtain related conditional hardness results for homology vanishing, additive approximations with larger error tolerances, preparation of simplex and harmonic states, cycle recovery, and counting eigenvalues at low energy. Our reduction clarifies the structural requirements for quantum advantage in TDA and provides a new lens to investigate the classical and quantum complexity of related problems.

quant-pharXiv:2609.12777•Sep 14, 2026•2 citations

Topological control of quantum speed limits

Alexander Kruchkov

Quantum Fisher Information (QFI) is a measure quantifying the sensitivity of a quantum state with respect to changes in tuning parameters in quantum metrology, and defining quantum speed limits. We show that even if the quantum state is completely dispersionless, QFI in this state remains momentum-resolved. We compute the QFI for topological phases at integer filling and demonstrate that each momentum-resolved term is fundamentally bounded by quantum geometric and topological invariants, with maximum QFI controlled by topological invariants (Chern number $|C|$). We also finds bounds on quantum speed limit which scales as $\sqrt{|C|}$ in a (dispersionless) topological phase. We conclude that quantum platforms of high Chern numbers $|C| \gg 1$, such as those featuring twisted multilayered van der Waals heterostructures, significantly enhance capacity for quantum Fisher information, and provide practical control over quantum speed limits.

arXiv:2507.15950•Jul 21, 2025•2 citations
Graph states are a versatile resource for quantum metrology, and their quantum Fisher information (QFI) has a closed-form expression in terms of the underlying graph: it counts pairs of vertices with identical neighborhoods. It remains unclear, however, which global structural properties of a graph determine whether its QFI exceeds the standard quantum limit (SQL). Here we ask whether topological invariants, namely the Betti numbers of the graph's clique complex, capture this behavior, and we address the question numerically with two complementary approaches. First, we randomly add or delete edges in balanced complete multipartite graphs, which combine a QFI beyond the SQL with a single nonvanishing higher Betti number. Edge addition eventually destroys both the metrological advantage and the nontrivial topology. Under edge deletion, by contrast, higher Betti numbers persist well after the QFI has dropped to the SQL. Second, we start from Erdős--Rényi random graphs, whose QFI does not typically exceed the SQL, and maximize a chosen Betti number with a Monte Carlo search. The search drives the graphs toward near-extremal multipartite structures whose QFI lies well beyond the SQL. Our results show that topological optimization offers a route to metrologically useful graph states, but also that Betti numbers alone do not determine the QFI.
The topological order of the Kitaev toric code is insensitive to disorder in its couplings since all star and plaquette operators commute; consequently, the stabilizer ground-state manifold is independent of the individual coupling strengths, and the phase remains stable against weak local perturbations. This insensitivity, however, is a property of the eigenstates and not of the dynamics they generate, and we show that the disorder sensitivity of a probe prepared outside that eigenbasis can be a metrological resource. In particular, we investigate the estimation of the strength of three topological-order-breaking perturbations, the nonlinear Castelnovo-Chamon deformation, nearest-neighbor Ising interactions, and a magnetic field along horizontal edges, encoded on an initially separable probe through unitary evolution under the disordered toric code Hamiltonian. We demonstrate that the quenched average quantum Fisher information (QFI), a figure of merit for metrological precision, exceeds that of its ordered counterpart in suitable regimes of perturbation strength and encoding time. For the ordered case, we further identify optimal product probes, for which the quadratic and cubic terms of the short-time expansion vanish identically, leaving a transient quartic scaling of QFI. Interestingly, this window persists as long as the multipartite entanglement generated by the encoding continues to increase, and it survives under local dephasing, bit-flip, and amplitude damping noise acting independently on each site, with the non-unital channel being the least detrimental.
Topological data analysis (TDA) is a rapidly growing area that applies techniques from algebraic topology to extract robust features from large-scale data. A key task in TDA is the estimation of (normalized) Betti numbers, which capture essential topological invariants. While recent work has led to quantum algorithms for this problem, we explore an alternative direction: combining classical and quantum resources to estimate the Betti numbers of a simplicial complex more efficiently. Assuming the classical description of a simplicial complex, that is, its set of vertices and edges, we propose a hybrid quantum-classical algorithm. The classical component enumerates all simplices, and this combinatorial structure is subsequently processed by a quantum algorithm to estimate the Betti numbers. We analyze the performance of our approach and identify regimes where it potentially achieves polynomial to exponential speedups over existing quantum methods, at the trade-off of using more ancilla qubits. We further demonstrate the utility of normalized Betti numbers in concrete applications, highlighting the broader potential of hybrid quantum algorithms in topological data analysis.
Quantum correlations can be used to improve sensing precision beyond classical limits, yet the correlated resource states needed can be challenging to prepare and preserve. Here, we study the family of weighted hypergraph states and identify subclasses characterized by their underlying graph topology that exhibit enhanced metrological performance. Using the quantum Fisher information and a novel Dicke state basis representation, we show that these subclasses outperform both separable and standard weighted graph state benchmarks over broad ranges of edge weights corresponding to weak controlled operations between qubits representing the vertices of the graph. We provide analytical formulas for an arbitrary number NNN of qubits, supplemented by a general study, while focusing a detailed analysis on the example case of N=4N=4N=4. By identifying the critical probabilities for local dephasing, we show that adding higher-order weighted hyperedges for NNN qubits can enhance metrological robustness, allowing the resulting states to retain a quantum advantage at higher noise levels. These probe states exhibit favorable scaling, enhanced precision, and noise tolerance. Our findings establish weighted hypergraph states as viable, structurally tunable and robust resources for quantum-enhanced metrology.
Betti numbers are central to topological data analysis but fail to capture torsion in integral homology. Torsion can distinguish topological structures with identical Betti numbers, and examples from classical topological data analysis show that it can affect the topology inferred from data. Related torsion-sensitive quantities are also known to have practical applications in graph-based machine learning, including biomedical applications. We investigate how quantum spectral methods can access this additional information. Log pseudodeterminants, obtained by summing the logarithms of the nonzero boundary-Laplacian eigenvalues, summarize spectral information about a simplicial complex. Under explicit topological assumptions, an alternating combination of these quantities gives the size of a higher critical group, the higher-dimensional analogue of a graph sandpile group. With stronger certification, a related construction recovers the size of the torsion subgroup in homology itself. This is, to our knowledge, the first provably correct quantum estimator of integral-homology torsion order. We give a new quantum algorithm for estimating these quantities, with explicit dependence on how the input is queried, the required accuracy, and the spectral gaps. Exact spectra for balanced multipartite clique complexes provide favorable gaps, and a related construction gives an explicit torsion-bearing benchmark. With compact query access, the algorithm need not construct the exponentially large boundary matrices explicitly. For a restricted torsion-bearing family, a tailored amplitude-estimation routine uses quadratically fewer queries than any randomized classical algorithm given comparable access when estimating the log pseudodeterminant. Estimating the full, unnormalized quantity to fixed additive error still costs in proportion to the candidate-space dimension DDD.
We establish the average-case hardness of Betti number estimation on random clique complexes via a reduction from the planted clique problem. We further show that our reduction implies a series of hardness results for many problems in both classical and quantum Topological Data Analysis (qTDA). Under the classical planted clique conjecture, no randomized polynomial-time Betti number estimator achieves additive error below 12\tfrac1221​ with constant advantage. Under a new quantum planted clique conjecture that we introduce, the same conclusion holds for quantum polynomial-time algorithms. We also obtain related conditional hardness results for homology vanishing, additive approximations with larger error tolerances, preparation of simplex and harmonic states, cycle recovery, and counting eigenvalues at low energy. Our reduction clarifies the structural requirements for quantum advantage in TDA and provides a new lens to investigate the classical and quantum complexity of related problems.
Quantum Fisher Information (QFI) is a measure quantifying the sensitivity of a quantum state with respect to changes in tuning parameters in quantum metrology, and defining quantum speed limits. We show that even if the quantum state is completely dispersionless, QFI in this state remains momentum-resolved. We compute the QFI for topological phases at integer filling and demonstrate that each momentum-resolved term is fundamentally bounded by quantum geometric and topological invariants, with maximum QFI controlled by topological invariants (Chern number ∣C∣|C|∣C∣). We also finds bounds on quantum speed limit which scales as ∣C∣\sqrt{|C|}∣C∣​ in a (dispersionless) topological phase. We conclude that quantum platforms of high Chern numbers ∣C∣≫1|C| \gg 1∣C∣≫1, such as those featuring twisted multilayered van der Waals heterostructures, significantly enhance capacity for quantum Fisher information, and provide practical control over quantum speed limits.