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

ACM International Conference on Computing Frontiers: Workshops and Special Sessions (CF Companion)

Quantum computer simulation on HPC

Nobuyasu Ito, Naoki Yoshioka

Published May 7, 2024• 0 citations
Publisher

Abstract

Current status of the HPC-QC hybrid activities in the R-CCS, and RIKEN Quantum activities will be given, together with a focus on QC simulation on the Fugaku. A state-vector simulator, "braket" [3], has been developed for HPC [1, 2] and it is now tuning up to the Fugaku. It makes 40-qubits scale simulation easily and execution elapse time is about one second or less per gate, and it will reach to 48 qubits simulation in double precision using full nodes of the Fugaku. As an example, estimation of ground-state energy of spin-1/2 Heisenberg chain is to be shown up to 40 spins using 41 circuits of 40 qubits, which implies exact calculation of 1,641 qubits circuits. Another QC simulator using tensor network method also be developed for HPC.

DOI
10.1145/3637543.3653433

Related papers

Simulator Demonstration of Large Scale Variational Quantum Algorithm on HPC Cluster

Mikio Morita, Yoshinori Tomita, Junpei Koyama +1 more

Advances in quantum simulator technology are increasingly required because research on quantum algorithms is becoming more sophisticated and complex. State vector simulation utilizes CPU and memory resources in computing nodes exponentially with respect to the number of qubits; furthermore, in a variational quantum algorithm, the large number of repeated runs by classical optimization is also a heavy load. This problem has been addressed by preparing numerous computing nodes or simulation frameworks that operate effectively. This study aimed to accelerate quantum simulation using two newly proposed methods: to efficiently utilize limited computational resources by adjusting the ratio of the MPI and distributed processing parallelism corresponding to the target problem settings and to slim down the Hamiltonian by considering the effect of accuracy on the calculation result. Ground-state energy calculations of a fermionic model were performed using a variational quantum eigensolver (VQE) on an HPC cluster with up to 1024 FUJITSU Processor A64FX connected to each other by InfiniBand; the processor is also used on supercomputer Fugaku. We achieved 200 times higher speed over VQE simulations and demonstrated 32 qubits ground-state energy calculations in acceptable time. This result indicates that > 30 qubit state vector simulations can be realistically utilized for further research on variational quantum algorithms.

arXiv:2402.11878•IEEE Access•Jan 1, 2024•8 citations

Quantum-HPC Workflows Across Multiple Quantum Computing Platforms: Two Case Studies

Philipp Seitz, Miwako Tsuji, John Children +5 more

We describe the Quantum-HPC hybrid system comprising the supercomputer Fugaku, the QPUs Quantinuum Reimei and ibm_kobe, and the Tierkreis hybrid workflow software. We present two demonstrations of the system at work. In the first, we compute the excited states of a biomolecular system using Fugaku and Reimei (simulator) to handle classical and quantum parts of the workflow respectively. In the second, Fugaku coordinates Reimei and ibm_kobe working together in a combined VQE + QPE workflow to compute the ground state energy of a simple system.

quant-pharXiv:2609.31528•Sep 28, 2026•0 citations

HybridQ: A Hybrid Simulator for Quantum Circuits

Salvatore Mandrà, Jeffrey Marshall, Eleanor Gilbert Rieffel +1 more

Developing state-of-the-art classical simulators of quantum circuits is of utmost importance to test and evaluate early quantum technology and understand the true potential of full-blown error-corrected quantum computers. In the past few years, multiple theoretical and numerical advances have continuously pushed the boundary of what is classically simulable, hence the development of a plethora of tools which are often limited to a specific purpose or designed for a particular hardware (e.g. CPUs vs. GPUs). Moreover, such tools are typically developed using tailored languages and syntax, which makes it hard to compare results from, and create hybrid approaches using, different simulation techniques. To support unified and optimized use of these techniques across platforms, we developed HybridQ , a highly extensible platform designed to provide a common framework to integrate multiple state-of-the-art techniques to run on a variety of hardware. The philosophy behind its development has been driven by three main pillars: Easy to Use, Easy to Extend, and Use the Best Available Technology. The powerful tools of HybridQ allow users to manipulate, develop, and extend noiseless and noisy circuits for different hardware architectures. HybridQ supports large-scale high-performance computing (HPC) simulations, automatically balancing workload among different processor nodes and enabling the use of multiple backends to maximize parallel efficiency. Everything is then glued together by a simple and expressive language that allows seamless switching from one technique to another as well as from one hardware to the next, without the need to write lengthy translations, thus greatly simplifying the development of new hybrid algorithms and techniques.

