Related papers: Erasure Thresholds for Hyperbolic and Semi-Hyperbo…
This short note is devoted to establishing the almost sure central limit theorem for the parabolic/hyperbolic Anderson models driven by colored-in-time Gaussian noises, completing recent results on quantitative central limit theorems for…
Spinal codes, a family of rateless codes introduced in 2011, have been proved to achieve Shannon capacity over both the additive white Gaussian noise (AWGN) channel and the binary symmetric channel (BSC). In this paper, we derive explicit…
We study low-delay error correction codes for streaming recovery over a class of packet-erasure channels that introduce both burst-erasures and isolated erasures. We propose a simple, yet effective class of codes whose parameters can be…
This paper presents two new approaches for finding the homogenized coefficients of multiscale elliptic PDEs. Standard approaches for computing the homogenized coefficients suffer from the so-called resonance error, originating from a…
Computer simulations are used to test whether a recently introduced generalization of Rosenfeld's excess-entropy scaling method for estimating transport coefficients in systems obeying molecular dynamics can be extended to predict long-time…
We calculate the decay widths and branching ratios of the extra neutral boson $Z^{\prime}$ predicted by the 331 bilepton model in the framework of two different particle contents. These calculations are performed taken into account oblique…
Convolutional codes are a class of error-correcting codes that performs very well over erasure channels with low delay requirements. In particular, Maximum Distance Profile (MDP) convolutional codes, which are defined to have optimal column…
Biased-noise qubits, in which one type of error (e.g. $X$- and $Y$-type errors) is significantly suppressed relative to the other (e.g. $Z$-type errors), can significantly reduce the overhead of quantum error correction. Codes such as the…
This paper focuses on error thresholds for Pauli channels. We numerically compute lower bounds for the thresholds using the analytic framework of coset weight enumerators pioneered by DiVincenzo, Shor and Smolin in 1998. In particular, we…
Quantum error correction is a critical technique for transitioning from noisy intermediate-scale quantum (NISQ) devices to fully fledged quantum computers. The surface code, which has a high threshold error rate, is the leading quantum…
Error correcting codes are defined and important parameters for a code are explained. Parameters of new codes constructed on algebraic surfaces are studied. In particular, codes resulting from blowing up points in $\proj^2$ are briefly…
In order to build a large scale quantum computer, one must be able to correct errors extremely fast. We design a fast decoding algorithm for topological codes to correct for Pauli errors and erasure and combination of both errors and…
In this paper we concentrate on rate-1/3 systematic parallel concatenated convolutional codes and their rate-1/2 punctured child codes. Assuming maximum-likelihood decoding over an additive white Gaussian channel, we demonstrate that a…
Surface codes are the most promising candidates for fault-tolerant quantum computation. Single qudit errors are typically modelled as Pauli operators, to which general errors are converted via randomizing methods. In this Letter, we…
In this work we develop a general tensor network decoder for 2D codes. Specifically, we propose a decoder that approximates maximally likelihood decoding for 2D stabiliser and subsystem codes subject to Pauli noise. For a code consisting of…
We map the decoding problem of the surface code under depolarizing and syndrome noise to a disordered spin model, which we call the random coupled-plaquette gauge model (RCPGM). By coupling X- and Z-syndrome volumes, this model allows us to…
Hyperbolic networks have shown prominent improvements over their Euclidean counterparts in several areas involving hierarchical datasets in various domains such as computer vision, graph analysis, and natural language processing. However,…
Quantum error correction codes (QECCs) are critical for realizing reliable quantum computing by protecting fragile quantum states against noise and errors. However, limited research has analyzed the noise resilience of QECCs to help select…
The network paradigm for quantum computing involves interconnecting many modules to form a scalable machine. Typically it is assumed that the links between modules are prone to noise while operations within modules have significantly higher…
A pruned variant of polar coding is reinvented for all binary erasure channels. For small $\varepsilon>0$, we construct codes with block length $\varepsilon^{-5}$, code rate $\text{Capacity}-\varepsilon$, error probability $\varepsilon$,…