An improved lower bound on query complexity for quantum PAC learning (Q1944033)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6150225
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved lower bound on query complexity for quantum PAC learning |
scientific article; zbMATH DE number 6150225 |
Statements
An improved lower bound on query complexity for quantum PAC learning (English)
0 references
4 April 2013
0 references
probably approximately correct learning
0 references
lower bound
0 references
quantum algorithm
0 references
VC dimension
0 references
computational complexity
0 references
0.8306966423988342
0 references
0.793073832988739
0 references
0.7869970202445984
0 references
0.7650505900382996
0 references
