Laplacian versus adjacency matrix in quantum walk search (Q332103)
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: Laplacian versus adjacency matrix in quantum walk search |
scientific article; zbMATH DE number 6644711
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Laplacian versus adjacency matrix in quantum walk search |
scientific article; zbMATH DE number 6644711 |
Statements
Laplacian versus adjacency matrix in quantum walk search (English)
0 references
27 October 2016
0 references
quantum walk
0 references
continuous time
0 references
spatial search
0 references
Laplacian
0 references
adjacency matrix
0 references
0.8121677041053772
0 references
0.7944046258926392
0 references
0.7864047884941101
0 references
0.785103976726532
0 references
0.7790303826332092
0 references
