QASMBench: A Low-level QASM Benchmark Suite for NISQ Evaluation and Simulation

Abstract

The rapid development of quantum computing (QC) in the NISQ era urgently demands a low-level benchmark suite and insightful evaluation metrics for characterizing the properties of prototype NISQ devices, the efficiency of QC programming compilers, schedulers and assemblers, and the capability of quantum system simulators in a classical computer. In this work, we fill this gap by proposing a low-level, easy-to-use benchmark suite called QASMBench based on the OpenQASM assembly representation. It consolidates commonly used quantum routines and kernels from a variety of domains including chemistry, simulation, linear algebra, searching, optimization, arithmetic, machine learning, fault tolerance, cryptography, etc., trading-off between generality and usability. To analyze these kernels in terms of NISQ device execution, in addition to circuit width and depth, we propose four circuit metrics including gate density, retention lifespan, measurement density, and entanglement variance, to extract more insights about the execution efficiency, the susceptibility to NISQ error, and the potential gain from machine-specific optimizations. Applications in QASMBench can be launched and verified on several NISQ platforms, including IBM-Q, Rigetti, IonQ and Quantinuum. For evaluation, we measure the execution fidelity of a subset of QASMBench applications on 12 IBM-Q machines through density matrix state tomography, which comprises 25K circuit evaluations. We also compare the fidelity of executions among the IBM-Q machines, the IonQ QPU and the Rigetti Aspen M-1 system. QASMBench is released at: http://github.com/pnnl/QASMBench.

References in corpus (58)

• Quantum Computing in the NISQ era and beyond
• Quantum Cryptography
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• The Quantum Internet
• Experimental quantum teleportation
• Quantum Machine Learning
• A variational eigenvalue solver on a quantum processor
• Quantum cryptography: Public key distribution and coin tossing
• Three qubits can be entangled in two inequivalent ways
• Quantum algorithm for solving linear systems of equations
• Surface codes: Towards practical large-scale quantum computation
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Quantum Simulation
• Photonic quantum technologies
• The Physical Implementation of Quantum Computation
• The theory of variational hybrid quantum-classical algorithms
• A Quantum Approximate Optimization Algorithm
• Quantum Computation and Decision Trees
• Quantum algorithms: an overview
• Quantum Networks for Elementary Arithmetic Operations
• A single-atom electron spin qubit in silicon
• Quantum memory for photons: I. Dark state polaritons
• Realizing quantum Ising models in tunable two-dimensional arrays of single Rydberg atoms
• Robust randomized benchmarking of quantum processes
• Validating quantum computers using randomized model circuits
• Quantum computers can search rapidly by using almost any transformation
• A CMOS silicon spin qubit
• Superconducting qubit in waveguide cavity with coherence time approaching 0.1ms
• Characterizing Quantum Gates via Randomized Benchmarking
• ProjectQ: An Open Source Software Framework for Quantum Computing
• Cloud Quantum Computing of an Atomic Nucleus
• A generative modeling approach for benchmarking and training shallow quantum circuits
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• An approximate Fourier transform useful in quantum factoring
• A new quantum ripple-carry addition circuit
• Resource-Aware Quantum Programming with General Recursion and Quantum Control
• Preconditioned quantum linear system algorithm
• Quantum Risk Analysis
• Quantum computational finance: Monte Carlo pricing of financial derivatives
• Variational quantum algorithms for discovering Hamiltonian spectra
• Software Mitigation of Crosstalk on Noisy Intermediate-Scale Quantum Computers
• From quantum fusiliers to high-performance networks
• Arbitrary accuracy iterative phase estimation algorithm as a two qubit benchmark
• Two-particle quantum walks applied to the graph isomorphism problem
• Security of two quantum cryptography protocols using the same four qubit states
• Quantum factoring, discrete logarithms and the hidden subgroup problem
• Optimized Compilation of Aggregated Instructions for Realistic Quantum Computers
• Direct randomized benchmarking for multi-qubit devices
• An Experimental Microarchitecture for a Superconducting Quantum Processor
• Quantum Recommendation Systems
• Benchmarking gate-based quantum computers
• Quantum learning robust to noise
• Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark
• Identification of networking quantum teleportation on 14-qubit IBM universal quantum computer
• Quantum Counterfeit Coin Problems
• A quantum teleportation experiment for undergraduate students
• Noise-tolerant parity learning with one quantum bit
• Classical and Quantum Algorithms for the Boolean Satisfiability Problem

Cited by in corpus (13)

• Neutral Atom Quantum Computing Hardware: Performance and End-User Perspective
• Benchmarking quantum computers
• Simultaneous execution of quantum circuits on current and near-future NISQ systems
• QUARK: A Framework for Quantum Computing Application Benchmarking
• A compiler for universal photonic quantum computers
• $i$-QER: An Intelligent Approach towards Quantum Error Reduction
• Robust and Resource-Efficient Quantum Circuit Approximation
• FragQC: An Efficient Quantum Error Reduction Technique using Quantum Circuit Fragmentation
• MIRAGE: Quantum Circuit Decomposition and Routing Collaborative Design using Mirror Gates
• Q-gen: A Parameterized Quantum Circuit Generator
• State of practice: evaluating GPU performance of state vector and tensor network methods
• Analyzing crosstalk error in the NISQ era
• QSSA: An SSA-based IR for Quantum Computing