相关论文: On the Scalability of Quasi-Complementary Sequence…

Efficient and scalable non-parametric or semi-parametric regression analysis and density estimation are of crucial importance to the fields of statistics and machine learning. However, available methods are limited in their ability to…

Quasiperiodicity in strings was introduced almost 30 years ago as an extension of string periodicity. The basic notions of quasiperiodicity are cover and seed. A cover of a text $T$ is a string whose occurrences in $T$ cover all positions…

We review the quantum spectral curve (QSC) formalism for anomalous dimensions of planar ${\cal\ N}=4$ SYM, including its $\gamma$-deformation. Leaving aside its derivation, we concentrate on formulation of the "final product" in its most…

We study complementary information set codes of length $tn$ and dimension $n$ of order $t$ called ($t-$CIS code for short). Quasi-cyclic and quasi-twisted $t$-CIS codes are enumerated by using their concatenated structure. Asymptotic…

Families of "asymptotically regular" LDPC block code ensembles can be formed by terminating (J,K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles…

The aim of this paper is to present a streamlined and fully three-dimensional version of the quasicontinuum (QC) theory of Tadmor et al. and to analyze its accuracy and convergence characteristics. Specifically, we assess the effect of the…

Let $C$ be a $(n,q^{2k},n-k+1)_{q^2}$ additive MDS code which is linear over ${\mathbb F}_q$. We prove that if $n \geqslant q+k$ and $k+1$ of the projections of $C$ are linear over ${\mathbb F}_{q^2}$ then $C$ is linear over ${\mathbb…

The Quantum Max Cut (QMC) problem has emerged as a test-problem for designing approximation algorithms for local Hamiltonian problems. In this paper we attack this problem using the algebraic structure of QMC, in particular the relationship…

Errors are inevitable during all kinds quantum informational tasks and quantum error-correcting codes (QECCs) are powerful tools to fight various quantum noises. For standard QECCs physical systems have the same number of energy levels.…

Capacity scaling laws are analyzed in an underwater acoustic network with $n$ regularly located nodes on a square, in which both bandwidth and received signal power can be limited significantly. A narrow-band model is assumed where the…

We propose a new scalable platform for quantum computing (QC) -- an array of optically trapped symmetric-top molecules (STMs) of the alkaline earth monomethoxide (MOCH$_3$) family. Individual STMs form qubits, and the system is readily…

In this paper, we study convergence rates of the cubic regularized proximal quasi-Newton method (\csr) for solving non-smooth additive composite problems that satisfy the so-called Kurdyka-\L ojasiewicz (K\L ) property with respect to some…

We present in detail a new systematic method which can be used to automatically eliminate the renormalization scheme and scale ambiguities in perturbative QCD predictions at all orders. We show that all of the nonconformal \beta-dependent…

In a theory with linear confinement, such as QCD, the masses squared m^2 of mesons with high spin S or high radial excitation number n are expected, from semiclassical arguments, to grow linearly with S and n. We show that this behavior can…

This article provides an overview of some interfaces between the theory of quasi-Monte Carlo (QMC) methods and applications. We summarize three QMC theoretical settings: first order QMC methods in the unit cube $[0,1]^s$ and in…

A linear code with parameters $[n, k, n-k+1]$ is called a maximum distance separable (MDS for short) code. A linear code with parameters $[n, k, n-k]$ is said to be almost maximum distance separable (AMDS for short). A linear code is said…

The study of subblock-constrained codes has recently gained attention due to their application in diverse fields. We present bounds on the size and asymptotic rate for two classes of subblock-constrained codes. The first class is binary…

This work concerns the local convergence theory of Newton and quasi-Newton methods for convex-composite optimization: minimize f(x):=h(c(x)), where h is an infinite-valued proper convex function and c is C^2-smooth. We focus on the case…

Hybrid quantum-classical algorithms have begun to leverage quantum devices to efficiently represent many-electron wavefunctions, enabling early demonstrations of molecular simulations on real hardware. A key prerequisite for scalable…

We provide explicit expressions for quadrature rules on the space of $C^1$ cubic splines with non-uniform, symmetrically stretched knot sequences. The quadrature nodes and weights are derived via an explicit recursion that avoids an…