most citedOptimal conclusive discrimination of two states can be achieved locally

48 citations · 160 across the 14 of their papers we have counts for

collaborators

14 papers

cs.PL20055 cited

Proof rules for purely quantum programs

Yuan Feng, Runyao Duan, Zhengfeng Ji +1

We apply the notion of quantum predicate proposed by D'Hondt and Panangaden to analyze a purely quantum language fragment which describes the quantum part of a future quantum compu…

cs.AI20055 cited

Relational reasoning in the region connection calculus

Yongming Li, Sanjiang Li, Mingsheng Ying

This paper is mainly concerned with the relation-algebraical aspects of the well-known Region Connection Calculus (RCC). We show that the contact relation algebra (CRA) of certain…

quant-ph20055 cited

Local cloning of two product states

Zhengfeng Ji, Yuan Feng, Mingsheng Ying

Local quantum operations and classical communication (LOCC) put considerable constraints on many quantum information processing tasks such as cloning and discrimination. Surprising…

quant-ph20043 cited

Quantum search algorithm by adiabatic evolution under a priori probability

Zhaohui Wei, Mingsheng Ying

Grover's algorithm is one of the most important quantum algorithms, which performs the task of searching an unsorted database without a priori probability. Recently the adiabatic e…

quant-ph200414 cited

Entanglement-assisted transformation is asymptotically equivalent to multiple-copy transformation

Runyao Duan, Yuan feng, Mingsheng Ying

We show that two ways of manipulation of quantum entanglement, namely, entanglement-assisted local transformation [D. Jonathan and M. B. Plenio, Phys. Rev. Lett. {\bf 83}, 3566 (19…

quant-ph200418 cited

Unambiguous discrimination of mixed quantum states

Chi Zhang, Yuan Feng, Ming Sheng Ying

In this paper, we consider the problem of unambiguous discrimination between a set of mixed quantum states. We first divide the density matrix of each mixed state into two parts by…