SearcharxivSearch

arXiv subjects

Quinten Eggerickx

Publications and source records attributed to Quinten Eggerickx.

3 recordsLinked to original sources

A route to damage tolerance exceeding $10\%$ in shuttling-equipped quantum processors

This is a short study of an approach offering high tolerance to damage (i.e. defects or 'drop outs') in solid state fault-tolerant quantum computing. Our method is primarily aimed at semiconductor electron spin-qubit systems, which have been shown to support fast and high-fidelity shuttling along pre-defined paths. We adapt the recent CAbLECAR method of Chadwick and Chong: stabilisers are performed by ancillas which each follow a bespoke pre-programmed path. We consider the simple surface code but we damage the physical lattice, and rely on route-solving software to find efficient pathways under constraints enforcing stabiliser commutation and hook error avoidance. Solutions are then converted to detector error models for Stim and logical error rates are obtained. We express our results by gauging the logical performance against that of a pristine lattice, using the notion of a reduced equivalent surface-code distance; for reasonable underlying error rates we find that $10\%$ damage leaves roughly half of the pristine equivalent distance ($d_\text{equiv}\approx0.48\,d_\text{pristine}$ in the large-array limit, rising to $\approx0.60$ for our smallest array). This suggests that one can tolerate substantial damage by building oversized arrays. We note that investigating damage tolerance of other qLDPC codes is a straightforward generalisation, and potentially one could adapt to damage emerging at runtime.

quant-ph

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

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$.

quant-ph

Almost Linear Decoder for Optimal Geometrically Local Quantum Codes

Geometrically local quantum codes, which are error correction codes embedded in $\mathbb{R}^D$ with checks acting only on qubits within a fixed spatial distance, have garnered significant interest. Recently, it has been demonstrated how to achieve geometrically local codes that maximize both the dimension and the distance, as well as the energy barrier of the code. In this work, we focus on the constructions involving subdivision and show that they have an almost linear time decoder, obtained by combining the decoder of the outer good qLDPC code and a generalized version of the Union-Find decoder. This provides the first decoder for an optimal geometrically local three-dimensional code. We demonstrate the existence of a finite threshold error rate under the code capacity noise model using a minimum weight perfect matching decoder. Furthermore, we argue that this threshold is also applicable to the decoder based on the generalized Union-Find algorithm.

quant-ph