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.
Updated to match published version in Computer Physics Communications
References in corpus (16)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A Quantum Approximate Optimization Algorithm
- Unsupervised Machine Learning on a Hybrid Quantum Computer
- Massive Parallel Quantum Computer Simulator
- Quantum annealing initialization of the quantum approximate optimization algorithm
- Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
- SU(2) lattice gauge theory on a quantum annealer
- Classical variational simulation of the Quantum Approximate Optimization Algorithm
- Benchmarking gate-based quantum computers
- Simulation of low-depth quantum circuits as complex undirected graphical models
- For Fixed Control Parameters the Quantum Approximate Optimization Algorithm's Objective Function Value Concentrates for Typical Instances
- Simulating the Sycamore quantum supremacy circuits
- Comparison of QAOA with Quantum and Simulated Annealing
- Garden optimization problems for benchmarking quantum annealers
- 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