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:quant-ph/0506021 · Physical Review A

Condition and capability of quantum state separation

Yuan Feng, Runyao Duan, Zhengfeng Ji

Published Jul 13, 2005• 18 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.72.012313

Related papers

Quantum state separation, unambiguous discrimination and exact cloning

Anthony Chefles, Stephen Mark Barnett

Unambiguous discrimination and exact cloning reduce the square-overlap between quantum states, exemplifying the more general type of procedure we term state separation . We obtain the maximum probability with which two equiprobable quantum states can be separated by an arbitrary degree, and find that the established bounds on the success probabilities for discrimination and cloning are special cases of this general bound. The latter also gives the maximum probability of successfully producing N exact copies of a quantum system whose state is chosen secretly from a known pair, given M initial realizations of the state, where N > M . We also discuss the relationship between this bound and that on unambiguous state discrimination.

arXiv:quant-ph/9808018•Journal of Physics A Mathematical and General•Dec 18, 1998•100 citations

Quantum State Seperation, Unambiguous Discrimination and Exact Cloning

Anthony Chefles, Stephen Mark Barnett

Unambiguous discrimination and exact cloning reduce the square-overlap between quantum states, exemplifying the more general type of procedure we term state separation. We obtain the maximum probability with which two equiprobable quantum states can be separated by an arbitrary degree, and find that the established bounds on the success probabilities for discrimination and cloning are special cases of this general bound. The latter also gives the maximum probability of successfully producing N exact copies of a quantum system whose state is chosen secretly from a known pair, given M initial realizations of the state, where N > M. We also discuss the relationship between this bound and that on unambiguous state discrimination.

European Quantum Electronics Conference (EQEC)•Aug 24, 2005•0 citations

No Universal Purification in Quantum Mechanics

Zhenhuan Liu, Du, Zhenyu, Eisert, Jens +2 more

Many central tasks in fundamental physics and quantum information processing are possible only insofar as mixed quantum states can be made purer. In this work, we prove that the linearity and positivity of quantum mechanics impose general restrictions on quantum purification, unveiling a new fundamental principle of quantum information processing. We first establish that no quantum operation can transform a finite number of copies of an unknown quantum state or channel into an exactly pure output that depends non-trivially on the input, thereby ruling out an important form of universal purification in both static and dynamical settings. Building on this, we show that, upon relaxing the requirement of exact purity, one can establish quantitative sample-complexity lower bounds for approximate purification that hold for arbitrary physically allowed strategies, whose scaling matches the performance of purification-related tasks across several different areas of quantum information processing. Moreover, this lower bound leads to a generalized standard quantum limit for learning arbitrary functions of a quantum state, greatly extending earlier results based on quantum Fisher information and revealing a deep connection between purification and quantum learning. Extending this principle to other important settings, we establish, for the first time, an exponential sample-complexity lower bound for approximate pure dilation state preparation and a no-go theorem for approximate bosonic Gaussian state purification with passive Gaussian operations, establishing much more stringent limitations under practical operational constraints.

arXiv:2509.21111•Sep 25, 2025•14 citations

Part probabilistic cloning of linearly dependent states

Pinshu Rui, Zhang, Wen, Yan-Lin Liao +1 more

From Ref. [Phys. Rev. Lett. 80(1998)4999] one knows that the quantum states secretly chosen from a certain set can be probabilistically cloned with positive cloning efficiencies if and only if all the states in the set are linearly independent. In this paper, we focus on the probabilistic quantum cloning (PQC) of linearly dependent states with nonnegative cloning efficiencies. We show that a linearly independent subset of the linearly dependent quantum states can be probabilistically cloned if and only if any one state in the subset can not be expressed as the linear superposition of the other states in the set. The optimal possible cloning efficiencies are also investigated.

arXiv:1603.07036•Mar 23, 2016•1 citation

Upper bound on the success probability of separation among quantum states

Daowen Qiu

Quantum state separation is a more general operation for identifying states than unambiguous discrimination. In this paper, we derive an upper bound on the success probability of separation among n states with arbitrary a priori probabilities, extending some of the important results given in the literature. This conclusion generalizes that obtained by Chefles and Barnett for separating two states having equal a priori probabilities. Some of the known bounds on the success probabilities of unambiguous discrimination such as the Ivanovic–Dieks–Peres limit, the more general limit by Jaeger and Shimony, and an upper bound for the case of unambiguously discriminating n states, are special cases of our results. Notably, we also give implicitly a different method to derive the upper bound on the probability of successful unambiguous discrimination among n states. Finally, we apply our conclusion to quantum cloning and then derive some upper bounds on the success probabilities for several probabilistic cloning machines.

