HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware

In order to characterize and benchmark computational hardware, software, and algorithms, it is essential to have many problem instances on-hand. This is no less true for quantum computation, where a large collection of real-world problem instances would allow for benchmarking studies that in turn help to improve both algorithms and hardware designs. To this end, here we present a large dataset of qubit-based quantum Hamiltonians. The dataset, called HamLib (for Hamiltonian Library), is freely available online and contains problem sizes ranging from 2 to 1000 qubits. HamLib includes problem instances of the Heisenberg model, Fermi-Hubbard model, Bose-Hubbard model, molecular electronic structure, molecular vibrational structure, MaxCut, Max-<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-SAT, Max-<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-Cut, QMaxCut, and the traveling salesperson problem. The goals of this effort are (a) to save researchers time by eliminating the need to prepare problem instances and map them to qubit representations, (b) to allow for more thorough tests of new algorithms and hardware, and (c) to allow for reproducibility and standardization across research studies.

Authors

Institutions

Publication Details

Journal
Quantum
Published
2024-12-11
DOI
https://doi.org/10.22331/q-2024-12-11-1559
Citations
14
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
4.86

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware

Shavindra Premaratne, Daniel Marti-Dafcik, Ojas Parekh, David E. Bernal et al.
14 citations
Quantum
Quantum Computing Algorithms and Architecture
4.86
article

HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware

Shavindra Premaratne, Daniel Marti-Dafcik, Ojas Parekh, David E. Bernal, Simon C. Benjamin, Daan Camps, Alicia Magann, N. C. Bishop, Pradeep Dubey, Wibe A. de Jong, Katherine Klymko, Daniel P. Tabor, Nicolas P. D. Sawaya, Norm M. Tubman, A. Y. Matsuura, Yang Ho
article en
14 citations

Abstract

In order to characterize and benchmark computational hardware, software, and algorithms, it is essential to have many problem instances on-hand. This is no less true for quantum computation, where a large collection of real-world problem instances would allow for benchmarking studies that in turn help to improve both algorithms and hardware designs. To this end, here we present a large dataset of qubit-based quantum Hamiltonians. The dataset, called HamLib (for Hamiltonian Library), is freely available online and contains problem sizes ranging from 2 to 1000 qubits. HamLib includes problem instances of the Heisenberg model, Fermi-Hubbard model, Bose-Hubbard model, molecular electronic structure, molecular vibrational structure, MaxCut, Max-<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-SAT, Max-<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-Cut, QMaxCut, and the traveling salesperson problem. The goals of this effort are (a) to save researchers time by eliminating the need to prepare problem instances and map them to qubit representations, (b) to allow for more thorough tests of new algorithms and hardware, and (c) to allow for reproducibility and standardization across research studies.

QuantumVol. 8
Ames Research Center (US), Universities Space Research Association (US), Intel (United States) (US), Lawrence Berkeley National Laboratory (US), Purdue University West Lafayette (US), University of Oxford (GB), Sandia National Laboratories (US), National Energy Research Scientific Computing Center (US), Texas A&M University (US)
U.S. Department of Energy, National Aeronautics and Space Administration, Aeronautics Research Mission Directorate, National Energy Research Scientific Computing Center, University of Oxford, Office of Science, National Nuclear Security Administration, Ames Research Center, High Performance Research Computing, Texas A and M University, Engineering and Physical Sciences Research Council, Advanced Scientific Computing Research, Sandia National Laboratories, Lawrence Berkeley National Laboratory
Openalex Percentile: Top 4%
Quantum Computing Algorithms and Architecture
4.86
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.