Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

98

Voted

CPHYSICS
2011

199views Education» more CPHYSICS 2011»

The complexity of the Quantum Adiabatic Algorithm

14 years 9 months ago

The complexity of the Quantum Adiabatic Algorithm

Download physics.ucsc.edu

A. P. Young, S. Knysh, V. N. Smelyanskiy

Real-time Traffic

CPHYSICS 2011 | Education |

claim paper

Related Content

» Lower bounds for local search by quantum arguments

» Three counterexamples refuting Kieus plan for quantum adiabatic hypercomputation and some ...

» The detectability lemma and quantum gap amplification

» Adiabatic quantum state generation and statistical zero knowledge

» Common Mistakes in Adiabatic Logic Design and How to Avoid Them

» Improved outputsensitive quantum algorithms for Boolean matrix multiplication

» Simulating and Compiling Code for the Sequential Quantum Random Access Machine

» Polynomial Degree vs Quantum Query Complexity

» Sharp Quantum versus Classical Query Complexity Separations

Post Info
More Details (n/a)

Added	13 May 2011
Updated	13 May 2011
Type	Journal
Year	2011
Where	CPHYSICS
Authors	A. P. Young, S. Knysh, V. N. Smelyanskiy

Comments (0)