arXiv subjects

Yuan Feng

Publications and source records attributed to Yuan Feng.

159 records · Page 9Linked to original sources

arXiv2006

Unambiguous discrimination of mixed quantum states

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 the fact that it comes from ensemble of pure quantum states. The first part will not contribute anything to the discrimination, the second part has support space linearly independent to each other. Then the problem we consider can be reduced to a problem in which the strategy of set discrimination can be used in designing measurements to discriminate mixed states unambiguously. We find a necessary and sufficient condition of unambiguous mixed state discrimination, and also point out that searching the optimal success probability of unambiguous discrimination is mathematically the well-known semi-definite programming problem. A upper bound of the optimal success probability is also presented. Finally, We generalize the concept of set discrimination to mixed state and point out that the problem of discriminating it unambiguously is equivalent to that of unambiguously discriminating mixed states.

quant-ph↗

arXiv2006

Optimal dense coding with arbitrary pure entangled states

We examine dense coding with an arbitrary pure entangled state sharing between the sender and the receiver. Upper bounds on the average success probability in approximate dense coding and on the probability of conclusive results in unambiguous dense coding are derived. We also construct the optimal protocol which saturates the upper bound in each case.

quant-ph↗

arXiv2006

Identification and Distance Measures of Measurement Apparatus

We propose simple schemes that can perfectly identify projective measurement apparatus secretly chosen from a finite set. Entanglements are used in these schemes both to make possible the perfect identification and to improve the efficiency significantly. A brief discussion on the problem of how to appropriately define distance measures of measurements is also provided based on the results of identification.

quant-ph↗

arXiv2006

Proof rules for purely quantum programs

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 computer in Knill's architecture. The denotational semantics, weakest precondition semantics, and weakest liberal precondition semantics of this language fragment are introduced. To help reasoning about quantum programs involving quantum loops, we extend proof rules for classical probabilistic programs to our purely quantum programs.

cs.PL↗

arXiv2006

Boundary effect of deterministic dense coding

We present a rigorous proof of an interesting boundary effect of deterministic dense coding first observed by Mozes et al. [Phys. Rev. A 71, 012311 (2005)]. Namely, it is shown that $d^2-1$ cannot be the maximal alphabet size of any isometric deterministic dense coding schemes utilizing $d$-level partial entanglement.

quant-ph↗

arXiv2005

Condition and capability of quantum state separation

The linearity of quantum operations puts many fundamental constraints on the information processing tasks we can achieve on a quantum system whose state is not exactly known, just as we observe in quantum cloning and quantum discrimination. In this paper we show that in probabilistic manner, linearity is in fact the only one that restricts the physically realizable tasks. To be specific, if a system is prepared in a state secretly chosen from a linearly independent pure state set, then any quantum state separation can be physically realized with a positive probability. Furthermore, we derive a lower bound on the average failure probability of any quantum state separation.

quant-ph↗

arXiv2005

Trade-off between multiple-copy transformation and entanglement catalysis

We demonstrate that multiple copies of a bipartite entangled pure state may serve as a catalyst for certain entanglement transformations while a single copy cannot. Such a state is termed a "multiple-copy catalyst" for the transformations. A trade-off between the number of copies of source state and that of the catalyst is also observed. These results can be generalized to probabilistic entanglement transformations directly.

quant-ph↗

arXiv2005

Multiple-copy entanglement transformation and entanglement catalysis

We prove that any multiple-copy entanglement transformation [S. Bandyopadhyay, V. Roychowdhury, and U. Sen, Phys. Rev. A \textbf{65}, 052315 (2002)] can be implemented by a suitable entanglement-assisted local transformation [D. Jonathan and M. B. Plenio, Phys. Rev. Lett. \textbf{83}, 3566 (1999)]. Furthermore, we show that the combination of multiple-copy entanglement transformation and the entanglement-assisted one is still equivalent to the pure entanglement-assisted one. The mathematical structure of multiple-copy entanglement transformations then is carefully investigated. Many interesting properties of multiple-copy entanglement transformations are presented, which exactly coincide with those satisfied by the entanglement-assisted ones. Most interestingly, we show that an arbitrarily large number of copies of state should be considered in multiple-copy entanglement transformations.

