AppQSim: Application-oriented benchmarks for Hamiltonian simulation on a quantum computer
Etienne Granet, Henrik Dreyer
TL;DR
AppQSim delivers an application-oriented benchmarking framework for Hamiltonian simulation on quantum hardware, spanning material dynamics, static low-temperature observables, NMR spectroscopy, molecular ground-state preparation, and classical optimization. A central contribution is the distinguishability cost $\mathcal{S}$, the minimal total two-qubit gates a perfect computer must execute to certify incorrectness of hardware outputs via a chi-square test, enabling cross-task hardware comparison even when exact solutions are inaccessible. The suite includes concrete protocols such as a compact free-fermion encoding on a square lattice, adiabatic Kagome-lattice ground-state preparation, benzene NMR-era FID spectroscopy, hydrogen-chain adiabatic state preparation with a randomized Hamiltonian evolution, and a Max-Cut adiabatic benchmark on 3-regular graphs, each with task-specific scoring rules. These benchmarks emphasize diverse circuit depths, connectivities, and measurement strategies, offering a practical path toward assessing and guiding quantum hardware toward real-world quantum advantage in Hamiltonian simulation tasks.
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.
