Generating Target Graph Couplings for QAOA from Native Quantum Hardware Couplings

Abstract

We present methods for constructing any target coupling graph using limited global controls in an Ising-like quantum spin system. Our approach is motivated by implementing the quantum approximate optimization algorithm (QAOA) on trapped ion quantum hardware to find approximate solutions to Max-Cut. We present a mathematical description of the problem and provide approximately optimal algorithmic constructions that generate arbitrary unweighted coupling graphs with $n$ nodes in $O(n)$ global entangling operations and weighted graphs with $m$ edges in $O(m)$ operations. These upper bounds are not tight in general, and we formulate a mixed-integer program to solve the graph coupling problem to optimality. We perform numeric experiments on small graphs with $n\le 8$ and show that optimal sequences, which use fewer operations, can be found using mixed-integer programs. Noisy simulations of Max-Cut QAOA show that our implementation is less susceptible to noise than the standard gate-based compilation.

References in corpus (31)

• Quantum Computing in the NISQ era and beyond
• Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
• Observation of a Many-Body Dynamical Phase Transition with a 53-Qubit Quantum Simulator
• Engineered 2D Ising interactions on a trapped-ion quantum simulator with hundreds of spins
• Entanglement and quantum computation with ions in thermal motion
• Hartree-Fock on a superconducting qubit quantum computer
• Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
• Demonstration of the trapped-ion quantum-CCD computer architecture
• Quantum dynamics of cold trapped ions, with application to quantum computation
• Quantum spin dynamics and entanglement generation with hundreds of trapped ions
• Quantum computing with neutral atoms
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Quantum-Classical Computation of Schwinger Model Dynamics using Quantum Computers
• High-fidelity control and entanglement of Rydberg atom qubits
• Entanglement and Tunable Spin-Spin Couplings Between Trapped Ions Using Multiple Transverse Modes
• Rydberg mediated entanglement in a two-dimensional neutral atom qubit array
• Single-qubit quantum memory exceeding $10$-minute coherence time
• Obstacles to State Preparation and Variational Optimization from Symmetry Protection
• Emulating many-body localization with a superconducting quantum processor
• Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
• Assessing the progress of trapped-ion processors towards fault-tolerant quantum computation
• Phase Control of Trapped Ion Quantum Gates
• Simulating open quantum systems: from many-body interactions to stabilizer pumping
• Basic circuit compilation techniques for an ion-trap quantum machine
• Efficient implementation of selective recoupling in heteronuclear spin systems using Hadamard matrices
• A quantum annealer with fully programmable all-to-all coupling via Floquet engineering
• Many-Body Dephasing in a Trapped-Ion Quantum Simulator
• Scaling Quantum Approximate Optimization on Near-term Hardware
• Transport Implementation of the Bernstein-Vazirani Algorithm with Ion Qubits
• Universal Control of Ion Qubits in a Scalable Microfabricated Planar Trap
• Testing the Robustness of Robust Phase Estimation

Cited by in corpus (5)

• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Individual-Ion Addressing and Readout in a Penning Trap
• Modelling noise in global Molmer-Sorensen interactions applied to quantum approximate optimization
• Universal quantum processors in spin systems via robust local pulse sequences
• Exactly-solved model of light-scattering errors in quantum simulations with metastable trapped-ion qubits