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

Journal of Physics Conference Series

High performance computing and quantum trajectory method in CPU and GPU systems

Joanna Wiśniewska, Marek Sawerwain, W. Leoński

Published Jan 21, 2015• 4 citations
Publisher

Abstract

Nowadays, a dynamic progress in computational techniques allows for development of various methods, which offer significant speed-up of computations, especially those related to the problems of quantum optics and quantum computing. In this work, we propose computational solutions which re-implement the quantum trajectory method (QTM) algorithm in modern parallel computation environments in which multi-core CPUs and modern many-core GPUs can be used. In consequence, new computational routines are developed in more effective way than those applied in other commonly used packages, such as Quantum Optics Toolbox (QOT) for Matlab or QuTIP for Python.

DOI
10.1088/1742-6596/574/1/012127

Related papers

QTM: Computational package using MPI protocol for Quantum Trajectories Method

Marek Sawerwain, Joanna Wiśniewska

The Quantum Trajectories Method (QTM) is one of the frequently used methods for studying open quantum systems. The main idea of this method is the evolution of wave functions which describe the system (as functions of time). Then, so-called quantum jumps are applied at a randomly selected point in time. The obtained system state is called as a trajectory. After averaging many single trajectories, we obtain the approximation of the behavior of a quantum system. This fact also allows us to use parallel computation methods. In the article, we discuss the QTM package which is supported by the MPI technology. Using MPI allowed utilizing the parallel computing for calculating the trajectories and averaging them-as the effect of these actions, the time taken by calculations is shorter. In spite of using the C++ programming language, the presented solution is easy to utilize and does not need any advanced programming techniques. At the same time, it offers a higher performance than other packages realizing the QTM. It is especially important in the case of harder computational tasks, and the use of MPI allows improving the performance of particular problems which can be solved in the field of open quantum systems.

arXiv:1810.03047•PLoS ONE•Dec 10, 2018•1 citation

GPU-aware distributed quantum simulation

Anderson Ávila, Adriano Maron, Renata Reiser +2 more

The simulation of algorithms from quantum computing is currently the most affordable solution for development of new applications. Due to the high computational cost of such simulation, solutions towards novel features that increase the performance are always desired. This work proposes an extension for the D-GM's simulation framework, establishing the support for GPU-aware distributed quantum simulation. The project explores the concepts of heterogeneous computing, merging distributed and GPU computing in a single programming environment. Our results comprehend the distributed simulation of systems comprised by Hadamard transformations up to 21 qubits. Detailed analysis and a performance comparison between PyCUDA and JCUDA frameworks for our application are discussed. This work is a significant step towards the ultimate goal of our project, which is the hybrid simulation of quantum algorithms, i.e., exploring multi-core CPUs and GPUs distributed along a cluster, achieving scalability when larger systems are simulated.

ACM Symposium on Applied Computing•Mar 24, 2014•35 citations

PARALLEL ADAPTIVE QUANTUM TRAJECTORY METHOD FOR WAVEPACKET SIMULATIONS

Ricolindo L. Cariño, Ioana Banicescu, R. K. Vadapalli +2 more

Time-dependent wavepackets are widely used to model various phenomena in physics. One approach in simulating the wavepacket dynamics is the quantum trajectory method (QTM). Based on the hydrodynamic formulation of quantum mechanics, the QTM represents the wavepacket by an unstructured set of pseudoparticles whose trajectories are coupled by the quantum potential. The governing equations for the pseudoparticle trajectories are solved using a computationally-intensive moving weighted least squares (MWLS) algorithm, and the trajectories can be computed in parallel. This paper contributes a strategy for improving the performance of wavepacket simulations using the QTM. Specifically, adaptivity is incorporated into the MWLS algorithm, and loop scheduling techniques are employed to dynamically load balance the parallel computation of the trajectories. The adaptive MWLS algorithm reduces the amount of computations without sacrificing accuracy, while adaptive loop scheduling addresses the load imbalance introduced by the algorithm and the runtime system. Results of experiments on a Linux cluster are presented to confirm that the adaptive MWLS reduces the trajectory computation time by up to 24%, and adaptive loop scheduling achieves parallel efficiencies of up to 85% when simulating a free particle.

Parallel Processing Letters•Dec 1, 2005•2 citations

Parallel adaptive quantum trajectory method for wavepacket simulations

R.L. Carino, Ioana Banicescu, R. K. Vadapalli +2 more

