Related papers: A graph-based formalism for surface codes and twis…
The surface code is one of the most promising candidates for combating errors in large scale fault-tolerant quantum computation. A fault-tolerant decoder is a vital part of the error correction process---it is the algorithm which computes…
In this paper we introduce the notion of $\Sigma$-colouring of a graph $G$: For given subsets $\Sigma(v)$ of neighbours of $v$, for every $v\in V(G)$, this is a proper colouring of the vertices of $G$ such that, in addition, vertices that…
The entanglement properties of a class of topological stabilizer states, the so called \emph{topological color codes} defined on a two-dimensional lattice or \emph{2-colex}, are calculated. The topological entropy is used to measure the…
Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this…
The purpose of the present article is the study of duals of functional codes on algebraic surfaces. We give a direct geometrical description of them, using differentials. Even if this geometrical description is less trivial, it can be…
We introduce a twisted fiber bundle construction of quantum CSS codes over group algebras \(R=\mathbb F_2[G]\), where each base generator carries a generator-dependent \(R\)-linear fiber twist satisfying a flatness condition. This…
Surface codes are a popular choice for implementing fault-tolerant quantum computing. Two-qubit gates may be realised in these codes using only nearest-neighbour interactions, either by lattice surgery or by braiding defects around each…
We construct a cobordism group for embedded graphs in two different ways, first by using sequences of two basic operations, called "fusion" and "fission", which in terms of cobordisms correspond to the basic cobordisms obtained by attaching…
We present a systematic method for translating fault-tolerant quantum circuits between their braiding and lattice surgery (LS) representations within the surface code. Our approach employs the ZX calculus to establish an equivalence between…
The generalized Dehn twist along a closed curve in an oriented surface is an algebraic construction which involves intersections of loops in the surface. It is defined as an automorphism of the Malcev completion of the fundamental group of…
Surface roughness plays an important role in analyzing engineering surfaces. It quantifies the surface topography and can be used to determine whether the resulting surface finish is acceptable or not. Nevertheless, while several existing…
The emergence of explainability methods has enabled a better comprehension of how deep neural networks operate through concepts that are easily understood and implemented by the end user. While most explainability methods have been designed…
Lattice surgery is a measurement-based technique for performing fault-tolerant quantum computation in two dimensions. When using the surface code, the most general lattice surgery operations require lattice irregularities called twist…
In recent years, there have been many studies on local stabilizer codes. Under the assumption of translation and scale invariance Yoshida classified such codes. His result implies that translation invariant 2D color codes are equivalent to…
An economy of scale is found when storing many qubits in one highly entangled block of a topological quantum code. The code is defined by construction of a topologically convoluted 2-d surface and does not work by compressing redundancy in…
Surface codes$\unicode{x2014}$leading candidates for quantum error correction (QEC)$\unicode{x2014}$and entanglement phases$\unicode{x2014}$a key notion for many-body quantum dynamics$\unicode{x2014}$have heretofore been unrelated. Here, we…
We introduce a theoretical framework for differentiable surface evolution that allows discrete topology changes through the use of topological derivatives for variational optimization of image functionals. While prior methods for inverse…
We present STITCH, a novel approach for neural implicit surface reconstruction of a sparse and irregularly spaced point cloud while enforcing topological constraints (such as having a single connected component). We develop a new…
On one hand, we study the class of graphs on surfaces, satisfying tessellation properties, with positive Forman curvature on each edge. Via medial graphs, we provide a new proof for the finiteness of the class, and give a complete…
Deciding if a given family of quantum states is topologically ordered is an important but nontrivial problem in condensed matter physics and quantum information theory. We derive necessary and sufficient conditions for a family of graph…