The topology of data hides in quantum thermal states
arXiv:2402.15633 · doi:10.1063/5.0209201
Abstract
We provide a quantum protocol to perform topological data analysis (TDA) via the distillation of quantum thermal states. Recent developments of quantum thermal state preparation algorithms reveal their characteristic scaling defined by properties of dissipative Lindbladians. This contrasts with protocols based on unitary evolution which have a scaling depending on the properties of the combinatorial Laplacian. To leverage quantum thermal state preparation algorithms, we translate quantum TDA from a real-time to an imaginary-time picture, shifting the paradigm from a unitary approach to a dissipative one. Starting from an initial state overlapping with the ground state of the system, one can dissipate its energy via channels unique to the dataset, naturally distilling its information. Therefore calculating Betti numbers translates into a purity estimation. Alternatively, this can be interpreted as the evaluation of the Rényi 2-entropy, Uhlmann fidelity or Hilbert-Schmidt distance relative to thermal states with the embedded topology of simplicial complexes. Our work opens the field of TDA toward a more physical interpretation of the topology of data.
8 pages, 3 figures. Published version, revtex format
References in corpus (20)
- The randomized measurement toolbox
- Entanglement spectroscopy on a quantum computer
- Predicting Gibbs-State Expectation Values with Pure Thermal Shadows
- Analyzing Prospects for Quantum Advantage in Topological Data Analysis
- Quantum algorithms for estimating quantum entropies
- Quantum Mixed State Compiling
- Szegedy Walk Unitaries for Quantum Maps
- Learning quantum phase transitions through Topological Data Analysis
- Quantifying non-Gaussianity of a quantum state by the negative entropy of quadrature distributions
- Quantum Topological Data Analysis with Linear Depth and Exponential Speedup
- Complexity-Theoretic Limitations on Quantum Algorithms for Topological Data Analysis
- A streamlined quantum algorithm for topological data analysis with exponentially fewer qubits
- Quantum Sampling Algorithms, Phase Transitions, and Computational Complexity
- Complexity of Supersymmetric Systems and the Cohomology Problem
- Topological data analysis on noisy quantum computers
- Persistent homology of quantum entanglement
- Fast Thermalization from the Eigenstate Thermalization Hypothesis
- Quantum Algorithm for Estimating Betti Numbers Using Cohomology Approach
- Quantum topological data analysis via the estimation of the density of states
- Limitations of Clustering Using Quantum Persistent Homology