Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.13907

A scalable sample-based quantum diagonalization solver for general Pauli-sum Hamiltonians

Yutaro Iiyama

quant-phSubmitted Oct 9, 2026• Announced Oct 12, 2026• 0 citations
arXivHTMLPDF

Abstract

A scalable ground-state solver to be used in sample-based quantum diagonalization (SQD) is presented. The solver is built on JAX API, and is intended to be run on GPU platforms and possibly many-GPU high-performance computing facilities. It is capable of subspace diagonalization in up to $2^{30}$-dimensional subspace, with possible upgrades to enable even larger-scale operations. The two main components, a general-purpose eigensolver and an SQD-specific matrix-vector operation function, are described in detail. Efficiency of the eigensolver with respect to the GPU memory is demonstrated using a simple physics model. Furthermore, good strong scaling of the eigensolver in many-GPU environment is observed.

AI Summary

The paper addresses the classical diagonalization bottleneck in sample-based quantum diagonalization (SQD), where a Hamiltonian is projected onto computational-basis states selected through quantum sampling and classical postprocessing. It presents an open-source, Python/JAX solver for general Pauli-sum Hamiltonians, combining a matrix-free eigensolver with an SQD-specific Hamiltonian–vector operation and supporting distributed GPU execution. The eigensolver uses the established locally optimal conjugate-gradient method, retaining as few as five full-size vectors through memory reuse. For $D=10^9$, these vectors require approximately $80$ GB in complex128 precision, excluding additional matrix–vector workspace. The SQD operation represents Pauli strings by binary signatures, finds connections between selected basis states using stable sorting, and groups terms sharing an X signature. Optional caching trades memory against repeated computation; caching source indices requires $4LN$ bytes for $N$ basis states and $L$ distinct X signatures. Demonstrations concern the standalone eigensolver: the two lowest energies of a 30-site transverse-field Ising chain are computed on one 96-GB NVIDIA H100, and a 32-site ground-state calculation is distributed across 8–128 GPUs. Identical energies and good strong scaling are reported, without numerical timing values in the supplied text. The current SQD implementation is limited to $N\leq 2^{30}-1$ by JAX’s stable-sort size restriction; block-wise sorting is proposed to remove this limit. Matrix–vector workspace can increase memory requirements, and the optional sequential approach to excited states is acknowledged to be numerically unstable.

Little sign of AI-generated textIncrementalMissing comparison

Error found: The reported benchmarks validate only the standalone eigensolver, leaving the complete SQD projection/matvec capacity and distributed performance unbenchmarked. The documented sorting restriction permits at most 2^30−1 SQD basis states, inconsistent with the introduction's 2^31 limit and slightly below the abstract's stated 2^30. For the valid Pauli Hamiltonian A=I, the published eigensolver pseudocode treats a zero residual as a Rayleigh–Ritz basis vector and subsequently divides a zero update vector by its norm. For positive Rayleigh quotients, the published stopping criterion rejects sufficiently small nonzero residuals and fails to recognize an exact positive-energy eigenpair.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
10 pages, 1 figure

Related papers

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

Robert E. Walkup, Juha Jäykkä, Igor Pasichnyk +14 more

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.

arXiv:2601.16169•Jan 22, 2026•7 citations

GPU-Accelerated Selected Basis Diagonalization with Thrust for SQD-based Algorithms

Jun Doi, Tomonori Shirakawa, Yukio Kawashima +2 more

Selected Basis Diagonalization (SBD) plays a central role in Sample-based Quantum Diagonalization (SQD), where iterative diagonalization of the Hamiltonian in selected configuration subspaces forms the dominant classical workload. We present a GPU-accelerated implementation of SBD using the Thrust library. By restructuring key components -- including configuration processing, excitation generation, and matrix-vector operations -- around fine-grained data-parallel primitives and flattened GPU-friendly data layouts, the proposed approach efficiently exploits modern GPU architectures. In our experiments, the Thrust-based SBD achieves up to $\sim$40$\times$ speedup over CPU execution and substantially reduces the total runtime of SQD iterations. These results demonstrate that GPU-native parallel primitives provide a simple, portable, and high-performance foundation for accelerating SQD-based quantum-classical workflows.

arXiv:2601.16637•Jan 23, 2026•6 citations

Scalable nuclear shell model calculations on noisy quantum computers

Durgesh Pandey, Ankit Kumar Das, P. Arumugam

