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

Lecture notes in computer science

Parallelization of the QC-Lib Quantum Computer Simulator Library

I. Glendinning, Bernhard Ömer

Published Jan 1, 2004• 15 citations
Publisher
DOI
10.1007/978-3-540-24669-5_60

Related papers

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

Parallel Quantum Computer Simulation on the CUDA Architecture

Eladio Gutiérrez, Sergio Romero, Marı́a A. Trenas +1 more

Lecture notes in computer science•Jan 1, 2008•18 citations

Parallelization of the QC-lib Quantum Computer Simulator Library

I. Glendinning, Bernhard Ömer

Abstract. We report 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 QClib, then describe its parallelization using MPI, and present performance measurements made on a Beowulf cluster. Using more processors allowed larger problems to be solved, and reasonable speedups were obtained for the Hadamard transform and Grover’s quantum search algorithm. 1

•Dec 28, 2009•5 citations

Massively parallel quantum computer simulator

Koen De Raedt, Kristel F. L. Michielsen, Hans A. De Raedt +6 more

arXiv:quant-ph/0608239•Computer Physics Communications•Dec 16, 2006•213 citations

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•5 citations

General-Purpose Parallel Simulator for Quantum Computing

J. Niwa, Keiji Matsumoto, Hiroshi Imai

Lecture notes in computer science•Jan 1, 2002•23 citations
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.
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.