Qudit vs. Qubit: Simulated performance of error correction codes in higher dimensions

• URL: http://arxiv.org/abs/2502.05992v2
• Date: Fri, 05 Sep 2025 12:18:59 GMT
• Title: Qudit vs. Qubit: Simulated performance of error correction codes in higher dimensions
• Authors: James Keppens, Quinten Eggerickx, Vukan Levajac, George Simion, Bart Sorée,
• Abstract summary: Qudits can be described by a state vector in a $q$-dimensional Hilbert space.<n>This implies that conducting fault-tolerant quantum computations using qudits rather than qubits might entail less overhead.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Qudits can be described by a state vector in a $q$-dimensional Hilbert space, enabling a more extensive encoding and manipulation of information compared to qubits. This implies that conducting fault-tolerant quantum computations using qudits rather than qubits might entail less overhead. In this work, we investigate the viability of qudits in error correction codes by creating and simulating the quantum circuitry for the smallest qudit error correction code with a multidimensional circuit-level noise model and specifically adapted decoders. After introducing a flag qudit to protect the code from hook errors, comparable error thresholds of the order of $10^{-4}$ are obtained for qudits of dimensions $2$, $3$ and $5$.

Related papers

• Comparison of spin-qubit architectures for quantum error-correcting codes [0.0]
  We investigate the performance of two quantum error-correcting codes, the surface code and the Bacon-Shor code, for implementation with spin qubits in silicon.<n>We find that the logical error rate is not limited by memory errors, but rather by gate errors, especially 1- and 2-qubit gate errors.
  arXiv  Detail & Related papers  (2025-06-20T17:45:21Z)
• Demonstrating dynamic surface codes [118.67046728951689]
  We experimentally demonstrate three time-dynamic implementations of the surface code.<n>First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three.<n>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.<n>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 error correction below the surface code threshold [107.92016014248976]
  Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit. We present two surface code memories operating below a critical threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-24T23:08:50Z)
• Noise-adapted qudit codes for amplitude-damping noise [6.320926638892934]
  We identify a $[4,1]$ qudit error correcting code tailored to protect against amplitude-damping noise.<n>We show that this four-qudit code satisfies the error correction conditions for all single-qudit and a few two-qudit damping errors.<n>We generalize this construction to a family of $[2M+2, M]$ qudit codes that can approximately correct all the single-qudit and a few two-qudit amplitude-damping errors.
  arXiv  Detail & Related papers  (2024-06-04T16:07:26Z)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• Fault-tolerant hyperbolic Floquet quantum error correcting codes [0.4527817188861902]
  We introduce a family of dynamically generated quantum error correcting codes that we call "hyperbolic Floquet codes"<n>One of our hyperbolic Floquet codes uses 400 physical qubits to encode 52 logical qubits with a code distance of 8, i.e., it is a $[[400,52,8]]$ code.<n>At small error rates, comparable logical error suppression to this code requires 5x as many physical qubits (1924) when using the honeycomb Floquet code with the same noise model and decoder.
  arXiv  Detail & Related papers  (2023-09-18T18:00:02Z)
• Bounds on Autonomous Quantum Error Correction [3.9119979887528125]
  We analyze Markovian autonomous decoders that can be implemented with a wide range of qubit and bosonic error-correcting codes. For many-body quantum codes, we show that, to achieve error suppression comparable to active error correction, autonomous decoders generally require correction rates that grow with code size.
  arXiv  Detail & Related papers  (2023-08-30T18:00:07Z)
• 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)
• A lower bound on the overhead of quantum error correction in low dimensions [9.797319790710711]
  We show that a quantum architecture with an error correction procedure limited to geometrically local operations incurs an overhead that grows with the system size. In particular, we prove that in order to operate a quantum error correcting code in 2D at a logical error rate of $delta$, a space overhead of $Omega(sqrtlog(1/delta))$ is needed.
  arXiv  Detail & Related papers  (2023-02-08T20:19:28Z)
• 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)
• 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)
• Suppressing quantum errors by scaling a surface code logical qubit [147.2624260358795]
  We report the measurement of logical qubit performance scaling across multiple code sizes. Our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. Results mark the first experimental demonstration where quantum error correction begins to improve performance with increasing qubit number.
  arXiv  Detail & Related papers  (2022-07-13T18:00:02Z)
• Matching and maximum likelihood decoding of a multi-round subsystem quantum error correction experiment [1.2189422792863451]
  We perform quantum error correction on superconducting qubits connected in a heavy-hexagon lattice. Full processor can encode a logical qubit with distance three and perform several rounds of fault-tolerant syndrome measurements. We show that the logical error varies depending on the use of a perfect matching decoder.
  arXiv  Detail & Related papers  (2022-03-14T15:44:11Z)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• Exact performance of the five-qubit code with coherent errors [0.0]
  We obtain explicit process matrix of the coding maps with a unital error channel for the five-qubit code. We analytically show how the code affects the average gate infidelity and diamond distance of the error channels.
  arXiv  Detail & Related papers  (2022-03-03T13:28:59Z)
• Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays [3.575043595126111]
  We propose a qubit encoding and gate protocol for $171$Yb neutral atom qubits that converts the dominant physical errors into erasures. We estimate that 98% of errors can be converted into erasures.
  arXiv  Detail & Related papers  (2022-01-10T18:56:31Z)
• Quantum Error Correction with Gauge Symmetries [69.02115180674885]
  Quantum simulations of Lattice Gauge Theories (LGTs) are often formulated on an enlarged Hilbert space containing both physical and unphysical sectors. We provide simple fault-tolerant procedures that exploit such redundancy by combining a phase flip error correction code with the Gauss' law constraint.
  arXiv  Detail & Related papers  (2021-12-09T19:29:34Z)
• Simulation of the five-qubit quantum error correction code on superconducting qubits [0.0]
  We propose a circuit based on the minimal distance-3 QEC code, which requires only 5 data qubits and 5 ancilla qubits. Thanks to its smaller footprint, the proposed code has a lower logical error rate than Surface-17 for similar physical error rates.
  arXiv  Detail & Related papers  (2021-07-14T05:29:59Z)
• Exponential suppression of bit or phase flip errors with repetitive error correction [56.362599585843085]
  State-of-the-art quantum platforms typically have physical error rates near $10-3$. Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits. We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
  arXiv  Detail & Related papers  (2021-02-11T17:11:20Z)
• Trade-offs on number and phase shift resilience in bosonic quantum codes [10.66048003460524]
  One quantum error correction solution is to encode quantum information into one or more bosonic modes. We show that by using arbitrarily many modes, $g$-gapped multi-mode codes can yield good approximate quantum error correction codes.
  arXiv  Detail & Related papers  (2020-08-28T10:44:34Z)

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.