4 papers
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 industrial use cases such as last-mile delivery. Although TSP has been studie…
A Minimal Introduction to Quantum Computing
M M Hassan Mahmud, Daniel Goldsmith
In this article, we present an introduction to quantum computing (QC) tailored for computing professionals such as programmers, machine learning engineers, and data scientists. Our…
Beyond QUBO and HOBO formulations, solving the Travelling Salesman Problem on a quantum boson sampler
Daniel Goldsmith, Joe Day-Evans
The Travelling Salesman Problem (TSP) is an important combinatorial optimisation problem, and is usually solved on a quantum computer using a Quadratic Unconstrained Binary Optimis…
Machine Learning for Quantum Computing Specialists
Daniel Goldsmith, M M Hassan Mahmud
Quantum machine learning (QML) is a promising early use case for quantum computing. There has been progress in the last five years from theoretical studies and numerical simulation…