Quantum technologies have the potential to solve certain computationally hard problems with polynomial or super-polynomial speedups when compared to classical methods. Unfortunately, the unstable nature of quantum information makes it prone to errors. For this reason, quantum error correction is an invaluable tool to make quantum information reliable and enable the ultimate goal of fault-tolerant quantum computing. Surface codes currently stand as the most promising candidates to build near term error corrected qubits given their two-dimensional architecture, the requirement of only local operations, and high tolerance to quantum noise. Decoding algorithms are an integral component of any error correction scheme, as they are tasked with producing accurate estimates of the errors that affect quantum information, so that they can subsequently be corrected. A critical aspect of decoding algorithms is their speed, since the quantum state will suffer additional errors with the passage of time. This poses a connundrum, where decoding performance is improved at the expense of complexity and viceversa. In this review, a thorough discussion of state-of-the-art decoding algorithms for surface codes is provided. The target audience of this work are both readers with an introductory understanding of the field as well as those seeking to further their knowledge of the decoding paradigm of surface codes. We describe the core principles of these decoding methods as well as existing variants that show promise for improved results. In addition, both the decoding performance, in terms of error correction capability, and decoding complexity, are compared. A review of the existing software tools regarding surface codes decoding is also provided.
The well-documented capacity-approaching performance of sparse codes in the realm of classical communications has inspired the search for their quantum counterparts. Sparse quantum codes are generally built as the amalgamation of two robust classical codes and are decoded via classical decoding algorithms. However, the quantum paradigm presents phenomena that act in a deleterious manner on sparse quantum codes when they are decoded based on classical methodologies. One such phenomenon is known as degeneracy, and it is a major contributor to why sparse quantum codes do not entirely evoke the stupendous error correcting abilities of their classical counterparts. In this paper, we adopt a group theoretical approach to discuss the issue of degeneracy as it relates to sparse quantum codes. Furthermore, we compare the decoding process of sparse quantum codes with that of sparse classical codes, illustrating the challenges that appear in the quantum domain. Finally, we provide a detailed example to illustrate the effects of degeneracy on sparse quantum codes and the challenges of designing an optimum decoder for these schemes.
The decoherence effects experienced by the qubits of a quantum processor are generally characterized using the amplitude damping time (T1) and the dephasing time (T2). Quantum channel models that exist at the time of writing assume that these parameters are fixed and invariant. However, recent experimental studies have shown that they exhibit a time-varying (TV) behaviour. These time-dependant fluctuations of T1 and T2, which become even more pronounced in the case of superconducting qubits, imply that conventional static quantum channel models do not capture the noise dynamics experienced by realistic qubits with sufficient precision. In this article, we study how the fluctuations of T1 and T2 can be included in quantum channel models. We propose the idea of time-varying quantum channel (TVQC) models, and we show how they provide a more realistic portrayal of decoherence effects than static models in some instances. We also discuss the divergence that exists between TVQCs and their static counterparts by means of a metric known as the diamond norm. In many circumstances this divergence can be significant, which indicates that the time-dependent nature of decoherence must be considered, in order to construct models that capture the real nature of quantum devices.
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 and dephasing 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 paper we introduce the independent nonidentically distributed (i.n.i.d.) noise model, a decoherence model that accounts for the nonuniform behavior of the decoherence parameters of qubits. Additionally, we use the i.n.i.d. model to study how it affects the performance of a specific family of quantum error correction 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 performance decrements in terms of the code pseudothreshold when they are subjected to the i.n.i.d. noise model. Furthermore, we consider and describe two methods which enhance the performance of planar codes under i.n.i.d. noise. The first method involves a so-called reweighting 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 pseudothreshold values that are up to higher than for the traditional MWPM decoder under i.n.i.d. noise.
Quantum information is prone to suffer from errors caused by the so-called decoherence, which describes the loss in coherence of quantum states associated to their interactions with the surrounding environment. This decoherence phenomenon is present in every quantum information task, be it transmission, processing or even storage of quantum information. Consequently, the protection of quantum information via quantum error correction codes (QECC) is of paramount importance to construct fully operational quantum computers. Understanding environmental decoherence processes and the way they are modeled is fundamental in order to construct effective error correction methods capable of protecting quantum information. Moreover, quantum channel models that are efficiently implementable and manageable on classical computers are required in order to design and simulate such error correction schemes. In this paper, we present a survey of decoherence models, reviewing the manner in which these models can be approximated into quantum Pauli channel models, which can be efficiently implemented on classical computers. We also explain how certain families of quantum error correction codes can be entirely simulated in the classical domain, without the explicit need of a quantum computer. A quantum error correction code for the approximated channel is also a correctable code for the original channel, and its performance can be obtained by Monte Carlo simulations on a classical computer.
Time-varying quantum channels (TVQCs) have been proposed as a model to include fluctuations of the relaxation () and dephasing times (). In previous works, realizations of multiqubit TVQCs have been assumed to be equal for all the qubits of an error correction block, implying that the random variables that describe the fluctuations of and are block-to-block uncorrelated but qubit-wise perfectly correlated for the same block. In this article, we perform a correlation analysis of the fluctuations of the relaxation times of five multiqubit quantum processors. Our results show that it is reasonable to assume that the fluctuations of the relaxation and dephasing times of superconducting qubits are local to each of the qubits of the system. Based on these results, we discuss the multiqubit TVQCs when the fluctuations of the decoherence parameters for an error correction block are qubit-wise uncorrelated (as well as from block-to-block), a scenario we have named the fast time-varying quantum channel (FTVQC). Furthermore, we lower-bound the quantum capacity of general FTVQCs based on a quantity we refer to as the ergodic quantum capacity. Finally, we use numerical simulations to study the performance of quantum error correction codes when they operate over FTVQCs.