activity
20202026
collaborators

11 papers

quant-ph2026

Quantum walk-based optimisation for capacitated vehicle routing with homogeneous and heterogeneous fleets

Edric Matwiejew, Aidan Smith, Callum Neill +3

The capacitated vehicle routing problem (CVRP) is an appealing candidate for quantum optimisation due to its combinatorial complexity and practical importance. However, the problem…

quant-ph2026

Distributed Variational Quantum Optimisation by Entanglement-Selective Transport

Edric Matwiejew, Pascal Elahi, Ugo Varetto

Distributed quantum optimisation is challenging because computing the problem cost function across multiple quantum processors requires non-local gates, which can incur overhead in…

quant-ph2025

Continuous-time quantum walk-based ansätze on neutral atom hardware

Edric Matwiejew, Jonathan Wurtz, Jing Chen +3

Continuous-time quantum walks offer provable speedups for certain computational problems, yet translating these advantages to near-term hardware remains challenging. We realize var…

quant-ph2025

Benchmarking Quantum Heuristics: Non-Variational QWOA for Weighted Maxcut

Tavis Bennett, Aidan Smith, Edric Matwiejew +1

We present benchmarking results for the non-variational Quantum Walk Optimisation Algorithm (non-variational QWOA) applied to the weighted maxcut problem, using classical simulatio…

quant-ph2024

Gravitational-wave matched filtering with variational quantum algorithms

Jason Pye, Edric Matwiejew, Aidan Smith +3

In this paper, we explore the application of variational quantum algorithms designed for classical optimization to the problem of matched filtering in the detection of gravitationa…

quant-ph2024

Quantum walk informed variational algorithm design

Edric Matwiejew, Jingbo B. Wang

We present a theoretical framework for the analysis of amplitude transfer in Quantum Variational Algorithms (QVAs) for combinatorial optimisation with mixing unitaries defined by v…