Sciweavers

59 search results - page 7 / 12
» Nonadaptive quantum query complexity
Sort
View
CORR
2010
Springer
43views Education» more  CORR 2010»
13 years 8 months ago
Quantum query complexity of minor-closed graph properties
Andrew M. Childs, Robin Kothari
COLT
2010
Springer
13 years 9 months ago
Quantum Predictive Learning and Communication Complexity with Single Input
We define a new model of quantum learning that we call Predictive Quantum (PQ). This is a quantum analogue of PAC, where during the testing phase the student is only required to a...
Dmitry Gavinsky
ICALP
2005
Springer
14 years 4 months ago
Quantum Complexity of Testing Group Commutativity
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
Frédéric Magniez, Ashwin Nayak
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
14 years 11 months ago
Negative weights make adversaries stronger
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...
Peter Høyer, Troy Lee, Robert Spalek
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 11 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang