MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Quantum Algorithm for Linear Systems of Equations

Author(s)
Lloyd, Seth; Hassidim, Avinatan
Thumbnail
DownloadHarrow-2009-Quantum Algorithm fo.pdf (96.97Kb)
PUBLISHER_POLICY

Publisher Policy

Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.

Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
Solving linear systems of equations is a common problem that arises both on its own and as a subroutine in more complex problems: given a matrix A and a vector b⃗, find a vector x⃗ such that Ax⃗=b⃗. We consider the case where one does not need to know the solution x⃗ itself, but rather an approximation of the expectation value of some operator associated with x⃗, e.g., x⃗†Mx⃗ for some matrix M. In this case, when A is sparse, N×N and has condition number κ, the fastest known classical algorithms can find x⃗ and estimate x⃗†Mx⃗ in time scaling roughly as N√κ. Here, we exhibit a quantum algorithm for estimating x⃗†Mx⃗ whose runtime is a polynomial of log(N) and κ. Indeed, for small values of κ [i.e., polylog(N)], we prove (using some common complexity-theoretic assumptions) that any classical algorithm for this problem generically requires exponentially more time than our quantum algorithm.
Date issued
2009-10
URI
http://hdl.handle.net/1721.1/51753
Department
Massachusetts Institute of Technology. Department of Mechanical Engineering; Massachusetts Institute of Technology. Research Laboratory of Electronics
Journal
Physical Review Letters
Publisher
American Physical Society
Citation
Harrow, Aram W., Avinatan Hassidim, and Seth Lloyd. “Quantum Algorithm for Linear Systems of Equations.” Physical Review Letters 103.15 (2009): 150502. © 2009 The American Physical Society.
Version: Final published version
ISSN
0031-9007

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.