Scaling Sample-Based Quantum Diagonalization on GPU-Accelerated Systems using OpenMP Offload

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Walkup, Robert, Jäykkä, Juha, Pasichnyk, Igor, Streeter, Zachary, Świrydowicz, Kasia, Tukiainen, Mikko, Eckert, Yasuko, Bertels, Luke, Claudino, Daniel, Groszkowski, Peter, Humble, Travis S., Evangelinos, Constantinos, Robledo-Moreno, Javier, Kirby, William, Mezzacapo, Antonio, Córcoles, Antonio, Seelam, Seetharami
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866915747865821184
author Walkup, Robert
Jäykkä, Juha
Pasichnyk, Igor
Streeter, Zachary
Świrydowicz, Kasia
Tukiainen, Mikko
Eckert, Yasuko
Bertels, Luke
Claudino, Daniel
Groszkowski, Peter
Humble, Travis S.
Evangelinos, Constantinos
Robledo-Moreno, Javier
Kirby, William
Mezzacapo, Antonio
Córcoles, Antonio
Seelam, Seetharami
author_facet Walkup, Robert
Jäykkä, Juha
Pasichnyk, Igor
Streeter, Zachary
Świrydowicz, Kasia
Tukiainen, Mikko
Eckert, Yasuko
Bertels, Luke
Claudino, Daniel
Groszkowski, Peter
Humble, Travis S.
Evangelinos, Constantinos
Robledo-Moreno, Javier
Kirby, William
Mezzacapo, Antonio
Córcoles, Antonio
Seelam, Seetharami
contents Hybrid quantum-HPC algorithms advance research by delegating complex tasks to quantum processors and using HPC systems to orchestrate workflows and complementary computations. Sample-based quantum diagonalization (SQD) is a hybrid quantum-HPC method in which information from a molecular Hamiltonian is encoded into a quantum circuit for evaluation on a quantum computer. A set of measurements on the quantum computer yields electronic configurations that are filtered on the classical computer, which also performs diagonalization on the selected subspace and identifies configurations to be carried over to the next step in an iterative process. Diagonalization is the most demanding task for the classical computer. Previous studies used the Fugaku supercomputer and a highly scalable diagonalization code designed for CPUs. In this work, we describe our efforts to enable efficient scalable and portable diagonalization on heterogeneous systems using GPUs as the main compute engines based on the previous work. GPUs provide massive on-device thread-level parallelism that is well aligned with the algorithms used for diagonalization. We focus on the computation of ground-state energies and wavefunctions using the Davidson algorithm with a selected set of electron configurations. We describe the offload strategy, code transformations, and data-movement, with examples of measurements on the Frontier supercomputer and five other GPU accelerated systems. Our measurements show that GPUs provide an outstanding performance boost of order 100x on a per-node basis. This dramatically expedites the diagonalization step-essential for extracting ground and excited state energies-bringing the classical processing time down from hours to minutes.
format Preprint
id arxiv_https___arxiv_org_abs_2601_16169
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Scaling Sample-Based Quantum Diagonalization on GPU-Accelerated Systems using OpenMP Offload
Walkup, Robert
Jäykkä, Juha
Pasichnyk, Igor
Streeter, Zachary
Świrydowicz, Kasia
Tukiainen, Mikko
Eckert, Yasuko
Bertels, Luke
Claudino, Daniel
Groszkowski, Peter
Humble, Travis S.
Evangelinos, Constantinos
Robledo-Moreno, Javier
Kirby, William
Mezzacapo, Antonio
Córcoles, Antonio
Seelam, Seetharami
Emerging Technologies
Distributed, Parallel, and Cluster Computing
Hybrid quantum-HPC algorithms advance research by delegating complex tasks to quantum processors and using HPC systems to orchestrate workflows and complementary computations. Sample-based quantum diagonalization (SQD) is a hybrid quantum-HPC method in which information from a molecular Hamiltonian is encoded into a quantum circuit for evaluation on a quantum computer. A set of measurements on the quantum computer yields electronic configurations that are filtered on the classical computer, which also performs diagonalization on the selected subspace and identifies configurations to be carried over to the next step in an iterative process. Diagonalization is the most demanding task for the classical computer. Previous studies used the Fugaku supercomputer and a highly scalable diagonalization code designed for CPUs. In this work, we describe our efforts to enable efficient scalable and portable diagonalization on heterogeneous systems using GPUs as the main compute engines based on the previous work. GPUs provide massive on-device thread-level parallelism that is well aligned with the algorithms used for diagonalization. We focus on the computation of ground-state energies and wavefunctions using the Davidson algorithm with a selected set of electron configurations. We describe the offload strategy, code transformations, and data-movement, with examples of measurements on the Frontier supercomputer and five other GPU accelerated systems. Our measurements show that GPUs provide an outstanding performance boost of order 100x on a per-node basis. This dramatically expedites the diagonalization step-essential for extracting ground and excited state energies-bringing the classical processing time down from hours to minutes.
title Scaling Sample-Based Quantum Diagonalization on GPU-Accelerated Systems using OpenMP Offload
topic Emerging Technologies
Distributed, Parallel, and Cluster Computing
url https://arxiv.org/abs/2601.16169