Related papers: Magic Boundaries of 3D Color Codes
A wide variety of intricate dynamics may be created at border-collision bifurcations of piecewise-smooth maps, where a fixed point collides with a surface at which the map is nonsmooth. For the border-collision normal form in two…
High-order topological phases host robust boundary states at the boundary of the boundary, which can be interpreted from their boundary topology. In this work, considering the interplay between superconductors and magnetic fields to gap the…
We introduce a finite-dimensional algebra that controls the possible boundary conditions of a conformal field theory. For theories that are obtained by modding out a Z_2 symmetry (corresponding to a so-called D_odd-type, or half-integer…
We study the infinite graph of $n$-dimensional rectangular grid that doesn't appear distance regular and the distance regular colorings of this graph, which are defined as the distance colorings with respect to completely regular codes. It…
An outer-1-planar graph is a graph admitting a drawing in the plane so that all vertices appear in the outer region of the drawing and every edge crosses at most one other edge. This paper establishes the local structure of outer-1-planar…
Topological domain walls separating 2+1 dimensional topologically ordered phases can be understood in terms of Witt equivalences between the UMTCs describing anyons in the bulk topological orders. However, this picture does not provide a…
We study subsystem codes whose gauge group has local generators in the 2D geometry. It is shown that there exists a family of such codes defined on lattices of size LxL with the number of logical qubits k and the minimum distance d both…
Based on the action of the mapping class group on the space of measured foliations, we construct a new boundary of the mapping class group and study the structure of this boundary. As an application, for any point in Teichmuller space, we…
The recent discovery and realizations of higher-order topological insulators enrich the fundamental studies on topological phases. Here, we report three-dimensional (3D) wave-steering capabilities enabled by topological boundary states at…
We study a graph coloring problem motivated by a fun Sudoku-style puzzle. Given a bipartition of the edges of a graph into {\em near} and {\em far} sets and an integer threshold $t$, a {\em threshold-coloring} of the graph is an assignment…
In this paper, we present a new bordered construction for self-dual codes which employs $\lambda$-circulant matrices. We give the necessary conditions for our construction to produce self-dual codes over a finite commutative Frobenius ring…
Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…
In this work, we define three composite matrices derived from group rings. We employ these composite matrices to create generator matrices of the form [In | {\Omega}(v)], where In is the identity matrix and {\Omega}(v) is a composite matrix…
Qudits offer the potential for low-overhead magic state distillation, although previous results for asymptotically good codes have required qudit dimension $q\gg 100$ or code length $\mathcal{N}\gg 100$. These parameters far exceed…
We study multiplicities and junctions of BPS domain walls interpolating between different chiral vacua in $\mathcal{N}=1$ supersymmetric QCD (SQCD) with the SU$(N)$ gauge group and a varying number of fundamental quarks. Depending on the…
Classes of self-dual codes and dual-containing codes are constructed. The codes are obtained within group rings and, using an isomorphism between group rings and matrices, equivalent codes are obtained in matrix form. Distances and other…
Tight bounds for several symmetric divergence measures are derived in terms of the total variation distance. It is shown that each of these bounds is attained by a pair of 2 or 3-element probability distributions. An application of these…
Color coding is an algorithmic technique used in parameterized complexity theory to detect "small" structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable,…
We study gapped boundaries of Abelian type-I fracton systems in three spatial dimensions. Using the X-cube model as our motivating example, we give a conjecture, with partial proof, of the conditions for a boundary to be gapped. In order to…
Historically, a $\sqrt{N}log^{1/2}(N)$ distance barrier for quantum low-density parity-check (LDPC) codes with $N$ qubits persisted for nearly two decades, until the recent discovery of the fibre-bundle code. An open question is whether…