Do you want to publish a course? Click here

A new coherence measure based on fidelity

231   0   0.0 ( 0 )
 Added by Chonglong Liu
 Publication date 2017
  fields Physics
and research's language is English




Ask ChatGPT about the research

Quantifying coherence is an essential endeavor for both quantum foundations and quantum technologies. In this paper, we put forward a quantitative measure of coherence by following the axiomatic definition of coherence measures introduced in [T. Baumgratz, M. Cramer, and M. B. Plenio, Phys. Rev. Lett. 113, 140401 (2014)]. Our measure is based on fidelity and analytically computable for arbitrary states of a qubit. As one of its applications, we show that our measure can be used to examine whether a pure qubit state can be transformed into another pure or mixed qubit state only by incoherent operations.



rate research

Read More

Purity and coherence of a quantum state are recognized as useful resources for various information processing tasks. In this article, we propose a fidelity based valid measure of purity and coherence monotone and establish a relationship between them. This formulation of coherence is extended to quantum correlation relative to measurement. We have also studied the role of weak measurement on purity.
We study the geometric measure of quantum coherence recently proposed in [Phys. Rev. Lett. 115, 020403 (2015)]. Both lower and upper bounds of this measure are provided. These bounds are shown to be tight for a class of important coherent states -- maximally coherent mixed states. The trade-off relation between quantum coherence and mixedness for this measure is also discussed.
We make a detailed analysis of quantumness for various quantum noise channels, both Markovian and non-Markovian. The noise channels considered include dephasing channels like random telegraph noise, non-Markovian dephasing and phase damping, as well as the non-dephasing channels such as generalized amplitude damping and Unruh channels. We make use of a recently introduced witness for quantumness based on the square $l_1$ norm of coherence. It is found that the increase in the degree of non-Markovianity increases the quantumness of the channel.
We propose an alternative fidelity measure (namely, a measure of the degree of similarity) between quantum states and benchmark it against a number of properties of the standard Uhlmann-Jozsa fidelity. This measure is a simple function of the linear entropy and the Hilbert-Schmidt inner product between the given states and is thus, in comparison, not as computationally demanding. It also features several remarkable properties such as being jointly concave and satisfying all of Jozsas axioms. The trade-off, however, is that it is supermultiplicative and does not behave monotonically under quantum operations. In addition, new metrics for the space of density matrices are identified and the joint concavity of the Uhlmann-Jozsa fidelity for qubit states is established.
91 - Yao Yao , Dong Li , 2020
As an analogy of best separable approximation (BSA) in the framework of entanglement theory, here we concentrate on the notion of best incoherent approximation, with application to characterizing and quantifying quantum coherence. From both analytical and numerical perspectives, we have demonstrated that the weight-based coherence measure displays some unusual properties, in sharp contrast to other popular coherence quantifiers. First, by deriving a closed formula for qubit states, we have showed the weight-based coherence measure exhibits a rich (geometrical) structure even in this simplest case. Second, we have identified the existence of mixed maximally coherent states (MMCS) with respect to this coherence measure and discussed the characteristic feature of MMCS in high-dimensional Hilbert spaces. Especially, we present several important families of MMCS by gaining insights from the numerical simulations. Moreover, it is pointed out that some considerations in this work can be generalized to general convex resource theories and a numerical method of improving the computational efficiency for finding the BSA is also discussed.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا