相关论文: Comments on "Best conventional solutions to the Ki…
We investigate several problems in entanglement theory from the perspective of convex optimization. This list of problems comprises (A) the decision whether a state is multi-party entangled, (B) the minimization of expectation values of…
Optimization seeks extremal points in a function. When there are superextensively many optima, optimization algorithms are liable to get stuck. Under these conditions, generic algorithms tend to find marginal optima, which have many nearly…
In this article we study the expected rank problem under full information. Our approach uses the planar Poisson approach from Gnedin (2007) to derive the expected rank of a stopping rule that is one of the simplest non-trivial examples…
We introduce a new entanglement measure based on optimal entanglement witness. First of all, we show that the entanglement measure satisfies some necessary properties, including zero entanglements for all separable states, convexity,…
This article develops a solution for an inverse problem through the generalized method of lines. We consider a Laplace equation on a domain with internal and external boundaries with standard Dirichlet boundary conditions. Also, we specify…
We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In…
We study the problem of heavy-tailed mean estimation in settings where the variance of the data-generating distribution does not exist. Concretely, given a sample $\mathbf{X} = \{X_i\}_{i = 1}^n$ from a distribution $\mathcal{D}$ over…
The peaceable queens problem asks to determine the maximum number $a(n)$ such that there is a placement of $a(n)$ white queens and $a(n)$ black queens on an $n \times n$ chessboard so that no queen can capture any queen of the opposite…
This paper studies the minimal conditions under which we can establish asymptotic formulae for Waring's problem and other additive problems that may be tackled by the circle method. We confirm in quantitative terms the well-known heuristic…
What is the relationship between plausibility logic and the principle of maximum entropy? When does the principle give unreasonable or wrong results? When is it appropriate to use the rule `expectation = average'? Can plausibility logic…
Finite geometry is used to underpin finite, $d^2$, dimensional Hilbert space accommodating two particles, d dimensional each. d=prime $\ne2$. Central role is allotted to states with mutual unbiased bases (MUB) labelling underpinned with…
We prove a conjecture by Bravyi on an upper bound on entanglement rates of local Hamiltonians. We then use this bound to prove the stability of the area law for the entanglement entropy of quantum spin systems under adiabatic and…
The goal of this paper is to relax convexity assumption on some classical results in mean curvature flow. In the first half of the paper, we prove a generalized version of Hamilton's differential Harnack inequality which holds for mean…
We investigate the problem of enhancement of mutual information by encoding classical data into entangled input states of arbitrary length and show that while there is a threshold memory or correlation parameter beyond which entangled…
We consider the problem of computing optimal policies in average-reward Markov decision processes. This classical problem can be formulated as a linear program directly amenable to saddle-point optimization methods, albeit with a number of…
We investigate the average bipartite entanglement, over all possible divisions of a multipartite system, as a useful measure of multipartite entanglement. We expose a connection between such measures and quantum-error-correcting codes by…
R. P. Stanley proved the Upper Bound Conjecture in 1975. We imitate his proof for the Ehrhart rings. We give some upper bounds for the volume of integrally closed lattice polytopes. We derive some inequalities for the delta-vector of…
A general form of the Lions-Magenes theorems on solvability of an elliptic boundary-value problem in the spaces of nonregular distributions is proved. We find a general condition on the space of right-hand sides of the elliptic equation…
One method to determine whether or not a system of partial differential equations is consistent is to attempt to construct a solution using merely the "algebraic data" associated to the system. In technical terms, this translates to the…
Let $X_1,\ldots,X_n$ be independent identically distributed random vectors in $\mathbb{R}^d$. We consider upper bounds on $\max_x \mathbb{P}(a_1X_1+\cdots+a_nX_n=x)$ under various restrictions on $X_i$ and the weights $a_i$. When…