activity
20192021
most citedMapping NP-Hard Problems to Restricted Adiabatic Quantum Architectures

2 citations · 2 across the 1 of their papers we have counts for

collaborators

5 papers

quant-ph2021

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…

quant-ph2021

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…

quant-ph2020

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…

quant-ph20192 cited

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…

quant-ph2019

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…