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

Physical Review A

Iterative methods for finding optimal quantum measurements under minimum-error and minimax criteria

Kenji Nakahira, Kentaro Kato, Tsuyoshi Sasaki Usuda

Published Jan 14, 2015• 11 citations
Publisher

Abstract

We investigate the problem of computing optimal quantum measurements in both minimal measuring and minimax strategies. A Belavkin weighted square-root measurement (BWSRM) with appropriate weights can represent the measurement that maximizes the correct probability for any given prior probabilities of quantum states. Using this fact, we propose methods for computing optimal solutions by optimizing the weights of the BWSRM. First, we explain the conditions for the BWSRM to be optimal. In particular, we argue that if a BWSRM with certain weights is a minimax measurement, then the minimax probabilities can be immediately obtained. Next, we propose an extension of the iterative algorithm developed by Je\ifmmode \check{z}\else \v{z}\fi{}ek et al. [Phys. Rev. A 65, 060301 (2002)] for maximizing the correct probability. We prove that, for a linearly independent pure state set, Je\ifmmode \check{z}\else \v{z}\fi{}ek et al.'s algorithm converges to an optimal measurement. We also propose an iterative algorithm for a minimax solution and prove that, for a pure state set, our algorithm monotonically decreases the difference between estimated and true minimax values. Finally the performance of our algorithms is evaluated through numerical experiments.

DOI
10.1103/physreva.91.012318

Related papers

Modified Iterative Algorithms for Computing Error Probabilities in Optimal Quantum Detection of Linearly Independent Pure States

Kentaro Kato, Kenji Nakahira

K. Nakahira et al. introduced iterative algorithms to determine the optimal quantum detection for general quantum state signals under the minimum-error and minimax criteria. In this paper, we aim to modify these algorithms, assuming that the signal states are pure and linearly independent. We demonstrate that the algorithms can be modified using the properties of the Gram matrix of linearly independent pure states. This modification eliminates the need to compute the inverse of the square root of the weighted Gram matrix, which is required in the original algorithms, thereby simplifying their implementation.

Globecom•Dec 8, 2025•0 citations

Error rates of Belavkin weighted quantum measurements and a converse to Holevo’s asymptotic optimality theorem

Jon Tyson

We compare several instances of pure-state Belavkin weighted square-root measurements from the standpoint of minimum-error discrimination of quantum states. The quadratically weighted measurement is proven superior to the so-called ``pretty good measurement'' (PGM) in a number of respects: (1) Holevo's quadratic weighting unconditionally outperforms the PGM in the case of two-state ensembles, with equality only in trivial cases. (2) A converse of a theorem of Holevo is proven, showing that a weighted measurement is asymptotically optimal only if it is quadratically weighted. Counterexamples for three states are constructed. The cube-weighted measurement of Ballester, Wehner, and Winter is also considered. Sufficient optimality conditions for various weights are compared.

arXiv:0907.1884•Physical Review A•Mar 31, 2009•19 citations

Generalized quantum state discrimination problems

Kenji Nakahira, Kentaro Kato, Tsuyoshi Sasaki Usuda

We address a broad class of optimization problems of finding quantum measurements, which includes the problems of finding an optimal measurement in the Bayes criterion and a measurement maximizing the average correct probability with a fixed rate of inconclusive results. Our approach can deal with any problem in which each of the objective and constraint functions is formulated by the sum of the traces of the multiplication of a Hermitian operator and a detection operator. We first derive dual problems and necessary and sufficient conditions for an optimal measurement. We also consider the minimax version of these problems and provide necessary and sufficient conditions for a minimax solution. Finally, for optimization problem having a certain symmetry, there exists an optimal solution with the same symmetry. Examples are shown to illustrate how our results can be used.

arXiv:1501.05744•Physical Review A•May 6, 2015•32 citations

A semidefinite programming approach to optimal unambiguous discrimination of quantum states

Yonina C. Eldar

