2 citations · 2 across the 7 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
quant-ph2024★ 2 cited
Provable quantum speedups for computing persistence in topological data analysis
Casper Gyurik, Alexander Schmidhuber, Robbie King +2
Topological data analysis (TDA) aims to extract noise-robust features from a data set by examining the number and persistence of holes in its topology. We provide an efficient quan…
quant-ph2024
Quantum Walks on Simplicial Complexes and Harmonic Homology: Application to Topological Data Analysis with Superpolynomial Speedups
Ryu Hayakawa, Kuo-Chin Chen, Min-Hsiu Hsieh
This work investigates whether quantum walks on simplicial complexes exhibit quantum advantages. We introduce a novel quantum walk that encodes the combinatorial Laplacian, a key o…