2 citations · 2 across the 3 of their papers we have counts for
8 papers · 1 filter
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…
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…
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…
Whole-device entanglement in a 65-qubit superconducting quantum computer
Gary J. Mooney, Gregory A. L. White, Charles D. Hill +1
The ability to generate large-scale entanglement is an important progenitor of quantum information processing capability in noisy intermediate-scale quantum (NISQ) devices. In this…
Generation and verification of 27-qubit Greenberger-Horne-Zeilinger states in a superconducting quantum computer
Gary J. Mooney, Gregory A. L. White, Charles D. Hill +1
Generating and detecting genuine multipartite entanglement (GME) of sizeable quantum states prepared on physical devices is an important benchmark for highlighting the progress of…
Cost-optimal single-qubit gate synthesis in the Clifford hierarchy
Gary J. Mooney, Charles D. Hill, Lloyd C. L. Hollenberg
For universal quantum computation, a major challenge to overcome for practical implementation is the large amount of resources required for fault-tolerant quantum information proce…