Search NASA⌕ Search

DOE OSTI · 2502144

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sawaya, Nicolas P. D. [Azulene Labs, San Francisco, CA (United States); Intel Labs, Santa Clara, CA (United States)], Marti-Dafcik, Daniel [Univ. of Oxford (United Kingdom). Clarendon Lab.], Ho, Yang [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)], Tabor, Daniel P. [Texas A & M Univ., College Station, TX (United States)], Neira, David Bernal [Ames Research Center, Moffett Field, CA (United States); Universities Space Research Association, Mountain View, CA (United States); Purdue Univ., West Lafayette, IN (United States)], Magann, Alicia B. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)], Premaratne, Shavindra [Intel Labs, Hillsboro, OR (United States)], Dubey, Pradeep [Intel Labs, Santa Clara, CA (United States)], Matsuura, Anne [Intel Labs, Hillsboro, OR (United States)], Bishop, Nathan [Intel Corporation, Hillsboro, OR (United States)], Jong, Wibe de [Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)], Benjamin, Simon [Univ. of Oxford (United Kingdom)], Parekh, Ojas [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)], Tubman, Norm [Ames Research Center, Moffett Field, CA (United States)], Klymko, Katherine [Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States). National Energy Research Scientific Computing Center (NERSC)], Camps, Daan [Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States). National Energy Research Scientific Computing Center (NERSC)]. 2024-12-11. HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware. https://doi.org/10.22331/q-2024-12-11-1559

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

TANTE: Time-adaptive operator learning via neural Taylor expansion

Operator learning for time-dependent partial differential equations (PDEs) has seen rapid progress in recent years, enabling efficient approximation of complex spatiotemporal dynamics. However, most existing methods rely on fixed time step sizes during rollout, which limits their ability to adapt to varying temporal complexity and often leads to error accumulation. In this work, we propose the Time-Adaptive Transformer with Neural Taylor Expansion (TANTE), a novel operator-learning framework that produces continuous-time predictions with adaptive step sizes. TANTE predicts future states by performing a Taylor expansion at the current state, where neural networks learn both the higher-order temporal derivatives and the local radius of convergence. This allows the model to dynamically adjust its rollout based on the local behavior of the solution, thereby reducing cumulative error and improving computational efficiency. We demonstrate the effectiveness of TANTE across a wide range of PDE benchmarks, achieving superior accuracy and adaptability compared to fixed-step baselines, delivering accuracy gains of 60-80 % and speed-ups of 30-40 % at inference time.

97 MATHEMATICS AND COMPUTING↗

Structured illumination for surface-resolved grazing-incidence X-ray scattering

Grazing-incidence (GI) scattering techniques are widely used to characterize thin films, offering high surface sensitivity and insight into morphology and structure. However, these approaches typically provide statistical averaged information due to elongated footprint or limited spatial resolution due to beam size. Here we introduce a method that combines structured illumination with GI X-ray scattering and leverages our computational imaging approach to resolve local structural details. We demonstrate that our method captures local features of an organic semiconductor thin film without the need for sample rotation as in tomography. The method expands GI techniques from statistical averaging to high-resolution imaging, thereby providing the capability for detailed analysis of local material properties, such as domain shape, orientation and polymorphism, which are critical for advancing material design towards more efficient and tailored materials.

97 MATHEMATICS AND COMPUTING↗