Related papers: Concurrence of Stochastic 1-Qubit Maps
We study a seller who sells a single good to multiple bidders with uncertainty over the joint distribution of bidders' valuations, as well as bidders' higher-order beliefs about their opponents. The seller only knows the (possibly…
The problem of the relationship between entanglement and two-qubit systems in which it is embedded is central to the quantum information theory. This paper suggests that the concurrence hierarchy as an entanglement measure provides an…
We introduce a new positive linear map for a single qubit. This map is a decay only in populations of a single-qubit density operator. It is shown that an n-fold product of this map may be used for a detection of n-partite inseparability of…
The problem of minimizing convex functionals of probability distributions is solved under the assumption that the density of every distribution is bounded from above and below. A system of sufficient and necessary first-order optimality…
Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of non-linear overlap cost that penalizes congestion. Routing becomes increasingly more difficult as the number of selected…
We present the probability preserving description of the decaying particle within the framework of quantum mechanics of open systems taking into account the superselection rule prohibiting the superposition of the particle and vacuum. In…
We consider the problem of computing optimal linear control policies for linear systems in finite-horizon. The states and the inputs are required to remain inside pre-specified safety sets at all times despite unknown disturbances. In this…
We consider shape optimization problems for elasticity systems in architecture. A typical question in this context is to identify a structure of maximal stability close to an initially proposed one. We show the existence of such an…
We prove that for two-marginal optimal transport with Coulomb cost, the optimal map is a $C^{1,\alpha}$ diffeomorphism outside a closed set of Lebesgue measure zero provided the marginals are $\alpha$-H\"older continuous and bounded away…
This paper explores recent progress related to constraint maps. Building on the exposition in [14], our goal is to provide a clear and accessible account of some of the more intricate arguments behind the main results in this work. Along…
A geometrical characterization of robustly separable (that is, remaining separable under sufficiently small variiations) mixed states of a bipartite quantum system is given. It is shown that the density matrix of any such state can be…
We study the competition between two different topological orders in three dimensions by considering the X-cube model and the three-dimensional toric code. The corresponding Hamiltonian can be decomposed into two commuting parts, one of…
This paper improves the algorithms based on supporting halfspaces and quadratic programming for convex set intersection problems in our earlier paper in several directions. First, we give conditions so that much smaller quadratic programs…
We propose and investigate a method to optimize recurrence entanglement purification protocols. The approach is based on a numerical search in the whole set of SU(4) matrices with the aid of a quasi-Newton algorithm. Our method evaluates…
We study dense packings of a large number of congruent non-overlapping circles inside a square by looking for configurations which maximize the packing density, defined as the ratio between the area occupied by the disks and the area of the…
Across diverse synthetic and real-world interaction graphs, the variational landscapes of reduced Quantum Approximate Optimization Algorithm (QAOA) instances obtained via variable freezing exhibit a robust universality. Leveraging this…
We develop a system-theoretic framework for the structured analysis of distributed optimization algorithms with decomposable cost functions. We model such algorithms as a network of interacting dynamical systems and derive tests for…
We study the inverse problem of inferring the state of a finite-level quantum system from expected values of a fixed set of observables, by maximizing a continuous ranking function. We have proved earlier that the maximum-entropy inference…
Rank-constrained optimization problems have received an increasing intensity of interest recently, because many optimization problems in communications and signal processing applications can be cast into a rank-constrained optimization…
We study reliable quantum information processing (QIP) under two different types of environment. First type is Markovian exponential decay, and the appropriate elementary strategy of protection of qubit is to apply fast gates. The second…