arXiv subjects

Shengjun Wu

Publications and source records attributed to Shengjun Wu.

69 records · Page 4Linked to original sources

arXiv2011

Comparison of mixed quantum states

In this article, we study the problem of comparing mixed quantum states: given $n$ unknown mixed quantum states, can one determine whether they are identical or not with an unambiguous quantum measurement? We first study universal comparison of mixed quantum states, and prove that this task is generally impossible to accomplish. Then, we focus on unambiguous comparison of $n$ mixed quantum states arbitrarily chosen from a set of $k$ mixed quantum states. The condition for the existence of an unambiguous measurement operator which can produce a conclusive result when the unknown states are actually the same and the condition for the existence of an unambiguous measurement operator when the unknown states are actually different are studied independently. We derive a necessary and sufficient condition for the existence of the first measurement operator, and a necessary condition and two sufficient conditions for the second. Furthermore, we find that the sufficiency of the necessary condition for the second measurement operator has simple and interesting dependence on $n$ and $k$. At the end, a unified condition is obtained for the simultaneous existence of these two unambiguous measurement operators.

quant-ph↗

arXiv2011

The classicality and quantumness of a quantum ensemble

In this paper, we investigate the classicality and quantumness of a quantum ensemble. We define a quantity called classicality to characterize how classical a quantum ensemble is. An ensemble of commuting states that can be manipulated classically has a unit classicality, while a general ensemble has a classicality less than 1. We also study how quantum an ensemble is by defining a related quantity called quantumness. We find that the classicality of an ensemble is closely related to how perfectly the ensemble can be cloned, and that the quantumness of an ensemble is essentially responsible for the security of quantum key distribution(QKD) protocols using that ensemble. Furthermore, we show that the quantumness of an ensemble used in a QKD protocol is exactly the attainable lower bound of the error rate in the sifted key.

quant-ph↗

arXiv2011

Weak Measurements Beyond the Aharonov-Albert-Vaidman Formalism

We extend the idea of weak measurements to the general case, provide a complete treatment and obtain results for both the regime when the pre-selected and post-selected states (PPS) are almost orthogonal and the regime when they are exactly orthogonal. We surprisingly find that for a fixed interaction strength, there may exist a maximum signal amplification and a corresponding optimum overlap of PPS to achieve it. For weak measurements in the orthogonal regime, we find interesting quantities that play the same role that weak values play in the non-orthogonal regime.

quant-ph↗

arXiv2009

Optimum Unambiguous Discrimination of Linearly Independent Pure States

Given $n$ linearly independent pure states and their prior probabilities, we study the problem of optimum unambiguous discrimination of these states. We derive the properties of the optimum solution and the equations that must be satisfied by the optimum measurement strategy which achieves the maximum average success probability, and also give the detailed steps to obtain the optimum solution and the optimum measurement strategy. The general method and results we obtain are also illustrated both numerically and geometrically. We derive a simple analytical formula of the maximum average success probability of unambiguous discrimination for a given set of pure states, and it can be used to simplify the calculation of the optimum solution in some situations. We also obtain the analytical solution of a generalized equal-probability measurement problem using the equations we introduce. Finally, as another application of our result, we study the optimum unambiguous discrimination problem of three linearly independent pure states in details and obtain analytical solutions for some special cases.

quant-ph↗

arXiv2009

Weak measurements with a qubit meter

We derive schemes to measure the so-called weak values of quantum system observables by coupling of the system to a qubit meter system. We highlight, in particular, the meaning of the imaginary part of the weak values, and show how it can be measured directly on equal footing with the real part of the weak value. We present compact expressions for the weak value of single qubit observables and of product observables on qubit pairs. Experimental studies of the results are suggested with cold trapped ions.

quant-ph↗

arXiv2009

Correlations in local measurements on a quantum state, and complementarity as an explanation of nonclassicality

We consider the classical correlations that two observers can extract by measurements on a bipartite quantum state, and we discuss how they are related to the quantum mutual information of the state. We show with several examples how complementarity gives rise to a gap between the quantum and the classical correlations, and we relate our quantitative finding to the so-called classical correlation locked in a quantum state. We derive upper bounds for the sum of classical correlation obtained by measurements in different mutually unbiased bases and we show that the complementarity gap is also present in the deterministic quantum computation with one quantum bit.

quant-ph↗

arXiv2009

Entropic uncertainty relation for mutually unbiased bases

We derive new inequalities for the probabilities of projective measurements in mutually unbiased bases of a qudit system. These inequalities lead to wider ranges of validity and tighter bounds on entropic uncertainty inequalities previously derived in the literature.

quant-ph↗

arXiv2009

Complementarity of information sent via different bases

We discuss quantitatively the complementarity of information transmitted by a quantum system prepared in a basis state in one out of several different mutually unbiased bases (MUBs). We obtain upper bounds on the information available to a receiver who has no knowledge of which MUB was chosen by the sender. These upper bounds imply a complementarity of information encoded via different MUBs and ultimately ensure the security in quantum key distribution protocols.

