388 search results - page 6 / 78 » Quantum Lower Bounds by Polynomials |
CORR
2007
Springer
13 years 6 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
JACM
2006
13 years 6 months ago
2006
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
AIEDAM
2008
13 years 6 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
