A quantum speedup in machine learning: finding an \(N\)-bit Boolean function for a classification (Q3387032)
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 7293057
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A quantum speedup in machine learning: finding an \(N\)-bit Boolean function for a classification |
scientific article; zbMATH DE number 7293057 |
Statements
A quantum speedup in machine learning: finding an<i>N</i>-bit Boolean function for a classification (English)
0 references
12 January 2021
0 references
0 references
0 references
0 references
0.7875855565071106
0 references
0.7872316837310791
0 references
0.7672916054725647
0 references
0.7654264569282532
0 references
0.759555459022522
0 references
