Classical variational simulation of the Quantum Approximate Optimization Algorithm
arXiv:2009.01760 · doi:10.1038/s41534-021-00440-z
Abstract
A key open question in quantum computing is whether quantum algorithms can potentially offer a significant advantage over classical algorithms for tasks of practical interest. Understanding the limits of classical computing in simulating quantum systems is an important component of addressing this question. We introduce a method to simulate layered quantum circuits consisting of parametrized gates, an architecture behind many variational quantum algorithms suitable for near-term quantum computers. A neural-network parametrization of the many-qubit wave function is used, focusing on states relevant for the Quantum Approximate Optimization Algorithm (QAOA). For the largest circuits simulated, we reach 54 qubits at 4 QAOA layers, approximately implementing 324 RZZ gates and 216 RX gates without requiring large-scale computational resources. For larger systems, our approach can be used to provide accurate QAOA simulations at previously unexplored parameter values and to benchmark the next generation of experiments in the Noisy Intermediate-Scale Quantum (NISQ) era.
arXiv comment14 pages, 5 figures
References in corpus (30)
- SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
- Array Programming with NumPy
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Machine Learning
- A variational eigenvalue solver on a quantum processor
- Ising formulations of many NP problems
- Efficient classical simulation of slightly entangled quantum computations
- Solving the Quantum Many-Body Problem with Artificial Neural Networks
- Efficient simulation of one-dimensional quantum many-body systems
- Simulated Quantum Computation of Molecular Energies
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Theory of Quantum Annealing of an Ising Spin Glass
- Defining and detecting quantum speedup
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- Quantum Natural Gradient
- Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
- QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
- Hierarchical quantum classifiers
- Obstacles to State Preparation and Variational Optimization from Symmetry Protection
- Simulation of quantum circuits by low-rank stabilizer decompositions
- Green Function Monte Carlo with Stochastic Reconfiguration
- Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
- Unsupervised Machine Learning on a Hybrid Quantum Computer
- What limits the simulation of quantum computers?
- Near-optimal quantum circuit for Grover's unstructured search using a transverse field
- Benchmarking the Quantum Approximate Optimization Algorithm
- Establishing the Quantum Supremacy Frontier with a 281 Pflop/s Simulation
- Variational Neural Annealing
- Improved success probability with greater circuit depth for the quantum approximate optimization algorithm
Cited by in corpus (36)
- Quantum annealing initialization of the quantum approximate optimization algorithm
- Beyond-classical computation in quantum simulation
- Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut
- Does provable absence of barren plateaus imply classical simulability?
- Fast quantum circuit cutting with randomized measurements
- A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity
- Empirical performance bounds for quantum approximate optimization
- Unbiasing time-dependent Variational Monte Carlo by projected quantum evolution
- Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach
- Parameter Setting in Quantum Approximate Optimization of Weighted Problems
- Neural-network quantum states for many-body physics
- GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
- An entanglement perspective on the quantum approximate optimization algorithm
- Dynamics with autoregressive neural quantum states: application to critical quench dynamics
- Investigating Topological Order using Recurrent Neural Networks
- Quantum Dropout: On and Over the Hardness of Quantum Approximate Optimization Algorithm
- Variational quantum dynamics of two-dimensional rotor models
- Solution of SAT Problems with the Adaptive-Bias Quantum Approximate Optimization Algorithm
- Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm
- Neural Projected Quantum Dynamics: a systematic study
- Neural-Shadow Quantum State Tomography
- Deep recurrent networks predicting the gap evolution in adiabatic quantum computing
- Scalable Imaginary Time Evolution with Neural Network Quantum States
- Impact of conditional modelling for a universal autoregressive quantum state
- Infinite Neural Network Quantum States: Entanglement and Training Dynamics
- Amplitude Ratios and Neural Network Quantum States
- Mimicking quantum correlation of a long-range Hamiltonian by finite-range interactions
- Supervised Training of Neural-Network Quantum States for the Next Nearest Neighbor Ising model
- Time-dependent Neural Galerkin Method for Quantum Dynamics
- Warm Start Adaptive-Bias Quantum Approximate Optimization Algorithm
- Out of the Loop: Structural Approximation of Optimisation Landscapes and non-Iterative Quantum Optimisation
- Tabu-driven Quantum Neighborhood Samplers
- Optimal solutions to quantum annealing using two independent control functions
- Heuristic Time Complexity of NISQ Shortest-Vector-Problem Solvers
- Finding the Dynamics of an Integrable Quantum Many-Body System via Machine Learning
- Multipartite entangled states in dipolar quantum simulators