Simulation Of Quantum Circuits Research Articles

Observing Quantum Measurement Collapse as a Learnability Phase Transition

During a quantum measurement, superpositions of states with different observable properties probabilistically collapse into one with a sharp value of the measured observable. In macroscopic quantum systems, this collapse arises via a continuous measurement-induced phase transition (MIPT) at a critical value of the strength of interaction with the measurement apparatus. MIPTs lie outside established paradigms for equilibrium or nonequilibrium critical phenomena and delineate distinct, stable dynamical and computational phases of matter. Quantum computers enable programmable simulation of the interaction of a measurement apparatus with a dynamical quantum system, to explore MIPT phenomena over a range of system sizes while retaining quantum coherence. Yet, existing experimental protocols rely on fundamentally nonscalable postselection techniques or direct classical simulation of quantum circuits. Here, we report the scalable observation of finite-size scaling evidence for an observable-sharpening MIPT in monitored quantum circuits in a chain of Yb+171 ions in Quantinuum’s H1-1 trapped-ion quantum processor. By leveraging an equivalent description as a statistical physics problem, we implement scalable classical algorithms to infer the value of the measured observable from a single experimental shot. This technique enables a truly scalable protocol to observe observable-sharpening MIPTs in generic classes of circuits that cannot be directly classically simulated and also provides enhanced means to detect and suppress errors in the quantum simulation. Published by the American Physical Society 2024

Weighted Context-Free-Language Ordered Binary Decision Diagrams

This paper presents a new data structure, called Weighted Context-Free-Language Ordered BDDs (WCFLOBDDs), which are a hierarchically structured decision diagram, akin to Weighted BDDs (WBDDs) enhanced with a procedure-call mechanism. For some functions, WCFLOBDDs are exponentially more succinct than WBDDs. They are potentially beneficial for representing functions of type B n → D , when a function’s image V ⊆ D has many different values. We apply WCFLOBDDs in quantum-circuit simulation, and find that they perform better than WBDDs on certain benchmarks. With a 15-minute timeout, the number of qubits that can be handled by WCFLOBDDs is 1-64× that of WBDDs(and 1-128× that of CFLOBDDs, which are an unweighted version of WCFLOBDDs). These results support the conclusion that for this application—from the standpoint of problem size, measured as the number of qubits—WCFLOBDDs provide the best of both worlds: performance roughly matches whichever of WBDDs and CFLOBDDs is better.(From the standpoint of running time, the results are more nuanced.)

Fast scalable and low-power quantum circuit simulation on the cluster of GPUs platforms

Fast scalable and low-power quantum circuit simulation on the cluster of GPUs platforms

Efficient Quantum Circuit Simulation by Tensor Network Methods on Modern GPUs

Efficient simulation of quantum circuits has become indispensable with the rapid development of quantum hardware. The primary simulation methods are based on state vectors and tensor networks. As the number of qubits and quantum gates grows larger in current quantum devices, traditional state-vector based quantum circuit simulation methods prove inadequate due to the overwhelming size of the Hilbert space and extensive entanglement. Consequently, brutal force tensor network simulation algorithms become the only viable solution in such scenarios. The two main challenges faced in tensor network simulation algorithms are optimal contraction path finding and efficient execution on modern computing devices, with the latter determines the actual efficiency. In this study, we investigate the optimization of such tensor network simulations on modern GPUs and propose general optimization strategies from two aspects: computational efficiency and accuracy. Firstly, we propose to transform critical Einstein summation operations into GEMM operations, leveraging the specific features of tensor network simulations to amplify the efficiency of GPUs. Secondly, by analyzing the data characteristics of quantum circuits, we employ extended precision to ensure the accuracy of simulation results and mixed precision to fully exploit the potential of GPUs, resulting in faster and more precise simulations. Our numerical experiments demonstrate that our approach can achieve a 3.96x reduction in verification time for random quantum circuit samples in the 18-cycle case of Sycamore, with sustained performance exceeding 21 TFLOPS on one A100. This method can be easily extended to the 20-cycle case, maintaining the same performance, accelerating by 12.5x compared to the state-of-the-art CPU-based results and 4.48-6.78x compared to the state-of-the-art GPU-based results reported in the literature. Furthermore, the strategies presented in this article hold general applicability for accelerating problems that can be tackled by contracting tensor networks such as graphical models and combinatorial optimizations.

Contraction of ZX diagrams with triangles via stabiliser decompositions

