Searcharxiv⌕ Search

arXiv subjects

Runyao Duan

Publications and source records attributed to Runyao Duan.

84 records · Page 5Linked to original sources

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

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 (1999)] and multiple-copy transformation [S. Bandyopadhyay, V. Roychowdhury, and U. Sen, Phys. Rev. A {\bf 65}, 052315 (2002)], are equivalent in the sense that they can asymptotically simulate each other's ability to implement a desired transformation from a given source state to another given target state with the same optimal success probability. As a consequence, this yields a feasible method to evaluate the optimal conversion probability of an entanglement-assisted transformation.

quant-ph↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

The Existence of Quantum Entanglement Catalysts

Without additional resources, it is often impossible to transform one entangled quantum state into another with local quantum operations and classical communication. Jonathan and Plenio [Phys. Rev. Lett. 83, 3566(1999)] presented an interesting example showing that the presence of another state, called a catalyst, enables such a transformation without changing the catalyst. They also pointed out that in general it is very hard to find an analytical condition under which a catalyst exists. In this paper we study the existence of catalysts for two incomparable quantum states. For the simplest case of $2\times 2$ catalysts for transformations from one $4\times 4$ state to another, a necessary and sufficient condition for existence is found. For the general case, we give an efficient polynomial time algorithm to decide whether a $k\times k$ catalyst exists for two $n\times n$ incomparable states, where $k$ is treated as a constant.

quant-ph↗

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↗

Comparability of multipartite entanglement

We prove, in a multipartite setting, that it's always feasible to exactly transform a genuinely $m$-partite entangled state with sufficient many copies to any other $m$-partite state via local quantum operation and classical communication. This result affirms the comparability of multipartite pure entangled states.

quant-ph↗

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↗