Adapting the traveling salesman problem to an adiabatic quantum computer (Q352991): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 81P45 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6184695 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
traveling salesman problem | |||
| Property / zbMATH Keywords: traveling salesman problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
adiabatic quantum computer | |||
| Property / zbMATH Keywords: adiabatic quantum computer / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
optimal tour | |||
| Property / zbMATH Keywords: optimal tour / rank | |||
Normal rank | |||
Revision as of 09:49, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Adapting the traveling salesman problem to an adiabatic quantum computer |
scientific article |
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
