Related papers: The local quantization behavior of absolutely cont…
When two players achieve a superclassical score at a nonlocal game, their outputs must contain intrinsic randomness. This fact has many useful implications for quantum cryptography. Recently it has been observed (C. Miller, Y. Shi, Quant.…
We study quantum hypothesis testing between orthogonal states under restricted local measurements in the many-copy scenario. For testing arbitrary multipartite entangled pure state against its orthogonal complement state via the local…
We consider the problem of constructing codes that can correct deletions that are localized within a certain part of the codeword that is unknown a priori. Namely, the model that we study is when at most $k$ deletions occur in a window of…
The purpose of this note is to clarify the effect of the finite size of spherical particles upon the characteristics of their spatial distribution through a random Poisson process (RPP). This information is of special interest when using…
Let $X $ be a square integrable random variable with basic probability space $(\O, \A, \P)$, taking values in a lattice $\mathcal L(v_0,1)=\big\{v_k=v_0+ k,k\in \Z\big\}$ and such that $\t_X =\sum_{k\in \Z}\P\{X=v_k\}\wedge…
We present a general framework for derandomizing random linear codes with respect to a broad class of properties, known as local properties, which encompass several standard notions such as distance, list-decoding, list-recovery, and…
We consider the energy norm arising from elliptic problems with discontinuous piecewise constant diffusion. We prove that under the quasi-monotonicity property on the diffusion coefficient, the best approximation error with continuous…
The Quantum Approximate Optimization Algorithm can naturally be applied to combinatorial search problems on graphs. The quantum circuit has p applications of a unitary operator that respects the locality of the graph. On a graph with…
Depending on the way one measures, quantum nonlocality might manifest more visibly. Using basis transformations and interactions on a particle pair, Hardy logically argued that any local hidden variable theory leads to a paradox. Extended…
A simple relativistic quantum hidden-variable theory of particle trajectories, similar to the Bohm theory but without nonlocal forces between the particles, is proposed. To provide compatibility with statistical predictions of quantum…
Quantization for probability distributions concerns the best approximation of a $d$-dimensional probability distribution $P$ by a discrete probability with a given number $n$ of supporting points. In this paper, we have considered a…
This paper develops a systematic and geometric theory of optimal quantization on the unit sphere $\mathbb S^2$, focusing on finite uniform probability distributions supported on the spherical surface - rather than on lower-dimensional…
We analyze and study the effects of locality on the fault-tolerance threshold for quantum computation. We analytically estimate how the threshold will depend on a scale parameter r which estimates the scale-up in the size of the circuit due…
Using 3D Vorono\text{\"i} analysis, we explore the local dynamics of small, settling, inertial particles in isotropic turbulence using Direct Numerical Simulations (DNS). We independently vary the Taylor Reynolds number $R_\lambda…
Let S(n) be the set of all polynomials of degree n with all roots in the unit disk, and define d(P) to be the maximum of the distances from each of the roots of a polynomial P to that root's nearest critical point. In this notation,…
Given a probability measure on a finitely generated group, the local limit problem consists in finding asymptotics of $p_n(e,e)$, the probability that the random walk at time $n$ is at the origin. We give the classification of all possible…
Our research deals with the optimization version of the set partition problem, where the objective is to minimize the absolute difference between the sums of the two disjoint partitions. Although this problem is known to be NP-hard and…
The class PLS (Polynomial Local Search) captures the complexity of finding a solution that is locally optimal and has proven to be an important concept in the theory of local search. It has been shown that local search versions of various…
One of the cornerstones of the distributed complexity theory is the derandomization result by Chang, Kopelowitz, and Pettie [FOCS 2016]: any randomized LOCAL algorithm that solves a locally checkable labeling problem (LCL) can be…
We revisit the approximate Voronoi cells approach for solving the closest vector problem with preprocessing (CVPP) on high-dimensional lattices, and settle the open problem of Doulgerakis-Laarhoven-De Weger [PQCrypto, 2019] of determining…