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

Scientific Reports

Almost minimum error discrimination of N-ary weak coherent states by Jaynes-Cummings Hamiltonian dynamics

Min Namkung, Younghun Kwon

Published Dec 23, 2019• 33 citations
Publisher

Abstract

Quantum state discrimination of coherent states has been one of important problems in quantum information processing. Recently, R. Han et al. showed that minimum error discrimination of two coherent states can be nearly done by using Jaynes-Cummings Hamiltonian. In this paper, based on the result of R. Han et al., we propose the methods where minimum error discrimination of more than two weak coherent states can be nearly performed. Specially, we construct models which can do almost minimum error discrimination of three and four coherent states. Our result can be applied to quantum information processing of various coherent states.

DOI
10.1038/s41598-019-55589-7

Related papers

Two-sequential conclusive discrimination between binary coherent states via indirect measurements

Min Namkung, Elena R. Loubenets

Abstract A general scenario for an N -sequential conclusive state discrimination introduced recently in Loubenets and Namkung [arXiv:2102.04747] can provide a multipartite quantum communication realizable in the presence of a noise. In the present article, we propose a new experimental scheme for the implementation of a sequential conclusive discrimination between binary coherent states via indirect measurements within the Jaynes–Cummings interaction model. We find that if the mean photon number is less than 1.6, then, for our two-sequential state discrimination scheme, the optimal success probability is larger than the one presented in Fields, Bergou, and Varga (2020, IEEE Int. Conf. Quant. Comp. Eng. ). We also show that, if the mean photon number is almost equal to 1.2, then the optimal success probability nearly approaches the Helstrom bound.

arXiv:2103.12539•Physica Scripta•Jun 17, 2021•3 citations

Structure of minimum-error quantum state discrimination

Joonwoo Bae

Distinguishing different quantum states is a fundamental task having practical applications in information processing. Despite the effort devoted so far, however, strategies for optimal discrimination are known only for specific examples. In this paper we consider the problem of minimum-error quantum state discrimination where one attempts to minimize the average error. We show the general structure of minimum-error state discrimination as well as useful properties to derive analytic solutions. Based on the general structure, we present a geometric formulation of the problem, which can be applied to cases where quantum state geometry is clear. We also introduce equivalent classes of sets of quantum states in terms of minimum-error discrimination: sets of quantum states in an equivalent class that share the same guessing probability. In particular, for qubit states where the state geometry is found with the Bloch sphere, we illustrate that for an arbitrary set of qubit states, the minimum-error state discrimination with equal prior probabilities can be analytically solved, that is, optimal measurement and the guessing probability are explicitly obtained.

arXiv:1210.2845•New Journal of Physics•Jul 18, 2013•89 citations

Demonstration of Near-Optimal Discrimination of Optical Coherent States

Christoffer Wittmann, Masahiro Takeoka, K. N. Cassemiro +3 more

The optimal discrimination of nonorthogonal quantum states with minimum error probability is a fundamental task in quantum measurement theory as well as an important primitive in optical communication. In this work, we propose and experimentally realize a new and simple quantum measurement strategy capable of discriminating two coherent states with smaller error probabilities than can be obtained using the standard measurement devices: the Kennedy receiver and the homodyne receiver.

arXiv:0809.4953•Physical Review Letters•Nov 17, 2008•120 citations

Near optimal discrimination of binary coherent signals via atom–light interaction

Rui Han, János A. Bergou, Gerd Leuchs

We study the discrimination of weak coherent states of light with significant overlaps by nondestructive measurements on the light states through measuring atomic states that are entangled to the coherent states via dipole coupling. In this way, the problem of measuring and discriminating coherent light states is shifted to finding the appropriate atom–light interaction and atomic measurements. We show that this scheme allows us to attain a probability of error extremely close to the Helstrom bound, the ultimate quantum limit for discriminating binary quantum states, through the simple Jaynes–Cummings interaction between the field and ancilla with optimized light–atom coupling and projective measurements on the atomic states. Moreover, since the measurement is nondestructive on the light state, information that is not detected by one measurement can be extracted from the post-measurement light states through subsequent measurements.

arXiv:1710.04592•New Journal of Physics•Feb 28, 2018•19 citations

Achieving minimum-error discrimination of an arbitrary set of laser-light pulses

Marcus Palmer Da Silva, Saikat Guha, Zachary Dutton

Laser light is widely used for communication and sensing applications, so the optimal discrimination of coherent states---the quantum states of light emitted by an ideal laser---has immense practical importance. Due to fundamental limits imposed by quantum mechanics, such discrimination has a finite minimum probability of error. While concrete optical circuits for the optimal discrimination between two coherent states are well known, the generalization to larger sets of coherent states has been challenging. In this paper, we show how to achieve optimal discrimination of any set of coherent states using a resource-efficient quantum computer. Our construction leverages a recent result on discriminating multicopy quantum hypotheses [Blume-Kohout, Croke, and Zwolak, arXiv:1201.6625]. As illustrative examples, we analyze the performance of discriminating a ternary alphabet and show how the quantum circuit of a receiver designed to discriminate a binary alphabet can be reused in discriminating multimode hypotheses. Finally, we show that our result can be used to achieve the quantum limit on the rate of classical information transmission on a lossy optical channel, which is known to exceed the Shannon rate of all conventional optical receivers.

