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.32968

Distributed Quantum-Centric Supercomputing with Multi-Layered Generative Learning for Intermolecular Interactions

Chayan Patra, Prayas Ghosh, Adwait Patkhedkar, Rahul Maitra

quant-phSubmitted Oct 23, 2026• Announced Oct 26, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum-centric supercomputing (QCSC) approaches, such as sample-based quantum diagonalization (SQD), combine quantum processors with high-performance computers (HPC), offering a promising route toward solving challenging electronic structure problems. However, implementation of QCSC approaches to large active space calculations is constrained by the associated number of qubits, deep quantum circuits, sampling cost, and large-scale Hamiltonian diagonalization. To overcome these limitations, we introduce a distributed QCSC framework that decomposes complex molecular problems into parallel sub-problems requiring fewer qubits, shallower circuits, and reduced shot budgets. A physically motivated, two-step aggregation scheme then reconstructs the global solution: first, a computational bit assignment strategy optimizes a cost function to appropriately map local bit indices to global ones, yielding a mapped tensor product state (MTPS); second, an inter-fragment correlation recovery module restores missing cross-fragment interactions. Herein, we employ a multi-layered generative machine learning architecture, starting with utilizing the recently proposed physics-informed generative SQD (PIGen-SQD) as a distributed QCSC solver, followed by a secondary generative module to model configuration distributions and identify dominant sectors of the global Hilbert space. For water and formamide dimers, our method achieves up to $95\%$ reduction in the diagonalization dimension while enhancing energy accuracy by an order of magnitude over conventional SQD. Furthermore, application to the water hexamer ($\mathrm{(H_2O)_6}$) cage successfully decomposes a 120-qubit problem into six 20-qubit monomeric subsystems, and stitches the monomers under a dimeric approximation, demonstrating excellent agreement with the reference classical methods.

AI Summary

The paper asks whether sample-based quantum diagonalization (SQD) can treat molecular assemblies using quantum samples only from smaller fragments, while reconstructing inter-fragment correlations classically. It introduces PIGen-SQD(MAPS), combining fragment molecular orbital (FMO) partitioning with parallel fragment solvers that use hardware samples, perturbatively selected determinants, and restricted Boltzmann machines (RBMs). An orbital-overlap- and energy-based linear assignment maps fragment occupation bitstrings into the supersystem basis. Their mapped products are augmented with cross-fragment single excitations, CISD configurations, and perturbative triples, then refined through a second RBM-driven selection/diagonalization loop. An alternative uses SQD’s S-CORE recovery initialized with the same mapped space. Tests use IBM Heron R3 samples and classical electronic-structure references for water and formamide dimers in a 6-31G basis. Relative to conventional full-dimer SQD, the reported improvements reach a $95\%$ reduction in diagonalization dimension and roughly an order of magnitude lower energy error. PIGen-SQD(MAPS) gives approximately $0.4\,\mathrm{m}E_h$ errors against heat-bath CI across the studied separation curves. For a water hexamer, sampling is restricted to six 20-spin-orbital monomers; classical recovery treats 15 fragment pairs. The resulting FMO-2 energy differs from the FMO-2 heat-bath-CI reference by $0.915\,\mathrm{m}E_h$, rather than benchmarking an unfragmented 120-qubit solution. The framework assumes predominantly local correlation and weaker inter-fragment coupling. Fragmentation and many-body expansion order are user choices; including larger fragment combinations increases classical cost. Recovery also depends on initialization, configuration thresholds, and sampling quality.

Little sign of AI-generated textIncrementalOverclaimsMissing comparisonStrong assumptions

Error found: The claimed initialization-only comparison between SQD and S-CORE(MTPS) also changes samples per batch from 1,000 to 10,000, so it cannot isolate the benefit of MTPS initialization. The paper asserts a combinatorial shot requirement without specifying distributional or recovery-accuracy assumptions, although useful configuration sampling need not require shots proportional to the ambient Hilbert-space dimension.

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

Related papers

Physics-Informed Generative Machine Learning for Accelerated Quantum-centric Supercomputing

Chayan Patra, Dibyendu Mondal, Sonaldeep Halder +4 more

