Sciweavers

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

6

STOC
2003
ACM

favoriteEmaildiscussreport

88views Algorithms» more STOC 2003»

Exponential algorithmic speedup by a quantum walk

14 years 4 months ago

Exponential algorithmic speedup by a quantum walk

Download pages.cpsc.ucalgary.ca

Andrew M. Childs, Richard Cleve, Enrico Deotto, Ed

Real-time Traffic

Algorithms | Exponential Algorithmic Speedup | STOC 2003 |

claim paper

Related Content

» Quantum Service Selection

» The Bubble Bit Technique as Improvement of HDLBased Quantum Circuits Simulation

» Quantum Lower Bounds by Polynomials

» Checking equivalence of quantum circuits and states

» Limitations of quantum coset states for graph isomorphism

» Smaller Decoding Exponents BallCollision Decoding

» Leaping Multiple Headers in a Single Bound WireSpeed Parsing Using the Kangaroo System

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2003
Where	STOC
Authors	Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, Daniel A. Spielman

Comments (0)