Quantum and classical query complexities of local search are polynomially related (Q5896965)
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: Quantum and classical query complexities of local search are polynomially related |
scientific article; zbMATH DE number 5600041
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quantum and classical query complexities of local search are polynomially related |
scientific article; zbMATH DE number 5600041 |
Statements
Quantum and classical query complexities of local search are polynomially related (English)
0 references
31 August 2009
0 references
local search
0 references
query complexity
0 references
quantum computing
0 references
0.99999994
0 references
0.92777705
0 references
0.8950533
0 references
0.88865334
0 references
0.88865334
0 references
0 references
0.88609797
0 references
0.8849566
0 references
0 references