Quantum centric supercomputing (QCSC) framework, such as sample-based quantum diagonalization (SQD) holds immense promise toward achieving practical quantum utility to solve challenging problems. QCSC leverages quantum computers to perform the classically intractable task of sampling the dominant fermionic configurations from the Hilbert space that have substantial support to a target state, followed by Hamiltonian diagonalization on a classical processor. However, noisy quantum hardware produces erroneous samples upon measurements, making robust and efficient configuration-recovery strategies essential for a scalable QCSC pipeline. Toward this, in this work, we introduce PIGen-SQD, an efficiently designed QCSC workflow that utilizes the capability of generative machine learning (ML) along with physics-informed configuration screening via implicit low-rank tensor decompositions for accurate fermionic state reconstruction. The physics-informed pruning is based on a class of efficient perturbative measures that, in conjunction with hardware samples, provide a substantial overlap with the target state. This distribution induces an anchoring effect on the generative ML models to stochastically explore only the dominant sector of the Hilbert space for effective identification of additional important configurations in a self-consistent manner. Our numerical experiments performed on IBM Heron R2 quantum processors demonstrate this synergistic workflow produces compact, high-fidelity subspaces that substantially reduce diagonalization cost while maintaining chemical accuracy under strong electronic correlations. By embedding classical many body intuitions directly into the generative ML model, PIGen-SQD advances the robustness and scalability of QCSC algorithms, offering a promising pathway toward chemically reliable quantum simulations on utility-scale quantum hardware.

quant-pharXiv:2512.06858•Quantum Science and Technology•Dec 9, 2025•13 citations

Distributed quantum approximate optimization algorithm on a quantum-centric supercomputing architecture

Seongmin Kim, Vincent Richard Pascuzzi, Zhihao Xu +3 more

Abstract Quantum approximate optimization algorithm (QAOA) has shown promise in solving combinatorial optimization problems by providing quantum speedup on near-term gate-based quantum computing systems. However, QAOA faces challenges for high-dimensional problems due to the large number of qubits required and the complexity of deep circuits, limiting its scalability for real-world applications. In this study, we present a distributed QAOA (DQAOA), which leverages distributed computing strategies to decompose a large computational workload into smaller tasks that require fewer qubits and shallower circuits than are necessary to solve the original problem. These sub-problems are processed using a combination of high-performance and quantum computing resources. The global solution is iteratively updated by aggregating sub-solutions, allowing convergence toward the optimal solution. We demonstrate that DQAOA can handle considerably large-scale optimization problems (e.g., 1000-bit problem), achieving a high solution quality and short time-to-solution, outperforming existing strategies. Furthermore, we realize DQAOA on a quantum-centric supercomputing architecture, paving the way for practical applications of gate-based quantum computers in real-world optimization tasks. To extend DQAOA’s applicability to materials science, we further develop an active learning algorithm integrated with our DQAOA (AL-DQAOA), which involves machine learning, DQAOA, and active data production in an iterative loop. We successfully optimize photonic structures using AL-DQAOA, indicating that solving real-world optimization problems using gate-based quantum computing is feasible. We expect the proposed DQAOA to be applicable to a wide range of optimization problems and AL-DQAOA to find broader applications in material design.

arXiv:2407.20212•npj Quantum Information•Jun 5, 2026•28 citations

Quantum Wavefunction Augmentation via Variational Autoencoders

Sonaldeep Halder, Chayan Patra, Rahul Maitra

Sample-based quantum diagonalization (SQD) has emerged as a promising route for quantum-centric supercomputing, relying on classical diagonalization of the molecular Hamiltonian within a hardware-sampled determinant subspace. However, its accuracy degrades in strongly correlated regimes where the relevant determinant space exceeds what finite-shot sampling can capture. In this work, we introduce Quantum Wavefunction Augmentation via Variational Autoencoders (Q-WAVE), a hybrid method that combines determinants sampled via SqDRIFT Krylov circuits and configuration interaction singles and doubles (CISD) determinants with generative machine learning. Using a custom $β$-annealed variational autoencoder (VAE) model, Q-WAVE iteratively expands this basis toward the variational ground state. The VAE learns the wavefunction's primary support structure from the combined hardware and CISD seed in a continuous latent space, generating new dominant determinants beyond any fixed excitation hierarchy. The resulting compact wavefunction exceeds what can be extracted from raw hardware samples alone. We demonstrate sub-millihartree accuracy compared to full configuration interaction for $\text{H}_2\text{O}$ and $\text{N}_2$ dissociation. Finally, we establish Q-WAVE's scalability on a 52-qubit ethylene system (achieving sub-millihartree accuracy versus CCSD(T)) and a highly correlated 60-qubit $\text{Cr}_2$ stress test that attains chemical accuracy upon a final perturbative correction.

