Related papers: Erasure Thresholds for Hyperbolic and Semi-Hyperbo…
This paper presents a new construction of error correcting codes which achieves optimal recovery of a streaming source over a packet erasure channel. The channel model considered is the sliding window erasure model, with burst and arbitrary…
We provide a general framework for bounding the block error threshold of a linear code $C\subseteq \mathbb{F}_2^N$ over the erasure channel in terms of its bit error threshold. Our approach relies on understanding the minimum support weight…
The usual belief propagation (BP) decoders are, in general, exchanging local information on the Tanner graph of the quantum error-correcting (QEC) code and, in particular, are known to not have a threshold for the surface code. We propose…
This paper investigates two distinct types of block errors - undetected errors (confusions) and erasures - in additive white Gaussian noise (AWGN) channels with error-bounded block decoders operating in the finite blocklength (FBL) regime.…
We propose a numerical method to solve an inverse source problem of computing the initial condition of hyperbolic equations from the measurements of Cauchy data. This problem arises in thermo- and photo- acoustic tomography in a bounded…
In this paper we do a detailed numerical investigation of the fault-tolerant threshold for optical cluster-state quantum computation. Our noise model allows both photon loss and depolarizing noise, as a general proxy for all types of local…
It is known that the frame error rate of turbo codes on quasi-static fading channels can be accurately approximated using the convergence threshold of the corresponding iterative decoder. This paper considers quasi-static fading channels…
Quantum error correction codes defined on hyperbolic lattices leverage the unique geometric properties of the hyperbolic space to enhance the performance of quantum error correction. By embedding qubits in hyperbolic lattices, these codes…
Our main result is that for all sufficiently large $x_0>0$, the set of commensurability classes of arithmetic hyperbolic 2- or 3-orbifolds with fixed invariant trace field $k$ and systole bounded below by $x_0$ has density one within the…
The amplitude damping time, $T_1$, has long stood as the major factor limiting quantum fidelity in superconducting circuits, prompting concerted efforts in the material science and design of qubits aimed at increasing $T_1$. In contrast,…
The iterative decoding threshold of low-density parity-check (LDPC) codes over the binary erasure channel (BEC) fulfills an upper bound depending only on the variable and check nodes with minimum distance 2. This bound is a consequence of…
Fracton models provide examples of novel gapped quantum phases of matter that host intrinsically immobile excitations and therefore lie beyond the conventional notion of topological order. Here, we calculate optimal error thresholds for…
We develop a most likely error Pauli error decoding algorithm for stabiliser codes based on general purpose integer optimisation. Using this decoder we analyse the performance of holographic codes against Pauli errors and find numerical…
The surface code is a promising platform for a quantum memory, but its threshold under coherent errors remains incompletely understood. We study maximum-likelihood decoding of the square-lattice surface code in the presence of single-qubit…
Applying single-qubit Clifford unitaries to a Pauli stabilizer code produces a Clifford-deformed variant whose stabilizers remain Pauli operators, but with locally rotated Pauli axes. Such deformations provide a simple way to tailor a fixed…
Dual-rail erasure qubits can substantially improve the efficiency of quantum error correction, allowing lower error rates to be achieved with fewer qubits, but each erasure qubit requires $3\times$ more transmons to implement compared to…
We propose new repair schemes for Reed-Solomon codes that use subspace polynomials and hence generalize previous works in the literature that employ trace polynomials. The Reed-Solomon codes are over $\mathbb{F}_{q^\ell}$ and have…
High-rate product codes (PCs) and staircase codes (SCs) are ubiquitous codes in high-speed optical communication achieving near-capacity performance on the binary symmetric channel. Their success is mostly due to very efficient iterative…
The electroweak corrections to the partial widths of the $H^+ \to \tilde{\chi}^+_i \tilde{\chi}_j^0 (i=1,j=1,2)$ decays including one-loop diagrams of the third generation quarks and squarks, are investigated within the Supersymmetric…
In this work we explore the fidelity of numerical approximations to the analytic spectra of hyperbolic partial differential equation systems with variable coefficients. We are particularly interested in the ability of discrete methods to…