Recent advances in classical simulation of Clifford+T circuits make use of the ZX calculus to iteratively decompose and simplify magic states into stabiliser terms We improve on this method by studying stabiliser decompositions of ZX diagrams involving the triangle operation. We show that this technique greatly speeds up the simulation of quantum circuits involving multi-controlled gates which can be naturally represented using triangles. We implement our approach in the QuiZX library (2022 A. Kissinger amd J. van de Wetering Quantum Science and Technology 7, 044001), (2022 A. Kissinger et al F. Le Gall and T. Morimae, ed. 17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022), Leibniz International Proceedings in Informatics (LIPIcs) 232, Schloss Dagstuhl—Leibniz-Zentrum für Informatik, Dagstuhl, Germany, pp 5:1–5:13) and demonstrate a significant simulation speed-up (up to multiple orders of magnitude) for random circuits and a variation of previously used benchmarking circuits. Furthermore, we use our software to contract diagrams representing the gradient variance of parametrised quantum circuits, which yields a tool for the automatic numerical detection of the barren plateau phenomenon in ansätze used for quantum machine learning. Compared to traditional statistical approaches, our method yields exact values for gradient variances and only requires contracting a single diagram. The performance of this tool is competitive with tensor network approaches, as demonstrated with benchmarks against the quimb library (2018 J. Gray Journal of Open Source Software 3, 819).

Quantum Computing for All: Online Courses Built Around an Interactive Visual Quantum Circuit Simulator.

Quantum computing is a highly abstract scientific discipline, which, however, is expected to have great practical relevance in future information technology. This forces educators to seek new methods to teach quantum computing for students with diverse backgrounds and with no prior knowledge of quantum physics. We have developed an online course built around an interactive quantum circuit simulator designed to enable easy creation and maintenance of course material with ranging difficulty. The immediate feedback and automatically evaluated tasks lower the entry barrier to quantum computing for all students, regardless of their background.

On Classical Simulation of Quantum Circuits Composed of Clifford Gates

On Classical Simulation of Quantum Circuits Composed of Clifford Gates

Robust Effective Ground State in a Nonintegrable Floquet Quantum Circuit.

An external periodic (Floquet) drive is believed to bring any initial state to the featureless infinite temperature state in generic nonintegrable isolated quantum many-body systems in the thermodynamic limit, irrespective of the driving frequency Ω. However, numerical or analytical evidence either proving or disproving this hypothesis is very limited and the issue has remained unsettled. Here, we study the initial state dependence of Floquet heating in a nonintegrable kicked Ising chain of length up to L=30 with an efficient quantum circuit simulator, showing a possible counterexample: the ground state of the effective Floquet Hamiltonian is exceptionally robust against heating, and could stay at finite energy density even after infinitely many Floquet cycles, if the driving period is shorter than a threshold value. This sharp energy localization transition or crossover does not happen for generic excited states. The exceptional robustness of the ground state is interpreted by (i)its isolation in the energy spectrum and (ii)the fact that those states with L-independent ℏΩ energy above the ground state energy of any generic local Hamiltonian, like the approximate Floquet Hamiltonian, are atypical and viewed as a collection of noninteracting quasiparticles. Our finding paves the way for engineering Floquet protocols with finite driving periods realizing long-lived, or possibly even perpetual, Floquet phases by initial state design.

Quantum support vector machines for classification and regression on a trapped-ion quantum computer

Quantum machine learning is a rapidly growing field at the intersection of quantum computing and machine learning. In this work, we examine our quantum machine learning models, which are based on quantum support vector classification (QSVC) and quantum support vector regression (QSVR). We investigate these models using a quantum circuit simulator, both with and without noise, as well as the IonQ Harmony quantum processor. For the QSVC tasks, we use a dataset containing fraudulent credit card transactions and image datasets (the MNIST and the Fashion-MNIST datasets); for the QSVR tasks, we use a financial dataset and a materials dataset. For the classification tasks, the performance of our QSVC models using 4 qubits of the trapped-ion quantum computer was comparable to that obtained from noiseless quantum circuit simulations. The result is consistent with the analysis of our device noise simulations with varying qubit gate error rates. For the regression tasks, applying a low-rank approximation to the noisy quantum kernel, in combination with hyperparameter tuning in ε-SVR, improved the performance of the QSVR models on the near-term quantum device. The alignment, as measured by the Frobenius inner product between the noiseless and noisy quantum kernels, can serve as an indicator of the relative prediction performance on noisy quantum devices in comparison with their ideal counterparts. Our results suggest that the quantum kernel, as described by our shallow quantum circuit, can be effectively used for both QSVC and QSVR tasks, indicating its resistance to noise and its adaptability to various datasets.

Toward cost-effective quantum circuit simulation with performance tuning techniques

