The Fraunhofer Quantum Computing Portal - www.qc.fraunhofer.de - A web-based Simulator of Quantum Computing Processes (original) (raw)

The Fraunhofer quantum computing simulator

Frontiers in Artificial Intelligence and Applications

Fraunhofer FIRST develops a computing service and collaborative workspace providing a convenient tool for simulation and investigation of quantum algorithms. To broaden the twenty qubit limit of workstation-based simulations to the next qubit decade we provide a dedicated high memorized Linux cluster with fast Myrinet interconnection network together with a adapted parallel simulator engine. This simulation service supplemented by a collaborative workspace is usable everywhere via web interface and integrates both hardware and software as collaboration and investigation platform for the quantum community. The modular design of our simulator engine enables the application of various implementations and simulation techniques and is open for extensions motivated by the experience of the users. The beta test version realizes all common one, two and three qubit gates, arbitrary one and two bit gates, orthogonal measurements as well as special gates like Oracle, Modulo function and Quantum Fourier Transformation. The main focus of our project is the simulation of experimentally realizations of quantum algorithms which will make it feasible to understand the differences between real and ideal quantum devices and open the view for new algorithms and applications. That's why the simulator also can work with arbitrary Hamiltonians yielding its unitary transformation, spectrum and eigenvectors. To realize the various simulation tasks we integrate various implementations. The test version is able to simulate small quantum circuits and Hamiltonians exactly, the latter through the use of a standard diagonalization procedure. Circuits up to thirty qubits can be simulated exactly as well; Hamiltonians of that size, however, have to be approximated according to the Trotter formulae. For a restricted gate set we also develop a tensor-sum implementation, which makes it feasible to investigate circuits with up to sixty qubits.

Towards a Novel Environment for Simulation of Quantum Computing

Computer Science, 2015

In this paper, we analyze existing quantum computer simulation techniques and their realizations to minimize the impact of the exponential complexity of simulated quantum computations. As a result of this investigation, we propose a quantum computer simulator with an integrated development environment-QuIDE-supporting the development of algorithms for future quantum computers. The simulator simplifies building and testing quantum circuits and understanding quantum algorithms in an efficient way. The development environment provides flexibility of source code edition and ease of the graphical building of circuit diagrams. We also describe and analyze the complexity of algorithms used for simulation as well as present performance results of the simulator as well as results of its deployment during university classes.

Massive Parallel Quantum Computer Simulator

2006

We describe portable software to simulate universal quantum computers on massive parallel computers. We illustrate the use of the simulation software by running various quantum algorithms on different computer architectures, such as a IBM BlueGene/L, a IBM Regatta p690+, a Hitachi SR11000/J1, a Cray X1E, a SGI Altix 3700 and clusters of PCs running Windows XP. We study the performance of the software by simulating quantum computers containing up to 36 qubits, using up to 4096 processors and up to 1 TB of memory. Our results demonstrate that the simulator exhibits nearly ideal scaling as a function of the number of processors and suggest that the simulation software described in this paper may also serve as benchmark for testing high-end parallel computers

Massively parallel quantum computer simulator

Computer Physics Communications, 2007

We describe portable software to simulate universal quantum computers on massive parallel computers. We illustrate the use of the simulation software by running various quantum algorithms on different computer architectures, such as a IBM BlueGene/L, a IBM Regatta p690+, a Hitachi SR11000/J1, a Cray X1E, a SGI Altix 3700 and clusters of PCs running Windows XP. We study the performance of the software by simulating quantum computers containing up to 36 qubits, using up to 4096 processors and up to 1 TB of memory. Our results demonstrate that the simulator exhibits nearly ideal scaling as a function of the number of processors and suggest that the simulation software described in this paper may also serve as benchmark for testing high-end parallel computers.

Psitrum: An Open Source Simulator for Universal Quantum Computers

2022

Quantum computing is a radical new paradigm for a technology that is capable to revolutionize information processing. Simulators of universal quantum computer are important for understanding the basic principles and operations of the current noisy intermediate-scale quantum (NISQ) processors, and for building in future fault-tolerant quantum computers. In this work, we present simulation of universal quantum computers by introducing Psitrum – a universal gate-model quantum computer simulator implemented on classical hardware. The simulator allows to emulate and debug quantum algorithms in form of quantum circuits for many applications with the choice of adding variety of noise modules to simulate decoherence in quantum circuits. Psitrum allows to simulate all basic quantum operations and provides variety of visualization tools. The simulator allows to trace out all possible quantum states at each stage M of an N-qubit implemented quantum circuit. Psitrum software and source codes ar...

