Large-scale quantum approximate optimization on non-planar graphs with machine learning noise mitigation

Abstract

Quantum computers are increasing in size and quality, but are still very noisy. Error mitigation extends the size of the quantum circuits that noisy devices can meaningfully execute. However, state-of-the-art error mitigation methods are hard to implement and the limited qubit connectivity in superconducting qubit devices restricts most applications to the hardware's native topology. Here we show a quantum approximate optimization algorithm (QAOA) on non-planar random regular graphs with up to 40 nodes enabled by a machine learning-based error mitigation. We use a swap network with careful decision-variable-to-qubit mapping and a feed-forward neural network to demonstrate optimization of a depth-two QAOA on up to 40 qubits. We observe a meaningful parameter optimization for the largest graph which requires running quantum circuits with 958 two-qubit gates. Our work emphasizes the need to mitigate samples, and not only expectation values, in quantum approximate optimization. These results are a step towards executing quantum approximate optimization at a scale that is not classically simulable. Reaching such system sizes is key to properly understanding the true potential of heuristic algorithms like QAOA.

References in corpus (1)

• Benchmarking the noise sensitivity of different parametric two-qubit gates in a single superconducting quantum computing platform

Cited by in corpus (18)

• Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics
• Provable bounds for noise-free expectation values computed from noisy samples
• Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs
• Learning How to Dynamically Decouple
• Quantum State Reconstruction in a Noisy Environment via Deep Learning
• Benchmarking Quantum Optimization for the Maximum-Cut Problem on a Superconducting Quantum Computer
• Noise-Agnostic Quantum Error Mitigation with Data Augmented Neural Models
• Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization
• Quantum approximate optimization algorithm with random and subgraph phase operators
• Quantum computing for genomics: conceptual challenges and practical perspectives
• Mitigating Quantum Gate Errors for Variational Eigensolvers Using Hardware-Inspired Zero-Noise Extrapolation
• Optimized Noise Suppression for Quantum Circuits
• Synergy between noisy quantum computers and scalable classical deep learning
• Optimization via Quantum Preconditioning
• Efficient Online Quantum Circuit Learning with No Upfront Training
• Digital Zero-Noise Extrapolation with Quantum Circuit Unoptimization
• Approximate Quadratization of High-Order Hamiltonians for Combinatorial Quantum Optimization
• Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms