Large-scale quantum approximate optimization on non-planar graphs with machine learning noise mitigation
arXiv:2307.14427 · doi:10.1103/PhysRevResearch.6.013223
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 (39)
- Quantum Machine Learning
- A variational eigenvalue solver on a quantum processor
- Ising formulations of many NP problems
- Solving the Quantum Many-Body Problem with Artificial Neural Networks
- Dynamical Decoupling of Open Quantum Systems
- Quantum computational chemistry
- Error mitigation for short-depth quantum circuits
- Parameterized quantum circuits as machine learning models
- Extending the computational reach of a noisy superconducting quantum processor
- Efficient variational quantum simulator incorporating active error minimisation
- Quantum optimization using variational algorithms on near-term quantum devices
- Efficient Z-Gates for Quantum Computing
- Practical Quantum Error Mitigation for Near-Future Applications
- Procedure for systematically tuning up crosstalk in the cross resonance gate
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- Quantum Computing for Finance: State of the Art and Future Prospects
- Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
- Warm-starting quantum optimization
- Realization of high-fidelity CZ and ZZ-free iSWAP gates with a tunable coupler
- Quantum equation of motion for computing molecular excitation energies on a noisy quantum processor
- Topological and subsystem codes on low-degree graphs with flag qubits
- Qiskit Pulse: Programming Quantum Computers Through the Cloud with Pulses
- Quantum annealing initialization of the quantum approximate optimization algorithm
- Solving the sampling problem of the Sycamore quantum circuits
- Gate-efficient simulation of molecular eigenstates on a quantum computer
- Parameter Concentration in Quantum Approximate Optimization
- Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
- Quantum Machine Learning in High Energy Physics
- From pulses to circuits and back again: A quantum optimal control perspective on variational quantum algorithms
- Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut
- Whole-device entanglement in a 65-qubit superconducting quantum computer
- Benchmarking the noise sensitivity of different parametric two-qubit gates in a single superconducting quantum computing platform
- Simulating the dynamics of braiding of Majorana zero modes using an IBM quantum computer
- Beating classical heuristics for the binary paint shop problem with the quantum approximate optimization algorithm
- Pulse variational quantum eigensolver on cross-resonance based hardware
- Well-conditioned multi-product formulas for hardware-friendly Hamiltonian simulation
- Bounds on approximating Max XOR with quantum and classical local algorithms
- A SAT approach to the initial mapping problem in SWAP gate insertion for commuting gates
- Squeezing and quantum approximate optimization
Cited by in corpus (19)
- Quantum-Enhanced Greedy Combinatorial Optimization Solver
- 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
- Benchmarking Quantum Optimization for the Maximum-Cut Problem on a Superconducting Quantum Computer
- Quantum State Reconstruction in a Noisy Environment via Deep Learning
- Noise-Agnostic Quantum Error Mitigation with Data Augmented Neural Models
- Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization
- Quantum computing for genomics: conceptual challenges and practical perspectives
- Quantum approximate optimization algorithm with random and subgraph phase operators
- Optimized Noise Suppression for Quantum Circuits
- Mitigating Quantum Gate Errors for Variational Eigensolvers Using Hardware-Inspired Zero-Noise Extrapolation
- 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
- Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms
- Approximate Quadratization of High-Order Hamiltonians for Combinatorial Quantum Optimization