arXiv:2111.06868•IEEE/ACM International Workshop on Quantum Computing Software (QCS)•Nov 1, 2021•11 citations

Quantum computing quantum Monte Carlo with hybrid tensor network for electronic structure calculations

Shu Kanno, Hajime Nakamura, T. Kobayashi +4 more

Abstract Quantum computers have a potential for solving quantum chemistry problems with higher accuracy than classical computers. Quantum computing quantum Monte Carlo (QC-QMC) is a QMC with a trial state prepared in quantum circuit, which is employed to obtain the ground state with higher accuracy than QMC alone. We propose an algorithm combining QC-QMC with a hybrid tensor network to extend the applicability of QC-QMC beyond a single quantum device size. In a two-layer quantum-quantum tree tensor, our algorithm for the larger trial wave function can be executed than preparable wave function in a device. Our algorithm is evaluated on the Heisenberg chain model, graphite-based Hubbard model, hydrogen plane model, and MonoArylBiImidazole using full configuration interaction QMC. Our algorithm can achieve energy accuracy (specifically, variance) several orders of magnitude higher than QMC, and the hybrid tensor version of QMC gives the same energy accuracy as QC-QMC when the system is appropriately decomposed. Moreover, we develop a pseudo-Hadamard test technique that enables efficient overlap calculations between a trial wave function and an orthonormal basis state. In a real device experiment by using the technique, we obtained almost the same accuracy as the statevector simulator, indicating the noise robustness of our algorithm. These results suggests that the present approach will pave the way to electronic structure calculation for large systems with high accuracy on current quantum devices.

arXiv:2303.18095•npj Quantum Information•Jun 6, 2024•20 citations

Hybrid HPC-Quantum Simulations: DFT-Quantum Embedding for Molecular Systems

Namrata Manglani, Samrit Maity, Shashank Sharma +4 more

Scientific simulations demand methods combining scalability with predictive accuracy. Density Functional Theory (DFT) on High-Performance Computing (HPC) enables large-scale electronic-structure simulations but is limited by approximations affecting strongly correlated systems and band-gap predictions. Quantum computing offers a pathway to address this, though current Noisy Intermediate-Scale Quantum (NISQ) hardware remains constrained by qubit resources, noise, and execution cost. This work presents a hybrid DFT-Quantum Embedding (QDFT) framework integrating classical HPC-based DFT with a quantum electronic-structure solver. Large systems are partitioned to isolate a chemically relevant active space, treated via the Variational Quantum Eigensolver (VQE), while the remaining degrees of freedom are described by DFT. The framework incorporates active-space selection, embedded Hamiltonian construction, symmetry preservation, operator mapping, self-consistent density updating, and modular classical-quantum coupling. We focus on noiseless quantum simulation to systematically evaluate accuracy, convergence, active-space dependence, computational cost, and HPC scalability without hardware noise. Detailed profiling identifies computational bottlenecks and highlights limitations of CPU-based quantum simulation. A QPU runtime-estimation methodology is additionally developed to assess execution requirements on actual quantum hardware. Results demonstrate quantum embedding's potential to improve selected electronic-structure properties while retaining classical HPC's scalability. Noisy quantum simulation and QPU execution remain key future directions, providing a pathway toward practical, scalable HPC-quantum hybrid simulations as hardware matures.

quant-pharXiv:2608.12884•Aug 14, 2026•0 citations

Exploring Hybrid Classical-Quantum Compute Systems through Simulation

Muhammad Nufail Farooqi, Martin Ruefenacht

