Related papers: Finding and investigating exact spherical codes
The purpose of this paper is two-fold. First, we characterize the existence of binary self-orthogonal codes meeting the Griesmer bound by employing Solomon-Stiffler codes and some related residual codes. Second, using such a…
We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by…
The purpose of this paper is the formal verification of a counterexample of Santos et al. to the so-called Hirsch Conjecture on the diameter of polytopes (bounded convex polyhedra). In contrast with the pen-and-paper proof, our approach is…
From a theoretical point of view, finding the solution set of a system of inequalities in only two variables is easy. However, if we want to get rigorous bounds on this set with floating point arithmetic, in all possible cases, then things…
Here we study an efficient algorithm for decoding the topological codes. It is based on a simple principle, which should allow straightforward generalization to complex decoding problems. It is benchmarked with the planar code for both…
For several decades the dominant techniques for integer linear programming have been branching and cutting planes. Recently, several authors have developed core point methods for solving symmetric integer linear programs (ILPs). An integer…
We give some new explicit examples of putatively optimal projective spherical designs. i.e., ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in…
Recently, a new algorithm to test equivalence of two cyclic codes has been introduced which is efficient and produced useful results. In this work, we generalize this algorithm to constacyclic codes. As an application of the algorithm we…
When a logical qubit is protected using a quantum error-correcting code, the net effect of coding, decoherence (a physical channel acting on qubits in the codeword) and recovery can be represented exactly by an effective channel acting…
A spherical two-distance set is a finite collection of unit vectors in $\reals^n$ such that the set of distances between any two distinct vectors has cardinality two. We use the semidefinite programming method to compute improved estimates…
The surface code is a powerful quantum error correcting code that can be defined on a 2-D square lattice of qubits with only nearest neighbor interactions. Syndrome and data qubits form a checkerboard pattern. Information about errors is…
In this paper, we examine algebraic geometric (AG) codes associated with curves generated by separated polynomials, and we create AG codes and quantum stabilizer codes from these curves by varying their parameters. Our research involves a…
Subspace codes form the appropriate mathematical setting for investigating the Koetter-Kschischang model of fault-tolerant network coding. The Main Problem of Subspace Coding asks for the determination of a subspace code of maximum size…
A (smooth) embedding of a closed curve on the plane with finitely many intersections is said to be generic if each point of self-intersection is crossed exactly twice and at non-tangent angles. A finite word $\omega$ where each character…
We present a scalable framework for accurately modeling many-body interactions in surface-code quantum processor units (QPUs). Combining a concise diagrammatic formalism with high-precision numerical methods, our approach efficiently…
Cooperative optimization is a new way for finding global optima of complicated functions of many variables. It has some important properties not possessed by any conventional optimization methods. It has been successfully applied in solving…
A rapid algorithm is derived for the Helmholtz--Hodge decomposition on the surface of the sphere in spherical coordinates. The algorithm uncouples modes of spherical harmonics with different absolute order, writes the conversion as…
This survey discusses recent developments in the context of spherical designs and minimal energy point configurations on spheres. The recent solution of the long standing problem of the existence of spherical $t$-designs on $\mathbb{S}^d$…
We present a new decoding algorithm based on error locating pairs and correcting an amount of errors exceeding half the minimum distance. When applied to Reed--Solomon or algebraic geometry codes, the algorithm is a reformulation of the…
The distance of a stabilizer quantum code is a very important feature since it determines the number of errors that can be detected and corrected. We present three new fast algorithms and implementations for computing the symplectic…