Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1503.06534

Probabilistic Uncorrelated Cloning Requires Negative Probability

Yuji Sekino

Published Mar 23, 2015• 0 citations
arXivHTMLPDF

Abstract

It is known that to imperfectly clone a phase-set of states uncorrelatedly is impossible due to the linearity and the hermitian-preservation of quantum operations deterministically shown by D'Ariano et al. In this paper we address uncorrelated cloning in probabilistic cases. We show that there exists a linear and hermitian-preserving probabilistic map to imperfectly clone a phase-set of states uncorrelatedly. It is pointed out that the existence of such a map is due to the difference between non-unit-trace output operators and normalized (unit-trace) output operators inherent to probabilistic maps. We however prove that such a possibility of uncorrelated cloning is completely excluded by the condition of positivity in addition to the linearity and the hermitian-preservation of quantum operations. Our results implicate that the positivity of quantum operation is richer physical meaning than the one which we usually assume a priori for the necessity of "probability interpretation."

DOI
10.48550/arxiv.1503.06534

Related papers

Extending quantum operations

Teiko Heinosaari, Maria Anastasia Jivulescu, David Reeb +1 more

For a given set of input-output pairs of quantum states or observables, we ask the question whether there exists a physically implementable transformation that maps each of the inputs to the corresponding output. The physical maps on quantum states are trace-preserving completely positive maps, but we also consider variants of these requirements. We generalize the definition of complete positivity to linear maps defined on arbitrary subspaces, then formulate this notion as a semidefinite program, and relate it by duality to approximative extensions of this map. This gives a characterization of the maps which can be approximated arbitrarily well as the restriction of a map that is completely positive on the whole algebra, also yielding the familiar extension theorems on operator spaces. For quantum channel extensions and extensions by probabilistic operations we obtain semidefinite characterizations, and we also elucidate the special case of Abelian inputs or outputs. Finally, revisiting a theorem by Alberti and Uhlmann, we provide simpler and more widely applicable conditions for certain extension problems on qubits, and by using a semidefinite programming formulation we exhibit counterexamples to seemingly reasonable but false generalizations of the Alberti-Uhlmann theorem.

arXiv:1205.0641•Journal of Mathematical Physics•Oct 1, 2012•45 citations

Deterministic Quantum State Transformations

Chefles, A

We derive a necessary condition for the existence of a completely-positive, linear, trace-preserving map which deterministically transforms one finite set of pure quantum states into another. This condition is also sufficient for linearly-independent initial states. We also examine the issue of quantum coherence, that is, when such operations maintain the purity of superpositions. If, in any deterministic transformation from one linearly-independent set to another, even a single, complete superposition of the initial states maintains its purity, the initial and final states are related by a unitary transformation.

•Nov 22, 1999•18 citations

Optimal probabilistic cloning and purification of quantum states

Jaromír Fiurášek

We investigate the probabilistic cloning and purification of quantum states. The performance of these probabilistic operations is quantified by the average fidelity between the ideal and actual output states. We provide a simple formula for the maximal achievable average fidelity and we explicitly show how to construct a probabilistic operation that achieves this fidelity. We illustrate our method on several examples such as the phase covariant cloning of qubits, cloning of coherent states, and purification of qubits transmitted via depolarizing channel and amplitude damping channel. Our examples reveal that the probabilistic cloner may yield higher fidelity than the best deterministic cloner even when the states that should be cloned are linearly dependent and are drawn from a continuous set.

arXiv:quant-ph/0403165•Physical Review A•Sep 10, 2004•69 citations

Quantum-information division and an optimal uncorrelated channel

Yuji Sekino, Satoshi Ishizaka

We consider quantum-information division, which is characterized by a channel whose outputs have no correlation and are not completely randomized. We show that the quantum-information division is possible in a probabilistic manner by optimizing the average fidelity in the channel with $M$ outputs in both deterministic and probabilistic cases. Moreover, we show that the optimal fidelities drastically change depending on the condition imposed on the outputs (symmetric and asymmetric), which is quite in contrast to the case of imperfect cloning.

arXiv:1307.6926•Physical Review A•Mar 31, 2014•2 citations

Geometrical analysis of probabilistic quantum cloning and identification of N states

Haixin Liu, Heng Fan

Abstract Creating n perfect clones from m copies of one of N prior known quantum states with minimum failure probability is a long-standing problem. We present a general geometrical form of the sufficient and necessary condition of probabilistic cloning of N known quantum states. With only one equality, we delineate in a parameter space the feasible set for probabilistic cloning of N known quantum states with prior probabilities and the surface for the optimal probabilistic cloning. The results are also applicable to the identification of those N quantum states. We provide a complete process of optimal identification of N given states and illustrate it with examples of three states. We further discover the relationship between probabilistic identification and the convexity of the feasible set. In addition, we discuss the differences in parameter selection when N = 2 and N ⩾ 3, plus provide a rigorous proof of some specific conclusions of this probabilistic quantum cloning problem when N = 2.

