Hypercube quantum search: exact computation of the probability of success in polynomial time (Q6043535)
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: Hypercube quantum search: exact computation of the probability of success in polynomial time |
scientific article; zbMATH DE number 7688093
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hypercube quantum search: exact computation of the probability of success in polynomial time |
scientific article; zbMATH DE number 7688093 |
Statements
Hypercube quantum search: exact computation of the probability of success in polynomial time (English)
0 references
23 May 2023
0 references
quantum walk
0 references
quantum algorithm
0 references
quantum information
0 references
