Related papers: Instantons causing iterative decoding to cycle
Fault-tolerant quantum computing requires classical hardware to perform the decoding necessary for error correction. The Union-Find decoder is one of the best candidates for this. It has remarkably organic characteristics, involving the…
We consider distributed computations between two parties carried out over a noisy channel that may erase messages. Following a noise model proposed by Dani et al. (2018), the noise level observed by the parties during the computation in our…
Binary message-passing decoders for low-density parity-check (LDPC) codes are studied by using extrinsic information transfer (EXIT) charts. The channel delivers hard or soft decisions and the variable node decoder performs all computations…
We briefly report on the contribution of QCD-instantons to the phenomenon of saturation in deep-inelastic scattering (DIS) at small Bjorken-x. The explicitly known instanton gauge field serves as a concrete realization of an underlying…
Algorithms are presented that efficiently shape the parity bits of systematic irregular repeat-accumulate (IRA) low-density parity-check (LDPC) codes by following the sequential encoding order of the accumulator. Simulations over additive…
Several applications in communication, control, and learning require approximating target distributions to within small informational divergence (I-divergence). The additional requirement of invertibility usually leads to using encoders…
Strong coupling constant computed in Landau gauge and MOM renormalization scheme from lattice two and three gluon Green Functions exhibits an unexpected behavior in the deep IR, showing a maximum value around $1 {\rm GeV}$. We analise this…
In contrast to a maximum-likelihood decoder, it is often desirable to use an incomplete decoder that can detect its decoding errors with high probability. One common choice is the bounded distance decoder. Bounds are derived for the total…
Using random Gaussian vectors and an information-uncertainty relation, we give a proof that the coherent information is an achievable rate for entanglement transmission through a noisy quantum channel. The codes are random subspaces…
In this work, lossy distributed compression of pairs of correlated sources is considered. Conventionally, Shannon's random coding arguments -- using randomly generated unstructured codebooks whose blocklength is taken to be asymptotically…
We discuss the effects of instantons in partially broken gauge groups on the low-energy effective gauge theory. Such effects arise when some of the instantons of the original gauge group G are no longer contained in (or can not be gauge…
Many recent tensor network algorithms apply unitary operators to parts of a tensor network in order to reduce entanglement. However, many of the previously used iterative algorithms to minimize entanglement can be slow. We introduce an…
We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather…
We develop an instanton approach to the non-equilibrium dynamics in one-dimensional random environments. The long time behavior is controlled by rare fluctuations of the disorder potential and, accordingly, by the tail of the distribution…
In this paper, we consider the problem of minimizing the multicast decoding delay of generalized instantly decodable network coding (G-IDNC) over persistent forward and feedback erasure channels with feedback intermittence. In such an…
We generate a random instanton vacuum with various densities and size distributions. We perform numerically the maximally abelian gauge fixing of these configurations in order to find monopole trajectories induced by instantons. We find…
This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple auxiliary costs is introduced, and is shown to achieve error…
A fully general strong converse for channel coding states that when the rate of sending classical information exceeds the capacity of a quantum channel, the probability of correctly decoding goes to zero exponentially in the number of…
This report is about contradiction between fidelity needed to determine the entanglement and concomitant noise that always accompanies precise measurement. Account of quantum properties of field leads to additional noise caused by multiple…
Instanton crystal is a fascinating phase which is encountered when the minimum of the free energy corresponds to a configuration with an imaginary-time-dependent order parameter in the form of a chain of alternating instantons and…