Related papers: Lower bound on concurrence for arbitrary-dimension…
We prove a lower bound on the relative entropy between two finite-dimensional states in terms of their entropy difference and the dimension of the underlying space. The inequality is tight in the sense that equality can be attained for any…
In quantum resource theories (QRTs), there exists evidences of intrinsic connections among different measures of quantum resources, including entanglement, coherence, quantum steering, and so on. However, building the relations among…
Detection of entanglement in bipartite states is a fundamental task in quantum information. The first method to verify entanglement in mixed states was the partial-transpose criterion. Subsequently, numerous quantifiers for bipartite…
We investigate the polygamy relations related to the concurrence of assistance for any multipartite pure states. General polygamy inequalities given by the $\alpha$th $(0\leq \alpha\leq 2)$ power of concurrence of assistance is first…
This paper employs a powerful argument, called an algorithmic argument, to prove lower bounds of the quantum query complexity of a multiple-block ordered search problem in which, given a block number i, we are to find a location of a target…
The concurrence, a quantitative measure of the entanglement between a pair of particles, is determined for the case where the pair is extracted from a symmetric state of N two-level systems. Examples are given for both pure and mixed states…
We solve the quantum discord completely as an optimization of certain one variable function for arbitrary two qubit X state. Exact solutions of the quantum discord are obtained for several nontrivial regions of the five parametric space for…
Quantum information masking is a protocol that hides the original quantum information from subsystems and spreads it over quantum correlation, which is available to multipartite except bipartite systems. In this work, we explicitly study…
We explore the quantum correlation distribution in multipartite quantum states based on the square of quantum discord (SQD). For tripartite quantum systems, we derive the necessary and sufficient condition for the SQD to satisfy the…
Bipartite quantum interactions have applications in a number of different areas of quantum physics, reaching from fundamental areas such as quantum thermodynamics and the theory of quantum measurements to other applications such as quantum…
Quantum coherence and quantum entanglement are two strong pillars in quantum information theory. We study here for the possibility of any connection between these two important aspects of quantum mechanics while studying the entanglement…
We provide an analytical tripartite-study from the generalized $R$-matrix. It provides the upper bound of the maximum violation of Mermin's inequality. For a generic 2-qubit pure state, the concurrence or $R$-matrix characterizes the…
The monogamy and polygamy properties of quantum entanglement characterize fundamental constraints on the distribution of entanglement in multipartite quantum systems. In this paper, we investigate tighter monogamy and polygamy relations for…
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 consider one of the simplest and best known buffer management architectures: the shared memory switch with multiple output queues and uniform packets. It was one of the first models studied by competitive analysis, with the Longest Queue…
The quantum adversary method is a versatile method for proving lower bounds on quantum algorithms. It yields tight bounds for many computational problems, is robust in having many equivalent formulations, and has natural connections to…
Subsystems of composite quantum systems are described by reduced density matrices, or quantum marginals. Important physical properties often do not depend on the whole wave function but rather only on the marginals. Not every collection of…
We study the polygamy property for tripartite and multipartite quantum systems. In tripartite system, we build a solution set for polygamy in tripartite system and find a lower bound of the set, which can be a sufficient and necessary…
Recent results in quantum information theory characterize quantum coherence in the context of resource theories. Here we study the relation between quantum coherence and quantum discord, a kind of quantum correlation which appears even in…
Quantum query complexity is a fundamental model for analyzing the computational power of quantum algorithms. It has played a key role in characterizing quantum speedups, from early breakthroughs such as Grover's and Simon's algorithms to…