A note on quantum algorithms and the minimal degree of \(\varepsilon\)-error polynomials for symmetric functions (Q3604066)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on quantum algorithms and the minimal degree of -error polynomials for symmetric functions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on quantum algorithms and the minimal degree of \(\varepsilon\)-error polynomials for symmetric functions |
scientific article |
Statements
24 February 2009
0 references
quantum algorithms
0 references
approximating polynomials
0 references
quantum proof
0 references
symmetric functions
0 references
probability theory
0 references
0.809535026550293
0 references
0.8079565167427063
0 references
0.804379403591156
0 references
0.8034383654594421
0 references
0.8006555438041687
0 references