Journal of Physics A Mathematical and General•Jul 30, 2002•25 citations

Linearly-Independent Quantum States Can Be Cloned by a Unitary-Reduct ion Operation

Duan Lu-ming, Guo Guang-Can

The famous quantum no-cloning theorem [Nature 299(1952)802] forbids replication of an arbitrary unknown quantum state. But it leaves open the following question: If the state is not completely arbitrary, but secretly chosen from a certain set , whether is the cloning possible? It is proved that the states from the set can be faithfully cloned by a general unitary-reduction operation in a probabilistic fashion if and only if and are linearly-independent.

Communications in Theoretical Physics•Mar 15, 1999•9 citations
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.
Unambiguous discrimination and exact cloning reduce the square-overlap between quantum states, exemplifying the more general type of procedure we term state separation . We obtain the maximum probability with which two equiprobable quantum states can be separated by an arbitrary degree, and find that the established bounds on the success probabilities for discrimination and cloning are special cases of this general bound. The latter also gives the maximum probability of successfully producing N exact copies of a quantum system whose state is chosen secretly from a known pair, given M initial realizations of the state, where N > M . We also discuss the relationship between this bound and that on unambiguous state discrimination.
Unambiguous discrimination and exact cloning reduce the square-overlap between quantum states, exemplifying the more general type of procedure we term state separation. We obtain the maximum probability with which two equiprobable quantum states can be separated by an arbitrary degree, and find that the established bounds on the success probabilities for discrimination and cloning are special cases of this general bound. The latter also gives the maximum probability of successfully producing N exact copies of a quantum system whose state is chosen secretly from a known pair, given M initial realizations of the state, where N > M. We also discuss the relationship between this bound and that on unambiguous state discrimination.
Many central tasks in fundamental physics and quantum information processing are possible only insofar as mixed quantum states can be made purer. In this work, we prove that the linearity and positivity of quantum mechanics impose general restrictions on quantum purification, unveiling a new fundamental principle of quantum information processing. We first establish that no quantum operation can transform a finite number of copies of an unknown quantum state or channel into an exactly pure output that depends non-trivially on the input, thereby ruling out an important form of universal purification in both static and dynamical settings. Building on this, we show that, upon relaxing the requirement of exact purity, one can establish quantitative sample-complexity lower bounds for approximate purification that hold for arbitrary physically allowed strategies, whose scaling matches the performance of purification-related tasks across several different areas of quantum information processing. Moreover, this lower bound leads to a generalized standard quantum limit for learning arbitrary functions of a quantum state, greatly extending earlier results based on quantum Fisher information and revealing a deep connection between purification and quantum learning. Extending this principle to other important settings, we establish, for the first time, an exponential sample-complexity lower bound for approximate pure dilation state preparation and a no-go theorem for approximate bosonic Gaussian state purification with passive Gaussian operations, establishing much more stringent limitations under practical operational constraints.
From Ref. [Phys. Rev. Lett. 80(1998)4999] one knows that the quantum states secretly chosen from a certain set can be probabilistically cloned with positive cloning efficiencies if and only if all the states in the set are linearly independent. In this paper, we focus on the probabilistic quantum cloning (PQC) of linearly dependent states with nonnegative cloning efficiencies. We show that a linearly independent subset of the linearly dependent quantum states can be probabilistically cloned if and only if any one state in the subset can not be expressed as the linear superposition of the other states in the set. The optimal possible cloning efficiencies are also investigated.
Quantum state separation is a more general operation for identifying states than unambiguous discrimination. In this paper, we derive an upper bound on the success probability of separation among n states with arbitrary a priori probabilities, extending some of the important results given in the literature. This conclusion generalizes that obtained by Chefles and Barnett for separating two states having equal a priori probabilities. Some of the known bounds on the success probabilities of unambiguous discrimination such as the Ivanovic–Dieks–Peres limit, the more general limit by Jaeger and Shimony, and an upper bound for the case of unambiguously discriminating n states, are special cases of our results. Notably, we also give implicitly a different method to derive the upper bound on the probability of successful unambiguous discrimination among n states. Finally, we apply our conclusion to quantum cloning and then derive some upper bounds on the success probabilities for several probabilistic cloning machines.