Learning DNF over the uniform distribution using a quantum example oracle

被引:75
作者
Bshouty, NH [1 ]
Jackson, JC
机构
[1] Univ Calgary, Dept Comp Sci, Calgary, AB T2N 1N4, Canada
[2] Duquesne Univ, Dept Math & Comp Sci, Pittsburgh, PA 15282 USA
关键词
quantum example oracle; quantum computing; disjunctive normal form (DNF); machine learning; Fourier transform;
D O I
10.1137/S0097539795293123
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We generalize the notion of probably approximately correct (PAC) learning from an example oracle to a notion of efficient learning on a quantum computer using a quantum example oracle. This quantum example oracle is a natural extension of the traditional PAC example oracle, and it immediately follows that all PAC-learnable function classes are learnable in the quantum model. Furthermore, we obtain positive quantum learning results for classes that are not known to be PAC learnable. Specifically, we show that disjunctive normal form (DNF) is efficiently learnable with respect to the uniform distribution by a quantum algorithm using a quantum example oracle. While it was already known that DNF is uniform-learnable using a membership oracle, we prove that a quantum example oracle with respect to uniform is less powerful than a membership oracle.
引用
收藏
页码:1136 / 1153
页数:18
相关论文
共 33 条
[21]  
Goldreich O., 1989, Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, P25, DOI 10.1145/73007.73010
[22]  
HANCOCK TR, 1991, PROCEEDINGS OF THE FOURTH ANNUAL WORKSHOP ON COMPUTATIONAL LEARNING THEORY, P199
[23]  
Jackson J., 1994, Proceedings. 35th Annual Symposium on Foundations of Computer Science (Cat. No.94CH35717), P42, DOI 10.1109/SFCS.1994.365706
[24]  
JACKSON J, 1997, P 5 ISR S THEOR COMP
[25]  
JACKSON JC, 1995, CMUCS95183
[26]   LEARNING DECISION TREES USING THE FOURIER SPECTRUM [J].
KUSHILEVITZ, E ;
MANSOUR, Y .
SIAM JOURNAL ON COMPUTING, 1993, 22 (06) :1331-1348
[27]  
Kushilevitz E., 1993, Proceeding of the Sixth Annual ACM Conference on Computational Learning Theory, P317, DOI 10.1145/168304.168362
[28]   CONSTANT DEPTH CIRCUITS, FOURIER-TRANSFORM, AND LEARNABILITY [J].
LINIAL, N ;
MANSOUR, Y ;
NISAN, N .
JOURNAL OF THE ACM, 1993, 40 (03) :607-620
[29]   THE STRENGTH OF WEAK LEARNABILITY [J].
SCHAPIRE, RE .
MACHINE LEARNING, 1990, 5 (02) :197-227
[30]  
Shor P. W., 1994, Proceedings. 35th Annual Symposium on Foundations of Computer Science (Cat. No.94CH35717), P124, DOI 10.1109/SFCS.1994.365700