Two new results about quantum exact learning

09/30/2018
by   Srinivasan Arunachalam, et al.
0

We present two new results about exact learning by quantum computers. First, we show how to exactly learn a k-Fourier-sparse n-bit Boolean function from O(k^1.5( k)^2) uniform quantum examples for that function. This improves over the bound of Θ(kn) uniformly random classical examples (Haviv and Regev, CCC'15). Second, we show that if a concept class C can be exactly learned using Q quantum membership queries, then it can also be learned using O(Q^2/ Q|C|) classical membership queries. This improves the previous-best simulation result (Servedio and Gortler, SICOMP'04) by a Q-factor.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/15/2018

Learning DNFs under product distributions via μ-biased quantum Fourier sampling

We show that DNF formulae can be quantum PAC-learned in polynomial time ...
research
09/04/2018

Quantum algorithms and lower bounds for convex optimization

While recent work suggests that quantum computers can speed up the solut...
research
09/03/2018

Convex optimization using quantum oracles

We study to what extent quantum algorithms can speed up solving convex o...
research
12/30/2021

Set membership with two classical and quantum bit probes

We consider the following problem: Given a set S of at most n elements f...
research
07/21/2020

Partial Boolean functions with exact quantum 1-query complexity

We provide two sufficient and necessary conditions to characterize any n...
research
05/06/2020

On the Learnability of Possibilistic Theories

We investigate learnability of possibilistic theories from entailments i...
research
05/04/2021

Deja-Vu: A Glimpse on Radioactive Soft-Error Consequences on Classical and Quantum Computations

What do Apple, the FBI and a Belgian politician have in common? In 2003,...

Please sign up or login with your details

Forgot password? Click here to reset