Solving the traveling salesman problem via different quantum computing architectures (Q7250220)
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 8201916
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the traveling salesman problem via different quantum computing architectures |
scientific article; zbMATH DE number 8201916 |
Statements
Solving the traveling salesman problem via different quantum computing architectures (English)
0 references
20 May 2026
0 references
graph optimization
0 references
optical computing
0 references
quantum computing
0 references
quantum algorithms
0 references
0 references
