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

陕西师范大学学报:自然科学版

The minimal error discrimination based on the square root measurement

Wenhua Wang, Cao Huaixin

Published Jan 1, 2016• 0 citations
OpenAlex

Related papers

MINIMUM-ERROR DISCRIMINATION FOR GEOMETRICALLY UNIFORM STATES

Eunsang Kim, Tae Ryong Park

Far East Journal of Mathematical Sciences (FJMS)•Oct 11, 2018•0 citations

Family of generalized “pretty good” measurements and the minimal-error pure-state discrimination problems for which they are optimal

Carlos Mochon

Given a quantum pure state chosen from a set with some a priori probabilities, what is the optimal measurement needed to correctly guess the given state? We show that a good choice is the family of square-root or ``pretty good'' measurements, as each measurement in the family is optimal for at least one discrimination problem with the same quantum states but possibly different a priori probabilities. Furthermore, the map from measurement to discrimination problems can be explicitly described. In fact, for linearly independent states, every pair of discrimination problem and optimal measurement can be explicitly generated this way.

arXiv:quant-ph/0506061•Physical Review A•Mar 22, 2006•48 citations

Imaginarity-assisted minimum error discrimination

Anonymous, Yadi Qiao, Huaixin Cao +1 more

Physical Review A•Sep 28, 2026•0 citations

Square-root measurement for pure states

Siendong Huang

Square-root measurement is a very useful suboptimal measurement in many applications. It was shown that the square-root measurement minimizes the squared error for pure states. In this paper, the least squared error problem is reformulated and a new proof is provided. It is found that the least squared error depends only on the average density operator of the input states. The properties of the least squared error are then discussed, and it is shown that if the input pure states are uniformly distributed, the average probability of error has an upper bound depending on the least squared error, the rank of the average density operator, and the number of the input states. The aforementioned properties help explain why the square-root measurement can be effective in decoding processes.

Physical Review A•Aug 18, 2005•4 citations

Quantum Error Correction and Its Application

Masahito Hayashi

Springer eBooks•Oct 31, 2016•0 citations

How well can you know the edge of a quantum pyramid?

Berthold‐Georg Englert, Jaroslav Řeháček

We consider a symmetric quantum communication scenario in which the signal states are edges of a quantum pyramid of arbitrary dimension and arbitrary shape, and all edge states are transmitted with the same probability. The receiver could employ different decoding strategies: he could minimize the error probability, or discriminate without ambiguity, or extract the accessible information. We state the optimal measurement scheme for each strategy. For large parameter ranges, the standard square-root measurement does not extract the information optimally.

arXiv:0905.0510•Journal of Modern Optics•Jul 31, 2009•17 citations
Given a quantum pure state chosen from a set with some a priori probabilities, what is the optimal measurement needed to correctly guess the given state? We show that a good choice is the family of square-root or ``pretty good'' measurements, as each measurement in the family is optimal for at least one discrimination problem with the same quantum states but possibly different a priori probabilities. Furthermore, the map from measurement to discrimination problems can be explicitly described. In fact, for linearly independent states, every pair of discrimination problem and optimal measurement can be explicitly generated this way.
Square-root measurement is a very useful suboptimal measurement in many applications. It was shown that the square-root measurement minimizes the squared error for pure states. In this paper, the least squared error problem is reformulated and a new proof is provided. It is found that the least squared error depends only on the average density operator of the input states. The properties of the least squared error are then discussed, and it is shown that if the input pure states are uniformly distributed, the average probability of error has an upper bound depending on the least squared error, the rank of the average density operator, and the number of the input states. The aforementioned properties help explain why the square-root measurement can be effective in decoding processes.
We consider a symmetric quantum communication scenario in which the signal states are edges of a quantum pyramid of arbitrary dimension and arbitrary shape, and all edge states are transmitted with the same probability. The receiver could employ different decoding strategies: he could minimize the error probability, or discriminate without ambiguity, or extract the accessible information. We state the optimal measurement scheme for each strategy. For large parameter ranges, the standard square-root measurement does not extract the information optimally.