The exact diagonalization of the nuclear shell model scales exponentially, leading to severe memory bottlenecks in classical high-performance computing (HPC). While hybrid quantum algorithms like the Variational Quantum Eigensolver (VQE) aim to overcome these limits, their deep quantum circuits and iterative feedback loops are susceptible to substantial noise inherent in the current Noisy Intermediate-Scale Quantum (NISQ) hardware. This noise renders several algorithms, such as the VQE, impractical for large-scale calculations despite sophisticated noise-mitigation techniques. As a pragmatic approach tolerant to these issues, we apply the Sample-based Quantum Diagonalization (SQD) framework to nuclear shell models for the first time. Using $^{38}\text{Ar}$ as a benchmark to confirm the numerical accuracy, we extend SQD to $^{32}\text{Mg}$, solving a nuclear shell-model Hamiltonian whose underlying Hilbert space cannot be directly diagonalized using conventional classical methods in a given HPC system. We present a systematic comparison of SQD with standard variational quantum schemes and exact classical solvers. By leveraging NISQ hardware connected via the cloud to classical HPC clusters, the SQD-based scheme could outperform conventional supercomputers in memory scaling and total execution time, enabling more rigorous large-scale shell model calculations.

nucl-thCross-listedarXiv:2608.16371•Aug 18, 2026•0 citations

A Critical Assessment of the Sample-Based Quantum Diagonalization for Heisenberg and Hubbard Models

Cedric Gaberle, Manpreet Singh Jattana

Sample-based quantum diagonalization (SQD) constructs subspaces from computational-basis configurations obtained via measurements of a quantum state, with the goal of approximating low-energy eigenspaces of many-body Hamiltonians. The effectiveness of this approach relies on the assumption that physically relevant states admit a compact representation in the computational basis. We investigate this assumption by analyzing SQD subspaces constructed directly from configurations of exact ground states of Heisenberg and Hubbard model lattices. By eliminating state-preparation and measurement inefficiencies, we isolate the intrinsic configuration-space structure of the wavefunction. We determine the minimal number of configurations required to reproduce the ground-state energy within fixed accuracy thresholds and find that this number grows exponentially with the system size. Notably, this scaling persists even under optimal inclusion of configurations in order of decreasing probability, demonstrating that it originates from intrinsic delocalization of the wavefunction rather than sampling inefficiencies. Our results indicate that SQD effectively probes the configuration-space entropy but faces fundamental scalability limitations for these models.

quant-pharXiv:2605.02494•May 5, 2026•5 citations

Sample-Based Quantum Diagonalization with Amplitude Amplification

Nina Stockinger, Ludwig Nützel, Michael J. Hartmann

Recently, sample-based quantum diagonalization (SQD) has emerged as a promising approach to compute ground and excited states of problem Hamiltonians.This method classically diagonalizes a Hamiltonian in a subspace that is spanned by samples obtained from a quantum computer. However, by its nature, SQD suffers from a fundamental sampling problem, as some basis states that are required for a targeted accuracy may only be sampled extremely rarely. To alleviate this limitation, we introduce the SQD-AA algorithm that combines SQD with amplitude amplification (AA). SQD-AA uses AA to sequentially reduce probabilities of already measured bitstrings, thus making the observation of new ones more likely. We observe a reduction in the total query complexity of more than a factor 100 for algebraically and exponentially decaying model distributions, and analytically show a quadratic advantage for the latter. Moreover, we evaluate real molecules in an early fault-tolerant scenario and compare SQD-AA to SQD and iterative quantum phase estimation (iQPE). For all considered examples, we observe the lowest total number of T-gates for SQD-AA while only requiring circuits that are 3-4 orders of magnitude shallower than those needed for iQPE. Given this substantial reduction in circuit depth compared to iQPE while saving 2 orders of magnitude in total runtime compared to SQD, we expect a significant regime in early fault-tolerance where SQD-AA runs feasibly, but iQPE circuits are too deep to execute confidently.

quant-pharXiv:2605.02565•May 5, 2026•3 citations

DF-SQD: Deterministic Fields for Sampling-Based Quantum Diagonalization

Kushagra Agarwal, Anupama Ray

