Floquetifying stabiliser codes with distance-preserving rewrites

• URL: http://arxiv.org/abs/2410.17240v2
• Date: Mon, 16 Dec 2024 15:54:54 GMT
• Title: Floquetifying stabiliser codes with distance-preserving rewrites
• Authors: Benjamin Rodatz, Boldizsár Poór, Aleks Kissinger,
• Abstract summary: We decompose arbitrary weight stabiliser measurements into quantum circuits with single- and two-qubit operations. As we only use distance-preserving rewrites, we are guaranteed that a single error in the resulting circuit creates at most a single error on the data qubits.
• Score: 0.0
• License:
• Abstract: Stabiliser codes with large weight measurements can be challenging to implement fault-tolerantly. To overcome this, we propose a Floquetification procedure which, given a stabiliser code, synthesises a novel Floquet code that only uses single- and two-qubit operations. Moreover, this procedure preserves the distance and number of logicals of the original code. The new Floquet code requires additional physical qubits. This overhead is linear in the weight of the largest measurement of the original code. Our method is based on the ZX calculus, a graphical language for representing and rewriting quantum circuits. However, a problem arises with the use of ZX in the context of rewriting error-correcting codes: ZX rewrites generally do not preserve code distance. Tackling this issue, we define the notion of distance-preserving rewrite that enables the transformation of error-correcting codes without changing their distance. These distance-preserving rewrites are used to decompose arbitrary weight stabiliser measurements into quantum circuits with single- and two-qubit operations. As we only use distance-preserving rewrites, we are guaranteed that a single error in the resulting circuit creates at most a single error on the data qubits. These decompositions enable us to generalise the Floquetification procedure of [arXiv:2307.11136] to arbitrary stabiliser codes, provably preserving the distance and number of logicals of the original code.

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)
• Quantum Prometheus: Defying Overhead with Recycled Ancillas in Quantum Error Correction [2.089191490381739]
  Quantum error correction (QEC) is crucial for ensuring the reliability of quantum computers. QEC codes depend heavily on ancilla qubits for stabilizer measurements. We propose reducing the number of ancilla qubits by reusing the same ancilla qubits for both X- and Z-type stabilizers.
  arXiv  Detail & Related papers  (2024-11-19T19:06:24Z)
• Single-shot preparation of hypergraph product codes via dimension jump [0.0]
  We present a protocol that prepares the codespace of constant-rate hypergraph product codes in constant depth with $O(sqrtn)$ spatial overhead. We show that the protocol is robust even in the presence of measurement errors.
  arXiv  Detail & Related papers  (2024-10-07T16:29:13Z)
• Accommodating Fabrication Defects on Floquet Codes with Minimal Hardware Requirements [44.99833362998488]
  Floquet codes provide good fault-tolerant characteristics while benefiting from reduced connectivity requirements in hardware. This is an under-studied issue of crucial importance for running such codes on realistic hardware. We introduce a new method of accommodating defective qubits on a wide range of two-dimensional Floquet codes.
  arXiv  Detail & Related papers  (2024-05-24T18:00:05Z)
• Estimating the Decoding Failure Rate of Binary Regular Codes Using Iterative Decoding [84.0257274213152]
  We propose a new technique to provide accurate estimates of the DFR of a two-iterations (parallel) bit flipping decoder. We validate our results, providing comparisons of the modeled and simulated weight of the syndrome, incorrectly-guessed error bit distribution at the end of the first iteration, and two-itcrypteration Decoding Failure Rates (DFR)
  arXiv  Detail & Related papers  (2024-01-30T11:40:24Z)
• Addressing Stopping Failures for Small Set Flip Decoding of Hypergraph Product Codes [1.04049929128816]
  Hypergraph product codes are a promising family of constant-rate quantum LDPC codes. Small-Set-Flip ($texttSSF$) is a linear-time decoding algorithm. We propose a new decoding algorithm called the Projection-Along-a-Line ($texttPAL$) decoder to supplement $textttSSF$ after stopping failures.
  arXiv  Detail & Related papers  (2023-11-01T22:08:49Z)
• Floquetifying the Colour Code [0.0]
  We use the ZX-calculus to create new Floquet codes that are in a definable sense equivalent to known stabilizer codes. This work shines a light on the relationship between'static' stabilizer and subsystem codes and 'dynamic' Floquet codes.
  arXiv  Detail & Related papers  (2023-07-20T17:01:16Z)
• 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)
• Quantum computation on a 19-qubit wide 2d nearest neighbour qubit array [59.24209911146749]
  This paper explores the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds. We engineer an error bias at the lowest level of encoding using the surface code. We then address this bias at a higher level of encoding using a lattice-surgery surface code bus.
  arXiv  Detail & Related papers  (2022-12-03T06:16:07Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• Optimizing Stabilizer Parities for Improved Logical Qubit Memories [0.8431877864777444]
  We study variants of Shor's code that are adept at handling single-axis correlated idling errors. Even-distance versions of our Shor code variants are decoherence-free subspaces and fully robust to identical and independent coherent idling noise.
  arXiv  Detail & Related papers  (2021-05-11T14:20:15Z)

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.