The Fidelity and Trace Norm Distances for Quantifying Coherence

We investigate the coherence measures induced by fidelity and trace norm, based on the recent proposed coherence quantification in [Phys. Rev. Lett. 113, 140401, 2014]. We show that the fidelity of coherence does not in general satisfy the monotonicity requirement as a measure of coherence under the subselection of measurements condition. We find that the trace norm of coherence can act as a measure of coherence for qubit case and some special class of qutrits.Comment: 4 pages, 1 figure

The Dual Roles of Quantum Discord in a Non-demolition Probing Task

We present a non-demolition quantum information processing task of probing the information of a class of quantum state. In this task, the information is extracted by some unitary evolution with the introduced probing qubit assisted, but the probed quantum state (density matrix) is undisturbed at any time and independent of the choice of the initial probing state. We give a sufficient and necessary condition on the Hamiltonian that can lead to the successful realization of such a task. We prove that, for any feasible scheme, the probed plus probing system will always stay at a disentangled state with one side quantum discord absent and the other side one inevitably produced in the probing process. An explicit example is given for the demonstration, whilst the example shows that the ratio of quantum discord to the total correlation will have to reduce to zero for the maximal accessible information. In this sense, we say that quantum discord plays the dual roles in this case.Comment: 5 pages and 1 figur

Entangling Power in the Deterministic Quantum Computation with One Qubit

The deterministic quantum computing with one qubit (DQC1) is a mixed-state quantum computation algorithm that evaluates the normalized trace of a unitary matrix and is more powerful than the classical counterpart. We find that the normalized trace of the unitary matrix can be directly described by the entangling power of the quantum circuit of the DQC1, so the nontrivial DQC1 is always accompanied with the non-vanishing entangling power. In addition, it is shown that the entangling power also determines the intrinsic complexity of this quantum computation algorithm, i.e., the larger entangling power corresponds to higher complexity. Besides, it is also shown that the non-vanishing entangling power does always exist in other similar tasks of DQC1.Comment: 6 pages and 1 figur