Sciweavers

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

112

STOC
2001
ACM

114views Algorithms» more STOC 2001»

Quantum computers that can be simulated classically in polynomial time

16 years 2 months ago

Quantum computers that can be simulated classically in polynomial time

Download www.cs.sfu.ca

Leslie G. Valiant

Real-time Traffic

Algorithms | Quantum Computers | STOC 2001 |

claim paper

Related Content

» Quantum Computing Postselection and Probabilistic PolynomialTime

» A Brief Survey of Quantum Programming Languages

» An Exact Quantum PolynomialTime Algorithm for Simons Problem

» TimeSpace Efficient Simulations of Quantum Computations

» Advice Coins for Classical and Quantum Computation

» Closed Timelike Curves Make Quantum and Classical Computing Equivalent

» Revisiting a limit on efficient quantum computation

» Exact Quantum Algorithms for the Leader Election Problem

» Quantum versus Classical Learnability

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2001
Where	STOC
Authors	Leslie G. Valiant

Comments (0)