1 citations · 1 across the 2 of their papers we have counts for
2 papers
quant-ph2024★ 1 cited
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…
quant-ph2024
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…