102 citations · 313 across the 13 of their papers we have counts for
13 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…
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…
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…
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…
A two-stage solution to quantum process tomography: error analysis and optimal design
Shuixin Xiao, Yuanlong Wang, Jun Zhang +4
Quantum process tomography is a critical task for characterizing the dynamics of quantum systems and achieving precise quantum control. In this paper, we propose a two-stage soluti…
Characterization of entanglement on superconducting quantum computers of up to 414 qubits
John F Kam, Haiyue Kang, Charles D Hill +2
As quantum technology advances and the size of quantum computers grow, it becomes increasingly important to understand the extent of quality in the devices. As large-scale entangle…
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…
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…
Mapping NP-Hard Problems to Restricted Adiabatic Quantum Architectures
Gary J. Mooney, Sam U. Y. Tonetto, Charles D. Hill +1
We introduce a framework for mapping NP-Hard problems to adiabatic quantum computing (AQC) architectures that are heavily restricted in both connectivity and dynamic range of coupl…
Entanglement in a 20-Qubit Superconducting Quantum Computer
Gary J. Mooney, Charles D. Hill, Lloyd C. L. Hollenberg
Towards realising larger scale quantum algorithms, the ability to prepare sizeable multi-qubit entangled states with full qubit control is used as a benchmark for quantum technolog…