14 search results - page 2 / 3 » Quantum Query Complexity of Multilinear Identity Testing |
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
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...
COCO
2001
Springer
13 years 10 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
STACS
2010
Springer
14 years 11 days ago
2010
Springer
Abstract. Suppose one has access to oracles generating samples from two unknown probability distributions p and q on some N-element set. How many samples does one need to test whet...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
COLT
2010
Springer
13 years 3 months ago
2010
Springer
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...