| Literature DB >> 25167475 |
X-D Cai1, C Weedbrook2, Z-E Su1, M-C Chen1, Mile Gu3, M-J Zhu1, Li Li1, Nai-Le Liu1, Chao-Yang Lu1, Jian-Wei Pan1.
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.Year: 2013 PMID: 25167475 DOI: 10.1103/PhysRevLett.110.230501
Source DB: PubMed Journal: Phys Rev Lett ISSN: 0031-9007 Impact factor: 9.161