Time-dependent wavepackets are widely used to model various phenomena in physics. One approach in simulating the wavepacket dynamics is the quantum trajectory method (QTM). Based on the hydrodynamic formulation of quantum mechanics, the QTM represents the wavepacket by an unstructured set of pseudoparticles whose trajectories are coupled by the quantum potential. The governing equations for the pseudoparticle trajectories are solved using a computationally intensive moving weighted least squares (MWLS) algorithm, and the trajectories can be computed in parallel. This paper contributes a strategy for improving the performance of wavepacket simulations using the QTM. Specifically, adaptivity is incorporated into the MWLS algorithm, and loop scheduling techniques are employed to dynamically load balance the parallel computation of the trajectories. The adaptive MWLS algorithm reduces the amount of computations without sacrificing accuracy, while adaptive loop scheduling addresses the load imbalance introduced by the algorithm and the runtime system. Results of experiments on a Linux cluster are presented to confirm that the adaptive MWLS reduces the trajectory computation time by up to 24%, and adaptive loop scheduling achieves parallel efficiencies of up to 85% when simulating a free particle.

IEEE International Parallel and Distributed Processing Symposium (IPDPS)•Mar 22, 2004•8 citations

Heterogeneous CPU-GPU-Quantum Accelerator

Seham Al Abdul Wahid, Arghavan Asad, Rupinder Kaur +3 more

The drastic growth of data generation by companies such as Google and Facebook, the widespread integration of IoT devices into everyday life, advancements in artificial intelligence, and the rise of social media platforms are driving a shift from model-driven to data-driven science. This surge in data created a need for massively parallel accelerators such as graphics processing units (GPU). High Performance Computing (HPC) are required to accommodate the growing complexity of data-driven technologies. HPC demands are anticipated to reach exascale levels within this decade. Since 2004, three waves of high-performance accelerators have driven advancements in HPC: the first wave introduced Central Processing Units (CPUs) and Field Programmable Gate Arrays (FPGAs), the second wave brought General Purpose Graphics Processing Units (GPGPUs), and the third wave focused on machine learning specific GPUs. Recent research reveals that quantum processing units (QPUs) have the potential to be the fourth wave of high-performance acceleration in the near future. However, as Quantum Computing is still in its early stages, its practical and useful quantum computation is yet to be developed. In this paper, a heterogeneous CPU-GPU-QPU (HCGQ) accelerator is proposed. The accelerator is based on an input size threshold, where the CPU assigns smaller input sizes workloads to the GPU, and larger input sizes to the QPU. This dynamic workload allocation is realized entirely through software-level integration. Using the searching algorithm and deep neural networks as benchmarks, it was observed that the HCGQ accelerator outperformed standalone GPUs and QPUs in terms of speed and energy efficiency.

•Sep 17, 2025•1 citation

Boosting quantum evolutions using Trotter-Suzuki algorithms on GPUs

Carlos Bederián, Axel D. Dente

Abstract. The evolution calculation of quantum systems represents a great challenge nowadays. Numerical implementations typically scale ex-ponentially with the size of the system, demanding high amounts of re-sources. General Purpose Graphics Processor Units (GPGPUs) enable a new range of possibilities for numerical simulations of quantum systems. In this work we implemented, optimized and compared the quantum Trotter-Suzuki algorithm running on both CPUs and GPUs. 1

