Related papers: Construction of Rational Surfaces Yielding Good Co…

Quantum error correction is a critical technique for transitioning from noisy intermediate-scale quantum (NISQ) devices to fully fledged quantum computers. The surface code, which has a high threshold error rate, is the leading quantum…

It is a well known phenomenon that many classical minimal surfaces in Euclidean space also exist with higher dihedral symmetry. More precisely, these surfaces are solutions to free boundary problems in a wedge bounded by two vertical planes…

The ruled surfaces, i.e., surfaces generated by one parametric set of lines, are widely used in the~field of applied geometry. An~isophote on a surface is a curve consisting of surface points whose normals form a constant angle with some…

This article provides an introduction to surface code quantum computing. We first estimate the size and speed of a surface code quantum computer. We then introduce the concept of the stabilizer, using two qubits, and extend this concept to…

In this paper, we introduce curve-lifted codes over fields of arbitrary characteristic, inspired by Hermitian-lifted codes over $\mathbb{F}_{2^r}$. These codes are designed for locality and availability, and their particular parameters…

Matthews and Michel investigated the minimum distances in certain algebraic-geometry codes arising from a higher degree place $P$. In terms of the Weierstrass gap sequence at $P$, they proved a bound that gives an improvement on the…

We improve on the lower bound of the maximum number of planes of ${\rm PG}(8,q)$ mutually intersecting in at most one point leading to the following lower bound: ${\cal A}_q(9, 4; 3) \ge q^{12}+2q^8+2q^7+q^6+q^5+q^4+1$ for constant…

We provide a new construction of $[n,9,n-9]_q$ near-MDS codes arising from elliptic curves with $n$ ${\mathbb F}_q$-rational points. Furthermore we show that in some cases these codes cannot be extended to longer near-MDS codes.

In this work we use arithmetic, geometric, and combinatorial techniques to compute the cohomology of Weil divisors of a special class of normal surfaces, the so-called rational ruled toric surfaces. These computations are used to study the…

We present a method for computing projective isomorphisms between rational surfaces that are given in terms of their parametrizations. The main idea is to reduce the computation of such projective isomorphisms to five base cases by…

We describe the Hilbert scheme components parametrizing lines and conics on the space of determinantal nets of conics, N. As an application, we use the quantum Lefschetz hyperplane principle to compute the instanton numbers of rational…

The surface code is designed to suppress errors in quantum computing hardware and currently offers the most believable pathway to large-scale quantum computation. The surface code requires a 2-D array of nearest-neighbor coupled qubits that…

We study several polygonal curve problems under the Fr\'{e}chet distance via algebraic geometric methods. Let $\mathbb{X}_m^d$ and $\mathbb{X}_k^d$ be the spaces of all polygonal curves of $m$ and $k$ vertices in $\mathbb{R}^d$,…

We use rational parametrizations of certain cubic surfaces and an explicit formula for descent via 3-isogeny to construct the first examples of elliptic curves E_k: x^3 + y^3 = k of ranks 8, 9, 10, and 11 over Q. As a corollary we produce…

A classical result due to Segre states that on a real cubic surface in ${\mathbb P}^3_\R$ there exists two kinds of real lines: elliptic and hyperbolic lines. These two kinds of real lines are defined in an intrinsic way, i.e., their…

We comprehensively study weighted projective Reed-Muller (WPRM) codes on weighted projective planes $\mathbb{P}(1,a,b)$. We provide the universal Gr\"obner basis for the vanishing ideal of the set $Y$ of $\mathbb{F}_q$--rational points of…

Cyclic boundaries are used in many branches of physics and mathematics, typically to assist the approximation of a large space. We show that when determining the performance of planar, fault-tolerant, topological quantum error correction,…

We give an algorithm to decide whether an algebraic plane foliation F has a rational first integral and to compute it in the affirmative case. The algorithm runs whenever we assume the polyhedrality of the cone of curves of the surface…

Practical quantum computers will require resource-efficient error-correcting codes. The rotated surface code uses approximately half the number of qubits as the unrotated surface code to create a logical qubit with the same error-correcting…

Algebraic Geometric codes associated to a recently discovered class of maximal curves are investigated. As a result, some linear codes with better parameters with respect to the previously known ones are discovered, and 70 improvements on…