GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
arXiv:2104.03293 · doi:10.1016/j.cpc.2022.108411
Abstract
We study large-scale applications using a GPU-accelerated version of the massively parallel Jülich universal quantum computer simulator (JUQCS--G). First, we benchmark JUWELS Booster, a GPU cluster with 3744 NVIDIA A100 Tensor Core GPUs. Then, we use JUQCS--G to study the relation between quantum annealing (QA) and the quantum approximate optimization algorithm (QAOA). We find that a very coarsely discretized version of QA, termed approximate quantum annealing (AQA), performs surprisingly well in comparison to the QAOA. It can either be used to initialize the QAOA, or to avoid the costly optimization procedure altogether. Furthermore, we study the scaling of the success probability when using AQA for problems with 30 to 40 qubits. We find that the case with the largest discretization error scales most favorably, surpassing the best result obtained from the QAOA.
arXiv commentUpdated to match published version in Computer Physics Communications
References in corpus (54)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- A Quantum Approximate Optimization Algorithm
- Two-Bit Gates are Universal for Quantum Computation
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Large-scale silicon quantum photonics implementing arbitrary two-qubit processing
- Quantum Computation by Adiabatic Evolution
- Perspectives of quantum annealing: Methods and implementations
- Robustness of adiabatic quantum computation
- Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
- Universality in Quantum Computation
- Architectural considerations in the design of a superconducting quantum annealing processor
- Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
- Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
- The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
- Unsupervised Machine Learning on a Hybrid Quantum Computer
- Massive Parallel Quantum Computer Simulator
- Quantum Supremacy through the Quantum Approximate Optimization Algorithm
- Support vector machines on the D-Wave quantum annealer
- Searching for quantum speedup in quasistatic quantum annealers
- A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
- Quantum annealing initialization of the quantum approximate optimization algorithm
- Reachability Deficits in Quantum Approximate Optimization
- 64-Qubit Quantum Circuit Simulation
- Quantum localization bounds Trotter errors in digital quantum simulation
- Massively parallel quantum computer simulator, eleven years later
- Benchmarking the Quantum Approximate Optimization Algorithm
- Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
- Power of Pausing: Advancing Understanding of Thermalization in Experimental Quantum Annealers
- Digital Quantum Simulation, Trotter Errors, and Quantum Chaos of the Kicked Top
- SU(2) lattice gauge theory on a quantum annealer
- Classical variational simulation of the Quantum Approximate Optimization Algorithm
- Benchmarking gate-based quantum computers
- Scaling and diabatic effects in quantum annealing with a D-Wave device
- Applying the Quantum Approximate Optimization Algorithm to the Tail Assignment Problem
- Improved success probability with greater circuit depth for the quantum approximate optimization algorithm
- Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem
- Simulation of low-depth quantum circuits as complex undirected graphical models
- Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets
- Finite temperature quantum annealing solving exponentially small gap problem with non-monotonic success probability
- Quantum Supremacy Is Both Closer and Farther than It Appears
- For Fixed Control Parameters the Quantum Approximate Optimization Algorithm's Objective Function Value Concentrates for Typical Instances
- Simulating the Sycamore quantum supremacy circuits
- Computational Methods for Simulating Quantum Computers
- Comparison of QAOA with Quantum and Simulated Annealing
- An adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer
- Garden optimization problems for benchmarking quantum annealers
- Real-time simulation of flux qubits used for quantum annealing
- Performance benefits of increased qubit connectivity in quantum annealing 3-dimensional spin glasses
- Supercomputer simulations of transmon quantum computers
Cited by in corpus (22)
- Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
- Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
- Artificial Intelligence for Quantum Computing
- Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems
- Large-Scale Simulation of Shor's Quantum Factoring Algorithm
- Transfer learning of optimal QAOA parameters in combinatorial optimization
- Quantum annealing for hard 2-SAT problems : Distribution and scaling of minimum energy gap and success probability
- Application-Driven Exascale: The JUPITER Benchmark Suite
- Simulation of Quantum Computers: Review and Acceleration Opportunities
- Decomposition Pipeline for Large-Scale Portfolio Optimization with Applications to Near-Term Quantum Computing
- Out of the Loop: Structural Approximation of Optimisation Landscapes and non-Iterative Quantum Optimisation
- On the fragility of gate-error metrics in simulation models of flux-tunable transmon quantum computers
- QuOp_MPI: a framework for parallel simulation of quantum variational algorithms
- A thermodynamic approach to optimization in complex quantum systems
- Learning-Driven Annealing with Adaptive Hamiltonian Modification for Solving Large-Scale Problems on Quantum Devices
- Toolchain for Faster Iterations in Quantum Software Development
- Universal Quantum Computer Simulation of 50 Qubits on Europe`s First Exascale Supercomputer Harnessing Its Heterogeneous CPU-GPU Architecture
- Fast quantum circuit simulation using hardware accelerated general purpose libraries
- Diagnosing crosstalk in large-scale QPUs using zero-entropy classical shadows
- Hidden local adiabatic ramp in the modulated time evolution and the quantum approximate optimization algorithm
- Improving Quantum Developer Experience with Kubernetes and Jupyter Notebooks
- Pilot-Wave Simulator: Exact Classical Sampling from Ideal and Noisy Quantum Circuits up to Hundreds of Qubits