2661 search results - page 10 / 533 » Quantum Complexity Classes |
FOCS
1998
IEEE
15 years 4 months ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
98
Voted
ITICSE
2010
ACM
15 years 2 months ago
2010
ACM
We show how to teach and motivate small quantum computer programs as a supplemental topic in a CS2 data structures class. A traditional example such as Shor’s factorization [8] ...
CORR
2010
Springer
15 years 20 days ago
2010
Springer
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
105
Voted
PAAPP
2007
15 years 2 days ago
2007
The quantum model of computation not only o ers entirely new ways to manipulate information, but also allows information processing tasks to be formulated in unconventional, genui...
117
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...