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.
The remarkable phenomenon of catalyst tells us that adding a catalyst could help state transformation. In this paper, we consider the problem of catalyst-assisted probabilistic coherence distillation for mixed states under strictly incoherent operations. To this end, we first present the necessary and sufficient conditions for distilling a target pure coherent state from an initial mixed state via stochastic strictly incoherent operations and the maximal probability of obtaining the target pure state from the initial state. With the help of these results, we present the necessary and sufficien…
We show that in some cases, catalyst-assisted entanglement transformation cannot be implemented by multiple-copy transformation for pure states. This fact, together with the result we obtained in [R. Y. Duan, Y. Feng, X. Li, and M. S. Ying, Phys. Rev. A 71, 042319 (2005)] that the latter can be completely implemented by the former, indicates that catalyst-assisted transformation is strictly more powerful than multiple-copy transformation. For purely probabilistic setting we find, however, these two kinds of transformations are geometrically equivalent in the sense that the sets of pure states …
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.
We introduce the general catalysts for pure entanglement transformations under local operations and classical communications in such a way that we disregard the profit and loss of entanglement of the catalysts per se. As such, the possibilities of pure entanglement transformations are greatly expanded. Remarkably, we find an interesting phenomenon that, in some situations, incomparable pairs ${| ψ> ,| ϕ> \} $ and ${| χ> ,| χ^{\prime}> \} $ can assist each other mutually so as to realize the transformation $| ψ> | χ> \to| ϕ> | χ^{\prime}>$. We also design an efficient algorithm to detect whethe…
Equivalence of Discrete and Continuous Otto-Like Engines assisted by Catalysts: Mapping Catalytic Advantages from the Discrete to the Continuous Framework
University of Gdańsk（格但斯克大学）；Los Alamos National Laboratory（洛斯阿拉莫斯国家实验室）
We analytically obtain the maximum probability of converting a finite number of copies of an arbitrary two-qubit pure state to a single copy of a maximally entangled two-qubit pure state via entanglement assisted local operations and classical communications using a two-qubit catalyst state. We show that the optimal catalyst for this transformation is always more entangled than the initial state but any two-qubit state can act as a (non-optimal) catalyst. Interestingly, the entanglement of the optimal two-qubit catalyst state is shown to decrease with that of the initial state. Entanglement as…
Given a pure state transformation $ψ\mapstoϕ$ restricted to entanglement-assisted local operations with classical communication, we determine a lower bound for the dimension of a catalyst allowing that transformation. Our bound is stated in terms of the generalised concurrence monotones (the usual concurrence of two qubits is one such monotone). We further provide tools for deriving further conditions upon catalysts of pure state transformations.
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$-dimensi…
Quantum catalytic transformations play important roles in the transformation of quantum entangled states under local operations and classical communications (LOCC). The key problems in catalytic transformations are the existence and the bounds on the catalytic states. We present the necessary conditions of catalytic states based on a set of points given by the Schmidt coefficients of the entangled source and target states. The lower bounds on the dimensions of the catalytic states are also investigated. Moreover, we give a detailed protocol of quantum mixed state transformation under entanglem…
Quantum resource manipulation may include an ancillary state called a catalyst, which aids the transformation while restoring its original form at the end, and characterizing the enhancement enabled by catalysts is essential to reveal the ultimate manipulability of the precious resource quantity of interest. Here, we show that allowing correlation among multiple catalysts can offer arbitrary power in the manipulation of quantum coherence. We prove that any state transformation can be accomplished with an arbitrarily small error by covariant operations with catalysts that may create a correlati…
Given a finite dimensional pure state transformation restricted by entanglement assisted local operations and classical communication (ELOCC), we derive minimum and maximum bounds on the entanglement of an ancillary catalyst that allows that transformation. These bounds are non-trivial even when the Schmidt number of both the original and ancillary states becomes large. We identify a lower bound for the dimension of a catalyst allowing a particular ELOCC transformation. Along with these bounds, we present further constraints on ELOCC transformations by identifying restrictions on the Schmidt c…
We demonstrate that local transformations on a composite quantum system can be enhanced in the presence of certain entangled states. These extra states act much like catalysts in a chemical reaction: they allow otherwise impossible local transformations to be realised, without being consumed in any way. In particular, we show that this effect can considerably improve the efficiency of entanglement concentration procedures for finite states.
In this paper we summarize the necessary condition for incomparable states which can be catalyzed under entanglement-assisted LQCC (ELQCC). When we apply an extended condition for entanglement transformation to entanglement-assisted local manipulation we obtain a fundamental limit for entanglement catalysts. Some relative questions are also discussed.
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.
We analyze entanglement swapping (ES) of partially entangled pure states with arbitrary Schmidt rank from the perspective of quantum state discrimination. It is shown that the standard deterministic ES protocol is related with an optimal minimum-error strategy. In this case the amount of entanglement of the states resulting from swapping is, in general, lower than the maximum achievable for the quantum channels involved. In this regard, we show that the ES protocol can be probabilistically improved resorting to optimal maximum-confidence (MC) discrimination strategy. Additionally, we show that…
We propose an entanglement purification scheme based on material qubits and ancillary coherent multiphoton states. We consider a typical QED scenario where material qubits implemented by two-level atoms fly sequentially through a cavity and interact resonantly with a single mode of the radiation field. We explore the theoretical possibilities of realizing a high-fidelity two-qubit quantum operation necessary for the purification protocol with the help of a postselective balanced homodyne photodetection. We demonstrate that the obtained probabilistic quantum operation can be used as a bilateral…
Motivated by the desire to better understand the class of quantum operations on bipartite systems that preserve positivity of partial transpose (PPT operations) and its relation to the class LOCC (local operations and classical communication), we present some results on deterministic bipartite pure state transformations by PPT operations. Restricting our attention to the case where we start with a rank K maximally entangled state, we give a necessary condition for transforming it into a given pure state, which we show is also sufficient when K is two and the final state has Schmidt rank three.…
We consider generic pure $n$-qubit states and a general class of pure states of arbitrary dimensions and arbitrarily many subsystems. We characterize those states which can be reached from some other state via Local Operations assisted by finitely many rounds of Classical Communication ($LOCC_{\mathbb{N}}$). For $n$ qubits with $n>3$ we show that this set of states is of measure zero, which implies that the maximally entangled set is generically of full measure if restricted to the practical scenario of $LOCC_{\mathbb{N}}$. Moreover, we identify a class of states for which any $LOCC_{\mathbb{N…
Quantum information protocols are inevitably affected by decoherence which is associated with the leakage of quantum information into an environment. In this paper we address the possibility of recovering the quantum information from an environmental measurement. We investigate continuous variable quantum information, and we propose a simple environmental measurement that under certain circumstances fully restores the quantum information of the signal state although the state is not reconstructed with unit fidelity. We implement the protocol for which information is encoded into conjugate quad…
Quantum Artificial Intelligence Laboratory, NASA Ames Research Center（美国国家航空航天局艾姆斯研究中心量子人工智能实验室）；Department of Computer Science, University College London（伦敦大学学院计算机科学系）；Cambridge Quantum Computing Limited（剑桥量子计算有限公司）；SGT Inc.（SGT公司）；Instituto de Matemáticas Aplicadas, Universidad de Cartagena（卡塔赫纳大学应用数学系）；Exploration Technology Directorate, NASA Ames Research Center（美国国家航空航天局艾姆斯研究中心探索技术部）；USRA Research Institute for Advanced Computer Science（美国航天研究所高级计算机科学研究所）
Mainstream machine-learning techniques such as deep learning and probabilistic programming rely heavily on sampling from generally intractable probability distributions. There is increasing interest in the potential advantages of using quantum computing technologies as sampling engines to speed up these tasks or to make them more effective. However, some pressing challenges in state-of-the-art quantum annealers have to be overcome before we can assess their actual performance. The sparse connectivity, resulting from the local interaction between quantum bits in physical hardware implementation…
We consider the distribution of high-dimensional entangled states to multiple parties via noisy channels and the subsequent probabilistic conversion of these states to desired target states using stochastic local operations and classical communication. We show that such state-conversion protocols can be enhanced by embedded channel-estimation routines at no additional cost in terms of the number of copies of the distributed states. The defining characteristic of our strategy is the use of those copies for which the conversion was unsuccessful for the estimation of the noise, thus allowing one …
