Supercomputer simulations of transmon quantum computers

• URL: http://arxiv.org/abs/2008.13490v1
• Date: Mon, 31 Aug 2020 11:07:02 GMT
• Title: Supercomputer simulations of transmon quantum computers
• Authors: Dennis Willsch
• Abstract summary: We develop a simulator for quantum computers composed of superconducting transmon qubits. We present results for the simulation of up to 16 transmons and resonators. We also demonstrate the transition from an isolated system to an open quantum system governed by a Lindblad master equation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We develop a simulator for quantum computers composed of superconducting transmon qubits. The simulation model supports an arbitrary number of transmons and resonators. Quantum gates are implemented by time-dependent pulses. Nontrivial effects such as crosstalk, leakage to non-computational states, entanglement between transmons and resonators, and control errors due to the pulses are inherently included. The time evolution of the quantum computer is obtained by solving the time-dependent Schr\"odinger equation. The simulation algorithm shows excellent scalability on high-performance supercomputers. We present results for the simulation of up to 16 transmons and resonators. Additionally, the model can be used to simulate environments, and we demonstrate the transition from an isolated system to an open quantum system governed by a Lindblad master equation. We also describe a procedure to extract model parameters from electromagnetic simulations or experiments. We compare simulation results to experiments on several NISQ processors of the IBM Q Experience. We find nearly perfect agreement between simulation and experiment for quantum circuits designed to probe crosstalk in transmon systems. By studying common gate metrics such as the fidelity or the diamond distance, we find that they cannot reliably predict the performance of repeated gate applications or practical quantum algorithms. As an alternative, we find that the results from two-transmon gate set tomography have an exceptional predictive power. Finally, we test a protocol from the theory of quantum error correction and fault tolerance. We find that the protocol systematically improves the performance of transmon quantum computers in the presence of characteristic control and measurement errors.

Related papers

• Toward hybrid quantum simulations with qubits and qumodes on trapped-ion platforms [0.0]
  We explore the feasibility of hybrid quantum computing using both discrete (qubit) and continuous (qumode) variables on trapped-ion platforms. We show that high-fidelity hybrid gates and measurement operations can be achieved for existing trapped-ion quantum platforms.
  arXiv  Detail & Related papers  (2024-10-09T18:01:15Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Sparse Simulation of VQE Circuits for Quantum Chemistry [0.0]
  Variational Quantum Eigensolver (VQE) is a promising algorithm for future Noisy Intermediate-Scale Quantum (NISQ) devices. In this paper, we consider the classical simulation of the iterative Qubit Coupled Cluster (iQCC) ansatz.
  arXiv  Detail & Related papers  (2024-04-15T18:00:05Z)
• A Modified Depolarization Approach for Efficient Quantum Machine Learning [0.0]
  We propose a modified representation for a single-qubit depolarization channel with two Kraus operators. Our approach reduces the computational complexity from six to four matrix multiplications per execution of a channel. This simplified noise model enables more scalable simulations of quantum circuits under depolarization.
  arXiv  Detail & Related papers  (2024-04-10T20:17:40Z)
• Quantum Computing Simulation of a Mixed Spin-Boson Hamiltonian and Its Performance for a Cavity Quantum Electrodynamics Problem [0.0]
  We present a methodology for simulating a phase transition in a pair of cavities that permit photon hopping. We find that the simulation can be performed with a modest amount of quantum resources.
  arXiv  Detail & Related papers  (2023-10-17T15:25:35Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Quantum emulation of the transient dynamics in the multistate Landau-Zener model [50.591267188664666]
  We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity. Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
  arXiv  Detail & Related papers  (2022-11-26T15:04:11Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• Verifying quantum information scrambling dynamics in a fully controllable superconducting quantum simulator [0.0]
  We study the verified scrambling in a 1D spin chain by an analogue superconducting quantum simulator with the signs and values of individual driving and coupling terms fully controllable. Our work demonstrates the superconducting system as a powerful quantum simulator.
  arXiv  Detail & Related papers  (2021-12-21T13:41:47Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.