activity
20222026
most citedLocality-aware Qubit Routing for the Grid Architecture

1 citations · 1 across the 6 of their papers we have counts for

collaborators
Showing 2025 · quant-phShow all

1 paper · 2 filters

quant-ph2025

Solving larger Travelling Salesman Problem networks with a penalty-free Variational Quantum Algorithm

Daniel Goldsmith, Xing Liang, Dimitrios Makris +1

The Travelling Salesman Problem (TSP) is a well-known NP-hard combinatorial optimisation problem with important industrial applications. Although extensively studied, quantum solut…