Related papers: Lower Bound of Concurrence Based on Generalized Po…
In this paper, we introduce a category of one-parameter bipartite entanglement quantifiers, termed $G_q$-concurrence ($q>1$), and show rigorously that they satisfy all the axiomatic conditions of an entanglement measure and can be…
We survey partial geometric designs and investigate their concurrences of points. The concurrence matrix of a design, which encodes the concurrences of pairs of points, can be used in the classification of designs in some extent. An…
In this paper we study some properties of quadrilaterals concerning concurrence of lines under few to none restrictive conditions, and obtain an extension of a transversal theorem from triangles to quadrilaterals.
We show that each entanglement witness detecting given bipartite entangled state provides an estimation of its concurrence. We illustrate our result with several well known examples of entanglement witnesses and compare the corresponding…
Adversarial learning is one of the most successful approaches to modelling high-dimensional probability distributions from data. The quantum computing community has recently begun to generalize this idea and to look for potential…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
In this work, we study the numerical optimization of nearest-neighbor concurrence of bipartite one and two dimensional lattices, as well as non bipartite two dimensional lattices. These systems are described in the framework of a…
We refine the notion of concurrence in this paper by a redefinition of the concept. The new definition is simpler, computationally straight forward, and allows the concurrence to be directly read off from the state. It has all the positive…
Though competitive analysis is often a very good tool for the analysis of online algorithms, sometimes it does not give any insight and sometimes it gives counter-intuitive results. Much work has gone into exploring other performance…
We construct a generalized concurrence for general multipartite states based on local W-class and GHZ-class operators. We explicitly construct the corresponding concurrence for three-partite states. The construction of the concurrence is…
We investigate \emph{bi-valued} auctions in the digital good setting and construct an explicit polynomial time deterministic auction. We prove an unconditional tight lower bound which holds even for random superpolynomial auctions. The…
We present a new approach to the analysis of entanglement in smooth bipartite continuous-variable states. One or both parties perform projective filterings via preliminary measurements to determine whether the system is located in some…
The concept of local concurrence is used to quantify the entanglement between a single qubit and the remainder of a multi-qubit system. For the ground state of the BCS model in the thermodynamic limit the set of local concurrences…
We study dynamical semigroups of positive, but not completely positive maps on finite-dimensional bipartite systems and analyze properties of their generators in relation to non-decomposability and bound-entanglement. An example of…
We study the competition for partners in two-sided matching markets with heterogeneous agent preferences, with a focus on how the equilibrium outcomes depend on the connectivity in the market. We model random partially connected markets,…
We describe a method to upper bound the quantum query complexity of Boolean formula evaluation problems, using fundamental theorems about the general adversary bound. This nonconstructive method can give an upper bound on query complexity…
Positive semidefinite rank (PSD-rank) is a relatively new quantity with applications to combinatorial optimization and communication complexity. We first study several basic properties of PSD-rank, and then develop new techniques for…
A previously overlooked constraint for the distribution of entanglement in three-qubit systems is exploited for the first time and used to reveal a new genuine tripartite entanglement measure. It is interpreted as the area of a so-called…
In this work we propose the geometric mean of bipartite concurrences as a genuine multipartite entanglement measure. This measure achieves the maximum value for absolutely maximally entangled states and has desirable properties for…
We consider two measures of entanglement of mixed bipartite states of dimension 2X2: concurrence and negativity. We first prove the conjecture of Eisert and Plenio that concurrence can never be smaller than negativity. We then characterise…