Quantum circuit simulation is a popular approach to evaluating novel quantum algorithms before a physical quantum computer is available. Unfortunately, the simulation is often done with the full-state quantum circuit simulation scheme, and a huge memory space required by a full-state simulator is a limiting factor for the simulation of a larger qubit system. In this work, in order to support the simulation of a broadened qubit system, storage devices are introduced into the full-state quantum circuit simulation. A vertical qubit simulation design is proposed for the storage-based, full-state quantum circuit simulation, including qubit representation, threading model, and parallel state manipulations over storage devices. An empirical method of simulator parameter tuning is developed to achieve higher simulation performance. Our experimental results show that compared with the state-of-the-art memory-only simulator (QuEST), the storage-based simulation can achieve a 61x higher cost-delay ratio and can simulate a 39-qubit system on a commodity computer. The encouraging results indicate that our proposed simulator can help scale the full-state simulation for larger quantum circuits and achieve higher performance via the performance tuning method.

Vectorization of the density matrix and quantum simulation of the von Neumann equation of time-dependent Hamiltonians

Based oh the properties of Lie algebras, in this work we develop a general framework to linearize the von Neumann equation rendering it in a suitable form for quantum simulations. Departing from the conventional method of expanding the density matrix in the Liouville space formed by matrices unit we express the von Neumann equation in terms of Pauli strings. This provides several advantages related to the quantum tomography of the density matrix and the formulation of the unitary gates that generate the time evolution. The use of Pauli strings facilitates the quantum tomography of the density matrix whose elements are purely real. As for any other basis of Hermitian matrices, this eliminates the need to calculate the phase of the complex entries of the density matrix. This approach also enables to express the evolution operator as a sequence of commuting Hamiltonian gates of Pauli strings that can readily be synthetized using Clifford gates. Additionally, the fact that these gates commute with each other along with the unique properties of the algebra formed by Pauli strings allows to avoid the use of Trotterization hence considerably reducing the circuit depth. The algorithm is demonstrated for three Hamiltonians using the IBM noisy quantum circuit simulator.

CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams

This article presents a new compressed representation of Boolean functions, called CFLOBDDs (for Context-Free-Language Ordered Binary Decision Diagrams). They are essentially a plug-compatible alternative to BDDs (Binary Decision Diagrams), and hence are useful for representing certain classes of functions, matrices, graphs, relations, and so forth in a highly compressed fashion. CFLOBDDs share many of the good properties of BDDs, but—in the best case—the CFLOBDD for a Boolean function can be exponentially smaller than any BDD for that function . Compared with the size of the decision tree for a function, a CFLOBDD—again, in the best case—can give a double-exponential reduction in size . They have the potential to permit applications to (i) execute much faster and (ii) handle much larger problem instances than has been possible heretofore. We applied CFLOBDDs in quantum-circuit simulation and found that for several standard problems, the improvement in scalability, compared to BDDs, is quite dramatic. With a 15-minute timeout, the number of qubits that CFLOBDDs can handle are 65,536 for Greenberger-Horne-Zellinger, 524,288 for Bernstein-Vazirani, 4,194,304 for Deutsch-Jozsa, and 4,096 for Grover’s algorithm, besting BDDs by factors of 128×, 1,024×, 8,192×, and 128×, respectively.

Effects of quantum noise on teleportation of arbitrary two-qubit state via five-particle Brown state

Abstract We propose a new protocol for quantum teleportation (QT) which adopts the Brown state as the quantum channel. This work focuses on the teleportation of a single unknown two-qubit state via a Brown state channel in an ideal environment. To validate the effectiveness of our proposed scheme, we conduct experiments by using the quantum circuit simulator Quirk. Furthermore, we investigate the effects of four noisy channels, namely, the phase damping noise, the bit-flip noise, the amplitude damping noise, and the phase-flip noise. Notably, we employ Monte Carlo simulation to elucidate the fidelity density under various noise parameters. Our analysis demonstrates that the fidelity of the protocol in a noisy environment is influenced significantly by the amplitude of the initial state and the noise factor.

Hybrid Approaches for Efficient Simulations of 3-Qubit Quantum Fourier Transform (QFT) Circuit Using Quick Quantum Circuit Simulation (QQCS)

