Adjacent vertices can be hard to find by quantum walks (Q2314211)
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 7083620
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Adjacent vertices can be hard to find by quantum walks |
scientific article; zbMATH DE number 7083620 |
Statements
Adjacent vertices can be hard to find by quantum walks (English)
0 references
19 July 2019
0 references
quantum algorithms
0 references
graph theory
0 references
search problem
0 references
quantum walks
0 references
0.9723940491676332
0 references
0.8484941720962524
0 references
0.8428764343261719
0 references
0.8362188935279846
0 references
0.8339707851409912
0 references
