2479 search results - page 31 / 496 » Quantum complexity theory |
STOC
2007
ACM
14 years 10 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
COCO
2009
Springer
14 years 4 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...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
In this article we present a refined summation theory based on Karr's difference field approach. The resulting algorithms find sum representations with optimal nested depth. ...
COMPLEXITY
2007
13 years 10 months ago
2007
ISCI
2000
13 years 10 months ago
2000
This paper reviews evidence from neuroscience and quantum computing theory in support of the notion of autonomy in the workings of cognitive processes. De