Search NASA⌕ Search

Engineering topics

Lvjun, Li

Publications and source records attributed to Lvjun, Li.

Relation between minimum-error discrimination and optimum unambiguous discrimination

In this paper, we investigate the relationship between the minimum-error probability Q{sub E} of ambiguous discrimination and the optimal inconclusive probability Q{sub U} of unambiguous discrimination. It is known that for discriminating two states, the inequality Q{sub U{>=}}2Q{sub E} has been proved in the literature. The main technical results are as follows: (1) We show that, for discriminating more than two states, Q{sub U{>=}}2Q{sub E} may not hold again, but the infimum of Q{sub U}/Q{sub E} is 1, and there is no supremum of Q{sub U}/Q{sub E}, which implies that the failure probabilities of the two schemes for discriminating some states may be narrowly or widely gapped. (2) We derive two concrete formulas of the minimum-error probability Q{sub E} and the optimal inconclusive probability Q{sub U}, respectively, for ambiguous discrimination and unambiguous discrimination among arbitrary m simultaneously diagonalizable mixed quantum states with given prior probabilities. In addition, we show that Q{sub E} and Q{sub U} satisfy the relationship that Q{sub U{>=}}(m/m-1)Q{sub E}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Minimum-error discrimination of quantum states: Bounds and comparisons

We derive a new bound on the minimum-error probability for ambiguous discrimination and compare the new bound with six other bounds in the literature. Specifically, the main technical contributions are as follows. (1) We obtain a general lower bound on the minimum-error probability for ambiguous discrimination among arbitrary m mixed quantum states with given prior probabilities. We further analyze how this lower bound is attainable by presenting a necessary and sufficient condition related to it. (2) We compare this new lower bound with six other bounds in the literature, in detail. We show that this new bound improves the previous one in the literature and in the equiprobable case; the new bound also improves another one. Moreover, we give an example to show that this new bound is the tightest one for some cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Semiquantum-key distribution using less than four quantum states

Recently Boyer et al. [Phys. Rev. Lett. 99, 140501 (2007)] suggested the idea of semiquantum key distribution (SQKD) in which Bob is classical and they also proposed a semiquantum key distribution protocol (BKM2007). To discuss the security of the BKM2007 protocol, they proved that their protocol is completely robust. This means that nonzero information acquired by Eve on the information string implies the nonzero probability that the legitimate participants can find errors on the bits tested by this protocol. The BKM2007 protocol uses four quantum states to distribute a secret key. In this paper, we simplify their protocol by using less than four quantum states. In detail, we present five different SQKD protocols in which Alice sends three quantum states, two quantum states, and one quantum state, respectively. Also, we prove that all the five protocols are completely robust. In particular, we invent two completely robust SQKD protocols in which Alice sends only one quantum state. Alice uses a register in one SQKD protocol, but she does not use any register in the other. The information bit proportion of the SQKD protocol in which Alice sends only one quantum state but uses a register is the double as that in the BKM2007 protocol. Furthermore, the information bit rate of the SQKD protocol in which Alice sends only one quantum state and does not use any register is not lower than that of the BKM2007 protocol.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