Fault-Tolerant Computing with Single Qudit Encoding

• URL: http://arxiv.org/abs/2307.10761v3
• Date: Fri, 22 Dec 2023 09:34:32 GMT
• Title: Fault-Tolerant Computing with Single Qudit Encoding
• Authors: Matteo Mezzadri, Alessandro Chiesa, Luca Lepori and Stefano Carretta
• Abstract summary: 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.
• Score: 49.89725935672549
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit to avoid resource escalation typical of multi-qubit codes. 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. Notably, this outperforms qubit codes using thousands of units. We also outline the required properties for a generic physical system to Fault-Tolerantly implement these embedded codes.

Related papers

• Optimizing compilation of error correction codes for 2xN quantum dot arrays and its NP-hardness [2.7817719859314263]
  Hardware-specific error correction codes can achieve fault-tolerance while respecting other constraints. Recent advancements have demonstrated the shuttling of electron and hole spin qubits through a quantum dot array with high fidelity. We develop a suite of methods for compiling any stabilizer error-correcting code's syndrome-extraction circuit to run with a minimal number of shuttling operations.
  arXiv  Detail & Related papers  (2025-01-15T19:00:00Z)
• 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)
• Generalized quantum data-syndrome codes and belief propagation decoding for phenomenological noise [6.322831694506286]
  We introduce quantum data-syndrome codes along with a generalized check matrix that integrates both quaternary and binary alphabets to represent diverse error sources. We observe that at high error rates, fewer rounds of syndrome extraction tend to perform better, while more rounds improve performance at lower error rates.
  arXiv  Detail & Related papers  (2023-10-19T12:23:05Z)
• Fault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code [2.5553228515450765]
  We implement a small quantum algorithm, one-qubit addition, fault-tolerantly on the Quantinuum H1-1 quantum computer. We observe arithmetic errors with a rate of $sim 1.1 times 10-3$ for the fault-tolerant circuit and $sim 9.5 times 10-3$ for the unencoded circuit.
  arXiv  Detail & Related papers  (2023-09-18T15:56:14Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Flag Gadgets based on Classical Codes [1.30536490219656]
  We develop a framework to design flag gadgets using classical codes. We show how to perform fault-tolerant syndrome extraction for any stabilizer code with arbitrary distance. These small examples may be relevant to near-term experiments on small-scale quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T03:16:49Z)
• 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)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond [68.8204255655161]
  We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
  arXiv  Detail & Related papers  (2020-04-15T18:00:01Z)

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.