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/9908001 · Physics Letters A

General strategies for discrimination of quantum states

Chuanwei Zhang, Chuan-Feng Li, Guang-Can Guo

Published Oct 1, 1999• 68 citations
arXivHTMLPDF
DOI
10.1016/s0375-9601(99)00566-6

Related papers

Generalized sequential state discrimination for multiparty QKD and its optical implementation

Min Namkung, Younghun Kwon

Sequential state discrimination is a strategy for N separated receivers. As sequential state discrimination can be applied to multiparty quantum key distribution (QKD), it has become one of the relevant research fields in quantum information theory. Up to now, the analysis of sequential state discrimination has been confined to special cases. In this report, we consider a generalization of sequential state discrimination. Here, we do not limit the prior probabilities and the number of quantum states and receivers. We show that the generalized sequential state discrimination can be expressed as an optimization problem. Moreover, we investigate a structure of generalized sequential state discrimination for two quantum states and apply it to multiparty QKD. We demonstrate that when the number of receivers is not too many, generalized sequential state discrimination for two pure states can be suitable for multiparty QKD. In addition, we show that generalized sequential state discrimination for two mixed states can be performed with high optimal success probability. This optimal success probability is even higher than those of quantum reproducing and quantum broadcasting strategy. Thus, generalized sequential state discrimination of mixed states is adequate for performing multiparty QKD. Furthermore, we prove that generalized sequential state discrimination can be implemented experimentally by using linear optics. Finally, we analyze the security of multiparty QKD provided by optimal sequential state discrimination. Our analysis shows that the multiparty QKD guarantees nonzero secret key rate even in low channel efficiency.

Scientific Reports•May 19, 2020•10 citations

Discrimination Among Quantum States

Masashi Ban

International Journal of Theoretical Physics•Jan 1, 2004•4 citations

Discrimination and identification of quantum states

Ulrike Futschik

•Jan 1, 2010•0 citations

Understanding of Various Type of Unambiguous Discrimination in View of Coherence Distribution

Min Namkung, Younghun Kwon

Unambiguous quantum state discrimination is a strategy where the conclusive result can always be trusted. This strategy is very important, since it can be used for various quantum information protocols, including quantum key distribution. However, in the view of quantumness, it is not clear what is going on in performing unambiguous quantum state discrimination. To answer the question, we investigate coherence distribution when unambiguous discrimination is performed by generalized measurement. Specially, we study coherence distribution in three cases, which consist of unambiguous quantum state discrimination, sequential quantum state discrimination, and assisted optimal discrimination, which are considered to be a family of unambiguous quantum state discrimination. In this investigation, we show that the structure of generalized measurements performing various types of unambiguous quantum state discrimination can be understood in terms of coherence distribution. Our result is not limited to the discrimination of two pure quantum states, but it is extended to the discrimination of two mixed states.

Entropy•Dec 16, 2020•5 citations

Composite Classical and Quantum Channel Discrimination

Bjarne Bergh, Nilanjana Datta, Salzmann, Robert

We study the problem of binary composite channel discrimination in the asymmetric setting, where the hypotheses are given by fairly arbitrary sets of channels, and samples do not have to be identically distributed. In the case of quantum channels we prove: (i) a characterization of the Stein exponent for parallel channel discrimination strategies and (ii) an upper bound on the Stein exponent for adaptive channel discrimination strategies. We further show that already for classical channels this upper bound can sometimes be achieved and be strictly larger than what is possible with parallel strategies. Hence, there can be an advantage of adaptive channel discrimination strategies with composite hypotheses for classical channels, unlike in the case of simple hypotheses. Moreover, we show that classically this advantage can only exist if the sets of channels corresponding to the hypotheses are non-convex. As a consequence of our more general treatment, which is not limited to the composite i.i.d. setting, we also obtain a generalization of previous composite state discrimination results.

arXiv:2303.02016•Mar 3, 2023•2 citations

Discrimination of quantum states with selected applications

János A. Bergou

Contemporary Physics•May 1, 2008•0 citations
Sequential state discrimination is a strategy for N separated receivers. As sequential state discrimination can be applied to multiparty quantum key distribution (QKD), it has become one of the relevant research fields in quantum information theory. Up to now, the analysis of sequential state discrimination has been confined to special cases. In this report, we consider a generalization of sequential state discrimination. Here, we do not limit the prior probabilities and the number of quantum states and receivers. We show that the generalized sequential state discrimination can be expressed as an optimization problem. Moreover, we investigate a structure of generalized sequential state discrimination for two quantum states and apply it to multiparty QKD. We demonstrate that when the number of receivers is not too many, generalized sequential state discrimination for two pure states can be suitable for multiparty QKD. In addition, we show that generalized sequential state discrimination for two mixed states can be performed with high optimal success probability. This optimal success probability is even higher than those of quantum reproducing and quantum broadcasting strategy. Thus, generalized sequential state discrimination of mixed states is adequate for performing multiparty QKD. Furthermore, we prove that generalized sequential state discrimination can be implemented experimentally by using linear optics. Finally, we analyze the security of multiparty QKD provided by optimal sequential state discrimination. Our analysis shows that the multiparty QKD guarantees nonzero secret key rate even in low channel efficiency.
Unambiguous quantum state discrimination is a strategy where the conclusive result can always be trusted. This strategy is very important, since it can be used for various quantum information protocols, including quantum key distribution. However, in the view of quantumness, it is not clear what is going on in performing unambiguous quantum state discrimination. To answer the question, we investigate coherence distribution when unambiguous discrimination is performed by generalized measurement. Specially, we study coherence distribution in three cases, which consist of unambiguous quantum state discrimination, sequential quantum state discrimination, and assisted optimal discrimination, which are considered to be a family of unambiguous quantum state discrimination. In this investigation, we show that the structure of generalized measurements performing various types of unambiguous quantum state discrimination can be understood in terms of coherence distribution. Our result is not limited to the discrimination of two pure quantum states, but it is extended to the discrimination of two mixed states.
We study the problem of binary composite channel discrimination in the asymmetric setting, where the hypotheses are given by fairly arbitrary sets of channels, and samples do not have to be identically distributed. In the case of quantum channels we prove: (i) a characterization of the Stein exponent for parallel channel discrimination strategies and (ii) an upper bound on the Stein exponent for adaptive channel discrimination strategies. We further show that already for classical channels this upper bound can sometimes be achieved and be strictly larger than what is possible with parallel strategies. Hence, there can be an advantage of adaptive channel discrimination strategies with composite hypotheses for classical channels, unlike in the case of simple hypotheses. Moreover, we show that classically this advantage can only exist if the sets of channels corresponding to the hypotheses are non-convex. As a consequence of our more general treatment, which is not limited to the composite i.i.d. setting, we also obtain a generalization of previous composite state discrimination results.