734 search results - page 1 / 147 » A polynomial quantum algorithm for approximating the Jones p... |
STOC
2006
ACM
14 years 5 months ago
2006
ACM
FOCS
2003
IEEE
13 years 10 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...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
This paper studies a simple class of zero-sum games played by two competing quantum players: each player sends a mixed quantum state to a referee, who performs a joint measurement...
DAGSTUHL
2006
13 years 6 months ago
2006
COCO
2009
Springer
13 years 11 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...