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.

arXiv:quant-ph/9808018Journal of Physics A Mathematical and GeneralDec 18, 199898 citations

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.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 GeneralJul 30, 200225 citations

Strategies and networks for state-dependent quantum cloning

Anthony Chefles, Stephen Mark Barnett

State-dependent cloning machines that have so far been considered either deterministically copy a set of states approximately or probablistically copy them exactly. In considering the case of two equiprobable pure states, we derive the maximum global fidelity of N approximate clones given M initial exact copies, where $N>M$ . We also consider strategies that interpolate between approximate and exact cloning. A tight inequality is obtained that expresses a trade-off between the global fidelity and success probability. This inequality is found to tend, in the limit $N\stackrel{\ensuremath{\rightarrow}}{}\ensuremath{\infty}$, to a known inequality that expresses the trade-off between error and inconclusive result probabilities for state-discrimination measurements. Quantum-computational networks are also constructed for the kinds of cloning machine we describe. For this purpose, we introduce two gates: the distinguishability transfer and state separation gates. Their key properties are described and we show how they may be decomposed into basic operations.State-dependent cloning machines that have so far been considered either deterministically copy a set of states approximately or probablistically copy them exactly. In considering the case of two equiprobable pure states, we derive the maximum global fidelity of N approximate clones given M initial exact copies, where $N>M$. We also consider strategies that interpolate between approximate and exact cloning. A tight inequality is obtained that expresses a trade-off between the global fidelity and success probability. This inequality is found to tend, in the limit $N\stackrel{\ensuremath{\rightarrow}}{}\ensuremath{\infty}$, to a known inequality that expresses the trade-off between error and inconclusive result probabilities for state-discrimination measurements. Quantum-computational networks are also constructed for the kinds of cloning machine we describe. For this purpose, we introduce two gates: the distinguishability transfer and state separation gates. Their key properties are described and we show how they may be decomposed into basic operations.

arXiv:quant-ph/9812035Physical Review AJul 1, 199965 citations

Quantum State Discrimination and Quantum Cloning: Optimization and Implementation

Andi Shehu

In our work we explore the field of quantum state discrimination and quantum cloning. Recently the problem of optimal state discrimination with a Fixed Rate of Inconclusive Outcomes (FRIO strategy) has been solved for two pure quantum states and a few other highly symmetric cases. An optical implementation to FRIO for pure states is provided. The physical implementation can be carried out with the use of a six-port interferometer constructed with optical fibers beam splitters, phase shifters and mirrors. The input states are composed of qubits which are realized as photons in the dual-rail representation. The non-unitary measurements are carried out at the output for the presence or absence of a photon. The setup optimally interpolates between minimum error and unambiguous state discrimination. We also extend the FRIO strategy to two mixed states, whose eigenvectors in their spectral representation form a Jordan basis. We derive the minimum error rate PE for a fixed inconclusive rate Q and, in particular, the optimal distribution of the total Q over the Jordan subspaces. As Q is varied between the two limits, 0 < Q < Qc, a structure with multiple thresholds, Q1(th) (=0) < Q2(th) < . . . < QN(th) < Qc, emerges. We also solve the problem of state separation of two known pure states in the general case where the known states have arbitrary prior probabilities. The solution emerges from a geometric formulation of the problem. This formulation also reveals a deeper connection between cloning and state discrimination. The results are then applied in designing a scheme for hybrid cloning which interpolates between approximate and probabilistic exact cloning. It is shown that state separation and hybrid cloning are generalized schemes to well established state discrimination and cloning strategies. The connection between cloning and state separation is derived in the asymptotic limit.In our work we explore the field of quantum state discrimination and quantum cloning. Recently the problem of optimal state discrimination with a Fixed Rate of Inconclusive Outcomes (FRIO strategy) has been solved for two pure quantum states and a few other highly symmetric cases. An optical implementation to FRIO for pure states is provided. The physical implementation can be carried out with the use of a six-port interferometer constructed with optical fibers beam splitters, phase shifters and mirrors. The input states are composed of qubits which are realized as photons in the dual-rail representation. The non-unitary measurements are carried out at the output for the presence or absence of a photon. The setup optimally interpolates between minimum error and unambiguous state discrimination. We also extend the FRIO strategy to two mixed states, whose eigenvectors in their spectral representation form a Jordan basis. We derive the minimum error rate PE for a fixed inconclusive rate Q and, in particular, the optimal distribution of the total Q over the Jordan subspaces. As Q is varied between the two limits, 0 < Q < Qc, a structure with multiple thresholds, Q1(th) (=0) < Q2(th) < . . . < QN(th) < Qc, emerges. We also solve the problem of state separation of two known pure states in the general case where the known states have arbitrary prior probabilities. The solution emerges from a geometric formulation of the problem. This formulation also reveals a deeper connection between cloning and state discrimination. The results are then applied in designing a scheme for hybrid cloning which interpolates between approximate and probabilistic exact cloning. It is shown that state separation and hybrid cloning are generalized schemes to well established state discrimination and cloning strategies. The connection between cloning and state separation is derived in the asymptotic limit.

Jan 1, 20153 citations

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.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/0506021Physical Review AJul 13, 200517 citations

Optimal unambiguous state discrimination of two density matrices: Lower bound and class of exact solutions

Philippe Raynal, Norbert Lütkenhaus

Recently the problem of unambiguous state discrimination of mixed quantum states has attracted much attention. So far, bounds on the optimum success probability have been derived [T. Rudolph, R. W. Spekkens, and P. S. Turner, Phys. Rev. A 68, 010301(R) (2003)]. For two mixed states they are given in terms of the fidelity. Here we give tighter bounds as well as necessary and sufficient conditions for two mixed states to reach these bounds. Moreover we construct the corresponding optimal measurement strategies. With this result, we provide analytical solutions for unambiguous discrimination of a class of generic mixed states. This goes beyond known results which are all reducible to some pure state case. Additionally, we show that examples exist where the bounds cannot be reached.Recently the problem of unambiguous state discrimination of mixed quantum states has attracted much attention. So far, bounds on the optimum success probability have been derived [T. Rudolph, R. W. Spekkens, and P. S. Turner, Phys. Rev. A 68, 010301(R) (2003)]. For two mixed states they are given in terms of the fidelity. Here we give tighter bounds as well as necessary and sufficient conditions for two mixed states to reach these bounds. Moreover we construct the corresponding optimal measurement strategies. With this result, we provide analytical solutions for unambiguous discrimination of a class of generic mixed states. This goes beyond known results which are all reducible to some pure state case. Additionally, we show that examples exist where the bounds cannot be reached.

arXiv:quant-ph/0502165Physical Review AAug 29, 200544 citations

N>M

. We also consider strategies that interpolate between approximate and exact cloning. A tight inequality is obtained that expresses a trade-off between the global fidelity and success probability. This inequality is found to tend, in the limit $N\stackrel{\ensuremath{\rightarrow}}{}\ensuremath{\infty}$, to a known inequality that expresses the trade-off between error and inconclusive result probabilities for state-discrimination measurements. Quantum-computational networks are also constructed for the kinds of cloning machine we describe. For this purpose, we introduce two gates: the distinguishability transfer and state separation gates. Their key properties are described and we show how they may be decomposed into basic operations.