Related papers: Asymmetric quantum codes on non-orientable surface…
A method is suggested for construction of quadrangulations of the closed orientable surface with given genus g and either (1) with given chromatic number or (2) with given order allowed by the genus g. In particular, N. Hartsfield and G.…
The surface code is a promising candidate for fault-tolerant quantum computation, achieving a high threshold error rate with nearest-neighbor gates in two spatial dimensions. Here, through a series of numerical simulations, we investigate…
Quasi-one-dimensional quantum structures with spectra scaling faster than the square of the eigenmode number (superscaling) can generate intrinsic, off-resonant optical nonlinearities near the fundamental physical limits, independent of the…
In the present paper, we show that if the dimension of an arbitrary algebraic geometry code over a finite field of even characters is slightly less than half of its length, then it is equivalent to an Euclidean self-orthogonal code.…
A translation surface in the Heisenberg group is constructed as the product of two planar curves. We classify a type of such surfaces with vanishing intrinsic curvature by analyzing the determinant of their Gauss map
Self-orthogonal codes are a significant class of linear codes in coding theory and have attracted a lot of attention. In \cite{HLL2023Te,LH2023Se}, $p$-ary self-orthogonal codes were constructed by using $p$-ary weakly regular bent…
In this article we describe an algorithm that can be applied for the generation of various classes of maps on orientable surfaces. It uses existing generators for abstract graphs and combines them with an efficient embedding and isomorphism…
Let C be a curve (possibly non reduced or reducible) lying on a smooth algebraic surface. We show that the canonical ring R(C, \omega_C) is generated in degree 1 if C is numerically 4-connected, not hyperelliptic and even (i.e. with K_C of…
We formulate a tropical analogue of Grothendieck's section conjecture: that for every stable graph G of genus g>2, and every field k, the generic curve with reduction type G over k satisfies the section conjecture. We prove many cases of…
We present a comprehensive and self-contained simplified review of the quantum computing scheme of Phys. Rev. Lett. 98, 190504 (2007), which features a 2-D nearest neighbor coupled lattice of qubits, a threshold error rate approaching 1%,…
We construct nontrivial homomorphisms from the quasi group of some cubic surfaces over $\bbF_{\!p}$ into a group. We show experimentally that the homomorphisms constructed are the only possible ones and that there are no nontrivial…
Based on cyclic and consta-cyclic simplex codes, a new explicit construction of a family of two-weight codes is presented. These two-weight codes obtained are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based on…
We study the set of isomorphism classes of principal polarizations on abelian varieties of GL2-type. As applications of our results, we construct examples of curves C, C'/\Q of genus two which are nonisomorphic over \bar \Q and share…
In this paper, we construct quantum synchronizable codes (QSCs) based on the sum and intersection of cyclic codes. Further, infinite families of QSCs are obtained from BCH and duadic codes. Moreover, we show that the work of…
We propose and analyze a hierarchical quantum error correction (QEC) scheme that concatenates hypergraph product (HGP) codes with rotated surface codes, which is compatible with quantum computers with only nearest-neighbor interactions. The…
We show that the gapless boundary signatures - namely, chiral/helical hinge modes or localized zero modes - of three-dimensional higher-order topological insulators and superconductors with inversion symmetry can be gapped without symmetry…
In this paper, we prove that the Accola-Maclachlan surface of genus $g$ bounds geometrically an orientable compact hyperbolic $3$-manifold for every genus. For infinitely many genera, this is an explicit example of non-arithmetic surface…
We adapt linear programming methods from sphere packings to closed hyperbolic surfaces and obtain new upper bounds on their systole, their kissing number, the first positive eigenvalue of their Laplacian, the multiplicity of their first…
The surface code is one the most promising alternatives for implementing fault-tolerant, large-scale quantum information processing. Its high threshold for single-qubit errors under stochastic noise is one of its most attrative features. We…
We introduce in this article a new method to estimate the minimum distance of codes from algebraic surfaces. This lower bound is generic, i.e. can be applied to any surface, and turns out to be ``liftable'' under finite morphisms, paving…