Himanshu Chaudhary, Biplab Mahato, Lakshya Priyadarshi, Naman Roshan, Utkarsh, Apoorva D. Patel
备注：
10 pages, 6 figures. Feel free to use this open source software library, but acknowledge our work if you do so. (v2) Clarifications added. Version to be published in the International Journal of Modern Physics C (World Scientific)
We have developed a software library that simulates noisy quantum logic circuits. We represent quantum states by their density matrices in the Pauli basis, 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.
myqcs is a quantum circuit simulator using tensor. The simulator can be used with both wave functions or density matrices. The simulator also included noise that can be varied in form and that can be different for each gate.
We suggest and demonstrate an all-optical quantum simulator for single-qubit noisy channels originating from the interaction with a fluctuating field. The simulator employs the polarization degree of freedom of a single photon, and exploits its spectral components to average over the realizations of the stochastic dynamics. As a proof of principle, we run simulations of dephasing channels driven either by Gaussian (Ornstein-Uhlenbeck) or non-Gaussian (random telegraph) stochastic processes.
In this paper, we will introduce the quantum circuit simulator we developed in C++ environment. We devise a novel method for efficient memory handling using linked list structures that enables us to simulate a quantum circuit of up to 20 qubits in a reasonable time. Our package can simulate the activity of any quantum circuit constructed by the user; it will also be used to understand the robustness of certain quantum algorithms such as Simons and Shors.
We introduce an error mitigation framework that mitigates errors in a quantum circuit using circuit cutting. Our framework can be implemented in polynomial time for a wide variety of quantum circuits. Our technique involves cutting the circuit in such a way that we run the circuit that needs to be executed on the quantum hardware whereas the error mitigation circuit is run on a simulator. We perform error mitigation qubit by qubit and then provide a way to combine the different probabilities from each of the individual qubit error mitigation runs such that the full circuit is error mitigated. …
Classical simulation of quantum computation is vital for verifying quantum devices and assessing quantum algorithms. We present a new quantum circuit simulator developed on the Sunway TaihuLight supercomputer. Compared with other simulators, the present one is distinguished in two aspects. First, our simulator is more versatile. The simulator consists of three mutually independent parts to compute the full, partial and single amplitudes of a quantum state with different methods. It has the function of emulating the effect of noise and support more kinds of quantum operations. Second, our simul…
This paper presents ``Stim", a fast simulator for quantum stabilizer circuits. The paper explains how Stim works and compares it to existing tools. With no foreknowledge, Stim can analyze a distance 100 surface code circuit (20 thousand qubits, 8 million gates, 1 million measurements) in 15 seconds and then begin sampling full circuit shots at a rate of 1 kHz. Stim uses a stabilizer tableau representation, similar to Aaronson and Gottesman's CHP simulator, but with three main improvements. First, Stim improves the asymptotic complexity of deterministic measurement from quadratic to linear by t…
Diners dilemma is one of the most interesting problems in both economic and game theories. Here, we solve this problem for n (number of players) =4 with quantum rules and we are able to remove the dilemma of diners between the Pareto optimal and Nash equilibrium points of the game. We find the quantum strategy that gives maximum payoff for each diner without affecting the payoff and strategy of others. We use the quantum principles of superposition and entanglement that gives supremacy over any classical strategies. We present the circuit implementation for the game, design it on the IBM quant…
In this work, we present a new large-scale quantum circuit simulator. It is based on the tensor network contraction technique to represent quantum circuits. We propose a novel parallelization algorithm based on \stepslice . In this paper, we push the requirement on the size of a quantum computer that will be needed to demonstrate the advantage of quantum computation with Quantum Approximate Optimization Algorithm (QAOA). We computed 210 qubit QAOA circuits with 1,785 gates on 1,024 nodes of the the Cray XC 40 supercomputer Theta. To the best of our knowledge, this constitutes the largest QAOA …
Pilot-Wave Simulator: Exact Classical Sampling from Ideal and Noisy Quantum Circuits up to Hundreds of Qubits
Lomonosov Moscow State University（莫斯科国立大学）；University of Science and Technology of China（中国科学技术大学）；Peking University（北京大学）；Southern University of Science and Technology（南方科技大学）
University of Chicago（芝加哥大学）；Center for Theoretical Physics, Polish Academy of Sciences（波兰科学院理论物理中心）；University of Michigan（密歇根大学）；IBM Quantum, IBM T.J. Watson Research Center（IBM量子，IBM托马斯·J·沃森研究中心）
MPStab: an hybrid stabilizers tensor-network quantum circuit simulator
University of Trieste（的里雅斯特大学）；Istituto Nazionale di Fisica Nucleare, Trieste Section（意大利国家核物理研究所的里雅斯特分部）；University of Helsinki（赫尔辛基大学）；European Organization for Nuclear Research (CERN)（欧洲核子研究组织（日内瓦））；Chalmers University of Technology（查尔姆斯理工大学）
With the rapid progress made by industry and academia, quantum computers with dozens of qubits or even larger size are being realized. However, the fidelity of existing quantum computers often sharply decreases as the circuit depth increases. Thus, an ideal quantum circuit simulator on classical computers, especially on high-performance computers, is needed for benchmarking and validation. We design a large-scale simulator of universal random quantum circuits, often called 'quantum supremacy circuits', and implement it on Sunway TaihuLight. The simulator can be used to accomplish the following…
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 for…
Quantum computers are expected to help us to achieve accurate simulation of the dynamics of many-body quantum systems. However, the limitations of current NISQ devices prevents us from realising this goal today. Recently an algorithm for performing quantum simulations called quantum assisted simulator has been proposed that promises realization on current experimental devices. In this work, we extend the quantum assisted simulator to simulate the dynamics of a class of time-dependent Hamiltonians. We show that the quantum assisted simulator is easier to implement as well as can realize multi-q…
Here we present qFlex, a flexible tensor network based quantum circuit simulator. qFlex can compute both exact amplitudes, essential for the verification of the quantum hardware, as well as low fidelity amplitudes, in order to mimic sampling from Noisy Intermediate-Scale Quantum (NISQ) devices. In this work, we focus on random quantum circuits (RQCs) in the range of sizes expected for supremacy experiments. Fidelity $f$ simulations are performed at a cost that is $1/f$ lower than perfect fidelity ones. We also present a technique to eliminate the overhead introduced by rejection sampling in mo…
To explore the possibilities of a near-term intermediate-scale quantum algorithm and long-term fault-tolerant quantum computing, a fast and versatile quantum circuit simulator is needed. Here, we introduce Qulacs, a fast simulator for quantum circuits intended for research purpose. We show the main concepts of Qulacs, explain how to use its features via examples, describe numerical techniques to speed-up simulation, and demonstrate its performance with numerical benchmarks.
Noise in quantum systems is a major obstacle to implementing many quantum algorithms on large quantum circuits. In this work, we study the effects of noise on the Rademacher complexity of quantum circuits, which is a measure of statistical complexity that quantifies the richness of classes of functions generated by these circuits. We consider noise models that are represented by convex combinations of unitary channels and provide both upper and lower bounds for the Rademacher complexities of quantum circuits characterized by these noise models. In particular, we find a lower bound for the Rade…
We provide and experimentally demonstrate an accreditation protocol that upper-bounds the variation distance between noisy and noiseless probability distributions of the outputs of arbitrary quantum computations. We accredit the outputs of twenty-four quantum circuits executed on programmable superconducting hardware, ranging from depth nine circuits on ten qubits to depth twenty-one circuits on four qubits. Our protocol requires implementing the "target" quantum circuit along with a number of random Clifford circuits and subsequently post-processing the outputs of these Clifford circuits. Imp…
This work studies the porting and optimization of the tensor network simulator QTensor on GPUs, with the ultimate goal of simulating quantum circuits efficiently at scale on large GPU supercomputers. We implement NumPy, PyTorch, and CuPy backends and benchmark the codes to find the optimal allocation of tensor simulations to either a CPU or a GPU. We also present a dynamic mixed backend to achieve optimal performance. To demonstrate the performance, we simulate QAOA circuits for computing the MaxCut energy expectation. Our method achieves $176\times$ speedup on a GPU over the NumPy baseline on…
Engineering and harnessing coherent excitonic transport in organic nanostructures has recently been suggested as a promising way towards improving man-made light harvesting materials. However, realising and testing the dissipative system-environment models underlying these proposals is presently very challenging in supramolecular materials. A promising alternative is to use simpler and highly tunable quantum simulators built from programmable qubits, as recently achieved in a superconducting circuit by Potocnik et al. In this article, we simulate the real-time dynamics of an exciton coupled to…
Analog Circuit-QED Simulator of Quantum Spin Dynamics Through the Extended Bose-Hubbard Model
Russian Quantum Center（俄罗斯量子中心）；Moscow Institute of Physics and Technology（莫斯科物理技术学院）；SKKU Advanced Institute of Nanotechnology (SAINT), Sungkyunkwan University（成均馆大学 SKKU 纳米技术高级研究所 (SAINT)）；Institute of Fundamental Physics IFF-CSIC（西班牙国家研究委员会基础物理研究所 (IFF-CSIC)）；National University of Science and Technology “MISIS”（国立科技大学 MISIS）；Lebedev Physical Institute, Russian Academy of Sciences（俄罗斯科学院列别捷夫物理研究所）；Department of Chemistry, Yonsei University（延世大学化学系）；Department of Quantum Information, Yonsei University（延世大学量子信息系）
The ability of a quantum computer to reproduce or replicate the results of a quantum circuit is a key concern for verifying and validating applications of quantum computing. Statistical variations in circuit outcomes that arise from ill-characterized fluctuations in device noise may lead to computational errors and irreproducible results. While device characterization offers a direct assessment of noise, an outstanding concern is how such metrics bound the reproducibility of a given quantum circuit. Here, we first directly assess the reproducibility of a noisy quantum circuit, in terms of the …
Effective methods for characterizing the noise in quantum computing devices are essential for programming and debugging circuit performance. Existing approaches vary in the information obtained as well as the amount of quantum and classical resources required, with more information generally requiring more resources. Here we benchmark the characterization methods of gate set tomography, Pauli channel noise reconstruction, and empirical direct characterization for developing models that describe noisy quantum circuit performance on a 27-qubit superconducting transmon device. We evaluate these m…
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. We have developed a general-purpose simulator for quantum computing on the parallel computer (Sun, Enterprise4500). It can deal with up-to 30 qubits. We have performed Shor's factoriz…
Analog quantum simulators can be used to study quantum correlation in novel many-body systems by emulating the Hamiltonian of these systems. One essential question in quantum simulation is to probe the properties of an emulated many-body system. Here we present a circuit QED scheme for probing such properties by measuring the spectrum of a superconducting resonator coupled to a quantum simulator. We first study a general framework of this approach, and show that the spectrum of the resonator is directly related to the correlation function of the coupling operator between the resonator and the …
The opportunities afforded by near-term quantum computers to calculate the ground-state properties of small molecules depend on the structure of the computational ansatz as well as the errors induced by device noise. Here we investigate the behavior of these noisy quantum circuits using numerical simulations to estimate the accuracy and fidelity of the prepared quantum states relative to the ground truth obtained by conventional means. We implement several different types of ansatz circuits derived from unitary coupled cluster theory for the purposes of estimating the ground-state energy of So…
In this work, we present an efficient rank-compression approach for the classical simulation of Kraus decoherence channels in noisy quantum circuits. The approximation is achieved through iterative compression of the density matrix based on its leading eigenbasis during each simulation step without the need to store, manipulate, or diagonalize the full matrix. We implement this algorithm in an in-house simulator, and show that the low rank algorithm speeds up simulations by more than two orders of magnitude over an existing implementation of full rank simulator, and with negligible error in th…
Parallel classical simulation of noisy shallow circuits: no quantum advantage in 1D
Technical University of Munich（慕尼黑工业大学）；Munich Center for Quantum Science and Technology（慕尼黑量子科学与技术中心）；National University of Singapore（新加坡国立大学）；Centre for Quantum Technologies（量子技术中心）
Limitations of Noisy Geometrically Local Quantum Circuits
University of Maryland（马里兰大学）；Joint Center for Quantum Information & Computer Science, University of Maryland and NIST（马里兰大学与美国国家标准与技术研究院联合量子信息与计算中心）；IBM T. J. Watson Research Center（IBM托马斯·J·沃森研究中心）
By using quantum mechanical effects, quantum computers promise significant speedups in solving problems intractable for conventional computers. However, despite recent progress they remain limited in scaling and availability-making quantum software and hardware development heavily reliant on quantum simulators running on conventional hardware. However, most of those simulators mimic perfect quantum computers and, hence, ignore the fragile nature of quantum mechanical effects which frequently yield to decoherence errors in real quantum devices. Considering those errors during the simulation is …
Noisy intermediate-scale quantum (NISQ) devices offer unique platforms to test and evaluate the behavior of non-fault-tolerant quantum computing. However, validating programs on NISQ devices is difficult due to fluctuations in the underlying noise sources and other non-reproducible behaviors that generate computational errors. Efficient and effective methods for modeling NISQ behaviors are necessary to debug these devices and develop programming techniques that mitigate against errors. We present a test-driven approach to characterizing NISQ programs that manages the complexity of noisy circui…
The exploration of hybrid quantum-classical algorithms and programming models on noisy near-term quantum hardware has begun. As hybrid programs scale towards classical intractability, validation and benchmarking are critical to understanding the utility of the hybrid computational model. In this paper, we demonstrate a newly developed quantum circuit simulator based on tensor network theory that enables intermediate-scale verification and validation of hybrid quantum-classical computing frameworks and programming models. We present our tensor-network quantum virtual machine (TNQVM) simulator w…
