arXiv:0902.0699 · Computer Physics Communications

QCMPI: A parallel environment for quantum computing

Frank Tabakin A, Bruno Juliá-Díaz

Published Dec 1, 2008• 27 citations

arXiv HTML PDF

DOI: 10.1016/j.cpc.2008.11.021

Related papers

Parallel Environment for Quantum Computing

Frank Tabakin A, Bruno Julia Diaz

Bulletin of the American Physical SocietyMar 19, 20090 citations

A parallel environment for simulating quantum computation

Geva Patz

This thesis describes the design and implementation of an environment to allow quantum computation to be simulated on classical computers. Although it is believed that quantum computers cannot in general be efficiently simulated classically, it is nevertheless possible to simulate small but interesting systems, on the order of a few tens of quantum bits. Since the state of the art of physical implementations is less than 10 bits, simulation remains a useful tool for understanding the behavior of quantum algorithms. To create a suitable envrionment for simulation, we constructed a 32-node cluster of workstation class computers linked with a high speed (gigabit Ethernet) network. We then wrote an initial simulation environment based on parallel linear algebra libraries with a Matlab front end. These libraries operated on large matrices representing the problem being simulated. The parallel Matlab environment demonstrated a degree of parallel speedup as we added processors, but overall execution times were high, since the amount of data scaled exponentially with the size of the problem. This increased both the number of operations that had to be performed to compute the simulation, and the volume of data that had to be communicated between the nodes as they were computing. The scaling also affected memory utilization, limiting us to a maximum problem size of 14 qubits. In an attempt to increase simulation efficiency, we revisited the design of the simulation environment. Many quantum algorithms have a structure that can be described using the tensor product operator from linear algebra. We believed that a new simulation environment based on this tensor product structure would be substantially more efficient than one based on large matrices. We designed a new simulation envrionment that exploited this tensor product structure. Benchmarks that we performed on the new simulation environment confirmed that it was substantially more efficient, allowing us to perform simulations of the quantum Fourier transform and the discrete approximation to the solution of 3-SAT by adiabatic evolution up to 25 qubits in a reasonable time. Thesis Supervisor: Stephen A. Benton Title: Professor of Media Arts and Sciences

Jan 1, 20036 citations

Parallel quantum programs

Mingsheng Ying

Elsevier eBooksJan 1, 20240 citations

QCSim, Quantum Computation Simulator

Paul E. Black

Dec 1, 20030 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 WorkshopsJan 1, 20040 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, 20260 citations