Quantum topological data analysis via the estimation of the density of states
arXiv:2312.07115 · doi:10.1103/PhysRevA.110.042616
Abstract
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 datasets and building explainable AI solutions. This task becomes computationally hard for simplicial complexes with over sixty 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 multi-fidelity protocols. Next, we develop various post-processing 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 to near-term device implementations and highlighting the utility of global DOS-based estimators.
arXiv comment15 pages, 8 figures
References in corpus (30)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Error mitigation for short-depth quantum circuits
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Efficient variational quantum simulator incorporating active error minimisation
- Practical Quantum Error Mitigation for Near-Future Applications
- Quantum advantage with shallow circuits
- tket : A Retargetable Compiler for NISQ Devices
- Learning the quantum algorithm for state overlap
- Accelerated Variational Quantum Eigensolver
- Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
- Variational Quantum State Diagonalization
- The SWAP test and the Hong-Ou-Mandel effect are equivalent
- Analog quantum chemistry simulation
- Methodology for replacing indirect measurements with direct measurements
- The Topology of the Cosmic Web in Terms of Persistent Betti Numbers
- Quantum Krylov subspace algorithms for ground and excited state energy estimation
- Analysis of Kolmogorov Flow and Rayleigh-Bénard Convection using Persistent Homology
- Matchgate Shadows for Fermionic Quantum Simulation
- Fixed Depth Hamiltonian Simulation via Cartan Decomposition
- Analog quantum simulation of chemical dynamics
- Quantum inverse iteration algorithm for programmable quantum simulators
- Entanglement spectroscopy with a depth-two quantum circuit
- Quantum Kernel Methods for Solving Differential Equations
- Towards quantum advantage via topological data analysis
- Analyzing Prospects for Quantum Advantage in Topological Data Analysis
- A constructive algorithm for the Cartan decomposition of SU(2^N)
- Hamiltonian operator approximation for energy measurement and ground state preparation
- Complexity-Theoretic Limitations on Quantum Algorithms for Topological Data Analysis
- Density-of-states of many-body quantum systems from tensor networks
- Complexity of Supersymmetric Systems and the Cohomology Problem