Performance of surface codes in realistic quantum hardware

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.

arXiv commentIncludes supplementary material (19 pages total)

References in corpus (17)

• Fault-tolerant quantum computation by anyons
• Surface codes: Towards practical large-scale quantum computation
• Strong quantum computational advantage using a superconducting quantum processor
• Qudits and high-dimensional quantum computing
• Sparse Graph Codes for Quantum Error-Correction
• Quantum Computing with Continuous-Variable Clusters
• Fluctuations of Energy-Relaxation Times in Superconducting Qubits
• Decoherence benchmarking of superconducting qubits
• Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
• Correlating decoherence in transmon qubits: Low frequency noise by single fluctuators
• Practical trapped-ion protocols for universal qudit-based quantum computing
• Entanglement-assisted quantum turbo codes
• The surface code with a twist
• Experimentally scalable protocol for identification of correctable codes
• Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead
• Coherent superconducting qubits from a subtractive junction fabrication process
• Surface Code Design for Asymmetric Error Channels

Cited by in corpus (4)

• Correcting non-independent and non-identically distributed errors with surface codes
• Performance enhancement of surface codes via recursive MWPM decoding
• Multi-qubit time-varying quantum channels for NISQ-era superconducting quantum processors
• Immense Fidelity Enhancement of Encoded Quantum Bell Pairs at Short and Long-distance Communication along with Generalized Design of Circuit