Related papers: On Self-Dual Quantum Codes, Graphs, and Boolean Fu…
The Bonami-Beckner hypercontractive inequality is a powerful tool in Fourier analysis of real-valued functions on the Boolean cube. In this paper we present a version of this inequality for matrix-valued functions on the Boolean cube. Its…
In the degree-diameter problem for Abelian Cayley and circulant graphs of diameter 2 and arbitrary degree d there is a wide gap between the best lower and upper bounds valid for all d, being quadratic functions with leading coefficient 1/4…
Binary linear codes are constructed from graphs, in particular, by the generator matrix $[I_n|A]$ where $A$ is the adjacency matrix of a graph on $n$ vertices. A combinatorial interpretation of the minimum distance of such codes is given.…
The additive codes may have better parameters than linear codes. However, it is still a challenging problem to efficiently construct additive codes that outperform linear codes, especially those with greater distances than linear codes of…
The dodecacode is a nonlinear additive quaternary code of length $12$. By puncturing it at any of the twelve coordinates, we obtain a uniformly packed code of distance $5$. In particular, this latter code is completely regular but not…
In this paper, we consider the unit graph $G(\mathbb{Z}_{n})$, where $n=p_{1}^{n_{1}} \text{ or } p_{1}^{n_{1}}p_{2}^{n_{2}} \text{ or } p_{1}^{n_{1}}p_{2}^{n_{2}}p_{3}^{n_{3}}$ and $p_{1}, p_{2}, p_{3}$ are distinct primes. For any prime…
In this work, we generalize the recently-introduced graph composition framework to the non-boolean setting. A quantum algorithm in this framework is represented by a hypergraph, where each hyperedge is adjacent to multiple vertices. The…
This is an expository article aiming to introduce the reader to the underlying mathematics and geometry of quantum error correction. Information stored on quantum particles is subject to noise and interference from the environment. Quantum…
We introduce quantum association schemes. This allows to define distance regular and strongly regular quantum graphs. We bring examples thereof. In addition, we formulate the duality for translation quantum association schemes corresponding…
A blocking quadruple (BQ) is a quadruple of vertices of a graph such that any two vertices of the quadruple either miss (have no neighbours on) some path connecting the remaining two vertices of the quadruple, or are connected by some path…
Quantum computing (QC) promises theoretical advantages, benefiting computational problems that would not be efficiently classically simulatable. However, much of this theoretical speedup depends on the quantum circuit design solving the…
We present sparse graph codes appropriate for use in quantum error-correction. Quantum error-correcting codes based on sparse graphs are of interest for three reasons. First, the best codes currently known for classical channels are based…
Quantum Error-Correcting Codes (QECCs) play a crucial role in enhancing the robustness of quantum computing and communication systems against errors. Within the realm of QECCs, stabilizer codes, and specifically graph codes, stand out for…
The discovery of holographic codes established a surprising connection between quantum error correction and the anti-de Sitter-conformal field theory correspondence. Recent technological progress in artificial quantum systems renders the…
Calderbank, Rains, Shor and Sloane (see \cite{Sloane}) showed that error-correction is possible in the context of quantum computations. Quantum stabilizer codes are a class of additive quaternary codes in binary projective spaces, which are…
One of the main objectives of quantum error-correction theory is to construct quantum codes with optimal parameters and properties. In this paper, we propose a class of 2-generator quasi-cyclic codes and study their applications in the…
The following open problems, which concern a fundamental limit on coding properties of quantum codes with realistic physical constraints, are analyzed and partially answered here: (a) the upper bound on code distances of quantum…
We study quantum analogs of graph colorings and chromatic number. Initially defined via an interactive protocol, quantum colorings can also be viewed as a natural operator relaxation of graph coloring. Since there is no known algorithm for…
This paper considers minimum-dimensional representations of graphs in pseudo-Euclidean spaces, where adjacency and non-adjacency relations are reflected in fixed scalar square values. A representation of a simple graph $(V,E)$ is a mapping…
Pseudo-random arrays and perfect maps are the two-dimensional analogs of M-sequences and de Bruijn sequences, respectively. We modify the definitions to be applied to codes. These codes are also the two-dimensional analogs of certain…