Quantum adiabatic like algorithms for linear systems of equations
Presented by Yigit Subasi, Los Alamos National Laboratory
Linear systems of equations are ubiquitous in science and engineering. The best classical algorithms to solve them scale at least linearly in the problem size. I will first review a quantum algorithm for this problem by Harrow, Hassidim and Lloyd that can result in exponential speedup for some instances. Then I will briefly mention improvements to this algorithm by Childs, Kothari and Somma. Both of these algorithms require a universal gate-based quantum computer.
In the rest of my talk I will describe new adiabatic like algorithms to solve linear systems of equations. Our algorithm is not obtained using equivalences between the circuit model and adiabatic quantum computing. Just like other quantum algorithms for this problem, our method may result in an exponential quantum speedup for particular instances, but the crucial difference relies on the fact that our quantum method may be implemented with non-universal computing resources.
3:30 pm, Thursday, December 7, 2017
Room 190, Physics & Astronomy
Northeast corner of Lomas and Yale, Albuquerque, New Mexico
Individuals with disabilities who need an auxiliary aid or service to attend or participate in P&A events should contact Sandra Ortiz (phone: 505-277-5900, email: email@example.com) well in advance to ensure your needs are accomodated. Event handouts can be provided in alternative accessible formats upon request. Please contact Mrs. Ortiz if you need written information in an alternative format.
A schedule of talks within the Department of Physics and Astronomy is available on the P&A web site at http://physics.unm.edu/pandaweb/events/index.php