| Abstract: |
| It has been recently revealed that surprising connections exist between topological data analysis and quantum computing. In this talk, I will show a quantum algorithm for estimating persistent Betti numbers, which is a central quantity in TDA. Moreover, I will show a complexity theoretic evidence that quantum computing exponentially outperforms classical computing for certain problems in TDA. |
|