The computational requirements of applications running in supercomputing centres are growing rapidly and diversifying over time. To meet these needs, developers are constantly developing new processors, domain-specific accelerators, and technologies. Quantum computing is one notable technology that has the potential to speed up certain computations and could be used to enhance High Performance Computing (HPC). However, integrating a quantum computer (QC) into HPC systems is a complex and challenging task, both at the physical and software level. Although various types of accelerators have been integrated into HPC in the past, the integration of QC into HPC presents a unique challenge as it operates on a new computing paradigm and is a scarce resource that needs to be shared among multiple jobs. Furthermore, HPCQC integration is a multidisciplinary field and integration can mean different things to different stakeholders. Our approach to HPCQC integration is from the perspective of an HPC centre where QC is integrated into the HPC environment as an accelerator. We identify parameters that are important for the integration, including network latency, HPCQC hybrid application characteristics and fine-grained scheduling. In addition, we develop a custom simulation model that can comprehensively simulate a hybrid classical-quantum compute system at selected level of detail. This simulation model is utilised to simulate the performance of a hybrid application by adjusting its features on a hybrid system with varying parameters. We discover that fine-grained scheduling is critical to performance, and network latency between QC and HPC has a significant impact on hybrid system performance.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•5 citations
Current status of the HPC-QC hybrid activities in the R-CCS, and RIKEN Quantum activities will be given, together with a focus on QC simulation on the Fugaku. A state-vector simulator, "braket" [3], has been developed for HPC [1, 2] and it is now tuning up to the Fugaku. It makes 40-qubits scale simulation easily and execution elapse time is about one second or less per gate, and it will reach to 48 qubits simulation in double precision using full nodes of the Fugaku. As an example, estimation of ground-state energy of spin-1/2 Heisenberg chain is to be shown up to 40 spins using 41 circuits of 40 qubits, which implies exact calculation of 1,641 qubits circuits. Another QC simulator using tensor network method also be developed for HPC.
Advances in quantum simulator technology are increasingly required because research on quantum algorithms is becoming more sophisticated and complex. State vector simulation utilizes CPU and memory resources in computing nodes exponentially with respect to the number of qubits; furthermore, in a variational quantum algorithm, the large number of repeated runs by classical optimization is also a heavy load. This problem has been addressed by preparing numerous computing nodes or simulation frameworks that operate effectively. This study aimed to accelerate quantum simulation using two newly proposed methods: to efficiently utilize limited computational resources by adjusting the ratio of the MPI and distributed processing parallelism corresponding to the target problem settings and to slim down the Hamiltonian by considering the effect of accuracy on the calculation result. Ground-state energy calculations of a fermionic model were performed using a variational quantum eigensolver (VQE) on an HPC cluster with up to 1024 FUJITSU Processor A64FX connected to each other by InfiniBand; the processor is also used on supercomputer Fugaku. We achieved 200 times higher speed over VQE simulations and demonstrated 32 qubits ground-state energy calculations in acceptable time. This result indicates that > 30 qubit state vector simulations can be realistically utilized for further research on variational quantum algorithms.
We describe the Quantum-HPC hybrid system comprising the supercomputer Fugaku, the QPUs Quantinuum Reimei and ibm_kobe, and the Tierkreis hybrid workflow software. We present two demonstrations of the system at work. In the first, we compute the excited states of a biomolecular system using Fugaku and Reimei (simulator) to handle classical and quantum parts of the workflow respectively. In the second, Fugaku coordinates Reimei and ibm_kobe working together in a combined VQE + QPE workflow to compute the ground state energy of a simple system.
Developing state-of-the-art classical simulators of quantum circuits is of utmost importance to test and evaluate early quantum technology and understand the true potential of full-blown error-corrected quantum computers. In the past few years, multiple theoretical and numerical advances have continuously pushed the boundary of what is classically simulable, hence the development of a plethora of tools which are often limited to a specific purpose or designed for a particular hardware (e.g. CPUs vs. GPUs). Moreover, such tools are typically developed using tailored languages and syntax, which makes it hard to compare results from, and create hybrid approaches using, different simulation techniques. To support unified and optimized use of these techniques across platforms, we developed HybridQ , a highly extensible platform designed to provide a common framework to integrate multiple state-of-the-art techniques to run on a variety of hardware. The philosophy behind its development has been driven by three main pillars: Easy to Use, Easy to Extend, and Use the Best Available Technology. The powerful tools of HybridQ allow users to manipulate, develop, and extend noiseless and noisy circuits for different hardware architectures. HybridQ supports large-scale high-performance computing (HPC) simulations, automatically balancing workload among different processor nodes and enabling the use of multiple backends to maximize parallel efficiency. Everything is then glued together by a simple and expressive language that allows seamless switching from one technique to another as well as from one hardware to the next, without the need to write lengthy translations, thus greatly simplifying the development of new hybrid algorithms and techniques.
Abstract Quantum computers have a potential for solving quantum chemistry problems with higher accuracy than classical computers. Quantum computing quantum Monte Carlo (QC-QMC) is a QMC with a trial state prepared in quantum circuit, which is employed to obtain the ground state with higher accuracy than QMC alone. We propose an algorithm combining QC-QMC with a hybrid tensor network to extend the applicability of QC-QMC beyond a single quantum device size. In a two-layer quantum-quantum tree tensor, our algorithm for the larger trial wave function can be executed than preparable wave function in a device. Our algorithm is evaluated on the Heisenberg chain model, graphite-based Hubbard model, hydrogen plane model, and MonoArylBiImidazole using full configuration interaction QMC. Our algorithm can achieve energy accuracy (specifically, variance) several orders of magnitude higher than QMC, and the hybrid tensor version of QMC gives the same energy accuracy as QC-QMC when the system is appropriately decomposed. Moreover, we develop a pseudo-Hadamard test technique that enables efficient overlap calculations between a trial wave function and an orthonormal basis state. In a real device experiment by using the technique, we obtained almost the same accuracy as the statevector simulator, indicating the noise robustness of our algorithm. These results suggests that the present approach will pave the way to electronic structure calculation for large systems with high accuracy on current quantum devices.
Scientific simulations demand methods combining scalability with predictive accuracy. Density Functional Theory (DFT) on High-Performance Computing (HPC) enables large-scale electronic-structure simulations but is limited by approximations affecting strongly correlated systems and band-gap predictions. Quantum computing offers a pathway to address this, though current Noisy Intermediate-Scale Quantum (NISQ) hardware remains constrained by qubit resources, noise, and execution cost. This work presents a hybrid DFT-Quantum Embedding (QDFT) framework integrating classical HPC-based DFT with a quantum electronic-structure solver. Large systems are partitioned to isolate a chemically relevant active space, treated via the Variational Quantum Eigensolver (VQE), while the remaining degrees of freedom are described by DFT. The framework incorporates active-space selection, embedded Hamiltonian construction, symmetry preservation, operator mapping, self-consistent density updating, and modular classical-quantum coupling. We focus on noiseless quantum simulation to systematically evaluate accuracy, convergence, active-space dependence, computational cost, and HPC scalability without hardware noise. Detailed profiling identifies computational bottlenecks and highlights limitations of CPU-based quantum simulation. A QPU runtime-estimation methodology is additionally developed to assess execution requirements on actual quantum hardware. Results demonstrate quantum embedding's potential to improve selected electronic-structure properties while retaining classical HPC's scalability. Noisy quantum simulation and QPU execution remain key future directions, providing a pathway toward practical, scalable HPC-quantum hybrid simulations as hardware matures.
The computational requirements of applications running in supercomputing centres are growing rapidly and diversifying over time. To meet these needs, developers are constantly developing new processors, domain-specific accelerators, and technologies. Quantum computing is one notable technology that has the potential to speed up certain computations and could be used to enhance High Performance Computing (HPC). However, integrating a quantum computer (QC) into HPC systems is a complex and challenging task, both at the physical and software level. Although various types of accelerators have been integrated into HPC in the past, the integration of QC into HPC presents a unique challenge as it operates on a new computing paradigm and is a scarce resource that needs to be shared among multiple jobs. Furthermore, HPCQC integration is a multidisciplinary field and integration can mean different things to different stakeholders. Our approach to HPCQC integration is from the perspective of an HPC centre where QC is integrated into the HPC environment as an accelerator. We identify parameters that are important for the integration, including network latency, HPCQC hybrid application characteristics and fine-grained scheduling. In addition, we develop a custom simulation model that can comprehensively simulate a hybrid classical-quantum compute system at selected level of detail. This simulation model is utilised to simulate the performance of a hybrid application by adjusting its features on a hybrid system with varying parameters. We discover that fine-grained scheduling is critical to performance, and network latency between QC and HPC has a significant impact on hybrid system performance.