Speaker: Seth Lloyd
Affiliation: Massachusetts Institute of Technology
Abstract: Quantum computers exhibit a variety of exponential enhancements over classical computers for performing linear algebraic operations. This talk reviews quantum algorithms for algebraic topology: I show how the central problem of simplicial homology can be mapped into a quantum computation, with an exponential speedup over classical algorithms. The method is particularly well adapted to topological analysis of large data sets, including financial time series analysis.