Sampling-based quantum diagonalization method exploits Quantum-centric supercomputing platforms to sample bitstrings for Hamiltonian projection on a quantum computer, and then classically diagonalize the Hamiltonian to estimate the eigenvalues and eigenvectors. In current quantum devices an algorithm is useful when shallow quantum circuits with error mitigation support can discover better results while having either a proof of convergence or some method to explain trust in experiment. In this paper, we introduce DF-SQD, a hybrid algorithm that derives deterministic auxiliary-field circuits from selected double-factorization leaves of the two-electron tensor. The circuits propose occupation-number configurations, while selected configuration interaction evaluates the original active-space Hamiltonian and can recentre subsequent proposal rounds. On N2 (32 qubits; 6-31G basis) and a 40-qubit [Fe2S2(SCH3)4]2- active-space Hamiltonian, we show that DF-SQD improves the energy obtained from sampled determinant spaces while using shallow number-preserving circuits in both simulator and hardware runs. For N2, DF-SQD is 45x more accurate with a 11.23\% smaller subspace, and due to its ability to sample better bitstrings at lesser shots it is 2.93x faster than SQD in quantum devices. For the iron-sulfur cluster, DF-SQD generated a subspace dimension of 221M with 400K shots, while SQD needed 1.5M shots to generate a 238M subspace, thus we have better subspace recovery evident from the hardware at 3.75x reduced shots. At a matched 50M subspace dimension, DF-SQD is 1.32x more accurate (achieves a 24.5\% relative error reduction over standard SQD). So overall, our method is able to discover better results with shallower circuits, is sample efficient, uses configuration recovery (so has targeted error mitigation) and we have empirical convergence observation.

