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 the normal view instead:
scientific article; zbMATH DE number 5779431
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of stoquastic frustration-free Hamiltonians |
scientific article; zbMATH DE number 5779431 |
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
0.8899679183959961
0 references
0.8429065346717834
0 references
0.842282235622406
0 references
0.8360877633094788
0 references
0.8088727593421936
0 references
