Experimental Quantum Computing to Solve Systems of Linear Equations
Abstract
Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time proportional to the number of variables N. A recently proposed quantum algorithm shows that quantum computers could solve linear systems in a time scale of order log(N), giving an exponential speedup over classical computers. Here we realize the simplest instance of this algorithm, solving 2×2 linear equations for various input vectors on a quantum computer. We use four quantum bits and four controlled logic gates to implement every subroutine required, demonstrating the working principle of this algorithm.
- Publication:
-
Physical Review Letters
- Pub Date:
- June 2013
- DOI:
- 10.1103/PhysRevLett.110.230501
- arXiv:
- arXiv:1302.4310
- Bibcode:
- 2013PhRvL.110w0501C
- Keywords:
-
- 03.67.Ac;
- 03.65.Ud;
- 03.67.Lx;
- 42.50.-p;
- Quantum algorithms protocols and simulations;
- Entanglement and quantum nonlocality;
- Quantum computation;
- Quantum optics;
- Quantum Physics
- E-Print:
- accepted version, to appear in Physical Review Letters