quant-pharXiv:2609.01264•Sep 2, 2026•0 citations
A scalable ground-state solver to be used in sample-based quantum diagonalization (SQD) is presented. The solver is built on JAX API, and is intended to be run on GPU platforms and possibly many-GPU high-performance computing facilities. It is capable of subspace diagonalization in up to 2302^{30}230-dimensional subspace, with possible upgrades to enable even larger-scale operations. The two main components, a general-purpose eigensolver and an SQD-specific matrix-vector operation function, are described in detail. Efficiency of the eigensolver with respect to the GPU memory is demonstrated using a simple physics model. Furthermore, good strong scaling of the eigensolver in many-GPU environment is observed.
The paper addresses the classical diagonalization bottleneck in sample-based quantum diagonalization (SQD), where a Hamiltonian is projected onto computational-basis states selected through quantum sampling and classical postprocessing. It presents an open-source, Python/JAX solver for general Pauli-sum Hamiltonians, combining a matrix-free eigensolver with an SQD-specific Hamiltonian–vector operation and supporting distributed GPU execution.
The eigensolver uses the established locally optimal conjugate-gradient method, retaining as few as five full-size vectors through memory reuse. For D=109D=10^9D=109, these vectors require approximately 808080 GB in complex128 precision, excluding additional matrix–vector workspace. The SQD operation represents Pauli strings by binary signatures, finds connections between selected basis states using stable sorting, and groups terms sharing an X signature. Optional caching trades memory against repeated computation; caching source indices requires 4LN4LN4LN bytes for NNN basis states and LLL distinct X signatures.
Demonstrations concern the standalone eigensolver: the two lowest energies of a 30-site transverse-field Ising chain are computed on one 96-GB NVIDIA H100, and a 32-site ground-state calculation is distributed across 8–128 GPUs. Identical energies and good strong scaling are reported, without numerical timing values in the supplied text.
The current SQD implementation is limited to N≤230−1N\leq 2^{30}-1N≤230−1 by JAX’s stable-sort size restriction; block-wise sorting is proposed to remove this limit. Matrix–vector workspace can increase memory requirements, and the optional sequential approach to excited states is acknowledged to be numerically unstable.
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.
Selected Basis Diagonalization (SBD) plays a central role in Sample-based Quantum Diagonalization (SQD), where iterative diagonalization of the Hamiltonian in selected configuration subspaces forms the dominant classical workload. We present a GPU-accelerated implementation of SBD using the Thrust library. By restructuring key components -- including configuration processing, excitation generation, and matrix-vector operations -- around fine-grained data-parallel primitives and flattened GPU-friendly data layouts, the proposed approach efficiently exploits modern GPU architectures. In our experiments, the Thrust-based SBD achieves up to $\sim404040\times$ speedup over CPU execution and substantially reduces the total runtime of SQD iterations. These results demonstrate that GPU-native parallel primitives provide a simple, portable, and high-performance foundation for accelerating SQD-based quantum-classical workflows.
The exact diagonalization of the nuclear shell model scales exponentially, leading to severe memory bottlenecks in classical high-performance computing (HPC). While hybrid quantum algorithms like the Variational Quantum Eigensolver (VQE) aim to overcome these limits, their deep quantum circuits and iterative feedback loops are susceptible to substantial noise inherent in the current Noisy Intermediate-Scale Quantum (NISQ) hardware. This noise renders several algorithms, such as the VQE, impractical for large-scale calculations despite sophisticated noise-mitigation techniques. As a pragmatic approach tolerant to these issues, we apply the Sample-based Quantum Diagonalization (SQD) framework to nuclear shell models for the first time. Using 38Ar^{38}\text{Ar}38Ar as a benchmark to confirm the numerical accuracy, we extend SQD to 32Mg^{32}\text{Mg}32Mg, solving a nuclear shell-model Hamiltonian whose underlying Hilbert space cannot be directly diagonalized using conventional classical methods in a given HPC system. We present a systematic comparison of SQD with standard variational quantum schemes and exact classical solvers. By leveraging NISQ hardware connected via the cloud to classical HPC clusters, the SQD-based scheme could outperform conventional supercomputers in memory scaling and total execution time, enabling more rigorous large-scale shell model calculations.
Sample-based quantum diagonalization (SQD) constructs subspaces from computational-basis configurations obtained via measurements of a quantum state, with the goal of approximating low-energy eigenspaces of many-body Hamiltonians. The effectiveness of this approach relies on the assumption that physically relevant states admit a compact representation in the computational basis. We investigate this assumption by analyzing SQD subspaces constructed directly from configurations of exact ground states of Heisenberg and Hubbard model lattices. By eliminating state-preparation and measurement inefficiencies, we isolate the intrinsic configuration-space structure of the wavefunction. We determine the minimal number of configurations required to reproduce the ground-state energy within fixed accuracy thresholds and find that this number grows exponentially with the system size. Notably, this scaling persists even under optimal inclusion of configurations in order of decreasing probability, demonstrating that it originates from intrinsic delocalization of the wavefunction rather than sampling inefficiencies. Our results indicate that SQD effectively probes the configuration-space entropy but faces fundamental scalability limitations for these models.
Recently, sample-based quantum diagonalization (SQD) has emerged as a promising approach to compute ground and excited states of problem Hamiltonians.This method classically diagonalizes a Hamiltonian in a subspace that is spanned by samples obtained from a quantum computer. However, by its nature, SQD suffers from a fundamental sampling problem, as some basis states that are required for a targeted accuracy may only be sampled extremely rarely. To alleviate this limitation, we introduce the SQD-AA algorithm that combines SQD with amplitude amplification (AA). SQD-AA uses AA to sequentially reduce probabilities of already measured bitstrings, thus making the observation of new ones more likely. We observe a reduction in the total query complexity of more than a factor 100 for algebraically and exponentially decaying model distributions, and analytically show a quadratic advantage for the latter. Moreover, we evaluate real molecules in an early fault-tolerant scenario and compare SQD-AA to SQD and iterative quantum phase estimation (iQPE). For all considered examples, we observe the lowest total number of T-gates for SQD-AA while only requiring circuits that are 3-4 orders of magnitude shallower than those needed for iQPE. Given this substantial reduction in circuit depth compared to iQPE while saving 2 orders of magnitude in total runtime compared to SQD, we expect a significant regime in early fault-tolerance where SQD-AA runs feasibly, but iQPE circuits are too deep to execute confidently.
Sampling-based quantum diagonalization method exploits Quantum-centric supercomputing platforms to sample bitstrings for Hamiltonian projection on a quantum computer, and then classically diagonalize the Hamiltonian to estimate the eigenvalues and eigenvectors. In current quantum devices an algorithm is useful when shallow quantum circuits with error mitigation support can discover better results while having either a proof of convergence or some method to explain trust in experiment. In this paper, we introduce DF-SQD, a hybrid algorithm that derives deterministic auxiliary-field circuits from selected double-factorization leaves of the two-electron tensor. The circuits propose occupation-number configurations, while selected configuration interaction evaluates the original active-space Hamiltonian and can recentre subsequent proposal rounds. On N2 (32 qubits; 6-31G basis) and a 40-qubit [Fe2S2(SCH3)4]2- active-space Hamiltonian, we show that DF-SQD improves the energy obtained from sampled determinant spaces while using shallow number-preserving circuits in both simulator and hardware runs. For N2, DF-SQD is 45x more accurate with a 11.23\% smaller subspace, and due to its ability to sample better bitstrings at lesser shots it is 2.93x faster than SQD in quantum devices. For the iron-sulfur cluster, DF-SQD generated a subspace dimension of 221M with 400K shots, while SQD needed 1.5M shots to generate a 238M subspace, thus we have better subspace recovery evident from the hardware at 3.75x reduced shots. At a matched 50M subspace dimension, DF-SQD is 1.32x more accurate (achieves a 24.5\% relative error reduction over standard SQD). So overall, our method is able to discover better results with shallower circuits, is sample efficient, uses configuration recovery (so has targeted error mitigation) and we have empirical convergence observation.