Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Quantum Artificial Intelligence (QAI)

Ansatz Optimization Using Simulated Annealing in Variational Quantum Algorithms for the Traveling Salesman Problem

Fabrizio Fagiolo, Nicolò Vescera

Published Nov 2, 2025• 2 citations
Publisher
DOI
10.1109/qai63978.2025.00051

Related papers

Freeze and Conquer: Reusable Ansatz for Solving the Traveling Salesman Problem

Fabrizio Fagiolo, Nicolò Vescera

In this paper we present a variational algorithm for the Traveling Salesman Problem (TSP) that combines (i) a compact encoding of permutations, which reduces the qubit requirement too, (ii) an optimize-freeze-reuse strategy: where the circuit topology (``Ansatz'') is first optimized on a training instance by Simulated Annealing (SA), then ``frozen'' and re-used on novel instances, limited to a rapid re-optimization of only the circuit parameters. This pipeline eliminates costly structural research in testing, making the procedure immediately implementable on NISQ hardware. On a set of $40$ randomly generated symmetric instances that span $4 - 7$ cities, the resulting Ansatz achieves an average optimal trip sampling probability of $100\%$ for 4 city cases, $90\%$ for 5 city cases and $80\%$ for 6 city cases. With 7 cities the success rate drops markedly to an average of $\sim 20\%$, revealing the onset of scalability limitations of the proposed method. The results show robust generalization ability for moderate problem sizes and indicate how freezing the Ansatz can dramatically reduce time-to-solution without degrading solution quality. The paper also discusses scalability limitations, the impact of ``warm-start'' initialization of parameters, and prospects for extension to more complex problems, such as Vehicle Routing and Job-Shop Scheduling.

arXiv:2508.21730•Aug 29, 2025•0 citations

Improved mapping of the travelling salesman problem for quantum annealing

Matthias Troyer, Bettina Heim, Ethan Brown +1 more

Bulletin of the American Physical Society•Mar 4, 2015•0 citations

Freeze and Conquer: Reusable Ansatz for Solving the Traveling Salesman Problem

Nicolò Vescera, Fabrizio, Fagiolo

In this paper we present a variational algorithm for the Traveling Salesman Problem (TSP) thatcombines (i) a compact encoding of permutations, which reduces the qubit requirement too, (ii) anoptimize-freeze-reuse strategy: where the circuit topology (“Ansatz”) is first optimized on a train-ing instance by Simulated Annealing (SA), then “frozen” and re-used on novel instances, limitedto a rapid re-optimization of only the circuit parameters. This pipeline eliminates costly structuralresearch in testing, making the procedure immediately implementable on NISQ hardware.On a set of 40 randomly generated symmetric instances that span 4 − 7 cities, the resultingAnsatz achieves an average optimal trip sampling probability of 100% for 4 city cases, 90% for 5city cases and 80% for 6 city cases. With 7 cities the success rate drops markedly to an average of∼ 20%, revealing the onset of scalability limitations of the proposed method.The results show robust generalization ability for moderate problem sizes and indicate howfreezing the Ansatz can dramatically reduce time-to-solution without degrading solution quality.The paper also discusses scalability limitations, the impact of “warm-start” initialization of pa-rameters, and prospects for extension to more complex problems, such as Vehicle Routing andJob-Shop Scheduling.

•Oct 8, 2025•0 citations

Quantum Algorithms for Solving the Traveling Salesman Problem

Florian Klug

•Jan 1, 2024•2 citations

Quantum wavefunction optimization algorithm: application in solving traveling salesman problem

Pritpal Singh

International Journal of Machine Learning and Cybernetics•Dec 7, 2024•7 citations

Testing Classical and Hybrid Quantum Solvers for Special and Euclidean Traveling Salesman Problem Instances: A Comparative Study of a Classical Algorithm Heuristics and Hybrid Quantum Annealers

Jedidiah T. Ramos, Cherry Lyn C. Sta. Romana

A classical algorithm is tested against D-Wave hybrid quantum annealers for special cases of the Traveling Salesman Problem where the weights of the edges in a graph form an arithmetic progression. The classical algorithm, Christofides, Nearest Neighbor, Simulated Annealing, Ant Colony Optimization, Genetic Algorithm, and D-Wave hybrid quantum annealers are also tested on the Euclidean Traveling Salesman Problem. D-Wave never outperformed the classical algorithm within its specified scope but outperformed all classical algorithms and heuristics for the Euclidean Traveling Salesman Problem before being overtaken at larger problem sizes.

International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence (ISMSI)•Apr 24, 2026•0 citations
In this paper we present a variational algorithm for the Traveling Salesman Problem (TSP) that combines (i) a compact encoding of permutations, which reduces the qubit requirement too, (ii) an optimize-freeze-reuse strategy: where the circuit topology (``Ansatz'') is first optimized on a training instance by Simulated Annealing (SA), then ``frozen'' and re-used on novel instances, limited to a rapid re-optimization of only the circuit parameters. This pipeline eliminates costly structural research in testing, making the procedure immediately implementable on NISQ hardware. On a set of 404040 randomly generated symmetric instances that span 4−74 - 74−7 cities, the resulting Ansatz achieves an average optimal trip sampling probability of 100%100\%100% for 4 city cases, 90%90\%90% for 5 city cases and 80%80\%80% for 6 city cases. With 7 cities the success rate drops markedly to an average of ∼20%\sim 20\%∼20%, revealing the onset of scalability limitations of the proposed method. The results show robust generalization ability for moderate problem sizes and indicate how freezing the Ansatz can dramatically reduce time-to-solution without degrading solution quality. The paper also discusses scalability limitations, the impact of ``warm-start'' initialization of parameters, and prospects for extension to more complex problems, such as Vehicle Routing and Job-Shop Scheduling.
In this paper we present a variational algorithm for the Traveling Salesman Problem (TSP) thatcombines (i) a compact encoding of permutations, which reduces the qubit requirement too, (ii) anoptimize-freeze-reuse strategy: where the circuit topology (“Ansatz”) is first optimized on a train-ing instance by Simulated Annealing (SA), then “frozen” and re-used on novel instances, limitedto a rapid re-optimization of only the circuit parameters. This pipeline eliminates costly structuralresearch in testing, making the procedure immediately implementable on NISQ hardware.On a set of 40 randomly generated symmetric instances that span 4 − 7 cities, the resultingAnsatz achieves an average optimal trip sampling probability of 100% for 4 city cases, 90% for 5city cases and 80% for 6 city cases. With 7 cities the success rate drops markedly to an average of∼ 20%, revealing the onset of scalability limitations of the proposed method.The results show robust generalization ability for moderate problem sizes and indicate howfreezing the Ansatz can dramatically reduce time-to-solution without degrading solution quality.The paper also discusses scalability limitations, the impact of “warm-start” initialization of pa-rameters, and prospects for extension to more complex problems, such as Vehicle Routing andJob-Shop Scheduling.
A classical algorithm is tested against D-Wave hybrid quantum annealers for special cases of the Traveling Salesman Problem where the weights of the edges in a graph form an arithmetic progression. The classical algorithm, Christofides, Nearest Neighbor, Simulated Annealing, Ant Colony Optimization, Genetic Algorithm, and D-Wave hybrid quantum annealers are also tested on the Euclidean Traveling Salesman Problem. D-Wave never outperformed the classical algorithm within its specified scope but outperformed all classical algorithms and heuristics for the Euclidean Traveling Salesman Problem before being overtaken at larger problem sizes.