 |
Center for Nonlinear Studies |
Some computational problems that are hard for classical computers can be solved efficiently using quantum computers. One such problem is solving a system of linear equations. In this talk I will describe what makes this problem hard for classical algorithms and how various quantum algorithms solve this problem in time that scales polylogarithmic in the dimension of the linear system. I will also discuss the caveats to this claim to exponential quantum speedup and some applications.
Host: David Metiver