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

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-$k$-SAT, Max-$k$-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.

41 pages; small changes in v1.1 of dataset

References in corpus (26)

• A Quantum Approximate Optimization Algorithm
• Randomized Benchmarking of Quantum Gates
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Is there evidence for exponential quantum advantage in quantum chemistry?
• Practical optimization for hybrid quantum-classical algorithms
• The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case
• The Bonsai algorithm: grow your own fermion-to-qubit mapping
• On the complexity of implementing Trotter steps
• An application benchmark for fermionic quantum simulations
• Scalable Benchmarks for Gate-Based Quantum Computers
• Quantum Public Key Distribution using Randomized Glauber States
• An LLVM-based C++ Compiler Toolchain for Variational Hybrid Quantum-Classical Algorithms and Quantum Accelerators
• Predicting parameters for the Quantum Approximate Optimization Algorithm for MAX-CUT from the infinite-size limit
• Arline Benchmarks: Automated Benchmarking Platform for Quantum Compilers
• Graphical quantum Clifford-encoder compilers from the ZX calculus
• Synergies Between Operations Research and Quantum Information Science
• VeriQBench: A Benchmark for Multiple Types of Quantum Circuits
• An Optimal Product-State Approximation for 2-Local Quantum Hamiltonians with Positive Terms
• Improved resource-tunable near-term quantum algorithms for transition probabilities, with applications in physics and variational quantum linear algebra
• Optimizing quantum circuit parameters via SDP
• Particle-conserving quantum circuit ansatz with applications in variational simulation of bosonic systems
• PCOAST: A Pauli-based Quantum Circuit Optimization Framework
• Data is often loadable in short depth: Quantum circuits from tensor networks for finance, images, fluids, and proteins
• Enhancing initial state overlap through orbital optimization for faster molecular electronic ground-state energy estimation
• Optimization at the Interface of Unitary and Non-unitary Quantum Operations in PCOAST
• QDataset: Quantum Datasets for Machine Learning

Cited by in corpus (7)

• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• Artificial Intelligence for Quantum Computing
• A Practical Introduction to Benchmarking and Characterization of Quantum Computers
• A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations
• AppQSim: Application-oriented benchmarks for Hamiltonian simulation on a quantum computer
• Diagonal-Budgeted Trotterization for Efficient Quantum Hamiltonian Simulation
• Multi-GPU Quantum Circuit Simulation and the Impact of Network Performance