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

3 元対称コヒーレント信号に対する古典ミニマックス解を与える生起確率

蒼一朗 藤田, 正雄 大崎

Published May 12, 2025• 0 citations
Publisher

Abstract

Here we give the result of the classical detection theory, which satisfies the mini-max condition for the ternary coherent signal. In detail, a priori probabilities of the signal are derived from the necessary and sufficient conditions of the mini-max strategy and compared with those obtained by the quantum detection theory.
DOI
10.15045/0002000473

Related papers

Derivation and physical interpretation of the optimum detection operators for coherent-state signals

Masao Osaki, Masashi Ban, Osamu Hirota

The optimum detection operators are derived for several linearly independent signal sets. The quantum minimax strategy is applied to the M-ary coherent state signals such as binary phase shift, ternary symmetric, ternary phase shift, and quadrature phase shift. It is shown that the detection process induces a kind of quantum interference between signal quantum states and measurement states. \textcopyright{} 1996 The American Physical Society.

Physical Review A•Aug 1, 1996•76 citations

On Maximum Mutual Information without Coding

Masao Osaki, Masashi Ban, Osamu Hirota

We consider the communication systems sending the classical (Shannon) information through the quantum channel. The classical information source X is represented with symbols and their a priori probabilities At a transmitter, each symbol is modulated to a quantum state and detected at a receiver by the quantum mechanically generalized measurement, so-called the probability operator-valued measure Here we call a detection operator since it represents a detection process deciding a received signal to be ‘j’. The detection operator is no-negative, and resolution of identity, where is the identity operator on the signal Hilbert space spanned by signal quantum states. This detection process can be regarded as a quantum channel characterized by the conditional probability defined as follows:

Kluwer Academic Publishers eBooks•Dec 19, 2005•2 citations

Necessary and sufficient conditions for minimax strategy in quantum signal detection

Kentaro Kato

The necessary and sufficient conditions for the minimax strategy of a finite number of decisions in quantum signal detection are derived in the case that the average Bayes cost is used as a quality function. This is a simple extension of the result of Hirota and Ikehara [1]. Applying the necessary and sufficient conditions, a closed-form expression of the minimax strategy for binary pure state signal is shown. Furthermore, the minimax strategy for a discrimination problem of the quasi-Bell states is considered. In this case, the square-root measurement consisting of the quasi-Bell states yields the minimax strategy.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2012•8 citations

Minimax strategy in quantum signal detection with inconclusive results

Kenji Nakahira, Kentaro Kato, Tsuyoshi Sasaki Usuda

We consider the application of the minimax strategy to discrimination between quantum states with a certain fraction of inconclusive results. An inconclusive minimax solution is defined as the pair of a collection of prior probabilities and a quantum measurement that achieves the minimax probability of a detection error subject to the constraint that the highest probability of an inconclusive result does not exceed a given value. We first show a necessary and sufficient condition for an inconclusive minimax solution, and derive that the problem of obtaining an inconclusive minimax measurement can be expressed as a semidefinite programming problem. We then present a condition under which there exists a solution such that at least one of the prior probabilities is a zero. We finally show that for any state set with a certain symmetry, an inconclusive minimax solution exists having the same symmetry.

Physical Review A•Sep 13, 2013•13 citations

The Numerical Results of Binary Coherent-State Signal’s Quantum Detection in the Presence of Noise

Wenbin Yu, Zijia Xiong, Zangqiang Dong +4 more

Lecture notes in computer science•Jan 1, 2020•0 citations

Two kinds of asymptotic bounds in quantum channel estimation

Masahito Hayashi

In order to treat the covariant approach and the Cramer-Rao approach in a unified viewpoint, we compare the Cramer-Rao bound and the local asymptotic mini-max bound, which coincides the limit of Bayesian bound in the group covariant case. it is shown that the local asymptotic mini-max bound is strictly larger than the Cramer-Rao bound in the phase estimation case while the both bounds coincide when the minimum mean square error decreases with the order O(1/n). We also derive a sufficient condition for that the minimum mean square error decreases with the order O(1/n).

•Mar 24, 2010•1 citation
We consider the communication systems sending the classical (Shannon) information through the quantum channel. The classical information source X is represented with symbols and their a priori probabilities At a transmitter, each symbol is modulated to a quantum state and detected at a receiver by the quantum mechanically generalized measurement, so-called the probability operator-valued measure Here we call a detection operator since it represents a detection process deciding a received signal to be ‘j’. The detection operator is no-negative, and resolution of identity, where is the identity operator on the signal Hilbert space spanned by signal quantum states. This detection process can be regarded as a quantum channel characterized by the conditional probability defined as follows:
The necessary and sufficient conditions for the minimax strategy of a finite number of decisions in quantum signal detection are derived in the case that the average Bayes cost is used as a quality function. This is a simple extension of the result of Hirota and Ikehara [1]. Applying the necessary and sufficient conditions, a closed-form expression of the minimax strategy for binary pure state signal is shown. Furthermore, the minimax strategy for a discrimination problem of the quasi-Bell states is considered. In this case, the square-root measurement consisting of the quasi-Bell states yields the minimax strategy.
We consider the application of the minimax strategy to discrimination between quantum states with a certain fraction of inconclusive results. An inconclusive minimax solution is defined as the pair of a collection of prior probabilities and a quantum measurement that achieves the minimax probability of a detection error subject to the constraint that the highest probability of an inconclusive result does not exceed a given value. We first show a necessary and sufficient condition for an inconclusive minimax solution, and derive that the problem of obtaining an inconclusive minimax measurement can be expressed as a semidefinite programming problem. We then present a condition under which there exists a solution such that at least one of the prior probabilities is a zero. We finally show that for any state set with a certain symmetry, an inconclusive minimax solution exists having the same symmetry.
In order to treat the covariant approach and the Cramer-Rao approach in a unified viewpoint, we compare the Cramer-Rao bound and the local asymptotic mini-max bound, which coincides the limit of Bayesian bound in the group covariant case. it is shown that the local asymptotic mini-max bound is strictly larger than the Cramer-Rao bound in the phase estimation case while the both bounds coincide when the minimum mean square error decreases with the order O(1/n). We also derive a sufficient condition for that the minimum mean square error decreases with the order O(1/n).