quant-pharXiv:2609.07972•Sep 9, 2026•1 citation

Accurate quantum-centric simulations of intermolecular interactions

Danil S. Kaliakin, Akhil Shajan, Fangchun Liang +10 more

Modelling and simulating non-covalent interactions is challenging, as they are inherently weak, dynamic, and system-specific. Common predictive methods often require trading the accuracy for reducing the otherwise cumbersome computational cost. To date, the most accurate approaches, achieving chemical accuracy, rely on quantum mechanical descriptions of non-covalent interactions, which limits their scalability. Whether quantum computing could overcome these limitations is still unclear, as such methods need to be redesigned for quantum hardware. Here, we take the first step in this direction by presenting quantum-centric simulations of non-covalent interactions using a supramolecular approach for binding energy calculations. We use a sample-based quantum diagonalization (SQD) approach to simulate the potential energy surfaces (PES) of the water and methane dimers, featuring hydrogen bond and dispersion interactions, respectively. We benchmark our quantum simulations (27- and 36-qubit circuits) against classical methods, registering deviations within 1.000 kcal/mol from the leading ones. Finally, we test the limits of the quantum methods for capturing dispersion interactions with an experiment on 54 qubits. Beyond reaching state-of-the-art accuracy, our work lays out a framework for electronic structure calculations of non-covalent interactions on quantum hardware. The authors present sample-based quantum diagonalization (SQD) simulations of non-covalent interactions that match the accuracy of state-of-the-art classical methods. These results mark a key step towards quantum advantage, though further advances are needed to fully realize this potential.

Communications Physics•Oct 8, 2025•22 citations

Chemistry beyond the scale of exact diagonalization on a quantum-centric supercomputer

Javier Robledo Moreno, Mário Motta, Holger Haas +14 more

A universal quantum computer can simulate diverse quantum systems, with electronic structure for chemistry offering challenging problems for practical use cases around the hundred-qubit mark. Although current quantum processors have reached this size, deep circuits and a large number of measurements lead to prohibitive runtimes for quantum computers in isolation. Here, we demonstrate the use of classical distributed computing to offload all but an intrinsically quantum component of a workflow for electronic structure simulations. Using a Heron superconducting processor and the supercomputer Fugaku, we simulate the ground-state dissociation of N 2 and the ground state properties of [2Fe-2S] and [4Fe-4S] clusters, with circuits up to 77 qubits and 10,570 gates. The proposed algorithm processes quantum samples to produce upper bounds for the ground-state energy and sparse approximations to the ground-state wave functions. Our results suggest that, for current error rates, a quantum-centric supercomputing architecture can tackle challenging chemistry problems beyond sizes amenable to exact diagonalization.

arXiv:2405.05068•Science Advances•Jun 18, 2025•291 citations

Resource efficient Sample Based Quantum Simulation through Fragmentation and Virtual Partitioning of QPU

R. Pradeep, Anurag Chaudhary, Ashish Kumar Patra +4 more

