Related papers: Topological Subsystem Codes From Graphs and Hyperg…
We find families of graphs $G$ and subgraphs $H$ of $G$ such that the number of edge colorings of $G$ avoiding a monochromatic coloring of $H$ is determined by lattice point counts or a Hodge structure on the cohomology of a certain toric…
We provide a detailed study of the general structure of two-dimensional topological stabilizer quantum error correcting codes, including subsystem codes. Under the sole assumption of translational invariance, we show that all such codes can…
We develop a systematic algorithm for constructing an N-fold supersymmetric system from a given vector space invariant under one of the supercharges. Applying this algorithm to spaces of monomials, we construct a new multi-parameter family…
New families of unit memory as well as multi-memory convolutional codes are constructed algebraically in this paper. These convolutional codes are derived from the class of group character codes. The proposed codes have basic generator…
Color codes are a class of topological quantum codes with a high error threshold and large set of transversal encoded gates, and are thus suitable for fault tolerant quantum computation in two-dimensional architectures. Recently,…
We study the phase transition from two different topological phases to the ferromagnetic phase by focusing on points of the phase transition. To this end, we present a detailed mapping from such models to the Ising model in a transverse…
In this paper, we develop a novel paradigm, namely hypergraph shift, to find robust graph modes by probabilistic voting strategy, which are semantically sound besides the self-cohesiveness requirement in forming graph modes. Unlike the…
We give a method of constructing self-orthogonal codes from equitable partitions of association schemes. By applying this method we construct self-orthogonal codes from some distance-regular graphs. Some of the obtained codes are optimal.…
Pseudo-geometric designs are combinatorial designs which share the same parameters as a finite geometry design, but which are not isomorphic to that design. As far as we know, many pseudo-geometric designs have been constructed by the…
Computing subgraph frequencies is a fundamental task that lies at the core of several network analysis methodologies, such as network motifs and graphlet-based metrics, which have been widely used to categorize and compare networks from…
Although topological band theory has been used to discover and classify a wide array of novel topological phases in insulating and semi-metal systems, it is not well-suited to identifying topological phenomena in metallic or gapless…
We present a scalable architecture for fault-tolerant topological quantum computation using networks of voltage-controlled Majorana Cooper pair boxes, and topological color codes for error correction. Color codes have a set of transversal…
We construct locally recoverable codes with hierarchy from surfaces in $\mathbb{A}^3$ admitting a fibration by curves of Artin-Schreier or Kummer type. We derive the parameters of our codes by leveraging the geometry and arithmetic of the…
For studying topological obstructions to graph colorings, Hom-complexes were introduced by Lov\'{a}sz. A graph $T$ is called a test graph if for every graph $H$, the $k$-connectedness of $|Hom(T, H)|$ implies $\chi (H)\geq k + 1 + \chi(T)$.…
The color code is both an interesting example of an exactly solved topologically ordered phase of matter and also among the most promising candidate models to realize fault-tolerant quantum computation with minimal resource overhead. The…
There are several topological results ensuring the existence of a large complete bipartite subgraph in any properly colored graph satisfying some special topological regularity conditions. In view of $\mathbb{Z}_p$-Tucker lemma, Alishahi…
Quantum information is fragile and must be protected by a quantum error-correcting code for large-scale practical applications. Recently, highly efficient quantum codes have been discovered which require a high degree of spatial…
We present a general framework for constructing error-correcting codes using distributed graph coloring under the LOCAL model. Building on the correspondence between independent sets in the confusion graph and valid codes, we show that the…
Hypergraphs are useful mathematical models for describing complex relationships among members of a structured graph, while hyperdigraphs serve as a generalization that can encode asymmetric relationships in the data. However, obtaining…
We give a new practical method for computing subvarieties of projective hypersurfaces. By computing the periods of a given hypersurface X, we find algebraic cohomology cycles on X. On well picked algebraic cycles, we can then recover the…