On the complexity of searching for a maximum of a function on a quantum computer (Q2491387)
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 5028223
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of searching for a maximum of a function on a quantum computer |
scientific article; zbMATH DE number 5028223 |
Statements
On the complexity of searching for a maximum of a function on a quantum computer (English)
0 references
29 May 2006
0 references
Numerical optimization
0 references
optimal algorithm
0 references
quantum computing
0 references
query complexity
0 references
0 references
0.7968199849128723
0 references
0.7882196307182312
0 references
0.7584317326545715
0 references
0.7572322487831116
0 references
0.7566700577735901
0 references