quant-ph↗

arXiv2005

Unambiguous discrimination between quantum mixed states

We prove that the states secretly chosen from a mixed state set can be perfectly discriminated if and only if these states are orthogonal. The sufficient and necessary condition when nonorthogonal quantum mixed states can be unambiguously discriminated is also presented. Furthermore, we derive a series of lower bounds on the inconclusive probability of unambiguous discrimination of states from a mixed state set with \textit{a prior} probabilities.

quant-ph↗

arXiv2005

Local cloning of two product states

Local quantum operations and classical communication (LOCC) put considerable constraints on many quantum information processing tasks such as cloning and discrimination. Surprisingly however, discrimination of any two pure states survives such constraints in some sense. In this paper, we show that cloning is not that lucky; namely, conclusive LOCC cloning of two product states is strictly less efficient than global cloning.

quant-ph↗

arXiv2005

When Catalysis is Useful for Probabilistic Entanglement Transformation

We determine all $2\times 2$ quantum states that can serve as useful catalysts for a given probabilistic entanglement transformation, in the sense that they can increase the maximal transformation probability. When higher-dimensional catalysts are considered, a sufficient and necessary condition is derived under which a certain probabilistic transformation has useful catalysts.

quant-ph↗

arXiv2005

Catalyst-assisted Probabilistic Entanglement Transformation

We are concerned with catalyst-assisted probabilistic entanglement transformations. A necessary and sufficient condition is presented under which there exist partial catalysts that can increase the maximal transforming probability of a given entanglement transformation. We also design an algorithm which leads to an efficient method for finding the most economical partial catalysts with minimal dimension. The mathematical structure of catalyst-assisted probabilistic transformation is carefully investigated.

quant-ph↗

arXiv2005

Efficiency of Deterministic Entanglement Transformation

We prove that sufficiently many copies of a bipartite entangled pure state can always be transformed into some copies of another one with certainty by local quantum operations and classical communication. The efficiency of such a transformation is characterized by deterministic entanglement exchange rate, and it is proved to be always positive and bounded from top by the infimum of the ratios of Renyi's entropies of source state and target state. A careful analysis shows that the deterministic entanglement exchange rate cannot be increased even in the presence of catalysts. As an application, we show that there can be two incomparable states with deterministic entanglement exchange rate strictly exceeding 1.

quant-ph↗

arXiv2005

An Equivalence of Entanglement-Assisted Transformation and Multiple-Copy Entanglement Transformation

We examine the powers of entanglement-assisted transformation and multiple-copy entanglement transformation. First, we find a sufficient condition of when a given catalyst is useful in producing another specific target state. As an application of this condition, for any non-maximally entangled bipartite pure state and any integer $n$ not less than 4, we are able to explicitly construct a set of $n\times n$ quantum states which can be produced by using the given state as a catalyst. Second, we prove that for any positive integer $k$, entanglement-assisted transformation with $k\times k$-dimensional catalysts is useful in producing a target state if and only if multiple-copy entanglement transformation with $k$ copies of state is useful in producing the same target. Moreover, a necessary and sufficient condition for both of them is obtained in terms of the Schmidt coefficients of the target. This equivalence of entanglement-assisted transformation and multiple-copy entanglement transformation implies many interesting properties of entanglement transformation. Furthermore, these results are generalized to the case of probabilistic entanglement transformations.

quant-ph↗

arXiv2003

Quantum operation, quantum Fourier transform and semi-definite programming

We analyze a class of quantum operations based on a geometrical representation of $d-$level quantum system (or qudit for short). A sufficient and necessary condition of complete positivity, expressed in terms of the quantum Fourier transform, is found for this class of operations. A more general class of operations on qudits is also considered and its completely positive condition is reduced to the well-known semi-definite programming problem.

quant-ph↗