Related papers: Numerical cubature using error-correcting codes
Cubature formulas and geometrical designs are described in terms of reproducing kernels for Hilbert spaces of functions on the one hand, and Markov operators associated to orthogonal group representations on the other hand. In this way,…
The well-known Caputo fractional derivative and the corresponding Caputo fractional integral occur naturally in many equations that model physical phenomena under inhomogeneous media. The relationship between the two fractional terms can be…
In this paper we give explicit constructions of point sets in the $s$ dimensional unit cube yielding quasi-Monte Carlo algorithms which achieve the optimal rate of convergence of the worst-case error for numerically integrating high…
There has recently been much progress on exact algorithms for the (un)weighted graph (bi)partitioning problem using branch-and-bound and related methods. In this note we present and improve an easily computable, purely combinatorial lower…
In this paper, we provide explicit constructions for a class of exact-repair regenerating codes that possess a layered structure. These regenerating codes correspond to interior points on the storage-repair-bandwidth tradeoff, and compare…
Classical BCH codes that contain their (Euclidean or Hermitian) dual codes can be used to construct quantum stabilizer codes; this correspondence studies the properties of such codes. It is shown that a BCH code of length n can contain its…
We provide convergence rates for Krylov subspace solutions to the trust-region and cubic-regularized (nonconvex) quadratic problems. Such solutions may be efficiently computed by the Lanczos method and have long been used in practice. We…
Error correcting codes with a universal set of transversal gates are a desideratum for quantum computing. Such codes, however, are ruled out by the Eastin-Knill theorem. Moreover, the theorem also rules out codes which are covariant with…
We present code constructions for masking $u$ partially stuck memory cells with $q$ levels and correcting additional random errors. The results are achieved by combining the methods for masking and error correction for stuck cells in [1]…
The method of regularized stokeslets is a powerful numerical method to solve the Stokes flow equations for problems in biological fluid mechanics. A recent variation of this method incorporates a nearest-neighbor discretization to improve…
Recently, operator quantum error-correcting codes have been proposed to unify and generalize decoherence free subspaces, noiseless subsystems, and quantum error-correcting codes. This note introduces a natural construction of such codes in…
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…
We consider a disjoint cover (partition) of an undirected weighted finite graph $G$ by $|J|$ connected subgraphs (clusters) $\{S_{j}\}_{j\in J}$ and select a function $\zeta_{j}\geq 0$ on each of the clusters. For a given signal $f$ on $G$…
Closed formulae for all Gaussian or optimal, 1-parameter quadrature rules in a compact interval [a, b] with non uniform, asymmetric subintervals, arbitrary number of nodes per subinterval for the spline classes $S_{2N, 0}$ and $S_{2N+1,…
This work develops a geometric framework for constructing quantum error-correcting codes from weighted projective and orbifold structures, integrating algebraic geometry, divisor theory, and the CSS stabilizer formalism. Beginning with…
In this paper, we introduce the cubature formula for Stochastic Volterra Integral Equations. We first derive the stochastic Taylor expansion in this setting, by utilizing a functional It\^{o} formula, and provide its tail estimates. We then…
A constant weight binary code consists of $n$-bit binary codewords, each with exactly $w$ bits equal to 1, such that any two codewords are at least Hamming distance $d$ apart. $A(n,d,w)$ is the maximum size of a constant weight binary code…
Quantum low-density parity-check codes, such as the Kitaev toric code and bivariate bicycle codes, are often defined with periodic boundary conditions, which are difficult to realize in physical systems. In this paper, we present an…
We report new construction of nine-qubit error-correcting code, which introduces two new nine-qubit codes and one new three-qubit code. Because both the new two nine-qubit codes have the normal logical operators, as opposed to the…
We explore the design of quantum error-correcting codes for cases where the decoherence events of qubits are correlated. In particular, we consider the case where only spatially contiguous qubits decohere, which is analogous to the case of…