215 search results - page 1 / 43 » Quantum computers that can be simulated classically in polyn... |
102
Voted
STOC
2001
ACM
16 years 1 months ago
2001
ACM
109
Voted
CORR
2004
Springer
15 years 29 days ago
2004
Springer
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
127
Voted
FLOPS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
164
Voted
ISTCS
1997
Springer
15 years 5 months ago
1997
Springer
We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the...
96
Voted
ECCC
2010
15 years 1 months ago
2010
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...