No abstract

Recently, J. A. Bergou et al. proposed sequential state discrimination as a new quantum state discrimination scheme. In the scheme, by the successful sequential discrimination of a qubit state, receivers Bob and Charlie can share the information of the qubit prepared by a sender Alice. A merit of the scheme is that a quantum channel is established between Bob and Charlie, but a classical communication is not allowed. In this report, we present a method for extending the original sequential state discrimination of two qubit states to a scheme of N linearly independent pure quantum states. Specifically, we obtain the conditions for the sequential state discrimination of N = 3 pure quantum states. We can analytically provide conditions when there is a special symmetry among N = 3 linearly independent pure quantum states. Additionally, we show that the scenario proposed in this study can be applied to quantum key distribution. Furthermore, we show that the sequential state discrimination of three qutrit states performs better than the strategy of probabilistic quantum cloning.

Sequential state discrimination is a strategy for quantum state discrimination of a sender’s quantum states when N receivers are separately located. In this report, we propose optical designs that can perform sequential state discrimination of two coherent states. For this purpose, we consider not only binary phase-shifting-key (BPSK) signals but also general coherent states, with arbitrary prior probabilities. Since our optical designs do not include electric feedback, they can be implemented without difficulty. Furthermore, we analyze our proposal for the case of photon loss. We also demonstrate that sequential state discrimination of two coherent states performs better than the probabilistic quantum cloning strategy. This proposal can facilitate multiparty QKD based on coherent states.

In this article, we investigate the error bound of quantum discord, obtained by the analytic formula of Ali et al.[Phys. Rev. A 81(2010)

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.