Related papers: Lower Bound of Concurrence Based on Generalized Po…
Two measures of entanglement, negativity and concurrence are studied for two qutrits. An operator origin of negativity is presented and an analytic formula connecting the two measures is derived.
We study the trade-off relations given by the l_1-norm coherence of general multipartite states. Explicit trade-off inequalities are derived with lower bounds given by the coherence of either bipartite or multipartite reduced density…
Explicit expressions for the concurrence of all positive and trace-preserving ("stochastic") 1-qubit maps are presented. We construct the relevant convex roof patterns by a new method. We conclude that two component optimal decompositions…
Multipartite entanglement holds great importance in quantum information processing. The distribution of entanglement among subsystems can be characterized by monogamy relations. Based on the $\beta$th power of concurrence and negativity, we…
We use the generalized concurrence approach to investigate the general multipartite separability problem. By extending the preconcurrence matrix formalism to arbitrary multipartite systems, we show that the separability problem can be…
The problem of bound entanglement detection is a challenging aspect of quantum information theory for higher dimensional systems. Here, we propose an indecomposable positive map for two-qutrit systems, which is shown to generate a class of…
Correlations obtained from sequences of measurements have been employed to distinguish among different physical theories or to witness the dimension of a system. In this work we show that they can also be used to establish semi-device…
We introduce a technique for applying quantum expanders in a distributed fashion, and use it to solve two basic questions: testing whether a bipartite quantum state shared by two parties is the maximally entangled state and disproving a…
We present observable upper bounds of squared concurrence, which are the dual inequalities of the observable lower bounds introduced in [F. Mintert and A. Buchleitner, Phys. Rev. Lett. 98, 140505 (2007)] and [L. Aolita, A. Buchleitner and…
Despite the successful experimental generation and verification of genuine multipartite entanglement, several existing entanglement measures remain insufficient to reliably capture its presence. In this study, we overcome this challenge by…
This note complements the paper "One-Way Ticket to Las Vegas and the Quantum Adversary" (arxiv:2301.02003). I develop the ideas behind the adversary bound - universal algorithm duality therein in a different form, using the same perspective…
We formulate a general approach to higher concurrencies in general and neural codes in particular, and suggest how the higher order aspects may be dealt with in using topology.
Entanglement and coherence are two essential quantum resources for quantum information processing. A natural question arises of whether there are direct link between them. And by thinking about this question, we propose a new measure for…
The uncertainty of measurement on a quantum system can be reduced in presence of quantum memory [M. Berta et. al. Nature Phys. {\bf 6}, 659 (2010)]. By measurement on quantum memory, some information (non-classical information) is…
We study the dynamics of multipartite entanglement under the influence of decoherence. A suitable generalization of concurrence reveals distinct scaling of the entanglement decay rate of GHZ and W states, for various environments.
We consider competitive algorithms for adaptive group testing problems. In the first part of the paper, we develop an algorithm with competitive constant c < 1.452 thus improving the up to now best known algorithms with constants…
We outline a new approach to the characterization as well as to the classification of positive maps. This approach is based on the facial structures of the set of states and of the cone of positive maps. In particular, the equivalence…
Entanglement is at the heart of most quantum information tasks, and therefore considerable effort has been made to find methods of deciding the entanglement content of a given bipartite quantum state. Here, we prove a fundamental limitation…
The existence of an on-line competitive algorithm for coloring bipartite graphs remains a tantalizing open problem. So far there are only partial positive results for bipartite graphs with certain small forbidden graphs as induced…
In this paper we investigate the robustness of the quantum correlations against the environment effects in various opto-mechanical bipartite systems. For two spatially separated opto-mechanical cavities, we give analytical formula for the…