Adapting the traveling salesman problem to an adiabatic quantum computer (Q352991): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the efficiency of Hamiltonian-based quantum computation for low-rank matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: In Pursuit of the Traveling Salesman / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: ``Neural'' computation of decisions in optimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A unified modeling and solution framework for combinatorial optimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A concise guide to the Traveling Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Special cases of the traveling salesman problem / rank | |||
Normal rank | |||
Latest revision as of 15:26, 6 July 2024
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
