Simulating quantum circuits with classical computers requires resources growing exponentially in terms of system size. Real quantum computer with noise, however, may be simulated polynomially with various methods considering different noise models. In this work, we simulate random quantum circuits in 1D with Matrix Product Density Operators (MPDO), for different noise models such as dephasing, depolarizing, and amplitude damping. We show that the method based on Matrix Product States (MPS) fails to approximate the noisy output quantum states for any of the noise models considered, while the MPDO method approximates them well. Compared with the method of Matrix Product Operators (MPO), the MPDO method reflects a clear physical picture of noise (with inner indices taking care of the noise simulation) and quantum entanglement (with bond indices taking care of two-qubit gate simulation). Consequently, in case of weak system noise, the resource cost of MPDO will be significantly less than that of the MPO due to a relatively small inner dimension needed for the simulation. In case of strong system noise, a relatively small bond dimension may be sufficient to simulate the noisy circuits, indicating a regime that the noise is large enough for an `easy' classical simulation. Moreover, we propose a more effective tensor updates scheme with optimal truncations for both the inner and the bond dimensions, performed after each layer of the circuit, which enjoys a canonical form of the MPDO for improving simulation accuracy. With truncated inner dimension to a maximum value $κ$ and bond dimension to a maximum value $χ$, the cost of our simulation scales as $\sim NDκ^3χ^3$, for an $N$-qubit circuit with depth $D$.
Recently, constant-depth quantum circuits are proved more powerful than their classical counterparts at solving certain problems, e.g., the two-dimensional (2D) hidden linear function (HLF) problem regarding a symmetric binary matrix. To further investigate the boundary between classical and quantum computing models, in this work we propose a high-performance two-stage classical scheme to solve a full-sampling variant of the 2D HLF problem, which combines traditional classical parallel algorithms and a gate-based classical circuit model together for exactly simulating the target shallow quantu…
We theoretically investigate the simulation of moving cavities in a superconducting circuit setup. In particular, we consider a recently proposed experimental scenario where the phase of the cavity field is used as a moving clock. By computing the error made when simulating the cavity trajectory with SQUIDs, we identify parameter regimes where the correspondence holds, and where time dilation, as well as corrections due to clock size and particle creation coefficients, are observable. These findings may serve as a guideline when performing experiments on simulation of moving cavities in superc…
We generalize solid-state tight-binding techniques for the spectral analysis of large superconducting circuits. We find that tight-binding states can be better suited for approximating the low-energy excitations than charge-basis states, as illustrated for the interesting example of the current-mirror circuit. The use of tight binding can dramatically lower the Hilbert space dimension required for convergence to the true spectrum, and allows for the accurate simulation of larger circuits that are out of reach of charge basis diagonalization.
Verification of NISQ era quantum devices demands fast classical simulation of large noisy quantum circuits. We present an algorithm based on the stabilizer formalism that can efficiently simulate noisy stabilizer circuits. Additionally, the protocol can efficiently simulate a large set of multi-qubit mixed states that are not mixtures of stabilizer states. The existence of these 'bound states' was previously only known for odd-dimensional systems like qutrits. The algorithm also has the favorable property that circuits with depolarizing noise are simulated much faster than unitary circuits. Th…
We propose a general tensor network method for simulating quantum circuits. The method is massively more efficient in computing a large number of correlated bitstring amplitudes and probabilities than existing methods. As an application, we study the sampling problem of Google's Sycamore circuits, which are believed to be beyond the reach of classical supercomputers and have been used to demonstrate quantum supremacy. Using our method, employing a small computational cluster containing 60 graphical processing units (GPUs), we have generated one million correlated bitstrings with some entries f…
Superconducting quantum circuits is one of the leading candidates for a universal quantum computer. Designing novel qubit and multiqubit superconducting circuits requires the ability to simulate and analyze the properties of a general circuit. In particular, going outside the transmon approach, we cannot make assumptions on anharmonicity, thus precluding blackbox quantization approaches and necessitating the formal circuit quantization approach. We consider and solve two issues involved in simulating general superconducting circuits. One of the issues is the handling of free modes in the circu…
We study the effect of noise on the classical simulatability of quantum circuits defined by computationally tractable (CT) states and efficiently computable sparse (ECS) operations. Examples of such circuits, which we call CT-ECS circuits, are IQP, Clifford Magic, and conjugated Clifford circuits. This means that there exist various CT-ECS circuits such that their output probability distributions are anti-concentrated and not classically simulatable in the noise-free setting (under plausible assumptions). First, we consider a noise model where a depolarizing channel with an arbitrarily small c…
In a recent milestone experiment, Google's processor Sycamore heralded the era of "quantum supremacy" by sampling from the output of (pseudo-)random circuits. We show that such random circuits provide tailor-made building blocks for simulating quantum many-body systems on noisy intermediate-scale quantum (NISQ) devices. Specifically, we propose an algorithm consisting of a random circuit followed by a trotterized Hamiltonian time evolution to study hydrodynamics and to extract transport coefficients in the linear response regime. We numerically demonstrate the algorithm by simulating the build…
Linear canonical transformations of bosonic modes correspond to Gaussian unitaries, which comprise passive linear-optical transformations as effected by a multiport passive interferometer and active Bogoliubov transformations as effected by a nonlinear amplification medium. As a consequence of the Bloch-Messiah theorem, any Gaussian unitary can be decomposed into a passive interferometer followed by a layer of single-mode squeezers and another passive interferometer. Here, it is shown how to circumvent the need for active transformations. Namely, we provide a technique to simulate sampling fro…
Simulating quantum circuits with a neural statebank
Materials Research Laboratory, Massachusetts Institute of Technology（麻省理工学院材料研究实验室）；Department of Physics, Harvard University（哈佛大学物理系）；Department of Physics, Massachusetts Institute of Technology（麻省理工学院物理系）
Studying out-of-equilibrium physics in quantum systems under quantum quench is of vast experimental and theoretical interests. Using periodic quantum quenches, we present an experimentally accessible scheme to simulate the quantum Zeno and anti-Zeno effects in an open quantum system of a single superconducting qubit interacting with an array of transmission line resonators. The scheme is based on the following two observations: Firstly, compared with conventional systems, the short-time non-exponential decay in our superconducting circuit system is readily observed; and secondly, a quench-off …
Variational quantum eigensolver (VQE) is promising to show quantum advantage on near-term noisy-intermediate-scale quantum (NISQ) computers. One central problem of VQE is the effect of noise, especially the physical noise on realistic quantum computers. We study systematically the effect of noise for the VQE algorithm, by performing numerical simulations with various local noise models, including the amplitude damping, dephasing, and depolarizing noise. We show that the ground state energy will deviate from the exact value as the noise probability increase and normally noise will accumulate as…
We propose a scheme for simulating 3+1, 2+1, 1+1 Dirac equation for a free spin-1/2 particle with superconducting josephson circuits consisting of five qubits, four qubits, two qubits respectively. In 3+1D and 2+1D, the flux qubit1 driven by a resonant pulse is in the superposition state of its own two eigenstatesis, and it is used as a bus to induce the (blue)red-sideband excitation consisting of a magnetic pulse acting resonantly on two levels of the flux qubit2 and the energy levels of one phase qubit, which yields two (Anti)Jaynes-Cummings interactions with one driving pulse and reduces th…
We introduce an enhanced technique for strong classical simulation of quantum circuits which combines the `sum-of-stabilisers' method with an automated simplification strategy based on the ZX-calculus. Recently it was shown that quantum circuits can be classically simulated by expressing the non-stabiliser gates in a circuit as magic state injections and decomposing them in chunks of 2-6 states at a time, obtaining sums of (efficiently-simulable) stabiliser states with many fewer terms than the naive approach. We adapt these techniques from the original setting of Clifford circuits with magic …
Simulation of materials by using quantum processors is envisioned to be a major direction of development in quantum information science. Here we exploit the mathematical analogies between a triangular spin lattice with Dzyaloshinskii-Moriya coupling on one edge and a three-level system driven by three fields in a loop configuation to emulate spin-transport effects. We show that the spin transport efficiency, seen in the three-level system as population transfer, is enhanced when the conditions for superadiabaticity are satisfied. We demonstrate experimentally that phenomena characteristic to s…
We optimise a translationally invariant, sequential quantum circuit on a superconducting quantum device to simulate the groundstate of the quantum Ising model through its quantum critical point. We further demonstrate how the dynamical quantum critical point found in quenches of this model across its quantum critical point can be simulated. Our approach avoids finite-size scaling effects by using sequential quantum circuits inspired by infinite matrix product states. We provide efficient circuits and a variety of error mitigation strategies to implement, optimise and time-evolve these states.
The numerical simulation of quantum circuits is an indispensable tool for development, verification and validation of hybrid quantum-classical algorithms on near-term quantum co-processors. The emergence of exascale high-performance computing (HPC) platforms presents new opportunities for pushing the boundaries of quantum circuit simulation. We present a modernized version of the Tensor Network Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the eXtreme-scale ACCelerator (XACC) framework. The new version is based on the general purpose, scalable tensor n…
We establish a classical heuristic algorithm for exactly computing quantum probability amplitudes. Our algorithm is based on mapping output probability amplitudes of quantum circuits to evaluations of the Tutte polynomial of graphic matroids. The algorithm evaluates the Tutte polynomial recursively using the deletion-contraction property while attempting to exploit structural properties of the matroid. We consider several variations of our algorithm and present experimental results comparing their performance on two classes of random quantum circuits. Further, we obtain an explicit form for Cl…
The finite-time isothermal process is fundamental in quantum thermodynamics yet complicated with combination of changing control parameters and the interaction with the thermal bath. Such complexity prevents the direct application of the traditional thermodynamics measurement of the relevant quantities. In this paper, we provide a discrete-step method to separate the work done and the heat exchange in the isothermal process by decomposing the process into piecewise adiabatic and isochoric processes. The piecewise control scheme makes it possible to simulate the whole process on a generic quant…
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…
Simulating quantum circuits with arbitrary local noise using Pauli Propagation
Ecole Polytechnique Fédérale de Lausanne (EPFL)（洛桑联邦理工学院）；Freie Universität Berlin（柏林自由大学）；Dahlem Center for Complex Quantum Systems, Freie Universität Berlin（柏林自由大学达勒姆复杂量子系统中心）；Los Alamos National Laboratory（洛斯阿拉莫斯国家实验室）
We introduce qclab++, a light-weight, fully-templated C++ package for GPU-accelerated quantum circuit simulations. The code offers a high degree of portability as it has no external dependencies and the GPU kernels are generated through OpenMP offloading. qclab++ is designed for performance and numerical stability through highly optimized gate simulation algorithms for 1-qubit, controlled 1-qubit, and 2-qubit gates. Furthermore, we also introduce qclab, a quantum circuit toolbox for Matlab with a syntax that mimics qclab++. This provides users the flexibility and ease of use of a scripting lan…
Most research in quantum computing today is performed against simulations of quantum computers rather than true quantum computers. Simulating a quantum computer entails implementing all of the unitary operators corresponding to the quantum gates as tensors. For high numbers of qubits, performing tensor multiplications for these simulations becomes quite expensive, since $N$-qubit gates correspond to $2^{N}$-dimensional tensors. One way to accelerate such a simulation is to use field programmable gate array (FPGA) hardware to efficiently compute the matrix multiplications. Though FPGAs can effi…
Matrix Product Evolution: A Method for Simulating Quantum Circuits Using Tensor Networks
BIPROGY Inc.（BIPROGY公司）；University of Tokyo（东京大学）；Niigata University（新潟大学）；Institute for Physics of Intelligence, University of Tokyo（东京大学智能物理研究所）；Institute for Solid State Physics, University of Tokyo（东京大学固体物理研究所）
We study the fundamental design automation problem of equivalence checking in the NISQ (Noisy Intermediate-Scale Quantum) computing realm where quantum noise is present inevitably. The notion of approximate equivalence of (possibly noisy) quantum circuits is defined based on the Jamiolkowski fidelity which measures the average distance between output states of two super-operators when the input is chosen at random. By employing tensor network contraction, we present two algorithms, aiming at different situations where the number of noises varies, for computing the fidelity between an ideal qua…
Limited quantum memory is one of the most important constraints for near-term quantum devices. Understanding whether a small quantum computer can simulate a larger quantum system, or execute an algorithm requiring more qubits than available, is both of theoretical and practical importance. In this Letter, we introduce cluster parameters $K$ and $d$ of a quantum circuit. The tensor network of such a circuit can be decomposed into clusters of size at most $d$ with at most $K$ qubits of inter-cluster quantum communication. We propose a cluster simulation scheme that can simulate any $(K,d)$-clust…
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…
