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

General-Purpose Parallel Simulator for Quantum Computing

J. Niwa, Keiji Matsumoto, Hiroshi Imai

Published Jan 1, 2002• 23 citations
Publisher
DOI
10.1007/3-540-45833-6_20

Related papers

General-purpose parallel simulator for quantum computing

J. Niwa, Keiji Matsumoto, Hiroshi Imai

With current technologies, it seems to be very difficult to implement quantum computers with many qubits. It is therefore of importance to simulate quantum algorithms and circuits on the existing computers. However, for a large-size problem, the simulation often requires more computational power than is available from sequential processing. Therefore, simulation methods for parallel processors are required. We have developed a general-purpose simulator for quantum algorithms/circuits on the parallel computer (Sun Enterprise4500). It can simulate algorithms/circuits with up to 30 qubits. In order to test efficiency of our proposed methods, we have simulated Shor's factorization algorithm and Grover's database search, and we have analyzed robustness of the corresponding quantum circuits in the presence of both decoherence and operational errors. The corresponding results, statistics, and analyses are presented in this paper.

arXiv:quant-ph/0201042•Physical Review A•Dec 30, 2002•46 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 Environment for Quantum Computing

Frank Tabakin A, Bruno Julia Diaz

Bulletin of the American Physical Society•Mar 19, 2009•0 citations

General-Purpose Quantum Computing

Cheng Hsiao Wu

Quantum parallel computing for the addition operation is the starting point for general-purpose computing. A 16 nonlocal operator–state relations are presented to show how parallel computing is achieved.

CRC Press eBooks•Nov 21, 2025•0 citations

An Approach for Quantum Computing using Adiabatic Evolution Algorithm

Shigeo Sato, Mitsunaga Kinjo, Koji Nakajima

A quantum computer employing a single quantum as a qubit executes real parallel computation and has various applications. Several algorithms have been proposed for quantum computation. However, these algorithms are applicable only to a limited number of applications. Therefore, a general purpose algorithm should be studied and developed for practical use in the near future. In this paper, we focus on the adiabatic evolution algorithm for general purpose quantum computation and discuss how to use this algorithm for solving an optimization problem. We show a new algorithm incorporating an artificial neural network (ANN)-like method in order to compose another Hamiltonian. The new algorithm is helpful for reducing computation cost and is easy to implement. Successful simulation results are shown.

Japanese Journal of Applied Physics•Nov 10, 2003•16 citations

Software for Massively Parallel Quantum Computing

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

arXiv:2211.13355•Springer eBooks•Aug 7, 2023•6 citations
With current technologies, it seems to be very difficult to implement quantum computers with many qubits. It is therefore of importance to simulate quantum algorithms and circuits on the existing computers. However, for a large-size problem, the simulation often requires more computational power than is available from sequential processing. Therefore, simulation methods for parallel processors are required. We have developed a general-purpose simulator for quantum algorithms/circuits on the parallel computer (Sun Enterprise4500). It can simulate algorithms/circuits with up to 30 qubits. In order to test efficiency of our proposed methods, we have simulated Shor's factorization algorithm and Grover's database search, and we have analyzed robustness of the corresponding quantum circuits in the presence of both decoherence and operational errors. The corresponding results, statistics, and analyses are presented in this paper.
A quantum computer employing a single quantum as a qubit executes real parallel computation and has various applications. Several algorithms have been proposed for quantum computation. However, these algorithms are applicable only to a limited number of applications. Therefore, a general purpose algorithm should be studied and developed for practical use in the near future. In this paper, we focus on the adiabatic evolution algorithm for general purpose quantum computation and discuss how to use this algorithm for solving an optimization problem. We show a new algorithm incorporating an artificial neural network (ANN)-like method in order to compose another Hamiltonian. The new algorithm is helpful for reducing computation cost and is easy to implement. Successful simulation results are shown.