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

Bulletin of the American Physical Society

Parallel Environment for Quantum Computing

Frank Tabakin A, Bruno Julia Diaz

Published Mar 19, 2009• 0 citations
OpenAlex

Related papers

Quantum Computing Environments

Springer eBooks•Jan 1, 2022•19 citations

QCMPI: A parallel environment for quantum computing

Frank Tabakin A, Bruno Juliá-Díaz

arXiv:0902.0699•Computer Physics Communications•Dec 1, 2008•27 citations

Software for Massively Parallel Quantum Computing

Thien Nguyen, Daanish Arya, Marcus W. Doherty +5 more

arXiv:2211.13355•Springer eBooks•Aug 7, 2023•9 citations

Quantum Computers and Their Simulation.

Thomas Lippert

Quantum computing is based on the exploitation of quantum effects to perform some important computations more efficiently than ever possible on classical computers. Well known quantum algorithms are Shors polynomial time factoring algorithm and Grovers data base search scheme. Their potential is due to the parallelism of a quantum computation increasing exponentially with the size of the computing device. IBM has succeeded in building a first working quantum computing device with up to 7 qubits based on NMR technology, however, the construction of large multi-qubit systems appears to become extremely difficult due to the loss of coherence of the quantum states. Like the design process of modern microprocessors which is carried out by means of sophisticated software, modelling and simulation of the entire QC device is even more relevant. Simulation is required in order to understand the functioning of quantum algorithms, to construct novel quantum algorithms, to write quantum programs, to teach quantum computing, to construct real quantum computers, to understand and fight de-coherence and to understand and control the influence of the environment. Since quantum parallelism increases exponentially with the size of the quantum computer, parallel supercomputers are required for realistic simulations. I intend to give an introduction into the simulation of quantum computers using conventional computers. The simulation is based on a generic physical model of quantum computer hardware. Issues like parallel gate level simulators, modelling of QCs, simulators for physical quantum computers are addressed.

ARCS Workshops•Jan 1, 2004•0 citations

General-Purpose Parallel Simulator for Quantum Computing

J. Niwa, Keiji Matsumoto, Hiroshi Imai

Lecture notes in computer science•Jan 1, 2002•24 citations

Adaptive Quantum Algorithm Parallel Expansion Strategy

Jincheng Zhang

This paper introduces an adaptive quantum algorithm parallel expansion strategy designed to optimize computational performance in quantum computing environments. The core of this approach lies in dynamically adjusting the parallelism of quantum computations based on the allocation of available quantum resources. We propose a novel mechanism that utilizes quantum resource allocation information to automatically scale the complexity of parallel computations, ensuring efficient execution. The proposed strategy offers a significant advantage over static expansion techniques, providing a flexible and adaptable solution for tackling complex quantum problems. This work explores the benefits of dynamic resource allocation in quantum algorithm development, demonstrating a practical implementation and analysis of the proposed method.

•Sep 3, 2026•0 citations
Quantum computing is based on the exploitation of quantum effects to perform some important computations more efficiently than ever possible on classical computers. Well known quantum algorithms are Shors polynomial time factoring algorithm and Grovers data base search scheme. Their potential is due to the parallelism of a quantum computation increasing exponentially with the size of the computing device. IBM has succeeded in building a first working quantum computing device with up to 7 qubits based on NMR technology, however, the construction of large multi-qubit systems appears to become extremely difficult due to the loss of coherence of the quantum states. Like the design process of modern microprocessors which is carried out by means of sophisticated software, modelling and simulation of the entire QC device is even more relevant. Simulation is required in order to understand the functioning of quantum algorithms, to construct novel quantum algorithms, to write quantum programs, to teach quantum computing, to construct real quantum computers, to understand and fight de-coherence and to understand and control the influence of the environment. Since quantum parallelism increases exponentially with the size of the quantum computer, parallel supercomputers are required for realistic simulations. I intend to give an introduction into the simulation of quantum computers using conventional computers. The simulation is based on a generic physical model of quantum computer hardware. Issues like parallel gate level simulators, modelling of QCs, simulators for physical quantum computers are addressed.
This paper introduces an adaptive quantum algorithm parallel expansion strategy designed to optimize computational performance in quantum computing environments. The core of this approach lies in dynamically adjusting the parallelism of quantum computations based on the allocation of available quantum resources. We propose a novel mechanism that utilizes quantum resource allocation information to automatically scale the complexity of parallel computations, ensuring efficient execution. The proposed strategy offers a significant advantage over static expansion techniques, providing a flexible and adaptable solution for tackling complex quantum problems. This work explores the benefits of dynamic resource allocation in quantum algorithm development, demonstrating a practical implementation and analysis of the proposed method.