Parallel Computational Structure of Noisy Quantum Circuits Simulation (original) (raw)

A Software Simulator for Noisy Quantum Circuits

arXiv: Quantum Physics, 2019

We have developed a software library that simulates noisy quantum logic circuits. We represent quantum states by their density matrices, and incorporate possible errors in initialisation, logic gates, memory and measurement using simple models. Our quantum simulator is implemented as a new backend on IBM's open-source Qiskit platform. In this document, we provide its description, and illustrate it with some simple examples.

Simulations of Quantum Circuits with Approximate Noise using qsim and Cirq

arXiv: Quantum Physics, 2021

We introduce multinode quantum trajectory simulations with qsim, an open source high performance simulator of quantum circuits. qsim can be used as a backend of Cirq, a Python software library for writing quantum circuits. We present a novel delayed inner product algorithm for quantum trajectories which can result in an order of magnitude speedup for low noise simulation. We also provide tools to use this framework in Google Cloud Platform, with high performance virtual machines in a single mode or multinode setting. Multinode configurations are well suited to simulate noisy quantum circuits with quantum trajectories. Finally, we introduce an approximate noise model for Google's experimental quantum computing platform and compare the results of noisy simulations with experiments for several quantum algorithms on Google's Quantum Computing Service. Contents

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.

Detailed Account of Complexity for Implementation of Circuit-Based Quantum Algorithms

Frontiers in Physics, 2021

In this review article, we are interested in the detailed analysis of complexity aspects of both time and space that arises from the implementation of a quantum algorithm on a quantum based hardware. In particular, some steps of the implementation, as the preparation of an arbitrary superposition state and readout of the final state, in most of the cases can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of circuit-based quantum algorithms, from state preparation to the number of measurements needed to obtain good statistics from the final states of the quantum system, in order to assess the overall space and time costs of the processes.

Design of an Efficient Quantum Circuit Simulator

… on Electronic System …, 2010

Work is in progress throughout the globe to efficiently use the potential of the quantum theory of computation over their classical counterpart and hence there is a need of building quantum computing hardware. The target of building quantum computers can be achieved if we have better tools for the design of quantum hardware. Quantum circuit simulators are tools for the logic verification of quantum circuits and they can be an essential component of quantum CAD tools in the future. This work is the extension of the previous work by the authors, in order to increase the efficiency of the simulator and to incorporate more components in the gate library. In this paper we have proposed an efficient simulator which can simulate a quantum circuit specified using the proposed quantum hardware descriptive language (QHDL).

A quantum circuit modeling toolkit for high performance computing

2015

Theoretically, quantum computers are known to solve a certain class of problems more efficiently than their classical counterparts. This is due to parallelism which is inherent in quantum algorithms. However, a full-scale quantum computer has not been realised as yet. Therefore, in order to validate and debug quantum circuits, a classical computer is used. Since most of these circuits are simulated using personal computers (PCs), quantum circuits with a limited number of quantum bits (qubits) can only be simulated, due to computational limitations of PCs. In this work, we report the simulation of quantum circuits for a high performance platform using message passing interface for the Python (mpi4py) package.

Efficiently improving the performance of noisy quantum computers

2022

Using near-term quantum computers to achieve a quantum advantage requires efficient strategies to improve the performance of the noisy quantum devices presently available. We develop and experimentally validate two efficient error mitigation protocols named "Noiseless Output Extrapolation" and "Pauli Error Cancellation" that can drastically enhance the performance of quantum circuits composed of noisy cycles of gates. By combining popular mitigation strategies such as probabilistic error cancellation and noise amplification with efficient noise reconstruction methods, our protocols can mitigate a wide range of noise processes that do not satisfy the assumptions underlying existing mitigation protocols, including non-local and gate-dependent processes. We test our protocols on a four-qubit superconducting processor at the Advanced Quantum Testbed. We observe significant improvements in the performance of both structured and random circuits, with up to 8686\%86 impro...

Quantum simulation using noisy unitary circuits and measurements

2021

Many-body quantum systems are notoriously hard to study theoretically due to the exponential growth of their Hilbert space. It is also challenging to probe the quantum correlations in many-body states in experiments due to their sensitivity to external noise. Using synthetic quantum matter to simulate quantum systems has opened new ways of probing quantum many-body systems with unprecedented control, and of engineering phases of matter which are otherwise hard to find in nature. Noisy quantum circuits have become an important cornerstone of our understanding of quantum many-body dynamics. In particular, random circuits act as minimally structured toy models for chaotic nonintegrable quantum systems, faithfully reproducing some of their universal properties. Crucially, in contrast to the full microscopic model, random circuits can be analytically tractable under a reasonable set of assumptions, thereby providing invaluable insights into questions which might be out of reach even for ...

Efficient Quantum Circuit Simulation

I would like to thank many people who were instrumental in helping me finish my Ph.D. My advisors John Hayes and Igor Markov provided me with excellent ideas to pursue, offered endless advice and comments on every publication we worked on together, and pushed me to do a great deal of solid research over the years.

A mathematica program for constructing quantum circuits and computing their unitary matrices

Physics of Particles and Nuclei Letters, 2009

One reason for this is the potential ability of a quantum computer to do certain computational tasks much more efficiently than they can be done by any classical computer Two the most famous examples of such calculations are Shor's algorithm for efficient factorization of large integers and Grover's algorithm of element search in an unsorted list.