QPack: Quantum Approximate Optimization Algorithms as universal benchmark for quantum computers
arXiv:2103.17193
Abstract
In this paper, we present QPack, a universal benchmark for Noisy Intermediate-Scale Quantum (NISQ) computers based on Quantum Approximate Optimization Algorithms (QAOA). Unlike other evaluation metrics in the field, this benchmark evaluates not only one, but multiple important aspects of quantum computing hardware: the maximum problem size a quantum computer can solve, the required runtime, as well as the achieved accuracy. The applications MaxCut, dominating set and traveling salesman are included to provide variation in resource requirements. This will allow for a diverse benchmark that promotes optimal design considerations, avoiding hardware implementations for specific applications. We also discuss the design aspects that are taken in consideration for the QPack benchmark, with critical quantum benchmark requirements in mind. An implementation is presented, providing practical metrics. QPack is presented as a hardware agnostic benchmark by making use of the XACC library. We demonstrate the application of the benchmark on various IBM machines, as well as a range of simulators.
arXiv comment24 pages, 11 figures
References in corpus (22)
- A Quantum Approximate Optimization Algorithm
- Randomized Benchmarking of Quantum Gates
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Scalable Noise Estimation with Random Unitary Operators
- QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
- Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
- A Tutorial on Formulating and Using QUBO Models
- Hamiltonian complexity
- Reachability Deficits in Quantum Approximate Optimization
- Near-optimal quantum circuit for Grover's unstructured search using a transverse field
- Deterministic Preparation of Dicke States
- Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem
- Different Strategies for Optimization Using the Quantum Adiabatic Algorithm
- QuASeR -- Quantum Accelerated De Novo DNA Sequence Reconstruction
- Accrediting outputs of noisy intermediate-scale quantum computing devices
- Analysis of Quantum Approximate Optimization Algorithm under Realistic Noise in Superconducting Qubits
- Performance of QAOA on Typical Instances of Constraint Satisfaction Problems with Bounded Degree
- Knapsack Problem variants of QAOA for battery revenue optimisation
- An algorithm for DNA read alignment on quantum accelerators
- Optimizing QAOA: Success Probability and Runtime Dependence on Circuit Depth
- Quantum approximate algorithm for NP optimization problems with constraints