Hardness results for decoding the surface code with Pauli noise

Abstract

Real quantum computers will be subject to complicated, qubit-dependent noise, instead of simple noise such as depolarizing noise with the same strength for all qubits. We can do quantum error correction more effectively if our decoding algorithms take into account this prior information about the specific noise present. This motivates us to consider the complexity of surface code decoding where the input to the decoding problem is not only the syndrome-measurement results, but also a noise model in the form of probabilities of single-qubit Pauli errors for every qubit. In this setting, we show that quantum maximum likelihood decoding (QMLD) and degenerate quantum maximum likelihood decoding (DQMLD) for the surface code are NP-hard and #P-hard, respectively. We reduce directly from SAT for QMLD, and from #SAT for DQMLD, by showing how to transform a boolean formula into a qubit-dependent Pauli noise model and set of syndromes that encode the satisfiability properties of the formula. We also give hardness of approximation results for QMLD and DQMLD. These are worst-case hardness results that do not contradict the empirical fact that many efficient surface code decoders are correct in the average case (i.e., for most sets of syndromes and for most reasonable noise models). These hardness results are nicely analogous with the known hardness results for QMLD and DQMLD for arbitrary stabilizer codes with independent $X$ and $Z$ noise.

44 pages, 21 figures. 29 pages, 13 figures in main text. Published version in Quantum

References in corpus (15)

• Surface codes: Towards practical large-scale quantum computation
• Topological quantum memory
• Suppressing quantum errors by scaling a surface code logical qubit
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• Building logical qubits in a superconducting quantum computing system
• Realization of an Error-Correcting Surface Code with Superconducting Qubits
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Strong Resilience of Topological Codes to Depolarization
• Statistical mechanical models for quantum codes with correlated noise
• A silicon-based surface code quantum computer
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes
• NP-hardness of decoding quantum error-correction codes
• Decoding algorithms for surface codes
• Correcting non-independent and non-identically distributed errors with surface codes