QDENSITY—A Mathematica Quantum Computer simulation

Computer Physics Communications, 2006

This Mathematica 5.2 package 1 is a simulation of a Quantum Computer. The program provides a modular, instructive approach for generating the basic elements that make up a quantum circuit. The main emphasis is on using the density matrix, although an approach using state vectors is also implemented in the package. The package commands are defined in Qdensity.m which contains the tools needed in quantum circuits, e.g. multiqubit kets, projectors, gates, etc. Selected examples of the basic commands are presented here and a tutorial notebook, Tutorial.nb is provided with the package (available on our website) that serves as a full guide to the package. Finally, application is made to a variety of relevant cases, including Teleportation, Quantum Fourier transform, Grover's search and Shor's algorithm, in separate notebooks: QFT.nb, Teleportation.nb, Grover.nb and Shor.nb where each algorithm is explained in detail. Finally, two examples of the construction and manipulation of cluster states, which are part of "one way computing" ideas, are included as an additional tool in the notebook Cluster.nb. A Mathematica palette containing most commands in QDENSITY is also included: QDENSpalette.nb .

QCWAVE – A Mathematica quantum computer simulation update

Computer Physics Communications, 2011

This Mathematica 7.0/8.0 package upgrades and extends the quantum computer simulation code called QDENSITY. Use of the density matrix was emphasized in QDENSITY, although that code was also applicable to a quantum state description. In the present version, the quantum state version is stressed and made amenable to future extensions to parallel computer simulations. The add-on QCWAVE extends QDENSITY in several ways. The first way is to describe the action of one, two and three-qubit quantum gates as a set of small (2 × 2, 4 × 4 or 8 × 8) matrices acting on the 2 nq amplitudes for a system of n q qubits. This procedure was described in our parallel computer simulation QCMPI and is reviewed here. The advantage is that smaller storage demands are made, without loss of speed, and that the procedure can take advantage of message passing interface (MPI) techniques, which will hopefully be generally available in future Mathematica versions.

A Mathematica Package for Simulation of Quantum Computation

Lecture Notes in Computer Science, 2009

In this paper we briefly describe a Mathematica package for simulation of quantum circuits and illustrate some of its features by simple examples. Unlike other Mathematica-based quantum simulators, our program provides a user-friendly graphical interface for generating quantum circuits and computing the circuit unitary matrices. It can be used for designing and testing different quantum algorithms. As an example we consider a quantum circuit implementing Grover's search algorithm and show that it gives a quadratic speed-up in solving the search problem.

General-purpose parallel simulator for quantum computing

Physical Review A, 2002

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, the simulation methods using parallel processing are required.

Parallel Environment for Quantum Computing

is a quantum computer simulation package written in Fortran 90 code with parallel processing capabilities. It is an accessible research tool that permits rapid evaluation of quantum algorithms for a large number(∼ 30) of qubits. The prime motivation for developing such is to facilitate numerical examination of not only how QC algorithms work, but to include decoherence and attenuation effects and to evaluate the efficacy of error correction schemes. The present work builds on an earlier Mathematica code , which is mainly a pedagogic tool. In that earlier work, although the density matrix formulation was featured, the description using state vectors was also provided. In , the stress is on state vectors, in order to employ a large numbers of qubits. The parallel processing feature is implemented by using the Message-Passing Interface (MPI) protocol. A description of how to spread the wave function components over many processors is provided, along with how to efficiently describe the action of general one-two-and three-qubit operators on these state vectors. These operators include the standard Pauli operators, the Hadamard and also the CNOT, CPHASE, Toffoli, etc., operators which make up the actions needed in QC. Codes for Teleportation, Grover's search, and Shor's algorithms are delineated. In addition, a superdense coding example is examined. Procedures for handling quantum dynamics using Hamiltonians and for simulating environmental effects are also discussed to illustrate the potential applications of this powerful tool. Comparisions to earlier work of a similar type are also provided. .