Present-day sample-based quantum algorithms within quantum-centric supercomputing workflows require substantial classical post-processing, large circuit depths to produce chemically relevant samples, and long QPU times to execute the many circuits needed for molecules of chemically relevant size. We introduce FMO-QVM-HCI-HSQD, a resource-efficient sample-based framework that breaks a large problem into fragments, runs the fragments in parallel on virtual regions of the QPU, and reduces circuit depth through a half-qubit ansatz whose samples seed an HCI expansion. We demonstrate the algorithm on ibm_marrakesh and ibm_boston for the water trimer and the carmofur_Mpro complex with up to 52 qubits, benchmarking against FMO-CCSD(T), FMO-CASCI and FMO-HCI. For the water trimer (14 spin orbitals for monomers, 28 for dimers), our method reduces the two-qubit depth by 39% compared to FMO-QVM-SQD and the QPU time by 82% compared to sequential FMO-SQD, and accesses 3% of the determinant subspace versus 40% for FMO-SQD, while achieving more accurate energies. For the carmofur_Mpro complex (16 and 32 spin orbitals), it reduces the two-qubit depth by 47% and the QPU time by 20% compared to FMO-QVM-SQD, and accesses 0.007% of the determinant subspace versus 40%, while remaining within chemical accuracy. Extending the carmofur_Mpro active space in the 6-31G basis to 52 and 104 spin orbitals, sampled on 26 and 52 qubits, the total energy deviates from FMO-HCI by only 1.22 mHa. These results show that combining fragmentation, virtual QPU partitioning and half-qubit sampling makes sample-based quantum simulation of chemically relevant systems feasible on current hardware.

