342 search results - page 5 / 69 » Quantum Algorithms |
115
Voted
STOC
2003
ACM
16 years 3 months ago
2003
ACM
135
Voted
STOC
2002
ACM
16 years 3 months ago
2002
ACM
127
Voted
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
123
Voted
ENGL
2008
15 years 2 months ago
2008
Multiple-valued quantum circuits are promising choices for future quantum computing technology, since the multiple-valued quantum system is more compact than the corresponding bina...