Related papers: Concurrence of Stochastic 1-Qubit Maps

Consider a finite system of Brownian particles on the real line. Each particle has drift and diffusion coefficients depending on its current rank relative to other particles, as in Karatzas, Pal and Shkolnikov (2012). We prove some…

In this paper first we give a partial answer to a question of L. Moln\'ar and W. Timmermann. Namely, we will describe those linear (not necessarily bijective) transformations on the set of self-adjoint matrices which preserve a unitarily…

We study classical structures in various categories of completely positive morphisms: on sets and relations, on cobordisms, on a free dagger compact category, and on Hilbert spaces. As an application, we prove that quantum maps with…

Rank and select queries on bitmaps are essential building bricks of many compressed data structures, including text indexes, membership and range supporting spatial data structures, compressed graphs, and more. Theoretically considered yet…

Optimal maps, solutions to the optimal transportation problems, are completely determined by the corresponding c-convex potential functions. In this paper, we give simple sufficient conditions for a smooth function to be c-convex when the…

In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths…

In this note functions that transform open segments of a linear space into open segments of another linear space are studied and characterized. Assuming that the range is non-collinear, it is proved that such a map can always be expressed…

We discuss a kind of generalized concurrence for a class of high dimensional quantum pure states such that the entanglement of formation is a monotonically increasing convex function of the generalized concurrence. An analytical expression…

For many completely positive maps repeated compositions will eventually become entanglement breaking. To quantify this behaviour we develop a technique based on the Schmidt number: If a completely positive map breaks the entanglement with…

Let M and N be full matrix algebras. A unital completely positive (UCP) map \phi:M\to N is said to preserve entanglement if its inflation \phi\otimes \id_N : M\otimes N\to N\otimes N has the following property: for every maximally entangled…

We study the mapping which occurs when a single qubit in an arbitrary state interacts with another qubit in a given, fixed state resulting in some unitary transformation on the two qubit system which, in effect, makes two copies of the…

Starting from a classic financial optimization problem, we first propose a cutting plane algorithm for this problem. Then we use spectral decomposition to tranform the problem into an equivalent D.C. programming problem, and the…

Direct policy search has achieved great empirical success in reinforcement learning. Many recent studies have revisited its theoretical foundation for continuous control, which reveals elegant nonconvex geometry in various benchmark…

Let $1\leq p\leq n$ be two positive integers. For a linearly nondegenerate holomorphic mapping $f\colon\mathbb{C}^p\rightarrow\mathbb{P}^n(\mathbb{C})$ of maximal rank intersecting a family of hyperplanes in general position, we obtain a…

Using the concept of dynamical mappings, two symmetry conserving nonperturbative approaches are presented. The first is based on the 1/N-expansion and sorted out using Holstein-Primakoff mapping. The second consists of dynamically mapping…

We introduce the notion of one-sided mapping cones of positive linear maps between matrix algebras. These are convex cones of maps that are invariant under compositions by completely positive maps from either the left or right side. The…

We consider stochastic variational inequality problems where the mapping is monotone over a compact convex set. We present two robust variants of stochastic extragradient algorithms for solving such problems. Of these, the first scheme…

This paper is concerned with a stochastic linear-quadratic optimal control problem in a finite time horizon, where the coefficients of the control system are allowed to be random, and the weighting matrices in the cost functional are…

Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-rank components. Such a problem arises in a number of…

We provide a recurrent construction of entanglement witnesses for a bipartite systems living in a Hilbert space corresponding to $2N$ qubits ($N$ qubits in each subsystem). Our construction provides a new method of generalization of the…