We consider the problem of unambiguous discrimination between a set of linearly independent pure quantum states. We show that the design of the optimal measurement that minimizes the probability of an inconclusive result can be formulated as a semidefinite programming problem. Based on this formulation, we develop a set of necessary and sufficient conditions for an optimal quantum measurement. We show that the optimal measurement can be computed very efficiently in polynomial time by exploiting the many well-known algorithms for solving semidefinite programs, which are guaranteed to converge to the global optimum. Using the general conditions for optimality, we derive necessary and sufficient conditions so that the measurement that results in an equal probability of an inconclusive result for each one of the quantum states is optimal. We refer to this measurement as the equal-probability measurement (EPM). We then show that for any state set, the prior probabilities of the states can be chosen such that the EPM is optimal. Finally, we consider state sets with strong symmetry properties and equal prior probabilities for which the EPM is optimal. We first consider geometrically uniform (GU) state sets that are defined over a group of unitary matrices and are generated by a single generating vector. We then consider compound GU state sets which are generated by a group of unitary matrices using multiple generating vectors, where the generating vectors satisfy a certain (weighted) norm constraint.

arXiv:quant-ph/0206093•IEEE Transactions on Information Theory•Feb 1, 2003•129 citations

Optimal Detection of Symmetric Mixed Quantum States

Yonina C. Eldar, Alexandre Megretski, George C. Verghese

We develop a sufficient condition for the least-squares measurement (LSM), or the square-root measurement, to minimize the probability of a detection error when distinguishing between a collection of mixed quantum states. Using this condition we derive the optimal measurement for state sets with a broad class of symmetries. We first consider geometrically uniform (GU) state sets with a possibly non-Abelian generating group, and show that if the generator satisfies a weighted norm constraint, then the LSM is optimal. In particular, for pure-state GU ensembles, the LSM is shown to be optimal. For arbitrary GU state sets we show that the optimal measurement operators are GU with generator that can be computed very efficiently in polynomial time, within any desired accuracy. We then consider compound GU (CGU) state sets which consist of subsets that are GU. When the generators satisfy a certain constraint, the LSM is again optimal. For arbitrary CGU state sets, the optimal measurement operators are shown to be CGU with generators that can be computed efficiently in polynomial time.

arXiv:quant-ph/0211111•IEEE Transactions on Information Theory•Jun 1, 2004•158 citations

‘Pure’ Square-Root Measurement and its Optimality for Mixed-State Signals

Tsuyoshi Sasaki Usuda

The optimum quantum measurements that minimize the error probability for mixed‐state signals are considered. The square‐root measurement (SRM) is known to be the optimal measurement for many pure‐state signals, e.g., symmetric states, linear codes, etc. However, when the states are mixed, the SRM is no longer guaranteed to be optimal even if the states are symmetric. Here, we define the ‘pure’ square‐root measurement (pure‐SRM) which is the SRM for pure states and its optimality for mixed states. It is shown that the pure‐SRM is satisfied the necessary and sufficient conditions of the quantum Bayes strategy when the signals are mixed by transmission errors, and therefore the pure‐SRM is the optimal measurement.

