Related papers: Quasi-Cross Lattice Tilings with Applications to F…
In this work we calculate the renormalization of counterterms which arise in the lattice action of $N = 1$ Supersymmetric QCD (SQCD). In particular, the fine-tunings for quartic couplings are studied in detail through both continuum and…
A flag is a sequence of nested subspaces of a given ambient space F_q^n over a finite field F_q. In network coding, a flag code is a set of flags, all of them with the same sequence of dimensions, the type vector. In this paper, we…
This paper studies the problem of constructing codes correcting deletions in arrays. Under this model, it is assumed that an $n\times n$ array can experience deletions of rows and columns. These deletion errors are referred to as…
Quantum error correction (QEC) and fault-tolerant (FT) mechanisms are essential for reliable quantum computing. However, QEC considerably increases the computation size up to four orders of magnitude. Moreover, FT implementation has…
We introduce the class of partition-balanced families of codes, and show how to exploit their combinatorial invariants to obtain upper and lower bounds on the number of codes that have a prescribed property. In particular, we derive precise…
In this paper, we propose a general construction of linear perfect codes over infinite skew fields and quasi skew fields with right (left) unity. A complete classification of such codes over associative skew fields is given. Since the…
Asymmetric quantum error-correcting codes are quantum codes defined over biased quantum channels: qubit-flip and phase-shift errors may have equal or different probabilities. The code construction is the Calderbank-Shor-Steane construction…
All approaches currently used to study finite baryon density lattice QCD suffer from uncontrolled systematic uncertainties in addition to the well-known sign problem. We formulate and test an algorithm, sign reweighting, that works directly…
In this paper, we study the lattice properties of posets of torsion pairs in the module category of a family of representation-finite gentle algebras called tiling algebras, introduced by Coelho Simoes and Parsons. We present a…
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding and encoded Hilbert spaces. However, this bound only applies…
There exists an exact relationship between the quasi-exactly solvable problems of quantum mechanics and models of square and rectangular random complex matrices. This relationship enables one to reduce the problem of constructing…
In [1], K\"otter and Kschischang presented a new model for error correcting codes in network coding. The alphabet in this model is the subspace lattice of a given vector space, a code is a subset of this lattice and the used metric on this…
Asymmetric quantum error-correcting codes (AQCs) may offer some advantage over their symmetric counterparts by providing better error-correction for the more frequent error types. The well-known CSS construction of $q$-ary AQCs is extended…
A (q,k,t)-design matrix is an m x n matrix whose pattern of zeros/non-zeros satisfies the following design-like condition: each row has at most q non-zeros, each column has at least k non-zeros and the supports of every two columns…
In this paper we study a special type of quasi-cyclic (QC) codes called skew QC codes. This set of codes is constructed using a non-commutative ring called the skew polynomial rings $F[x;\theta ]$. After a brief description of the skew…
Finite-density QCD is difficult to study numerically because of the sign problem. We prove that, in a certain region of the phase diagram, the phase quenched approximation is exact to O(Nf/Nc). It is true for any physical observables. We…
In this thesis we present several results in coding theory, concerning error-correcting codes and the Shannon capacity. 1. We give a general symmetry reduction of matrices occuring in semidefinite programs in coding theory. 2. We apply the…
Practical applications of quantum computing depend on fault-tolerant devices that employ error correction. A promising quantum error-correcting code for large-scale quantum computing is the surface code. For this code, Fault-Tolerant…
The laws of quantum-critical scaling theory of quantum fidelity, dependent on the underlying system dimensionality $D$, have so far been verified in exactly solvable $1D$ models, belonging to or equivalent to interacting, quadratic…
We compute lattice correlation functions for the model of critical dense polymers on a semi-infinite cylinder of perimeter $n$. In the lattice loop model, contractible loops have a vanishing fugacity whereas non-contractible loops have a…