Streamlined quantum algorithm for persistent Betti numbers with exponential qubit reduction, polynomial speedups, and a competitive quantum-inspired classical algorithm showing no evidence for exponential quantum advantage.
As a result, Y has acted as a change of basis, from the simplicial basis, to a basis of chains that has, as a subset, a basis of C i,j 2 (Sj)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A streamlined quantum algorithm for topological data analysis with exponentially fewer qubits
Streamlined quantum algorithm for persistent Betti numbers with exponential qubit reduction, polynomial speedups, and a competitive quantum-inspired classical algorithm showing no evidence for exponential quantum advantage.