AppQSim: Application-oriented benchmarks for Hamiltonian simulation on a quantum computer

Abstract

We introduce AppQSim, a benchmarking suite for quantum computers focused on applications of Hamiltonian simulation. We consider five different settings for which we define a precise task and score: condensed matter and material simulation (dynamic and static properties), nuclear magnetic resonance simulation, chemistry ground state preparation, and classical optimization. These five different benchmark tasks display different resource requirements and scalability properties. We introduce a metric to evaluate the quality of the output of a tested quantum hardware, called distinguishability cost, defined as the minimal number of gates that a perfect quantum computer would have to run to certify that the output of the benchmarked hardware is incorrect.

arXiv comment24 pages. v2: minor modifications and references added

References in corpus (29)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Recent developments in the PySCF program package
• Logical quantum processor based on reconfigurable atom arrays
• Randomized Benchmarking of Quantum Gates
• Validating quantum computers using randomized model circuits
• Scalable Noise Estimation with Random Unitary Operators
• A blueprint for demonstrating quantum supremacy with superconducting qubits
• Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
• A Race Track Trapped-Ion Quantum Processor
• Characterizing large-scale quantum computers via cycle benchmarking
• Measuring the Capabilities of Quantum Computers
• Gapped spin liquid with ${\mathbb{Z}}_2$-topological order for kagome Heisenberg model
• The $S=1/2$ Kagome Heisenberg Antiferromagnet Revisited
• A Compact Fermion to Qubit Mapping
• Gapless quantum spin liquid and global phase diagram of the spin-1/2 $J_1$-$J_2$ square antiferromagnetic Heisenberg model
• Benchmarking quantum co-processors in an application-centric, hardware-agnostic and scalable way
• Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark
• A Method for Measurement of Spin-Spin Couplings with sub-mHz Precision Using Zero- to Ultralow-Field Nuclear Magnetic Resonance
• The computational power of random quantum circuits in arbitrary geometries
• A quantum hamiltonian simulation benchmark
• Quantum approximate Bayesian computation for NMR model inference
• Digital quantum simulation of NMR experiments
• HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware
• Continuous Hamiltonian dynamics on digital quantum computers without discretization error
• Practicality of quantum adiabatic algorithm for chemistry applications
• A Classically Efficient Quantum Scalable Fermi-Hubbard Benchmark
• Dilution of error in digital Hamiltonian simulation
• Analog simulation of noisy quantum circuits
• Benchmarking a heuristic Floquet adiabatic algorithm for the Max-Cut problem

Cited by in corpus (2)

• Quantum Optimization Benchmarking Library - The Intractable Decathlon
• Simulating sparse SYK model with a randomized algorithm on a trapped-ion quantum computer