quant-pharXiv:2610.41986•Nov 2, 2026•0 citations
Quantum-centric supercomputing (QCSC) approaches, such as sample-based quantum diagonalization (SQD), combine quantum processors with high-performance computers (HPC), offering a promising route toward solving challenging electronic structure problems. However, implementation of QCSC approaches to large active space calculations is constrained by the associated number of qubits, deep quantum circuits, sampling cost, and large-scale Hamiltonian diagonalization. To overcome these limitations, we introduce a distributed QCSC framework that decomposes complex molecular problems into parallel sub-problems requiring fewer qubits, shallower circuits, and reduced shot budgets. A physically motivated, two-step aggregation scheme then reconstructs the global solution: first, a computational bit assignment strategy optimizes a cost function to appropriately map local bit indices to global ones, yielding a mapped tensor product state (MTPS); second, an inter-fragment correlation recovery module restores missing cross-fragment interactions. Herein, we employ a multi-layered generative machine learning architecture, starting with utilizing the recently proposed physics-informed generative SQD (PIGen-SQD) as a distributed QCSC solver, followed by a secondary generative module to model configuration distributions and identify dominant sectors of the global Hilbert space. For water and formamide dimers, our method achieves up to 95%95\%95% reduction in the diagonalization dimension while enhancing energy accuracy by an order of magnitude over conventional SQD. Furthermore, application to the water hexamer ((H2O)6\mathrm{(H_2O)_6}(H2​O)6​) cage successfully decomposes a 120-qubit problem into six 20-qubit monomeric subsystems, and stitches the monomers under a dimeric approximation, demonstrating excellent agreement with the reference classical methods.
The paper asks whether sample-based quantum diagonalization (SQD) can treat molecular assemblies using quantum samples only from smaller fragments, while reconstructing inter-fragment correlations classically. It introduces PIGen-SQD(MAPS), combining fragment molecular orbital (FMO) partitioning with parallel fragment solvers that use hardware samples, perturbatively selected determinants, and restricted Boltzmann machines (RBMs). An orbital-overlap- and energy-based linear assignment maps fragment occupation bitstrings into the supersystem basis. Their mapped products are augmented with cross-fragment single excitations, CISD configurations, and perturbative triples, then refined through a second RBM-driven selection/diagonalization loop. An alternative uses SQD’s S-CORE recovery initialized with the same mapped space.
Tests use IBM Heron R3 samples and classical electronic-structure references for water and formamide dimers in a 6-31G basis. Relative to conventional full-dimer SQD, the reported improvements reach a 95%95\%95% reduction in diagonalization dimension and roughly an order of magnitude lower energy error. PIGen-SQD(MAPS) gives approximately 0.4 mEh0.4\,\mathrm{m}E_h0.4mEh​ errors against heat-bath CI across the studied separation curves. For a water hexamer, sampling is restricted to six 20-spin-orbital monomers; classical recovery treats 15 fragment pairs. The resulting FMO-2 energy differs from the FMO-2 heat-bath-CI reference by 0.915 mEh0.915\,\mathrm{m}E_h0.915mEh​, rather than benchmarking an unfragmented 120-qubit solution.
The framework assumes predominantly local correlation and weaker inter-fragment coupling. Fragmentation and many-body expansion order are user choices; including larger fragment combinations increases classical cost. Recovery also depends on initialization, configuration thresholds, and sampling quality.
Quantum centric supercomputing (QCSC) framework, such as sample-based quantum diagonalization (SQD) holds immense promise toward achieving practical quantum utility to solve challenging problems. QCSC leverages quantum computers to perform the classically intractable task of sampling the dominant fermionic configurations from the Hilbert space that have substantial support to a target state, followed by Hamiltonian diagonalization on a classical processor. However, noisy quantum hardware produces erroneous samples upon measurements, making robust and efficient configuration-recovery strategies essential for a scalable QCSC pipeline. Toward this, in this work, we introduce PIGen-SQD, an efficiently designed QCSC workflow that utilizes the capability of generative machine learning (ML) along with physics-informed configuration screening via implicit low-rank tensor decompositions for accurate fermionic state reconstruction. The physics-informed pruning is based on a class of efficient perturbative measures that, in conjunction with hardware samples, provide a substantial overlap with the target state. This distribution induces an anchoring effect on the generative ML models to stochastically explore only the dominant sector of the Hilbert space for effective identification of additional important configurations in a self-consistent manner. Our numerical experiments performed on IBM Heron R2 quantum processors demonstrate this synergistic workflow produces compact, high-fidelity subspaces that substantially reduce diagonalization cost while maintaining chemical accuracy under strong electronic correlations. By embedding classical many body intuitions directly into the generative ML model, PIGen-SQD advances the robustness and scalability of QCSC algorithms, offering a promising pathway toward chemically reliable quantum simulations on utility-scale quantum hardware.
Abstract Quantum approximate optimization algorithm (QAOA) has shown promise in solving combinatorial optimization problems by providing quantum speedup on near-term gate-based quantum computing systems. However, QAOA faces challenges for high-dimensional problems due to the large number of qubits required and the complexity of deep circuits, limiting its scalability for real-world applications. In this study, we present a distributed QAOA (DQAOA), which leverages distributed computing strategies to decompose a large computational workload into smaller tasks that require fewer qubits and shallower circuits than are necessary to solve the original problem. These sub-problems are processed using a combination of high-performance and quantum computing resources. The global solution is iteratively updated by aggregating sub-solutions, allowing convergence toward the optimal solution. We demonstrate that DQAOA can handle considerably large-scale optimization problems (e.g., 1000-bit problem), achieving a high solution quality and short time-to-solution, outperforming existing strategies. Furthermore, we realize DQAOA on a quantum-centric supercomputing architecture, paving the way for practical applications of gate-based quantum computers in real-world optimization tasks. To extend DQAOA’s applicability to materials science, we further develop an active learning algorithm integrated with our DQAOA (AL-DQAOA), which involves machine learning, DQAOA, and active data production in an iterative loop. We successfully optimize photonic structures using AL-DQAOA, indicating that solving real-world optimization problems using gate-based quantum computing is feasible. We expect the proposed DQAOA to be applicable to a wide range of optimization problems and AL-DQAOA to find broader applications in material design.
Sample-based quantum diagonalization (SQD) has emerged as a promising route for quantum-centric supercomputing, relying on classical diagonalization of the molecular Hamiltonian within a hardware-sampled determinant subspace. However, its accuracy degrades in strongly correlated regimes where the relevant determinant space exceeds what finite-shot sampling can capture. In this work, we introduce Quantum Wavefunction Augmentation via Variational Autoencoders (Q-WAVE), a hybrid method that combines determinants sampled via SqDRIFT Krylov circuits and configuration interaction singles and doubles (CISD) determinants with generative machine learning. Using a custom βββ-annealed variational autoencoder (VAE) model, Q-WAVE iteratively expands this basis toward the variational ground state. The VAE learns the wavefunction's primary support structure from the combined hardware and CISD seed in a continuous latent space, generating new dominant determinants beyond any fixed excitation hierarchy. The resulting compact wavefunction exceeds what can be extracted from raw hardware samples alone. We demonstrate sub-millihartree accuracy compared to full configuration interaction for H2O\text{H}_2\text{O}H2​O and N2\text{N}_2N2​ dissociation. Finally, we establish Q-WAVE's scalability on a 52-qubit ethylene system (achieving sub-millihartree accuracy versus CCSD(T)) and a highly correlated 60-qubit Cr2\text{Cr}_2Cr2​ stress test that attains chemical accuracy upon a final perturbative correction.
Modelling and simulating non-covalent interactions is challenging, as they are inherently weak, dynamic, and system-specific. Common predictive methods often require trading the accuracy for reducing the otherwise cumbersome computational cost. To date, the most accurate approaches, achieving chemical accuracy, rely on quantum mechanical descriptions of non-covalent interactions, which limits their scalability. Whether quantum computing could overcome these limitations is still unclear, as such methods need to be redesigned for quantum hardware. Here, we take the first step in this direction by presenting quantum-centric simulations of non-covalent interactions using a supramolecular approach for binding energy calculations. We use a sample-based quantum diagonalization (SQD) approach to simulate the potential energy surfaces (PES) of the water and methane dimers, featuring hydrogen bond and dispersion interactions, respectively. We benchmark our quantum simulations (27- and 36-qubit circuits) against classical methods, registering deviations within 1.000 kcal/mol from the leading ones. Finally, we test the limits of the quantum methods for capturing dispersion interactions with an experiment on 54 qubits. Beyond reaching state-of-the-art accuracy, our work lays out a framework for electronic structure calculations of non-covalent interactions on quantum hardware. The authors present sample-based quantum diagonalization (SQD) simulations of non-covalent interactions that match the accuracy of state-of-the-art classical methods. These results mark a key step towards quantum advantage, though further advances are needed to fully realize this potential.
A universal quantum computer can simulate diverse quantum systems, with electronic structure for chemistry offering challenging problems for practical use cases around the hundred-qubit mark. Although current quantum processors have reached this size, deep circuits and a large number of measurements lead to prohibitive runtimes for quantum computers in isolation. Here, we demonstrate the use of classical distributed computing to offload all but an intrinsically quantum component of a workflow for electronic structure simulations. Using a Heron superconducting processor and the supercomputer Fugaku, we simulate the ground-state dissociation of N 2 and the ground state properties of [2Fe-2S] and [4Fe-4S] clusters, with circuits up to 77 qubits and 10,570 gates. The proposed algorithm processes quantum samples to produce upper bounds for the ground-state energy and sparse approximations to the ground-state wave functions. Our results suggest that, for current error rates, a quantum-centric supercomputing architecture can tackle challenging chemistry problems beyond sizes amenable to exact diagonalization.
Present-day sample-based quantum algorithms within quantum-centric supercomputing workflows require substantial classical post-processing, large circuit depths to produce chemically relevant samples, and long QPU times to execute the many circuits needed for molecules of chemically relevant size. We introduce FMO-QVM-HCI-HSQD, a resource-efficient sample-based framework that breaks a large problem into fragments, runs the fragments in parallel on virtual regions of the QPU, and reduces circuit depth through a half-qubit ansatz whose samples seed an HCI expansion. We demonstrate the algorithm on ibm_marrakesh and ibm_boston for the water trimer and the carmofur_Mpro complex with up to 52 qubits, benchmarking against FMO-CCSD(T), FMO-CASCI and FMO-HCI. For the water trimer (14 spin orbitals for monomers, 28 for dimers), our method reduces the two-qubit depth by 39% compared to FMO-QVM-SQD and the QPU time by 82% compared to sequential FMO-SQD, and accesses 3% of the determinant subspace versus 40% for FMO-SQD, while achieving more accurate energies. For the carmofur_Mpro complex (16 and 32 spin orbitals), it reduces the two-qubit depth by 47% and the QPU time by 20% compared to FMO-QVM-SQD, and accesses 0.007% of the determinant subspace versus 40%, while remaining within chemical accuracy. Extending the carmofur_Mpro active space in the 6-31G basis to 52 and 104 spin orbitals, sampled on 26 and 52 qubits, the total energy deviates from FMO-HCI by only 1.22 mHa. These results show that combining fragmentation, virtual QPU partitioning and half-qubit sampling makes sample-based quantum simulation of chemically relevant systems feasible on current hardware.