Presents a continuous-time quantum walk over a product space for CVRP that cuts gate complexity to O(n² log n) and shows faster convergence in simulations up to 8 customers.
Quantum Fisher-Yates shuffle: Unifying methods for generating uniform superpositions of permutations
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 3years
2026 3roles
method 1polarities
use method 1representative citing papers
Quantum divide-and-conquer with structured set-partition state preparation solves general TSP in O*(1.866^n) time, the first quantum algorithm claimed to beat the classical O*(2^n) barrier.
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.
citing papers explorer
-
Quantum walk-based optimisation for capacitated vehicle routing with homogeneous and heterogeneous fleets
Presents a continuous-time quantum walk over a product space for CVRP that cuts gate complexity to O(n² log n) and shows faster convergence in simulations up to 8 customers.
-
Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier
Quantum divide-and-conquer with structured set-partition state preparation solves general TSP in O*(1.866^n) time, the first quantum algorithm claimed to beat the classical O*(2^n) barrier.
-
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.