•Jan 1, 2011•6 citations
Nowadays, a dynamic progress in computational techniques allows for development of various methods, which offer significant speed-up of computations, especially those related to the problems of quantum optics and quantum computing. In this work, we propose computational solutions which re-implement the quantum trajectory method (QTM) algorithm in modern parallel computation environments in which multi-core CPUs and modern many-core GPUs can be used. In consequence, new computational routines are developed in more effective way than those applied in other commonly used packages, such as Quantum Optics Toolbox (QOT) for Matlab or QuTIP for Python.
The Quantum Trajectories Method (QTM) is one of the frequently used methods for studying open quantum systems. The main idea of this method is the evolution of wave functions which describe the system (as functions of time). Then, so-called quantum jumps are applied at a randomly selected point in time. The obtained system state is called as a trajectory. After averaging many single trajectories, we obtain the approximation of the behavior of a quantum system. This fact also allows us to use parallel computation methods. In the article, we discuss the QTM package which is supported by the MPI technology. Using MPI allowed utilizing the parallel computing for calculating the trajectories and averaging them-as the effect of these actions, the time taken by calculations is shorter. In spite of using the C++ programming language, the presented solution is easy to utilize and does not need any advanced programming techniques. At the same time, it offers a higher performance than other packages realizing the QTM. It is especially important in the case of harder computational tasks, and the use of MPI allows improving the performance of particular problems which can be solved in the field of open quantum systems.
The simulation of algorithms from quantum computing is currently the most affordable solution for development of new applications. Due to the high computational cost of such simulation, solutions towards novel features that increase the performance are always desired. This work proposes an extension for the D-GM's simulation framework, establishing the support for GPU-aware distributed quantum simulation. The project explores the concepts of heterogeneous computing, merging distributed and GPU computing in a single programming environment. Our results comprehend the distributed simulation of systems comprised by Hadamard transformations up to 21 qubits. Detailed analysis and a performance comparison between PyCUDA and JCUDA frameworks for our application are discussed. This work is a significant step towards the ultimate goal of our project, which is the hybrid simulation of quantum algorithms, i.e., exploring multi-core CPUs and GPUs distributed along a cluster, achieving scalability when larger systems are simulated.
Time-dependent wavepackets are widely used to model various phenomena in physics. One approach in simulating the wavepacket dynamics is the quantum trajectory method (QTM). Based on the hydrodynamic formulation of quantum mechanics, the QTM represents the wavepacket by an unstructured set of pseudoparticles whose trajectories are coupled by the quantum potential. The governing equations for the pseudoparticle trajectories are solved using a computationally-intensive moving weighted least squares (MWLS) algorithm, and the trajectories can be computed in parallel. This paper contributes a strategy for improving the performance of wavepacket simulations using the QTM. Specifically, adaptivity is incorporated into the MWLS algorithm, and loop scheduling techniques are employed to dynamically load balance the parallel computation of the trajectories. The adaptive MWLS algorithm reduces the amount of computations without sacrificing accuracy, while adaptive loop scheduling addresses the load imbalance introduced by the algorithm and the runtime system. Results of experiments on a Linux cluster are presented to confirm that the adaptive MWLS reduces the trajectory computation time by up to 24%, and adaptive loop scheduling achieves parallel efficiencies of up to 85% when simulating a free particle.
Time-dependent wavepackets are widely used to model various phenomena in physics. One approach in simulating the wavepacket dynamics is the quantum trajectory method (QTM). Based on the hydrodynamic formulation of quantum mechanics, the QTM represents the wavepacket by an unstructured set of pseudoparticles whose trajectories are coupled by the quantum potential. The governing equations for the pseudoparticle trajectories are solved using a computationally intensive moving weighted least squares (MWLS) algorithm, and the trajectories can be computed in parallel. This paper contributes a strategy for improving the performance of wavepacket simulations using the QTM. Specifically, adaptivity is incorporated into the MWLS algorithm, and loop scheduling techniques are employed to dynamically load balance the parallel computation of the trajectories. The adaptive MWLS algorithm reduces the amount of computations without sacrificing accuracy, while adaptive loop scheduling addresses the load imbalance introduced by the algorithm and the runtime system. Results of experiments on a Linux cluster are presented to confirm that the adaptive MWLS reduces the trajectory computation time by up to 24%, and adaptive loop scheduling achieves parallel efficiencies of up to 85% when simulating a free particle.
The drastic growth of data generation by companies such as Google and Facebook, the widespread integration of IoT devices into everyday life, advancements in artificial intelligence, and the rise of social media platforms are driving a shift from model-driven to data-driven science. This surge in data created a need for massively parallel accelerators such as graphics processing units (GPU). High Performance Computing (HPC) are required to accommodate the growing complexity of data-driven technologies. HPC demands are anticipated to reach exascale levels within this decade. Since 2004, three waves of high-performance accelerators have driven advancements in HPC: the first wave introduced Central Processing Units (CPUs) and Field Programmable Gate Arrays (FPGAs), the second wave brought General Purpose Graphics Processing Units (GPGPUs), and the third wave focused on machine learning specific GPUs. Recent research reveals that quantum processing units (QPUs) have the potential to be the fourth wave of high-performance acceleration in the near future. However, as Quantum Computing is still in its early stages, its practical and useful quantum computation is yet to be developed. In this paper, a heterogeneous CPU-GPU-QPU (HCGQ) accelerator is proposed. The accelerator is based on an input size threshold, where the CPU assigns smaller input sizes workloads to the GPU, and larger input sizes to the QPU. This dynamic workload allocation is realized entirely through software-level integration. Using the searching algorithm and deep neural networks as benchmarks, it was observed that the HCGQ accelerator outperformed standalone GPUs and QPUs in terms of speed and energy efficiency.