Journal of Physics A Mathematical and Theoretical•May 14, 2020•1 citation

Condition and capability of quantum state separation

Yuan Feng, Runyao Duan, Zhengfeng Ji

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 a 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.

arXiv:quant-ph/0506021•Physical Review A•Jul 13, 2005•18 citations
It is known that to imperfectly clone a phase-set of states uncorrelatedly is impossible due to the linearity and the hermitian-preservation of quantum operations deterministically shown by D'Ariano et al. In this paper we address uncorrelated cloning in probabilistic cases. We show that there exists a linear and hermitian-preserving probabilistic map to imperfectly clone a phase-set of states uncorrelatedly. It is pointed out that the existence of such a map is due to the difference between non-unit-trace output operators and normalized (unit-trace) output operators inherent to probabilistic maps. We however prove that such a possibility of uncorrelated cloning is completely excluded by the condition of positivity in addition to the linearity and the hermitian-preservation of quantum operations. Our results implicate that the positivity of quantum operation is richer physical meaning than the one which we usually assume a priori for the necessity of "probability interpretation."
For a given set of input-output pairs of quantum states or observables, we ask the question whether there exists a physically implementable transformation that maps each of the inputs to the corresponding output. The physical maps on quantum states are trace-preserving completely positive maps, but we also consider variants of these requirements. We generalize the definition of complete positivity to linear maps defined on arbitrary subspaces, then formulate this notion as a semidefinite program, and relate it by duality to approximative extensions of this map. This gives a characterization of the maps which can be approximated arbitrarily well as the restriction of a map that is completely positive on the whole algebra, also yielding the familiar extension theorems on operator spaces. For quantum channel extensions and extensions by probabilistic operations we obtain semidefinite characterizations, and we also elucidate the special case of Abelian inputs or outputs. Finally, revisiting a theorem by Alberti and Uhlmann, we provide simpler and more widely applicable conditions for certain extension problems on qubits, and by using a semidefinite programming formulation we exhibit counterexamples to seemingly reasonable but false generalizations of the Alberti-Uhlmann theorem.
We derive a necessary condition for the existence of a completely-positive, linear, trace-preserving map which deterministically transforms one finite set of pure quantum states into another. This condition is also sufficient for linearly-independent initial states. We also examine the issue of quantum coherence, that is, when such operations maintain the purity of superpositions. If, in any deterministic transformation from one linearly-independent set to another, even a single, complete superposition of the initial states maintains its purity, the initial and final states are related by a unitary transformation.
We investigate the probabilistic cloning and purification of quantum states. The performance of these probabilistic operations is quantified by the average fidelity between the ideal and actual output states. We provide a simple formula for the maximal achievable average fidelity and we explicitly show how to construct a probabilistic operation that achieves this fidelity. We illustrate our method on several examples such as the phase covariant cloning of qubits, cloning of coherent states, and purification of qubits transmitted via depolarizing channel and amplitude damping channel. Our examples reveal that the probabilistic cloner may yield higher fidelity than the best deterministic cloner even when the states that should be cloned are linearly dependent and are drawn from a continuous set.
We consider quantum-information division, which is characterized by a channel whose outputs have no correlation and are not completely randomized. We show that the quantum-information division is possible in a probabilistic manner by optimizing the average fidelity in the channel with MMM outputs in both deterministic and probabilistic cases. Moreover, we show that the optimal fidelities drastically change depending on the condition imposed on the outputs (symmetric and asymmetric), which is quite in contrast to the case of imperfect cloning.
Abstract Creating n perfect clones from m copies of one of N prior known quantum states with minimum failure probability is a long-standing problem. We present a general geometrical form of the sufficient and necessary condition of probabilistic cloning of N known quantum states. With only one equality, we delineate in a parameter space the feasible set for probabilistic cloning of N known quantum states with prior probabilities and the surface for the optimal probabilistic cloning. The results are also applicable to the identification of those N quantum states. We provide a complete process of optimal identification of N given states and illustrate it with examples of three states. We further discover the relationship between probabilistic identification and the convexity of the feasible set. In addition, we discuss the differences in parameter selection when N = 2 and N ⩾ 3, plus provide a rigorous proof of some specific conclusions of this probabilistic quantum cloning problem when N = 2.
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 a 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.