1391 search results - page 16 / 279 » Complexity Limitations on Quantum Computation |
TEC
2008
13 years 7 months ago
2008
Abstract--The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness f...
COCO
2009
Springer
14 years 2 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...
STACS
2009
Springer
2009
Springer
Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence
14 years 2 months ago
STOC
2007
ACM
14 years 8 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...
ICTCS
2005
Springer
14 years 1 months ago
2005
Springer
This work introduces two decision problems, StabilizerD and Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well a...