Floquet codes without parent subsystem codes

• URL: http://arxiv.org/abs/2210.02468v4
• Date: Wed, 25 Oct 2023 01:28:47 GMT
• Title: Floquet codes without parent subsystem codes
• Authors: Margarita Davydova, Nathanan Tantivasadakarn, Shankar Balasubramanian
• Abstract summary: We propose a new class of error-correcting dynamic codes in two and three dimensions that has no explicit connection to any parent subsystem code. Unlike the honeycomb code it possesses an explicit CSS structure and its gauge checks do not form a subsystem code. We show that our dynamic protocol conserves logical information and possesses a threshold for error correction.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a new class of error-correcting dynamic codes in two and three dimensions that has no explicit connection to any parent subsystem code. The two-dimensional code, which we call the CSS honeycomb code, is geometrically similar to that of the honeycomb code by Hastings and Haah, and also dynamically embeds an instantaneous toric code. However, unlike the honeycomb code it possesses an explicit CSS structure and its gauge checks do not form a subsystem code. Nevertheless, we show that our dynamic protocol conserves logical information and possesses a threshold for error correction. We generalize this construction to three dimensions and obtain a code that fault-tolerantly alternates between realizing two type-I fracton models, the checkerboard and the X-cube model. Finally, we show the compatibility of our CSS honeycomb code protocol and the honeycomb code by showing the possibility of randomly switching between the two protocols without information loss while still measuring error syndromes. We call this more general aperiodic structure `dynamic tree codes', which we also generalize to three dimensions. We construct a probabilistic finite automaton prescription that generates dynamic tree codes correcting any single-qubit Pauli errors and can be viewed as a step towards the development of practical fault-tolerant random codes.

Related papers

• Demonstrating dynamic surface codes [138.1740645504286]
  We experimentally demonstrate three time-dynamic implementations of the surface code. First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three. Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors. Third, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead.
  arXiv  Detail & Related papers  (2024-12-18T21:56:50Z)
• Synchronizable hybrid subsystem codes [4.14360329494344]
  We establish connections between quantum synchronizable codes, subsystem codes, and hybrid codes constructed from the same pair of classical cyclic codes. We also propose a method to construct a synchronizable hybrid subsystem code which can correct both Pauli and synchronization errors.
  arXiv  Detail & Related papers  (2024-09-17T16:11:30Z)
• Learning Linear Block Error Correction Codes [62.25533750469467]
  We propose for the first time a unified encoder-decoder training of binary linear block codes. We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
  arXiv  Detail & Related papers  (2024-05-07T06:47:12Z)
• Error Correction in Dynamical Codes [1.6317061277457001]
  We ask what is the general framework for a quantum error correcting code that is defined by a sequence of measurements. We develop an algorithm that tracks information about the error syndromes through the protocol and put that together to determine the distance of a dynamical code.
  arXiv  Detail & Related papers  (2024-03-07T02:47:21Z)
• Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
  We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
  arXiv  Detail & Related papers  (2023-07-20T10:51:23Z)
• Single-Shot Quantum Error Correction in Intertwined Toric Codes [0.14833692070415452]
  We construct a new subsystem code that exhibits single-shot error correction in a user-friendly and transparent way. Although previous codes share the property of single-shot error correction, the ITC is distinguished by its physically motivated origin. The syndromes of the ITC resemble the syndromes of the single-shot code by Kubica and Vasmer.
  arXiv  Detail & Related papers  (2023-07-16T18:00:01Z)
• Morphing quantum codes [77.34726150561087]
  We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate. We construct a family of hybrid color-toric codes by morphing the color code.
  arXiv  Detail & Related papers  (2021-12-02T17:43:00Z)
• Planar Floquet Codes [0.0]
  The honeycomb code is a subsystem code based on the honeycomb lattice with zero logical qubits. In this work we show a way to introduce boundaries to the system which curiously presents a rotating dynamics but has constant distance and is therefore not fault-tolerant.
  arXiv  Detail & Related papers  (2021-10-11T15:21:35Z)
• KO codes: Inventing Nonlinear Encoding and Decoding for Reliable Wireless Communication via Deep-learning [76.5589486928387]
  Landmark codes underpin reliable physical layer communication, e.g., Reed-Muller, BCH, Convolution, Turbo, LDPC and Polar codes. In this paper, we construct KO codes, a computationaly efficient family of deep-learning driven (encoder, decoder) pairs. KO codes beat state-of-the-art Reed-Muller and Polar codes, under the low-complexity successive cancellation decoding.
  arXiv  Detail & Related papers  (2021-08-29T21:08:30Z)
• COSEA: Convolutional Code Search with Layer-wise Attention [90.35777733464354]
  We propose a new deep learning architecture, COSEA, which leverages convolutional neural networks with layer-wise attention to capture the code's intrinsic structural logic. COSEA can achieve significant improvements over state-of-the-art methods on code search tasks.
  arXiv  Detail & Related papers  (2020-10-19T13:53:38Z)
• Exploiting degeneracy to construct good ternary quantum error correcting code [0.15229257192293197]
  We propose a 7-qutrit error-correcting code for the ternary quantum system. This code is optimum in the number of qutrits required to correct a single error while maintaining the CSS structure.
  arXiv  Detail & Related papers  (2020-08-03T08:38:22Z)

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.