Adapting the traveling salesman problem to an adiabatic quantum computer (Q352991)
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: Adapting the traveling salesman problem to an adiabatic quantum computer |
scientific article; zbMATH DE number 6184695
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Adapting the traveling salesman problem to an adiabatic quantum computer |
scientific article; zbMATH DE number 6184695 |
Statements
Adapting the traveling salesman problem to an adiabatic quantum computer (English)
0 references
5 July 2013
0 references
traveling salesman problem
0 references
adiabatic quantum computer
0 references
optimal tour
0 references
0.8417380452156067
0 references
0.7982946634292603
0 references
0.7909154891967773
0 references
0.7703404426574707
0 references
