Related papers: Analytical Bound of Concurrence
We investigate how much information about a quantum system can be simultaneously communicated to independent observers, by establishing quantitative limits to bipartite quantum correlations in many-body systems. As recently reported in…
By means of a generalization of the Fefferman-de la Llave decomposition we derive a general lower bound on the interaction energy of one-dimensional quantum systems. We apply this result to a specific class of lowest Landau band wave…
In our previous work we have found a lower bound for the multipartite uncertainty product of the position and momentum observables over all separable states. In this work we are trying to minimize this uncertainty product over a broader…
We consider methods for obtaining local lower bounds on characteristics of quantum (correspondingly, classical) systems, i.e. lower bounds valid in the trace norm $\epsilon$-neighborhood of a given state (correspondingly, probability…
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 extend a recent method to detect lower bounds to the quantum capacity of quantum communication channels by considering realistic scenarios with general input probe states and arbitrary detection procedures at the output. Realistic…
With the aid of a quantum memory, the uncertainty about the measurement outcomes of two incompatible observables of a quantum system can be reduced. We investigate this measurement uncertainty bound by considering an additional quantum…
We extend the definition of concurrence into a family of entanglement monotones, which we call concurrence monotones. We discuss their properties and advantages as computational manageable measures of entanglement, and show that for pure…
The variety of multi-partite entangled states enables numerous applications in novel quantum information tasks. In order to compare the suitability of different states from a theoretical point of view classifications have been introduced.…
We investigate multipartite entanglement in relation to the theoretical process of quantum state exchange. In particular, we consider such entanglement for a certain pure state involving two groups of N trapped atoms. The state, which can…
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progress function caused by one query. All previous variants…
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…
By using the quantum-memory-assisted entropic uncertainty relation (EUR), we derive a computable tight upper bound for quantum discord, which applies to an arbitrary bipartite state. Detailed examples show that this upper bound is tighter…
Quantum state discrimination is a fundamental task that is meaningful in quantum information theory. In this manuscript, we consider a revised unambiguous discrimination of quantum resources. First, we present an upper bound of the success…
We derive a classification and a measure of classical- and quantum-correlation of multipartite qubit, qutrit, and in general, $n$-level systems, in terms of SU$(n)$ representations of density matrices. We compare the measure for the case of…
In this paper we present a necessary and sufficient condition of distinguishability of bipartite quantum states. It is shown that the operators to reliably distinguish states need only rounds of projective measurements and classical…
In this contribution we present a concise introduction to quantum entanglement in multipartite systems. After a brief comparison between bipartite systems and the simplest non-trivial multipartite scenario involving three parties, we review…
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…
The difference of quantum mutual information for bipartite system of qubits and minimum taken with respect to local unitary transformation group is introduced as a characteristic of quantum correlations.The two qubits example (and…
We consider the discrimination of bipartite quantum states and establish a relation between nonlocal quantum state ensemble and quantum data hiding processing. Using a bound on optimal local discrimination of bipartite quantum states, we…