[Home]History of BookOnTheBookshelf

FrontPage | BookOfChanges | Preferences


Revision 37 . . (edit) April 21, 2012 3:01 pm by s10-16.opera-mini.net
Revision 36 . . (edit) April 21, 2012 2:48 pm by s10-16.opera-mini.net
Revision 35 . . June 11, 2011 1:49 pm by 81-64-220-205.rev.numericable.fr [Revert]
Revision 34 . . June 8, 2011 4:53 pm by 174.3.231.158
  

Difference (from prior major revision) (minor diff, author diff)

Added: 0a1
The Book on the Bookshelf, HenryPetroski? [ISBN 0375706399 (amazon.com, search)]

Added: 1a3,32


arcing12 23:38:
A Bookshelved convention: used to tag book pages for indexing purposes. Click on the title of this page, at the top left, to be presented with a list of the books on this site. (Well, books which people who reviewed them have remembered to tag that way, or that some Wiki:WikiGnome has indexed afterwards.)

PDF
PostScript?
Other formats
Current browse context:
quant-ph
< prev | next >

new | recent | 0405
References & Citations
INSPIRE HEP
(refers to | cited by)
NASA ADS
5 blog links(what is this?)
Bookmark(what is this?)
Quantum Physics
Title: Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
Authors: Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, Oded Regev
(Submitted on 18 May 2004 (v1), last revised 26 Mar 2005 (this version, v2))
Abstract: Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which implies that the adiabatic computation model and the conventional quantum computation model are polynomially equivalent. Our result can be extended to the physically realistic setting of particles arranged on a two-dimensional grid with nearest neighbor interactions. The equivalence between the models provides a new vantage point from which to tackle the central issues in quantum computation, namely designing new quantum algorithms and constructing fault tolerant quantum computers. In particular, by translating the main open questions in the area of quantum algorithms to the language of spectral gaps of sparse matrices, the result makes these questions accessible to a wider scientific audience, acquainted with mathematical physics, expander theory and rapidly mixing Markov chains.
Comments: 30 pages, updated version
Subjects: Quantum Physics (quant-ph)
Journal reference: SIAM Journal of Computing, Vol. 37, Issue 1, p. 166-194 (2007), conference version in Proc. 45th FOCS, p. 42-51 (2004)
Cite as: arXiv:quant-ph/0405098v2

Submission history
From: Oded Regev [view email]

Added: 10a42
Host: 74.125.224.135 rDNS = 74.125.224.135

FrontPage | BookOfChanges | Preferences
Search: