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

International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

A Grid Enabled Quantum Computer Simulator

Simona Caraiman, Alexandru Archip, Vasile Manta

Published Sep 1, 2009• 6 citations
Publisher

Abstract

Simulation of quantum computers using classical computers is a computationally hard problem, requiring a huge amount of operations and storage. Grid systems are a good choice for simulating quantum algorithms, since they provide access to high-performance computer clusters. In this paper we present the design of a message passing parallel version of the quantum computer simulator, QCL, deployed as a grid service. After describing the architecture of our grid service and the parallelization strategy for the general single qubit operator, we present the performance measurements for some test cases, showing the speedups obtained.

DOI
10.1109/synasc.2009.57

Related papers

Parallel Simulation of Quantum Search

Simona Caraiman, Vasile Manta

Simulation of quantum computers using classical computers is a computationally hard problem, requiring a huge amount of operations and storage. Parallelization can alleviate this problem, allowing the simulation of more qubits at the same time or the same number of qubits to be simulated in less time. A promising approach is represented by executing these simulators in Grid systems that can provide access to high performance resources. In this paper we present a parallel implementation of the QC-lib quantum computer simulator deployed as a Grid service. Using a specific scheme for partitioning the terms describing quantum states and efficient parallelization of the general singe qubit operator and of the controlled operators, very good speed-ups were obtained for the simulation of the quantum search problem.

International Journal of Computers Communications & Control•Dec 1, 2010•4 citations

Parallel quantum computer simulation on the GPU

Andrei Amariutei, Simona Caraiman

Simulation of quantum computers using classical computers is a hard problem with high memory and computational requirements. Parallelization can alleviate this problem, allowing the simulation of more qubits at the same time or the same number of qubits to be simulated in less time. A promising approach is to exploit the high performance computing capabilities provided by the latest graphical processing units. In this paper we present a parallel implementation of the QC-lib quantum computer simulator on the GPU using the CUDA programming model. The proposed scheme for partitioning the terms that describe the state of a quantum register takes advantage of the specific characteristics of the CUDA memory spaces and allows for an efficient parallelization of the general singe qubit operator. Experimental results indicate that very good speed-ups can be obtained in contrast with the sequential implementation.

•Nov 28, 2011•17 citations

A Parallel Quantum Computer Simulator

James E Fischer

The unique principles of quantum mechanics may one day enable computers to perform operations that would be impossible on a classical computer. Although no one knows whether it will be possible to build a large-scale, functional, and stable quantum computer, researchers can study quantum-mechanical systems and develop algorithms and circuits by simulating quantum systems in software. Performance and memory bottlenecks prevent most current quantum computer simulators from being able to simulate quantum systems that are large enough to be useful. In this thesis, we develop a matrix-free sequential quantum computer simulator to vastly improve both time and memory performance of sequential code on a single processor. Next, we distribute the matrix-free algorithm over multiple parallel processors using the Message Passing Interface in order to simulate quantum systems that are too large to reside wholly within the memory of a single processor. Finally, we simulate various quantum circuits using the Hamming high-performance computing cluster in order to conduct algorithmic analysis.

•Sep 1, 2016•0 citations

Parallelization of the General Single Qubit Gate and CNOT for the QC-lib Quantum Computer Simulator Library

I. Glendinning, Bernhard Ömer

This paper reports on work to parallelize QC-lib, a C++ library for the simulation of quantum computers at an abstract functional level. After a brief introduction to quantum computing, we give an outline of QC-lib, then describe the parallelization using MPI of the general single qubit gate and the controlled-NOT gate (CNOT). Although QC-lib also implements other gates, this combination is already universal for quantum computing, and has allowed us to implement Grover's quantum search algorithm as a test case. We present some performance measurements made on a Beowulf cluster, which show reasonable speedups for Grover's algorithm.

•Jun 1, 2003•4 citations

A quantum computing simulator scheme using MPI technology on cloud platform

Zhiguo Huang, Ling Qian, Dunbo Cai

With the deeply studied of quantum computing by research fellows, the computational complexity and time complexity of quantum algorithms gradually increase. The quantum computing simulator provides an effective platform for the development and verification of quantum algorithms. However, the running time and memory overhead during calculation will increase exponentially with the number of qubits. Therefore, the difficulty of high-speed quantum computing on classical computers will gradually increase. At present, a single node has been unable to meet the resource requirements of the algorithm in the quantum computing process, and it is necessary to expand the memory resources in the multi-node computing cluster. Message passing interface has high performance inter-process communication capabilities, which can balance the data transmission between different hosts. Quantum computing tasks can be distributed on several servers to work together to solve the same problem. Therefore, this paper designs an advanced scheme of deploying quantum computing programs on cloud computing platform to support message exchanging between servers using message passing interface to accelerate quantum computing.

IEEE International Conference on Electrical Engineering, Big Data and Algorithms (EEBDA)•Feb 25, 2022•8 citations

QX: A high-performance quantum computer simulation platform

Nader Khammassi, I. Ashraf, Xiang Fu +2 more