AIP conference proceedings•Jan 1, 2004•0 citations
We investigate the problem of computing optimal quantum measurements in both minimal measuring and minimax strategies. A Belavkin weighted square-root measurement (BWSRM) with appropriate weights can represent the measurement that maximizes the correct probability for any given prior probabilities of quantum states. Using this fact, we propose methods for computing optimal solutions by optimizing the weights of the BWSRM. First, we explain the conditions for the BWSRM to be optimal. In particular, we argue that if a BWSRM with certain weights is a minimax measurement, then the minimax probabilities can be immediately obtained. Next, we propose an extension of the iterative algorithm developed by Je\ifmmode \check{z}\else \v{z}\fi{}ek et al. [Phys. Rev. A 65, 060301 (2002)] for maximizing the correct probability. We prove that, for a linearly independent pure state set, Je\ifmmode \check{z}\else \v{z}\fi{}ek et al.'s algorithm converges to an optimal measurement. We also propose an iterative algorithm for a minimax solution and prove that, for a pure state set, our algorithm monotonically decreases the difference between estimated and true minimax values. Finally the performance of our algorithms is evaluated through numerical experiments.
K. Nakahira et al. introduced iterative algorithms to determine the optimal quantum detection for general quantum state signals under the minimum-error and minimax criteria. In this paper, we aim to modify these algorithms, assuming that the signal states are pure and linearly independent. We demonstrate that the algorithms can be modified using the properties of the Gram matrix of linearly independent pure states. This modification eliminates the need to compute the inverse of the square root of the weighted Gram matrix, which is required in the original algorithms, thereby simplifying their implementation.
We compare several instances of pure-state Belavkin weighted square-root measurements from the standpoint of minimum-error discrimination of quantum states. The quadratically weighted measurement is proven superior to the so-called ``pretty good measurement'' (PGM) in a number of respects: (1) Holevo's quadratic weighting unconditionally outperforms the PGM in the case of two-state ensembles, with equality only in trivial cases. (2) A converse of a theorem of Holevo is proven, showing that a weighted measurement is asymptotically optimal only if it is quadratically weighted. Counterexamples for three states are constructed. The cube-weighted measurement of Ballester, Wehner, and Winter is also considered. Sufficient optimality conditions for various weights are compared.
We address a broad class of optimization problems of finding quantum measurements, which includes the problems of finding an optimal measurement in the Bayes criterion and a measurement maximizing the average correct probability with a fixed rate of inconclusive results. Our approach can deal with any problem in which each of the objective and constraint functions is formulated by the sum of the traces of the multiplication of a Hermitian operator and a detection operator. We first derive dual problems and necessary and sufficient conditions for an optimal measurement. We also consider the minimax version of these problems and provide necessary and sufficient conditions for a minimax solution. Finally, for optimization problem having a certain symmetry, there exists an optimal solution with the same symmetry. Examples are shown to illustrate how our results can be used.
We consider the problem of unambiguous discrimination between a set of linearly independent pure quantum states. We show that the design of the optimal measurement that minimizes the probability of an inconclusive result can be formulated as a semidefinite programming problem. Based on this formulation, we develop a set of necessary and sufficient conditions for an optimal quantum measurement. We show that the optimal measurement can be computed very efficiently in polynomial time by exploiting the many well-known algorithms for solving semidefinite programs, which are guaranteed to converge to the global optimum. Using the general conditions for optimality, we derive necessary and sufficient conditions so that the measurement that results in an equal probability of an inconclusive result for each one of the quantum states is optimal. We refer to this measurement as the equal-probability measurement (EPM). We then show that for any state set, the prior probabilities of the states can be chosen such that the EPM is optimal. Finally, we consider state sets with strong symmetry properties and equal prior probabilities for which the EPM is optimal. We first consider geometrically uniform (GU) state sets that are defined over a group of unitary matrices and are generated by a single generating vector. We then consider compound GU state sets which are generated by a group of unitary matrices using multiple generating vectors, where the generating vectors satisfy a certain (weighted) norm constraint.
We develop a sufficient condition for the least-squares measurement (LSM), or the square-root measurement, to minimize the probability of a detection error when distinguishing between a collection of mixed quantum states. Using this condition we derive the optimal measurement for state sets with a broad class of symmetries. We first consider geometrically uniform (GU) state sets with a possibly non-Abelian generating group, and show that if the generator satisfies a weighted norm constraint, then the LSM is optimal. In particular, for pure-state GU ensembles, the LSM is shown to be optimal. For arbitrary GU state sets we show that the optimal measurement operators are GU with generator that can be computed very efficiently in polynomial time, within any desired accuracy. We then consider compound GU (CGU) state sets which consist of subsets that are GU. When the generators satisfy a certain constraint, the LSM is again optimal. For arbitrary CGU state sets, the optimal measurement operators are shown to be CGU with generators that can be computed efficiently in polynomial time.
The optimum quantum measurements that minimize the error probability for mixed‐state signals are considered. The square‐root measurement (SRM) is known to be the optimal measurement for many pure‐state signals, e.g., symmetric states, linear codes, etc. However, when the states are mixed, the SRM is no longer guaranteed to be optimal even if the states are symmetric. Here, we define the ‘pure’ square‐root measurement (pure‐SRM) which is the SRM for pure states and its optimality for mixed states. It is shown that the pure‐SRM is satisfied the necessary and sufficient conditions of the quantum Bayes strategy when the signals are mixed by transmission errors, and therefore the pure‐SRM is the optimal measurement.