734 search results - page 5 / 147 » A polynomial quantum algorithm for approximating the Jones p... |
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
ALGORITHMICA
2002
13 years 8 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
FLOPS
2004
Springer
14 years 1 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 ...
STOC
2010
ACM
14 years 6 months ago
2010
ACM
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...