Efficient quantum algorithms of finding the roots of a polynomial function (Q1616488)
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: Efficient quantum algorithms of finding the roots of a polynomial function |
scientific article; zbMATH DE number 6974039
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient quantum algorithms of finding the roots of a polynomial function |
scientific article; zbMATH DE number 6974039 |
Statements
Efficient quantum algorithms of finding the roots of a polynomial function (English)
0 references
6 November 2018
0 references
quantum computation
0 references
quantum algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0.9534085392951964
0 references
0.7773447036743164
0 references
0.7550081610679626
0 references
0.7541556358337402
0 references
0.7514667510986328
0 references
