342 search results - page 5 / 69 » Quantum Algorithms |
STOC
2001
ACM
14 years 7 months ago
2001
ACM
STOC
2003
ACM
14 years 7 months ago
2003
ACM
STOC
2002
ACM
14 years 7 months ago
2002
ACM
FOCS
2003
IEEE
14 years 23 days 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...
ENGL
2008
13 years 7 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...