Related papers: Evaluation Codes from smooth Quadric Surfaces and …
3D printing and other layer manufacturing processes are challenged by dimensional accuracy. Several techniques are used to validate and calibrate dimensional accuracy through the complete building envelope. The validation process involves…
Hypergraph product (HGP) codes are one of the most popular family of quantum low-density parity-check (LDPC) codes. Circuit-level simulations show that they can achieve the same logical error rate as surface codes with a reduced qubit…
We develop a geometrically intrinsic formulation of the arbitrary-order Virtual Element Method (VEM) on polygonal cells for the numerical solution of elliptic surface partial differential equations (PDEs). The PDE is first written in…
We study the density of everywhere locally soluble diagonal quadric surfaces, parameterised by rational points that lie on a split quadric surface.
On a real regular elliptic surface without multiple fiber, the Betti number $h_1$ and the Hodge number $h^{1,1}$ are related by $h_1\leq h^{1,1}$. We prove that it's always possible to deform such algebraic surface to obtain $h_1=h^{1,1}$.…
The surface code represents a promising candidate for fault-tolerant quantum computation due to its high error threshold and experimental accessibility with nearest-neighbor interactions. However, current exact surface code threshold…
We develop an essentially algebraic method to study biharmonic curves into an implicit surface. Although our method is rather general, it is especially suitable to study curves into surfaces defined by a polynomial equation: in particular,…
Low-density parity-check (LDPC) codes have been the subject of much interest due to the fact that they can perform near the Shannon limit. In this paper we present a construction of LDPC codes from cubic symmetric graphs. The constructed…
In this study, we define a brief description of the hyperbolic and elliptic rotational surfaces using a curve and matrices in 4-dimensional semi Euclidean space. That is, we provide different types of rotational matrices, which are the…
We nearly triple the number of logical qubits per physical qubit of surface codes in the teraquop regime by concatenating them into high-density parity check codes. These "yoked surface codes" are arrayed in a rectangular grid, with parity…
We establish a sharp geometric constant for the upper bound on the resonance counting function for surfaces with hyperbolic ends. An arbitrary metric is allowed within some compact core, and the ends may be of hyperbolic planar, funnel, or…
Let $C/K$ be a smooth plane quartic over a discrete valuation field. We characterize the type of reduction (i.e. smooth plane quartic, hyperelliptic genus 3 curve or bad) over $K$ in terms of the existence of a special plane quartic model…
We devise a new realization of the surface code on a rectangular lattice of qubits utilizing single-qubit and nearest-neighbor two-qubit Pauli measurements and three auxiliary qubits per plaquette. This realization gains substantial…
We show that a simple modification of the surface code can exhibit an enormous gain in the error correction threshold for a noise model in which Pauli Z errors occur more frequently than X or Y errors. Such biased noise, where dephasing…
The typical time-independent view of quantum error correction (QEC) codes hides significant freedom in the decomposition into circuits that are executable on hardware. Using the concept of detecting regions, we design time-dynamic QEC…
We prove that the enumerative geometry of lines on smooth cubic surfaces is governed by the arithmetic of the base field. In 1949, Segre proved that the number of lines on a smooth cubic surface over any field is 0, 1, 2, 3, 5, 7, 9, 15, or…
Linear error-correcting codes can be used for constructing secret sharing schemes; however finding in general the access structures of these secret sharing schemes and, in particular, determining efficient access structures is difficult.…
We examine homogeneous metrics on spheres and determine which ones have positive sectional curvature. The answer is subtle and surprisingly difficult to prove. In some cases we also determine their pinching constants. This completes the…
In this paper we provide some error estimates for the div least-squares finite element method on elliptic problems. The main contribution is presenting a complete error analysis, which improves the current \emph{state-of-the-art} results.…
Let k be a field of characteristic other than 2,3. We prove that there are no geometrically smooth quartic surfaces in IP^3 with more than 64 lines. As a key step, we derive the sharp bound that any line meets at most 20 other lines on a…