Quantum algorithms achieve polylogarithmic complexity for Betti number estimation and homology testing via block-encoded Laplacians and cohomological projections, claiming exponential speedups under sparsity assumptions.
Quantum walks on simplicial complexes and harmonic homology: Application to topological data analysis with superpolynomial speedups.arXiv preprint arXiv:2404.15407
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2verdicts
UNVERDICTED 2representative citing papers
Quantum algorithms achieve polynomial advantage for synchronization estimation and super-polynomial advantage for no-phase-locking certification in higher-order simplicial Kuramoto models under stated assumptions.
citing papers explorer
-
New aspects of quantum topological data analysis: Betti number estimation, and testing and tracking of homology and cohomology classes
Quantum algorithms achieve polylogarithmic complexity for Betti number estimation and homology testing via block-encoded Laplacians and cohomological projections, claiming exponential speedups under sparsity assumptions.
-
Efficient Quantum Algorithms for Higher-Order Coupled Oscillators
Quantum algorithms achieve polynomial advantage for synchronization estimation and super-polynomial advantage for no-phase-locking certification in higher-order simplicial Kuramoto models under stated assumptions.