Related papers: A Computer Search for N1L-Configurations
The stabilization of a quantum computer by repeated error correction can be reduced almost entirely to repeated preparation of blocks of qubits in quantum codeword states. These are multi-particle entangled states with a high degree of…
For processes involving structure functions and/or fragmentation functions, arguments that, over a range of a proper kinematic variable, there is a part that dominates the next-to-leading order (NLO) corrections are briefly reviewed. The…
In an increasing number of applications designers have access to multiple computer models which typically have different levels of fidelity and cost. Traditionally, designers calibrate these models one at a time against some high-fidelity…
We construct explicitly two infinite families of genuine nonadditive 1-error correcting quantum codes and prove that their coding subspaces are 50% larger than those of the optimal stabilizer codes of the same parameters via the linear…
This study presents incremental correction methods for refining neural network parameters or control functions entering into a continuous-time dynamic system to achieve improved solution accuracy in satisfying the interim point constraints…
The initial remarks in this technical report are primarily for those not familiar with the properties of L1 approximation, but the remainder of the report should also interest readers who are already acquainted with the inner workings of L1…
We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code ensemble, the linear programming decoder of Feldman et al. succeeds in…
In computing, spell checking is the process of detecting and sometimes providing spelling suggestions for incorrectly spelled words in a text. Basically, a spell checker is a computer program that uses a dictionary of words to perform spell…
Error-correcting codes are usually envisioned to counter errors by operating unitary corrections depending on the projective measurement results of some syndrome observables. We here propose a way to use them in a more integrated way, where…
Detectability of failures of linear programming (LP) decoding and its potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the LP problem. In this paper, we make a…
In this paper, we introduce CDL, a software library designed for the analysis of permutations and linear orders subject to various structural restrictions. Prominent examples of these restrictions include pattern avoidance, a topic of…
Various natural language processing tasks are structured prediction problems where outputs are constructed with multiple interdependent decisions. Past work has shown that domain knowledge, framed as constraints over the output space, can…
Recently, network error correction coding (NEC) has been studied extensively. Several bounds in classical coding theory have been extended to network error correction coding, especially the Singleton bound. In this paper, following the…
This paper introduces a framework of parametric descriptive directional types for constraint logic programming (CLP). It proposes a method for locating type errors in CLP programs and presents a prototype debugging tool. The main technique…
In this paper we formulate the problem of packing unequal rectangles/squares into a fixed size circular container as a mixed-integer nonlinear program. Here we pack rectangles so as to maximise some objective (e.g. maximise the number of…
Gallager-type error-correcting codes that nearly saturate Shannon's bound are constructed using insight gained from mapping the problem onto that of an Ising spin system. The performance of the suggested codes is evaluated for different…
We investigate the performance of a quantum error-correcting code when pushed beyond its intended capacity to protect information against errors, presenting formulae for the probability of failure when the errors affect more qudits than…
We develop a point of view on reduction of multiplicative proof nets based on quantum error-correcting codes. To each proof net we associate a code, in such a way that cut-elimination corresponds to error correction.
We derive necessary and sufficient conditions for the approximate correctability of a quantum code, generalizing the Knill-Laflamme conditions for exact error correction. Our measure of success of the recovery operation is the worst-case…
In this paper we present several constructions to generate codes for correcting a multidimensional cluster-error. The goal is to correct a cluster-error whose shape can be a box-error, a Lee sphere error, or an error with an arbitrary…