Quantum computing is rapidly evolving especially after the discovery of several efficient quantum algorithms solving intractable classical problems such as Shor's factoring algorithm. However the realization of a large-scale physical quantum computer is very challenging and the number of qubits that are currently under development is still very low, namely less than 15. In the absence of large size platforms, quantum computer simulation is critical for developing and testing quantum algorithms and investigating the different challenges facing the design of quantum computer hardware. What makes quantum computer simulation on classical computers particularly challenging are the memory and computational resource requirements. In this paper, we introduce a universal quantum computer simulator, called QX, that takes as input a specially designed quantum assembly language, called QASM, and provides, through agressive optimisations, high simulation speeds and large number of qubits. QX allows the simulation of up to 34 fully entangled qubits on a single node using less than 270 GB of memory. Our experiments using different quantum algorithms show that QX achieves significant simulation speedup over similar state-of-the-art simulation environment.

Design, Automation, and Test in Europe•Mar 1, 2017•101 citations
Simulation of quantum computers using classical computers is a computationally hard problem, requiring a huge amount of operations and storage. Grid systems are a good choice for simulating quantum algorithms, since they provide access to high-performance computer clusters. In this paper we present the design of a message passing parallel version of the quantum computer simulator, QCL, deployed as a grid service. After describing the architecture of our grid service and the parallelization strategy for the general single qubit operator, we present the performance measurements for some test cases, showing the speedups obtained.
Simulation of quantum computers using classical computers is a computationally hard problem, requiring a huge amount of operations and storage. Parallelization can alleviate this problem, allowing the simulation of more qubits at the same time or the same number of qubits to be simulated in less time. A promising approach is represented by executing these simulators in Grid systems that can provide access to high performance resources. In this paper we present a parallel implementation of the QC-lib quantum computer simulator deployed as a Grid service. Using a specific scheme for partitioning the terms describing quantum states and efficient parallelization of the general singe qubit operator and of the controlled operators, very good speed-ups were obtained for the simulation of the quantum search problem.
Simulation of quantum computers using classical computers is a hard problem with high memory and computational requirements. Parallelization can alleviate this problem, allowing the simulation of more qubits at the same time or the same number of qubits to be simulated in less time. A promising approach is to exploit the high performance computing capabilities provided by the latest graphical processing units. In this paper we present a parallel implementation of the QC-lib quantum computer simulator on the GPU using the CUDA programming model. The proposed scheme for partitioning the terms that describe the state of a quantum register takes advantage of the specific characteristics of the CUDA memory spaces and allows for an efficient parallelization of the general singe qubit operator. Experimental results indicate that very good speed-ups can be obtained in contrast with the sequential implementation.
The unique principles of quantum mechanics may one day enable computers to perform operations that would be impossible on a classical computer. Although no one knows whether it will be possible to build a large-scale, functional, and stable quantum computer, researchers can study quantum-mechanical systems and develop algorithms and circuits by simulating quantum systems in software. Performance and memory bottlenecks prevent most current quantum computer simulators from being able to simulate quantum systems that are large enough to be useful. In this thesis, we develop a matrix-free sequential quantum computer simulator to vastly improve both time and memory performance of sequential code on a single processor. Next, we distribute the matrix-free algorithm over multiple parallel processors using the Message Passing Interface in order to simulate quantum systems that are too large to reside wholly within the memory of a single processor. Finally, we simulate various quantum circuits using the Hamming high-performance computing cluster in order to conduct algorithmic analysis.
This paper reports on work to parallelize QC-lib, a C++ library for the simulation of quantum computers at an abstract functional level. After a brief introduction to quantum computing, we give an outline of QC-lib, then describe the parallelization using MPI of the general single qubit gate and the controlled-NOT gate (CNOT). Although QC-lib also implements other gates, this combination is already universal for quantum computing, and has allowed us to implement Grover's quantum search algorithm as a test case. We present some performance measurements made on a Beowulf cluster, which show reasonable speedups for Grover's algorithm.
With the deeply studied of quantum computing by research fellows, the computational complexity and time complexity of quantum algorithms gradually increase. The quantum computing simulator provides an effective platform for the development and verification of quantum algorithms. However, the running time and memory overhead during calculation will increase exponentially with the number of qubits. Therefore, the difficulty of high-speed quantum computing on classical computers will gradually increase. At present, a single node has been unable to meet the resource requirements of the algorithm in the quantum computing process, and it is necessary to expand the memory resources in the multi-node computing cluster. Message passing interface has high performance inter-process communication capabilities, which can balance the data transmission between different hosts. Quantum computing tasks can be distributed on several servers to work together to solve the same problem. Therefore, this paper designs an advanced scheme of deploying quantum computing programs on cloud computing platform to support message exchanging between servers using message passing interface to accelerate quantum computing.
Quantum computing is rapidly evolving especially after the discovery of several efficient quantum algorithms solving intractable classical problems such as Shor's factoring algorithm. However the realization of a large-scale physical quantum computer is very challenging and the number of qubits that are currently under development is still very low, namely less than 15. In the absence of large size platforms, quantum computer simulation is critical for developing and testing quantum algorithms and investigating the different challenges facing the design of quantum computer hardware. What makes quantum computer simulation on classical computers particularly challenging are the memory and computational resource requirements. In this paper, we introduce a universal quantum computer simulator, called QX, that takes as input a specially designed quantum assembly language, called QASM, and provides, through agressive optimisations, high simulation speeds and large number of qubits. QX allows the simulation of up to 34 fully entangled qubits on a single node using less than 270 GB of memory. Our experiments using different quantum algorithms show that QX achieves significant simulation speedup over similar state-of-the-art simulation environment.