Related papers: Relative hulls and quantum codes
In this paper we prove new lower bounds for the maximal size of permutation codes by connecting the theory of permutation codes with the theory of linear block codes. More specifically, using the columns of a parity check matrix of an…
In this letter we consider the ensemble of codes formed by the serial concatenation of a Hamming code and two accumulate codes. We show that this ensemble is asymptotically good, in the sense that most codes in the ensemble have minimum…
Motivated by entanglement-assisted quantum error-correcting codes, where the hull dimension determines the number of required pre-shared entangled pairs, we study hulls of two families of $\mathbb{F}_q$-linear codes defined by…
We evaluate the quantum corrections of the Einstein-Hilbert action with boundaries in the $2+\epsilon$ dimensional expansion approach. We find the Einstein-Hilbert action with boundaries to be renormalizable to the one loop order. We…
In this paper, we study the Hermitian hulls of generalized Reed-Solomon (GRS) codes over finite fields. For a given class of GRS codes, by extending the length, increasing the dimension, and extending the length and increasing the dimension…
The breakthrough of quantum error correction brought with it the picture of quantum information as a sort of combination of two complementary types of classical information, "amplitude" and "phase". Here I show how this intuition can be…
In this work, we study and determine the dimensions of Euclidean and Hermitian hulls of two classical propagation rules, namely, the direct sum construction and the $(\mathbf{u},\mathbf{u+v})$-construction. Some new criteria for the…
The geometric measure, the logarithmic robustness and the relative entropy of entanglement are proved to be equal for a stabilizer quantum codeword. The entanglement upper and lower bounds are determined with the generators of code. The…
We consider the problem of digitalizing Euclidean segments. Specifically, we look for a constructive method to connect any two points in $\mathbb{Z}^d$. The construction must be {\em consistent} (that is, satisfy the natural extension of…
We study entanglement entropy for regions with a singular boundary in higher dimensions using the AdS/CFT correspondence and find that various singularities make new universal contributions. When the boundary CFT has an even spacetime…
We present a logical type of proof of contextuality for a two-qubit state. We formulate a paradox that cannot be verified by a two-qubit system with local measurements while it is possible by using entanglement measurements. With our scheme…
We define the correlation of holes on the triangular lattice under periodic boundary conditions and study its asymptotics as the distances between the holes grow to infinity. We prove that the joint correlation of an arbitrary collection of…
We study an approximate version of $q$-query LDCs (Locally Decodable Codes) over the real numbers and prove lower bounds on the encoding length of such codes. A $q$-query $(\alpha,\delta)$-approximate LDC is a set $V$ of $n$ points in…
For every integer $k\geq 2$ and every $R>1$ one can find a dimension $n$ and construct a symmetric convex body $K\subset\mathbb{R}^n$ with $\text{diam}\,Q_{k-1}(K)\geq R\cdot\text{diam}\,Q_k(K)$, where $Q_k(K)$ denotes the $k$-convex hull…
We address the issue of reducing the resource required to compute information-theoretic quantum correlation measures like quantum discord and quantum work deficit in two qubits and higher dimensional systems. We show that determination of…
We first show that a class of operators acting on a given bipartite pure state on $\mathcal{H}_{A}\otimes\mathcal{H}_{B}$ can shrink its supports on $\mathcal{H}_{A}\otimes\mathcal{H}_{B}$ to only $\mathcal{H}_{A}$ or $\mathcal{H}_{B}$…
Local unitary operations allow for a unifying approach to the quantification of quantum correlations among the constituents of a bipartite quantum system. For pure states, the distance between a given state and its image under…
Known quantum error correction schemes are typically able to take advantage of only a limited class of classical error-correcting codes. Entanglement-assisted quantum error correction is a partial solution which made it possible to exploit…
We establish the existence of optimal maximal entanglement entanglement-assisted quantum $[[n,k,d;n-k]]_2$ codes for $(n,k,d)=(14,6,7)$, $(15,7,7)$, $(17,6,9)$, $(17,7,8)$, $(19,7,9)$ and $(20,7,10)$. These codes are obtained from…
For an integer $q\ge 2$, a perfect $q$-hash code $C$ is a block code over $[q]:=\{1,\ldots,q\}$ of length $n$ in which every subset $\{\mathbf{c}_1,\mathbf{c}_2,\dots,\mathbf{c}_q\}$ of $q$ elements is separated, i.e., there exists…