Complexity of Stoquastic Frustration-Free Hamiltonians (Q3586188)
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: Complexity of Stoquastic Frustration-Free Hamiltonians |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of Stoquastic Frustration-Free Hamiltonians |
scientific article |
Statements
Complexity of Stoquastic Frustration-Free Hamiltonians (English)
0 references
6 September 2010
0 references
adiabatic quantum computing
0 references
nonnegative matrices
0 references
randomized algorithms
0 references
Merlin-Arthur games
0 references
