Performance Analysis for Crosstalk Errors between Parallel Entangling Gates in Trapped Ion Quantum Error Correction

• URL: http://arxiv.org/abs/2501.09554v2
• Date: Fri, 17 Jan 2025 03:49:52 GMT
• Title: Performance Analysis for Crosstalk Errors between Parallel Entangling Gates in Trapped Ion Quantum Error Correction
• Authors: Fangxuan Liu, Gaoxiang Tang, Luming Duan, Yukai Wu,
• Abstract summary: We numerically calculate the logical error rates and coherence times under various crosstalk errors, gate infidelities and coherence times of the physical qubits. We show that a break-even point can be reached under realistic parameters.
• Score: 0.0
• License:
• Abstract: The ability to execute a large number of quantum gates in parallel is a fundamental requirement for quantum error correction, allowing an error threshold to exist under the finite coherence time of physical qubits. Recently, two-dimensional ion crystals have been demonstrated as a plausible approach to scale up the qubit number in a trapped ion quantum computer. However, although the long-range Coulomb interaction between the ions enables their strong connectivity, it also complicates the design of parallel gates and leads to intrinsic crosstalk errors. Here we examine the effects of crosstalk errors on a rotated surface code. We show that, instead of the distance-3 code considered in previous works, a distance-5 code is necessary to correct the two-qubit crosstalk error. We numerically calculate the logical error rates and coherence times under various crosstalk errors, gate infidelities and coherence times of the physical qubits, and we optimize the parallelism level according to the competition between different error sources. We show that a break-even point can be reached under realistic parameters. We further analyze the spatial dependence of the crosstalk, and discuss the scaling of the logical error rate versus the code distance for the long-term goal of a logical error rate below $10^{-10}$.

Related papers

• Demonstrating dynamic surface codes [138.1740645504286]
  We experimentally demonstrate three time-dynamic implementations of the surface code. First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three. Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors. Third, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead.
  arXiv  Detail & Related papers  (2024-12-18T21:56:50Z)
• Limited Parallelization in Gate Operations Leads to Higher Space Overhead and Lower Noise Threshold [1.17431678544333]
  In a modern error corrected quantum memory or circuit, parallelization of gate operations is severely restricted due to issues like cross-talk. In this paper, we obtain an analytical lower bound on the required space overhead in terms of the level of parallelization for an error correction framework.
  arXiv  Detail & Related papers  (2024-10-05T13:31:50Z)
• Quantum error correction below the surface code threshold [107.92016014248976]
  Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit. We present two surface code memories operating below a critical threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-24T23:08:50Z)
• An iterative transversal CNOT decoder [0.3270311586730471]
  Modern platforms for qubit candidates, such as trapped ions or neutral atoms, allow long range connectivity between distant physical qubits through shuttling. This opens up an avenue for iterative logical CNOT gates between distant logical qubits, whereby physical CNOT gates are performed between each corresponding physical qubit on the control and target logical qubits. However, the CNOT can propagate errors from one logical qubit to another, leading to correlated errors between logical qubits. We have developed a multi-pass decoder that decodes each logical qubit separately to deal with this correlated error.
  arXiv  Detail & Related papers  (2024-07-30T17:10:10Z)
• Hardware optimized parity check gates for superconducting surface codes [0.0]
  Error correcting codes use multi-qubit measurements to realize fault-tolerant quantum logic steps. We analyze an unconventional surface code based on multi-body interactions between superconducting transmon qubits. Despite the multi-body effects that underpin this approach, our estimates of logical faults suggest that this design can be at least as robust to realistic noise as conventional designs.
  arXiv  Detail & Related papers  (2022-11-11T18:00:30Z)
• Suppressing quantum errors by scaling a surface code logical qubit [147.2624260358795]
  We report the measurement of logical qubit performance scaling across multiple code sizes. Our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. Results mark the first experimental demonstration where quantum error correction begins to improve performance with increasing qubit number.
  arXiv  Detail & Related papers  (2022-07-13T18:00:02Z)
• Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays [3.575043595126111]
  We propose a qubit encoding and gate protocol for $171$Yb neutral atom qubits that converts the dominant physical errors into erasures. We estimate that 98% of errors can be converted into erasures.
  arXiv  Detail & Related papers  (2022-01-10T18:56:31Z)
• Realizing Repeated Quantum Error Correction in a Distance-Three Surface Code [42.394110572265376]
  We demonstrate quantum error correction using the surface code, which is known for its exceptionally high tolerance to errors. In an error correction cycle taking only $1.1,mu$s, we demonstrate the preservation of four cardinal states of the logical qubit.
  arXiv  Detail & Related papers  (2021-12-07T13:58:44Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• Exponential suppression of bit or phase flip errors with repetitive error correction [56.362599585843085]
  State-of-the-art quantum platforms typically have physical error rates near $10-3$. Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits. We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
  arXiv  Detail & Related papers  (2021-02-11T17:11:20Z)
• Crosstalk Suppression for Fault-tolerant Quantum Error Correction with Trapped Ions [62.997667081978825]
  We present a study of crosstalk errors in a quantum-computing architecture based on a single string of ions confined by a radio-frequency trap, and manipulated by individually-addressed laser beams. This type of errors affects spectator qubits that, ideally, should remain unaltered during the application of single- and two-qubit quantum gates addressed at a different set of active qubits. We microscopically model crosstalk errors from first principles and present a detailed study showing the importance of using a coherent vs incoherent error modelling and, moreover, discuss strategies to actively suppress this crosstalk at the gate level.
  arXiv  Detail & Related papers  (2020-12-21T14:20:40Z)

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.