arXiv:1208.5758•Physical Review A•May 23, 2013•34 citations

Minimum-error state discrimination and Fano's inequality

Georgios M. Nikolopoulos

The discrimination between non-orthogonal quantum states plays a pivotal role in quantum information processing and quantum technology. Strategies that minimize the error probability are of particular importance, but they are only known for special classes of problems. Certain forms of Fano's inequality yield a bound on the error probability, but it is not known how close this bound is to the minimum-error probability achieved by means of optimal measurements. In this work, we discuss how the minimum-error probability compares to the error bound obtained through the Fano's inequality for several scenarios, some of which are amenable to analytic treatments.

arXiv:2505.10042•American Journal of Physics•Jun 20, 2025•1 citation
Quantum state discrimination of coherent states has been one of important problems in quantum information processing. Recently, R. Han et al. showed that minimum error discrimination of two coherent states can be nearly done by using Jaynes-Cummings Hamiltonian. In this paper, based on the result of R. Han et al., we propose the methods where minimum error discrimination of more than two weak coherent states can be nearly performed. Specially, we construct models which can do almost minimum error discrimination of three and four coherent states. Our result can be applied to quantum information processing of various coherent states.
Abstract A general scenario for an N -sequential conclusive state discrimination introduced recently in Loubenets and Namkung [arXiv:2102.04747] can provide a multipartite quantum communication realizable in the presence of a noise. In the present article, we propose a new experimental scheme for the implementation of a sequential conclusive discrimination between binary coherent states via indirect measurements within the Jaynes–Cummings interaction model. We find that if the mean photon number is less than 1.6, then, for our two-sequential state discrimination scheme, the optimal success probability is larger than the one presented in Fields, Bergou, and Varga (2020, IEEE Int. Conf. Quant. Comp. Eng. ). We also show that, if the mean photon number is almost equal to 1.2, then the optimal success probability nearly approaches the Helstrom bound.
Distinguishing different quantum states is a fundamental task having practical applications in information processing. Despite the effort devoted so far, however, strategies for optimal discrimination are known only for specific examples. In this paper we consider the problem of minimum-error quantum state discrimination where one attempts to minimize the average error. We show the general structure of minimum-error state discrimination as well as useful properties to derive analytic solutions. Based on the general structure, we present a geometric formulation of the problem, which can be applied to cases where quantum state geometry is clear. We also introduce equivalent classes of sets of quantum states in terms of minimum-error discrimination: sets of quantum states in an equivalent class that share the same guessing probability. In particular, for qubit states where the state geometry is found with the Bloch sphere, we illustrate that for an arbitrary set of qubit states, the minimum-error state discrimination with equal prior probabilities can be analytically solved, that is, optimal measurement and the guessing probability are explicitly obtained.
We study the discrimination of weak coherent states of light with significant overlaps by nondestructive measurements on the light states through measuring atomic states that are entangled to the coherent states via dipole coupling. In this way, the problem of measuring and discriminating coherent light states is shifted to finding the appropriate atom–light interaction and atomic measurements. We show that this scheme allows us to attain a probability of error extremely close to the Helstrom bound, the ultimate quantum limit for discriminating binary quantum states, through the simple Jaynes–Cummings interaction between the field and ancilla with optimized light–atom coupling and projective measurements on the atomic states. Moreover, since the measurement is nondestructive on the light state, information that is not detected by one measurement can be extracted from the post-measurement light states through subsequent measurements.
Laser light is widely used for communication and sensing applications, so the optimal discrimination of coherent states---the quantum states of light emitted by an ideal laser---has immense practical importance. Due to fundamental limits imposed by quantum mechanics, such discrimination has a finite minimum probability of error. While concrete optical circuits for the optimal discrimination between two coherent states are well known, the generalization to larger sets of coherent states has been challenging. In this paper, we show how to achieve optimal discrimination of any set of coherent states using a resource-efficient quantum computer. Our construction leverages a recent result on discriminating multicopy quantum hypotheses [Blume-Kohout, Croke, and Zwolak, arXiv:1201.6625]. As illustrative examples, we analyze the performance of discriminating a ternary alphabet and show how the quantum circuit of a receiver designed to discriminate a binary alphabet can be reused in discriminating multimode hypotheses. Finally, we show that our result can be used to achieve the quantum limit on the rate of classical information transmission on a lossy optical channel, which is known to exceed the Shannon rate of all conventional optical receivers.
The discrimination between non-orthogonal quantum states plays a pivotal role in quantum information processing and quantum technology. Strategies that minimize the error probability are of particular importance, but they are only known for special classes of problems. Certain forms of Fano's inequality yield a bound on the error probability, but it is not known how close this bound is to the minimum-error probability achieved by means of optimal measurements. In this work, we discuss how the minimum-error probability compares to the error bound obtained through the Fano's inequality for several scenarios, some of which are amenable to analytic treatments.