Parallel decoding of multiple logical qubits in tensor-network codes

• URL: http://arxiv.org/abs/2012.07317v1
• Date: Mon, 14 Dec 2020 07:58:16 GMT
• Title: Parallel decoding of multiple logical qubits in tensor-network codes
• Authors: Terry Farrelly, Robert J. Harris, Nathan A. McMahon, Thomas M. Stace
• Abstract summary: We consider tensor-network stabilizer codes and show that their tensor-network decoder has the property that independent logical qubits can be decoded in parallel. As an application, we verify this for the max-rate holographic Steane (heptagon) code.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider tensor-network stabilizer codes and show that their tensor-network decoder has the property that independent logical qubits can be decoded in parallel. As long as the error rate is below threshold, we show that this parallel decoder is essentially optimal. As an application, we verify this for the max-rate holographic Steane (heptagon) code. For holographic codes this tensor-network decoder was shown to be efficient with complexity polynomial in n, the number of physical qubits. Here we show that, by using the parallel decoding scheme, the complexity is also linear in k, the number of logical qubits. Because the tensor-network contraction is computationally efficient, this allows us to exactly contract tensor networks corresponding to codes with up to half a million qubits. Finally, we calculate the bulk threshold (the threshold for logical qubits a fixed distance from the code centre) under depolarizing noise for the max-rate holographic Steane code to be 9.4%.

Related papers

• A blockBP decoder for the surface code [0.0]
  We present a new decoder for the surface code, which combines the accuracy of the tensor-network decoders with the efficiency and parallelism of the belief-propagation algorithm. Our decoder is therefore a belief-propagation decoder that works in the degenerate maximal likelihood decoding framework.
  arXiv  Detail & Related papers  (2024-02-07T13:32:32Z)
• Fault-Tolerant Quantum Memory using Low-Depth Random Circuit Codes [0.24578723416255752]
  Low-depth random circuit codes possess many desirable properties for quantum error correction. We design a fault-tolerant distillation protocol for preparing encoded states of one-dimensional random circuit codes. We show through numerical simulations that our protocol can correct erasure errors up to an error rate of $2%$.
  arXiv  Detail & Related papers  (2023-11-29T19:00:00Z)
• Homological Quantum Rotor Codes: Logical Qubits from Torsion [51.9157257936691]
  homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code. We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
  arXiv  Detail & Related papers  (2023-03-24T00:29:15Z)
• Graph Neural Networks for Channel Decoding [71.15576353630667]
  We showcase competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes. The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph. We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results.
  arXiv  Detail & Related papers  (2022-07-29T15:29:18Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Local tensor-network codes [0.0]
  We show how to write some topological codes, including the surface code and colour code, as simple tensor-network codes. We prove that this method is efficient in the case of holographic codes.
  arXiv  Detail & Related papers  (2021-09-24T14:38:06Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)
• Quantized Neural Networks via {-1, +1} Encoding Decomposition and Acceleration [83.84684675841167]
  We propose a novel encoding scheme using -1, +1 to decompose quantized neural networks (QNNs) into multi-branch binary networks. We validate the effectiveness of our method on large-scale image classification, object detection, and semantic segmentation tasks.
  arXiv  Detail & Related papers  (2021-06-18T03:11:15Z)
• General tensor network decoding of 2D Pauli codes [0.0]
  We propose a decoder that approximates maximally likelihood decoding for 2D stabiliser and subsystem codes subject to Pauli noise. We numerically demonstrate the power of this decoder by studying four classes of codes under three noise models. We show that the thresholds yielded by our decoder are state-of-the-art, and numerically consistent with optimal thresholds where available.
  arXiv  Detail & Related papers  (2021-01-11T19:00:03Z)
• Tensor-network codes [0.0]
  We introduce tensor-network stabilizer codes which come with a natural tensor-network decoder. We generalize holographic codes beyond those constructed from perfect or block-perfect isometries. For holographic codes exact the tensor-network decoder is efficient with a complexity that is in the number of physical qubits.
  arXiv  Detail & Related papers  (2020-09-22T05:44:50Z)
• Pruning Neural Belief Propagation Decoders [77.237958592189]
  We introduce a method to tailor an overcomplete parity-check matrix to (neural) BP decoding using machine learning. We achieve performance within 0.27 dB and 1.5 dB of the ML performance while reducing the complexity of the decoder.
  arXiv  Detail & Related papers  (2020-01-21T12:05:46Z)

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.