A Quantum Algorithm for Solving Linear Sets of Equations
November 19, 2006 - 1:45 - 2:10pm
RLE Conference Center 36-428
Solving linear systems of equations is a common problem in a wide variety of fields. The most common method of solution is Gaussian elimination, which takes time O(n^3); for sparse matrices, conjugate gradient methods can take time O(n). This talk describes a quantum algorithm that takes time O(polylog(n)).
Seth Lloyd was the first person to develop a realizable model for quantum computation and is currently working with a variety of groups to construct and operate quantum computers and quantum communication systems. Dr. Lloyd is the author of over a hundred scientific papers, and of `Programming the Universe,' (Knopf, 2004). He is currently the director of the W.M. Keck Center for Extreme Quantum Information Theory (xQIT) at MIT.