Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs

Abstract

We show through numerical simulation that the Quantum Approximate Optimization Algorithm (QAOA) for higher-order, random-coefficient, heavy-hex compatible spin glass Ising models has strong parameter concentration across problem sizes from $16$ up to $127$ qubits for $p=1$ up to $p=5$, which allows for straight-forward transfer learning of QAOA angles on instance sizes where exhaustive grid-search is prohibitive even for $p>1$. We use Matrix Product State (MPS) simulation at different bond dimensions to obtain confidence in these results, and we obtain the optimal solutions to these combinatorial optimization problems using CPLEX. In order to assess the ability of current noisy quantum hardware to exploit such parameter concentration, we execute short-depth QAOA circuits (with a CNOT depth of 6 per $p$, resulting in circuits which contain $1420$ two qubit gates for $127$ qubit $p=5$ QAOA) on $100$ higher-order (cubic term) Ising models on IBM quantum superconducting processors with $16,27,127$ qubits using QAOA angles learned from a single $16$-qubit instance. We show that (i) the best quantum processors generally find lower energy solutions up to $p=3$ for 27 qubit systems and up to $p=2$ for 127 qubit systems and are overcome by noise at higher values of $p$, (ii) the best quantum processors find mean energies that are about a factor of two off from the noise-free numerical simulation results. Additional insights from our experiments are that large performance differences exist among different quantum processors even of the same generation and that dynamical decoupling significantly improve performance for some, but decrease performance for other quantum processors. Lastly we show $p=1$ QAOA angle mean energy landscapes computed using up to a $414$ qubit quantum computer, showing that the mean QAOA energy landscapes remain very similar as the problem size changes.

References in corpus (22)

• Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
• Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
• Parameter Concentration in Quantum Approximate Optimization
• Counterdiabaticity and the quantum approximate optimization algorithm
• Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
• Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut
• Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
• Feedback-based quantum optimization
• Efficient tensor network simulation of IBM's largest quantum processors
• Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers
• Graph neural network initialisation of quantum approximate optimisation
• Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization
• Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments
• Large-scale quantum approximate optimization on non-planar graphs with machine learning noise mitigation
• Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson's Max-Cut at Low Circuit Depths
• Simulating Noisy Variational Quantum Algorithms: A Polynomial Approach
• Performance and limitations of the QAOA at constant levels on large sparse hypergraphs and spin glass models
• Numerical Evidence for Exponential Speed-up of QAOA over Unstructured Search for Approximate Constrained Optimization
• High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices
• The Quantum Alternating Operator Ansatz for Satisfiability Problems
• QAOA with $N\cdot p\ge 200$
• JuliQAOA: Fast, Flexible QAOA Simulation

Cited by in corpus (10)

• Benchmarking the performance of quantum computing software
• Quantum Approximate Multi-Objective Optimization
• Scalable Quantum Simulations of Scattering in Scalar Field Theory on 120 Qubits
• Multi-Objective Optimization and Network Routing with Near-Term Quantum Computers
• Quantum computing for genomics: conceptual challenges and practical perspectives
• Universal Resources for QAOA and Quantum Annealing
• Higher-Order Portfolio Optimization with Quantum Approximate Optimization Algorithm
• Biased Degenerate Ground-State Sampling of Small Ising Models with Converged QAOA
• Efficient Online Quantum Circuit Learning with No Upfront Training
• Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms