Alternative Method for Estimating Betti Numbers (2403.04686v2)
Abstract: Topological data analysis (TDA) is a fast-growing field that utilizes advanced tools from topology to analyze large-scale data. A central problem in topological data analysis is estimating the so-called Betti numbers of the underlying simplicial complex. While the difficulty of this problem has been established as NP-hard, previous works have showcased appealing quantum speedup. In this article, we provide an alternative method for estimating Betti numbers and normalized Betti numbers of given simplicial complex, based on some recent advances in quantum algorithm, specifically, quantum singular value transformation. Our method can be faster than the best-known classical method for finding Betti numbers, and interestingly, it can also find the Betti numbers of the complement graph to our original one. Comparing to the best known quantum algorithm, our method generally requires lower depth circuit, in trade-off for longer running time. Regarding normalized Betti numbers, our method could match the running time of best-known quantum method in the case of dense simplices.
- Peter W Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM review, 41(2):303–332, 1999.
- Lov K Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pages 212–219, 1996.
- David Deutsch. Quantum theory, the church–turing principle and the universal quantum computer. Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 400(1818):97–117, 1985.
- Rapid solution of problems by quantum computation. Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 439(1907):553–558, 1992.
- A Yu Kitaev. Quantum measurements and the abelian stabilizer problem. arXiv preprint quant-ph/9511026, 1995.
- Quantum machine learning. Nature, 549(7671):195–202, 2017.
- On the role of entanglement and statistics in learning. arXiv preprint arXiv:2306.03161, 2023.
- Ronald Chrisley. Quantum learning. In New directions in cognitive science: Proceedings of the international symposium, Saariselka, volume 4, 1995.
- Quantum advantage in learning from experiments. Science, 376(6598):1182–1186, 2022.
- Quantum reinforcement learning. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 38(5):1207–1220, 2008.
- Quantum algorithm for data fitting. Physical review letters, 109(5):050505, 2012.
- Quantum algorithms for nearest-neighbor methods for supervised and unsupervised learning. arXiv preprint arXiv:1401.2142, 2014.
- Optimal hamiltonian simulation by quantum signal processing. Physical review letters, 118(1):010501, 2017.
- Hamiltonian simulation by qubitization. Quantum, 3:163, 2019.
- Efficient quantum algorithms for simulating sparse hamiltonians. Communications in Mathematical Physics, 270(2):359–371, 2007.
- Black-box hamiltonian simulation and unitary implementation. Quantum Information and Computation, 12:29–62, 2009.
- Dominic W Berry. High-order quantum algorithm for solving linear differential equations. Journal of Physics A: Mathematical and Theoretical, 47(10):105301, 2014.
- Quantum algorithm for linear systems of equations. Physical review letters, 103(15):150502, 2009.
- Quantum algorithm for systems of linear equations with exponentially improved dependence on precision. SIAM Journal on Computing, 46(6):1920–1950, 2017.
- High-precision quantum algorithms for partial differential equations. Quantum, 5:574, 2021.
- Quantum algorithms for topological and geometric analysis of data. Nature communications, 7(1):1–7, 2016.
- Complexity-theoretic limitations on quantum algorithms for topological data analysis. arXiv preprint arXiv:2209.14286, 2022.
- Quantum topological data analysis with linear depth and exponential speedup. arXiv preprint arXiv:2108.02811, 2021.
- Review of a quantum algorithm for betti numbers. arXiv preprint arXiv:1906.07673, 2019.
- A streamlined quantum algorithm for topological data analysis with exponentially fewer qubits. arXiv preprint arXiv:2209.12887, 2022.
- Quantum persistent homology. arXiv preprint arXiv:2202.12965, 2022.
- An improved method for quantum matrix multiplication. Quantum Information Processing, 22(8):299, 2023.
- Quantum algorithm for estimating eigenvalue. arXiv preprint arXiv:2211.06179, 2022.
- Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 193–204, 2019.
- Patrick Rall. Quantum algorithms for estimating physical quantities using block encodings. Physical Review A, 102(2):022408, 2020.
- Approximate quantum circuit synthesis using block encodings. Physical Review A, 102(5):052411, 2020.
- Numerical linear algebra, volume 181. Siam, 2022.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.