7 papers
Optimisation-Free Recursive QAOA for the Binary Paint Shop Problem
Gary J Mooney, Jedwin Villanueva, Bhaskar Roy Radhan +3
The Quantum Approximate Optimisation Algorithm (QAOA) is a leading candidate for near-term quantum advantage, yet its practical impact is hindered by limited performance on symmetr…
Adaptable Weighted Token Swapping Algorithm for Optimal Multi-Qubit Pathfinding
Gary J Mooney
Quantum computing promises breakthroughs in simulating and solving complex, classically intractable problems. However, current noisy intermediate-scale quantum (NISQ) devices are r…
Teleporting two-qubit entanglement across 19 qubits on a superconducting quantum computer
Haiyue Kang, John F. Kam, Gary J. Mooney +1
Quantum teleportation is not merely a fascinating corollary of quantum entanglement, it also finds utility in quantum processing and circuit compilation. In this paper, we measure…
Hybrid quantum optimization in the context of minimizing traffic congestion
Jedwin Villanueva, Gary J Mooney, Bhaskar Roy Bardhan +3
Traffic optimization on roads is a highly complex problem, with one important aspect being minimization of traffic congestion. By mapping to an Ising formulation of the traffic con…
Quantum autoencoders using mixed reference states
Hailan Ma, Gary J. Mooney, Ian R. Petersen +2
One of the fundamental tasks in quantum information theory is quantum data compression, which can be realized via quantum autoencoders that first compress quantum states to low-dim…
Entanglement teleportation along a regenerating hamster-wheel graph state
Haiyue Kang, John F. Kam, Gary J. Mooney +1
We scheme an efficient and reusable approach to quantum teleportation that allows cyclic teleportation of a two-qubit graph state around a quantum hamster wheel -- a ring of qubits…