Related papers: Lower bound on concurrence for arbitrary-dimension…
We introduce a complete set of complementary quantities in bipartite, two-dimensional systems. Complementarity then relates the quantitative entanglement measure concurrence which is a bipartite property to the single-particle quantum…
We address the problem of unambiguous discrimination among a given set of quantum operations. The necessary and sufficient condition for them to be unambiguously distinguishable is derived in the cases of single use and multiple uses…
Quantum resources play crucial roles for displaying superiority in many quantum communication and computation tasks. To reveal the intrinsic relations hidden in these quantum resources, many efforts have been made in recent years. In this…
This paper examines the coherence in multipartite systems. We first discuss the distribution of total coherence in a given multipartite quantum state into discord between subsystems and coherent dissonance in each individual subsystem,…
The challenge of equality in the strong subadditivity inequality of entropy is approached via a general additivity of correlation information in terms of nonoverlapping clusters of subsystems in multipartite states (density operators). A…
It is expected that quantum computers would enable solving various problems that are beyond the capabilities of the most powerful current supercomputers, which are based on classical technologies. In the last three decades, advances in…
We introduce the notion of quantum dissension for a three-qubit system as a measure of quantum correlations. We use three equivalent expressions of three-variable mutual information. Their differences can be zero classically but not so in…
Multipartite quantum systems show properties which do not admit a classical explanation. In particular, even nonentangled states can enjoy a kind of quantum correlations called quantum discord. I discuss some recent results on the role of…
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…
The quantum uncertainty principle stands as a cornerstone and a distinctive feature of quantum mechanics, setting it apart from classical mechanics. We introduce a tripartite quantum-memory-assisted entropic uncertainty relation, and extend…
Amount of entanglement carried by a quantum bipartite state is usually evaluated in terms of concurrence (see Ref. 1). We give a physical interpretation of concurrence that reveals a way of its direct measurement and discuss possible…
We present a different kind of monogamy and polygamy relations based on concurrence and concurrence of assistance for multiqubit systems. By relabeling the subsystems associated with different weights, a smaller upper bound of the…
We present a reliable algorithm to evaluate quantum discord for general two--qubit states, amending and extending an approach recently put forward for the subclass of X--states. A closed expression for the discord of arbitrary states of two…
Quantifying genuine entanglement is a key task in quantum information theory. We study the quantification of genuine multipartite entanglement for four-qubit systems. Based on the concurrence of nine different classes of four-qubit states,…
Bounds on the exchange-correlation energy of many-electron systems are derived and tested. By using universal scaling properties of the electron-electron interaction, we obtain the exponent of the bounds in three, two, one, and quasi-one…
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 revisit the upper bound of quantum discord given by the von Neumann entropy of the measured subsystem. Using the Koashi-Winter relation, we obtain a trade-off between the amount of classical correlation and quantum discord in the…
So-called average subsystem entropies are defined by first taking partial traces over some pure state to define density matrices, then calculating the subsystem entropies, and finally averaging over the pure states to define the average…
Although numerous measures of entanglement have been proposed so far, the calculation of a given faithful entanglement measure is a hard work since it is always involved in some optimization process. It is, therefore, important to estimate…
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…