quant-ph↗

arXiv2008

Unambiguous unitary quantum channels

Unambiguous unitary maps and unambiguous unitary quantum channels are introduced and some of their properties are derived. These properties ensure certain simple form for the measurements involved in realizing an unambiguous unitary quantum channel. Error correction and unambiguous error correction with nonzero probability are discussed in terms of unambiguous unitary quantum channels. We not only re-derive the well-known condition for a set of errors to be correctable with certainty, but also obtain a necessary and sufficient condition for the errors caused by a noisy channel to be correctable with any nonzero probability. Dense coding with a partially entangled state can also be viewed as an unambiguous unitary quantum channel when all messages are required to be transmitted with equal probability of success, the maximal achievable probability of success is derived and the optimum protocol is also obtained.

quant-ph↗

arXiv2006

Deterministic and Unambiguous Dense Coding

Optimal dense coding using a partially-entangled pure state of Schmidt rank $\bar D$ and a noiseless quantum channel of dimension $D$ is studied both in the deterministic case where at most $L_d$ messages can be transmitted with perfect fidelity, and in the unambiguous case where when the protocol succeeds (probability $τ_x$) Bob knows for sure that Alice sent message $x$, and when it fails (probability $1-τ_x$) he knows it has failed. Alice is allowed any single-shot (one use) encoding procedure, and Bob any single-shot measurement. For $\bar D\leq D$ a bound is obtained for $L_d$ in terms of the largest Schmidt coefficient of the entangled state, and is compared with published results by Mozes et al. For $\bar D > D$ it is shown that $L_d$ is strictly less than $D^2$ unless $\bar D$ is an integer multiple of $D$, in which case uniform (maximal) entanglement is not needed to achieve the optimal protocol. The unambiguous case is studied for $\bar D \leq D$, assuming $τ_x>0$ for a set of $\bar D D$ messages, and a bound is obtained for the average $\lgl1/τ\rgl$. A bound on the average $\lglτ\rgl$ requires an additional assumption of encoding by isometries (unitaries when $\bar D=D$) that are orthogonal for different messages. Both bounds are saturated when $τ_x$ is a constant independent of $x$, by a protocol based on one-shot entanglement concentration. For $\bar D > D$ it is shown that (at least) $D^2$ messages can be sent unambiguously. Whether unitary (isometric) encoding suffices for optimal protocols remains a major unanswered question, both for our work and for previous studies of dense coding using partially-entangled states, including noisy (mixed) states.

quant-ph↗

arXiv2005

Atemporal diagrams for quantum circuits

A system of diagrams is introduced that allows the representation of various elements of a quantum circuit, including measurements, in a form which makes no reference to time (hence ``atemporal''). It can be used to relate quantum dynamical properties to those of entangled states (map-state duality), and suggests useful analogies, such as the inverse of an entangled ket. Diagrams clarify the role of channel kets, transition operators, dynamical operators (matrices), and Kraus rank for noisy quantum channels. Positive (semidefinite) operators are represented by diagrams with a symmetry that aids in understanding their connection with completely positive maps. The diagrams are used to analyze standard teleportation and dense coding, and for a careful study of unambiguous (conclusive) teleportation. A simple diagrammatic argument shows that a Kraus rank of 3 is impossible for a one-qubit channel modeled using a one-qubit environment in a mixed state.

quant-ph↗

arXiv2002

Some aspects of separability

We present three necessary separability criteria for bipartite mixed states, the violation of each of these conditions is a sufficient condition for entanglement. Some ideas on the issue of finding a necessary and sufficient criterion of separability are also discussed.

quant-ph↗

arXiv2000

A necessary and sufficient criterion for multipartite separable states

We present a necessary and sufficient condition for the separability of multipartite quantum states, this criterion also tells us how to write a multipartite separable state as a convex sum of separable pure states. To work out this criterion, we need to solve a set of equations, actually it is easy to solve these quations analytically if the density matrix of the given quantum state has few nonzero eigenvalues.

quant-ph↗

arXiv2000

Multipartite pure-state entanglement and the generalized GHZ states

We show that not all 4-party pure states are GHZ reducible (i.e., can be generated reversibly from a combination of 2-, 3- and 4-party maximally entangled states by local quantum operations and classical communication asymptotically) through an example, we also present some properties of the relative entropy of entanglement for those 3-party pure states that are GHZ reducible, and then we relate these properties to the additivity of the relative entropy of entanglement.

quant-ph↗

arXiv2000

Calculating the relative entropy of entanglement

We extend Vedral and Plenio's theorem (theorem 3 in Phys. Rev. A 57, 1619) to a more general case, and obtain the relative entropy of entanglement for a class of mixed states, this result can also follow from Rains' theorem 9 in Phys. Rev. A 60, 179.

quant-ph↗