Exhaustively parametrised feasibility-respecting quantum circuits can reach every feasible solution to problems like TSP with certainty using fixed parameters by leveraging group actions and generating sequences.
Santoro, and Erio Tosatti
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2roles
background 2polarities
background 2representative citing papers
Graph contraction reduces TSP instances to smaller sub-problems solvable by quantum annealers, shown via Path Integral Monte Carlo simulation and D-Wave hardware.
citing papers explorer
-
Exhaustive and feasible parametrisation with applications to the travelling salesperson problem
Exhaustively parametrised feasibility-respecting quantum circuits can reach every feasible solution to problems like TSP with certainty using fixed parameters by leveraging group actions and generating sequences.
-
A Hybrid Classical-Quantum Annealing Algorithm for the TSP
Graph contraction reduces TSP instances to smaller sub-problems solvable by quantum annealers, shown via Path Integral Monte Carlo simulation and D-Wave hardware.