arXiv (All)
open access
A Quantum Encoding of Traveling Salesperson Tours via Route Generation, Cost Phases, and a Reversible Valid-Permutation Oracle
For a traveling salesperson problem (TSP) of $n$ cities, we present a compact quantum encoding based on a time-register representation of tours. A candidate route is represented as a sequence of $n-1$ city labels over discrete time steps, with one fixed start city and the remaining cities encoded in
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Constrained minimax approximation for quantum signal processing#818979
- Constrained minimax approximation for quantum signal processing#808987
- Super-Quadratic Quantum Speedups for Combinatorial Optimization via Tilted Walks#1154357
- Quantum Computation#67121
- Solving larger Travelling Salesman Problem networks with a penalty-free Variational Quantum Algorithm#1128537
Record · ID 925964
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive