Performance of surface codes in realistic quantum hardware

• URL: http://arxiv.org/abs/2203.15695v2
• Date: Wed, 15 Jun 2022 10:32:49 GMT
• Title: Performance of surface codes in realistic quantum hardware
• Authors: Antonio deMarti iOlius, Josu Etxezarreta Martinez, Patricio Fuentes, Pedro M. Crespo, and Javier Garcia-Frias
• Abstract summary: Surface codes are generally studied based on the assumption that each of the qubits that make up the surface code lattice suffers noise that is independent and identically distributed (i.i.d.) We introduce independent non-identically distributed (i.ni.d.) noise model, a decoherence model that accounts for the non-uniform behaviour of the docoherence parameters of qubits. We consider and describe two methods which enhance the performance of planar codes under i.ni.d. noise.
• Score: 0.24466725954625884
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Surface codes are generally studied based on the assumption that each of the qubits that make up the surface code lattice suffers noise that is independent and identically distributed (i.i.d.). However, real benchmarks of the individual relaxation ($T_1$) and dephasing ($T_2$) times of the constituent qubits of state-of-the-art quantum processors have recently shown that the decoherence effects suffered by each particular qubit actually vary in intensity. In consequence, in this article we introduce the independent non-identically distributed (i.ni.d.) noise model, a decoherence model that accounts for the non-uniform behaviour of the docoherence parameters of qubits. Additionally, we use the i.ni.d model to study how it affects the performance of a specific family of Quantum Error Correction (QEC) codes known as planar codes. For this purpose we employ data from four state-of-the-art superconducting processors: ibmq\_brooklyn, ibm\_washington, Zuchongzhi and Rigetti Aspen-M-1. Our results show that the i.i.d. noise assumption overestimates the performance of surface codes, which can suffer up to $95\%$ performance decrements in terms of the code pseudo-threshold when they are subjected to the i.ni.d. noise model. Furthermore, we consider and describe two methods which enhance the performance of planar codes under i.ni.d. noise. The first method involves a so-called re-weighting process of the conventional minimum weight perfect matching (MWPM) decoder, while the second one exploits the relationship that exists between code performance and qubit arrangement in the surface code lattice. The optimum qubit configuration derived through the combination of the previous two methods can yield planar code pseudo-threshold values that are up to $650\%$ higher than for the traditional MWPM decoder under i.ni.d. noise.

Related papers

• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Q-Pandora Unboxed: Characterizing Noise Resilience of Quantum Error Correction Codes [2.348041867134616]
  Quantum error correction codes (QECCs) are critical for realizing reliable quantum computing by protecting fragile quantum states against noise and errors. This paper conducts a comprehensive study analyzing two QECCs under different error types and noise models using simulations. rotated surface codes perform best with higher thresholds attributed to simplicity and lower qubit overhead.
  arXiv  Detail & Related papers  (2023-08-05T02:24:55Z)
• Performance enhancement of surface codes via recursive MWPM decoding [0.28675177318965034]
  We modify the conventional MWPM decoder so that it considers the biases, the non-uniformities and the relationship between $X$, $Y$ and $Z$ errors. We also obtain significant performance improvements when considering biased noise and independent non-identically distributed (i.ni.d.) error models.
  arXiv  Detail & Related papers  (2022-12-22T11:58:12Z)
• Erasure qubits: Overcoming the $T_1$ limit in superconducting circuits [105.54048699217668]
  amplitude damping time, $T_phi$, has long stood as the major factor limiting quantum fidelity in superconducting circuits. We propose a scheme for overcoming the conventional $T_phi$ limit on fidelity by designing qubits in a way that amplitude damping errors can be detected and converted into erasure errors.
  arXiv  Detail & Related papers  (2022-08-10T17:39:21Z)
• Correcting non-independent and non-identically distributed errors with surface codes [0.8039067099377079]
  We develop and investigate the properties of topological surface codes adapted to a known noise structure by Clifford conjugations. We show that the surface code locally tailored to non-uniform single-qubit noise in conjunction with a scalable matching decoder yields an increase in error thresholds and exponential suppression of sub-threshold failure rates.
  arXiv  Detail & Related papers  (2022-08-03T16:21:44Z)
• Multiple Kernel Clustering with Dual Noise Minimization [56.009011016367744]
  Multiple kernel clustering (MKC) aims to group data by integrating complementary information from base kernels. In this paper, we rigorously define dual noise and propose a novel parameter-free MKC algorithm by minimizing them. We observe that dual noise will pollute the block diagonal structures and incur the degeneration of clustering performance, and C-noise exhibits stronger destruction than N-noise.
  arXiv  Detail & Related papers  (2022-07-13T08:37:42Z)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm [0.0]
  Noise mitigation can be performed up to some error for which we derive upper bounds. Experiments on 15 (23) qubits using IBM's devices to test both the noise model and the error-mitigation scheme. We show that similar effects are expected for Haar-random quantum states and states generated by shallow-depth random circuits.
  arXiv  Detail & Related papers  (2021-01-07T02:19:58Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)
• The XZZX Surface Code [2.887393074590696]
  We show that a variant of the surface code -- the XZZX code -- offers remarkable performance for fault-tolerant quantum computation. The error threshold of this code matches what can be achieved with random codes (hashing) for every single-qubit Pauli noise channel. We show that it is possible to maintain all of these advantages when we perform fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2020-09-16T18:00:01Z)

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.