The research devised efficient methods for simulating 3-qubit Quantum Fourier Transform (QFT) circuits using Quick Quantum Circuit Simulation (QQCS). The hybrid methodologies suggested as a solution for efficiently simulating the circuit involve the combination of decision diagrams and property exploitation techniques. This paper incorporated two methods based on decision diagrams: the reordering trick and decision diagram approximations, template-based optimization, and linear reversible circuit synthesis for property exploitation. The proposed approaches significantly improved and optimized quantum algorithms and hardware by aiming to simulate quantum circuits accurately and quickly. Simulations using QQCS proved the effectiveness of these strategies, which were then compared to the original circuit. The results yielded valuable insights into enhancing simulation efficiency while upholding circuit accuracy.

DGEMM on integer matrix multiplication unit

Deep learning hardware achieves high throughput and low power consumption by reducing computing precision and specializing in matrix multiplication. For machine learning inference, fixed-point value computation is commonplace, where the input and output values and the model parameters are quantized. Thus, many processors are now equipped with fast integer matrix multiplication units (IMMU). It is of significant interest to find a way to harness these IMMUs to improve the performance of HPC applications while maintaining accuracy. We focus on computing double-precision equivalent matrix multiplication using the Ozaki scheme, which computes a high-precision matrix multiplication by using lower-precision computing units, and show the advantages and disadvantages of using IMMU. The experiment using integer Tensor Cores shows that we can compute double-precision matrix multiplication faster than cuBLAS and an existing Ozaki scheme implementation on FP16 Tensor Cores on NVIDIA consumer GPUs. Furthermore, we demonstrate accelerating a quantum circuit simulation by up to 4.85 while maintaining the FP64 accuracy.

Efficient classical simulation of cluster state quantum circuits with alternative inputs

We provide new examples of pure entangled systems related to cluster state quantum computation that can be efficiently simulated classically. In cluster state quantum computation input qubits are initialised in the `equator' of the Bloch sphere, CZ gates are applied, and finally the qubits are measured adaptively using Z measurements or measurements of cos⁡(θ)X+sin⁡(θ)Y operators. We consider what happens when the initialisation step is modified, and show that for lattices of finite degree D, there is a constant λ≈2.06 such that if the qubits are prepared in a state that is within λ−D in trace distance of a state that is diagonal in the computational basis, then the system can be efficiently simulated classically in the sense of sampling from the output distribution within a desired total variation distance. In the square lattice with D=4 for instance, λ−D≈0.056. We develop a coarse grained version of the argument which increases the size of the classically efficient region. In the case of the square lattice of qubits, the size of the classically simulatable region increases in size to at least around ≈0.070, and in fact probably increases to around ≈0.1. The results generalise to a broader family of systems, including qudit systems where the interaction is diagonal in the computational basis and the measurements are either in the computational basis or unbiased to it. Potential readers who only want the short version can get much of the intuition from figures 1 to 3.

Non-stabilizerness and entanglement from cat-state injection

Recently, cat states have been used to heuristically improve the runtime of a classical simulator of quantum circuits based on the diagrammatic ZX-calculus. Here we investigate the use of cat-state injection within the quantum circuit model. We explore a family of cat states, catm∗ , and describe circuit gadgets using them to concurrently inject non-stabilizerness (also known as magic) and entanglement into any quantum circuit. We provide numerical evidence that cat-state injection does not lead to speed-up in classical simulation. On the other hand, we show that our gadgets can be used to widen the scope of compelling applications of cat states. Specifically, we show how to leverage them to achieve savings in the number of injected qubits, and also to induce scrambling dynamics in otherwise non-entangling Clifford circuits in a controlled manner.

Running Qiskit on ROCm Platform

Running Qiskit on ROCm Platform

Кванттық симулятор оқу құралы ретінде

n the field of quantum computing, the properties of quantum superposition offer a promising potential for solving complex problems in a few minutes, while classical computers would take years to solve the same problem. Therefore, many institutions have introduced courses related to quantum mechanics and quantum computing into their programs. However, there is currently no known web-based tool or PC application dedicated to the study of quantum computing. Quantum computers are not available for educational purposes. In the early stages of learning, students may benefit from a way to practice quantum computing with a visual tool. Quantum computing is usually expressed by a quantum circuit with its sequences of quantum gates. The article talks about the creation of an educational simulator for the study of quantum circuits with various gates, functions and transformation rules. This quantum simulator will help students learn the principles of quantum circuitry in their undergraduate and graduate courses. This tool will offer functions that allow you to build a quantum circuit, add and remove quantum gates, apply transformation rules, and observe the operation of a quantum circuit with its unitary matrix. By practicing with the quantum circuit simulator, students can strengthen their theoretical knowledge base about quantum computing and linear algebraic functions

QuanPath: achieving one-step communication for distributed quantum circuit simulation

QuanPath: achieving one-step communication for distributed quantum circuit simulation