Simulation and performance analysis of quantum error correction with a rotated surface code under a realistic noise model

• URL: http://arxiv.org/abs/2204.11404v4
• Date: Fri, 30 Sep 2022 01:16:48 GMT
• Title: Simulation and performance analysis of quantum error correction with a rotated surface code under a realistic noise model
• Authors: Mitsuki Katsuda, Kosuke Mitarai, Keisuke Fujii
• Abstract summary: Demonstration of quantum error correction (QEC) is one of the most important milestones in the realization of fully-fledged quantum computers. In this work, we performed a full simulation of QEC for the rotated surface codes with a code distance 5, which employs 49 qubits. We evaluate the logical error probability in a realistic noise model that incorporates not only Pauli errors but also coherent errors due to a systematic control error or unintended interactions.
• Score: 0.6946929968559495
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The demonstration of quantum error correction (QEC) is one of the most important milestones in the realization of fully-fledged quantum computers. Toward this, QEC experiments using the surface codes have recently been actively conducted. However, it has not yet been realized to protect logical quantum information beyond the physical coherence time. In this work, we performed a full simulation of QEC for the rotated surface codes with a code distance 5, which employs 49 qubits and is within reach of the current state-of-the-art quantum computers. In particular, we evaluate the logical error probability in a realistic noise model that incorporates not only stochastic Pauli errors but also coherent errors due to a systematic control error or unintended interactions. While a straightforward simulation of 49 qubits is not tractable within a reasonable computational time, we reduced the number of qubits required to 26 qubits by delaying the syndrome measurement in simulation. This and a fast quantum computer simulator, Qulacs, implemented on GPU allows us to simulate full QEC with an arbitrary local noise within reasonable simulation time. Based on the numerical results, we also construct and verify an effective model to incorporate the effect of the coherent error into a stochastic noise model. This allows us to understand what the effect coherent error has on the logical error probability on a large scale without full simulation based on the detailed full simulation of a small scale. The present simulation framework and effective model, which can handle arbitrary local noise, will play a vital role in clarifying the physical parameters that future experimental QEC should target.

Related papers

• Accuracy guarantees and quantum advantage in analogue open quantum simulation with and without noise [0.0]
  We theoretically analyze noisy analogue quantum simulation of geometrically local open quantum systems. We show that the dynamics of local observables can be obtained to a precision of $varepsilon$ in time that is $textpoly(varepsilon-1)$ and uniform in system size.
  arXiv  Detail & Related papers  (2024-04-17T05:40:08Z)
• Quantum Tunneling: From Theory to Error-Mitigated Quantum Simulation [49.1574468325115]
  This study presents the theoretical background and the hardware aware circuit implementation of a quantum tunneling simulation. We use error mitigation techniques (ZNE and REM) and multiprogramming of the quantum chip for solving the hardware under-utilization problem.
  arXiv  Detail & Related papers  (2024-04-10T14:27:07Z)
• MITS: A Quantum Sorcerer Stone For Designing Surface Codes [2.348041867134616]
  We present MITS, a tool designed to reverse-engineer the well-known simulator STIM for designing QEC codes. MITS accepts the specific noise model of a quantum computer and a target logical error rate as input and outputs the optimal surface code rounds and code distances.
  arXiv  Detail & Related papers  (2024-02-16T19:17:53Z)
• Stochastic error cancellation in analog quantum simulation [0.7204413136269974]
  We consider an error model in which the actual Hamiltonian of the simulator differs from the target Hamiltonian. We analyze the error accumulated in observables in this setting and show that, due to error cancellation, the error scales as the square root of the number of qubits instead of linearly.
  arXiv  Detail & Related papers  (2023-11-24T19:25:08Z)
• Robust Extraction of Thermal Observables from State Sampling and Real-Time Dynamics on Quantum Computers [49.1574468325115]
  We introduce a technique that imposes constraints on the density of states, most notably its non-negativity, and show that this way, we can reliably extract Boltzmann weights from noisy time series. Our work enables the implementation of the time-series algorithm on present-day quantum computers to study finite temperature properties of many-body quantum systems.
  arXiv  Detail & Related papers  (2023-05-30T18:00:05Z)
• 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)
• 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)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Error mitigation by training with fermionic linear optics [0.05076419064097732]
  We describe a method of reducing errors which is tailored to quantum algorithms for simulating fermionic systems. The method is based on executing quantum circuits in the model of fermionic linear optics, which are known to be efficiently simulable classically. In classical numerical simulations of 12-qubit examples with physically realistic levels of depolarising noise, errors were reduced by a factor of around 34 compared with the uncorrected case.
  arXiv  Detail & Related papers  (2021-02-03T15:56:23Z)
• Realistic simulation of quantum computation using unitary and measurement channels [1.406995367117218]
  We introduce a new simulation approach that relies on approximating the density matrix evolution by a sum of unitary and measurement channels. This model shows an improvement of at least one order of magnitude in terms of accuracy compared to the best known approaches.
  arXiv  Detail & Related papers  (2020-05-13T14:29:18Z)

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.