Related papers: Cube vs. Cube Low Degree Test
Let $f: T\to \{ 0,1 \}$ be a Boolean function on the Boolean half-slice, $T$, \ie elements of $\{0,1\}^n$ with Hamming weight $n/2$. We show that if $f(x)+f(y)=f(x+y)$ holds with probability $\frac{1+\delta}{2}$ over a uniform pair $(x,y)$…
The min-cost matching problem suffers from being very sensitive to small changes of the input. Even in a simple setting, e.g., when the costs come from the metric on the line, adding two nodes to the input might change the optimal solution…
Coherent errors are a dominant noise process in many quantum computing architectures. Unlike stochastic errors, these errors can combine constructively and grow into highly detrimental overrotations. To combat this, we introduce a simple…
Designing robust algorithms capable of training accurate neural networks on uncurated datasets from the web has been the subject of much research as it reduces the need for time consuming human labor. The focus of many previous research…
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 show the usability of the Gray code with constant weight words for computing linear combinations of codewords. This can lead to a big improvement of the computation time for finding the minimum distance of a code. We have…
Finding the global minimum of non-convex functions is one of the main and most difficult problems in modern optimization. In the first part of the paper, we consider a certain class of "good" non-convex functions that can be bounded above…
We study a model where two opposing provers debate over the membership status of a given string in a language, trying to convince a weak verifier whose coins are visible to all. We show that the incorporation of just two qubits to an…
The Positivstellens\"atze of Putinar and Schm\"udgen show that any polynomial $f$ positive on a compact semialgebraic set can be represented using sums of squares. Recently, there has been large interest in proving effective versions of…
The verification of reductions, representative subsets of interleavings, simplifies correctness proofs of parameterized concurrent programs. We introduce an expressive class of syntactic reductions, which we call natural reductions. Natural…
This paper presents a reproducible comparison of cubic and radial basis function (RBF) interpolants for multivariate surface analysis. To eliminate evaluation bias, both methods are assessed under a unified slice-wise train/test protocol on…
Many problems in interprocedural program analysis can be modeled as the context-free language (CFL) reachability problem on graphs and can be solved in cubic time. Despite years of efforts, there are no known truly sub-cubic algorithms for…
We demonstrate an implementation of the precise test of dimension on the qubit, using the public IBM quantum computer, using the determinant dimension witness. The accuracy is below $10^{-3}$ comparing to maximal possible value of the…
We consider the problem of testing hypotheses on the copula density from $n$ bi-dimensional observations. We wish to test the null hypothesis characterized by a parametric class against a composite nonparametric alternative. Each density…
The relationship according to which one physical theory encompasses the domain of empirical validity of another is widely known as "reduction." Here it is argued that one popular methodology for showing that one theory reduces to another,…
We find extremely general classes of nonsmooth open sets which guarantee Mosco convergence for corresponding Sobolev spaces and the validity of Sobolev inequalities with a uniform constant. An important feature of our results is that the…
A theorem is proved concerning approximation of analytic functions by multivariate polynomials in the $s$-dimensional hypercube. The geometric convergence rate is determined not by the usual notion of degree of a multivariate polynomial,…
We consider the goodness-of-fit testing problem of distinguishing whether the data are drawn from a specified distribution, versus a composite alternative separated from the null in the total variation metric. In the discrete case, we…
The task of state discrimination for a set of mutually orthogonal pure states is trivial if one has access to the corresponding sharp (projection-valued) measurement, but what if we are restricted to an unsharp measurement? Given that any…
Most state-of-the-art satisfiability algorithms today are variants of the DPLL procedure augmented with clause learning. The main bottleneck for such algorithms, other than the obvious one of time, is the amount of memory used. In the field…