Convergence of the JRF iteration for mixed-state discrimination
- Field
- Topic
Problem
Does the Ježek–Řeháček–Fiurášek (JRF) iteration, initialized by the uniform POVM, converge to a globally optimal minimum-error measurement for every finite ensemble containing mixed quantum states? Let \(m\geq2\), let \(p_i>0\) be prior probabilities, and let \(\rho_i\) be density operators on a finite-dimensional Hilbert space. Define
where at least one \(\rho_i\) has rank greater than one. On the signal space \(\mathcal H_0\) in Eq. (1), the optimal guessing probability is
Starting from \(\Pi_i^{(0)}:=I_{\mathcal H_0}/m\), define the JRF iterates by
For this initialization, \(\Lambda_k\) is inverted on \(\mathcal H_0\) and the operators in Eq. (3) form a POVM at every step. Determine whether there always exists an optimal POVM \(\{\Pi_i^\star\}_{i=1}^{m}\) attaining Eq. (2) such that
where \(\lVert\cdot\rVert_2\) is the Hilbert–Schmidt norm. If Eq. (4) fails, construct an explicit mixed-state counterexample and characterize its limiting behavior.
Source
Ježek, Řeháček, and Fiurášek introduced the iteration and explicitly reported that its numerically observed global convergence lacked a general proof [JRF02]. Lü and Dong proved the pure-state case and explicitly left convergence for general mixed-state ensembles open [LD26].
Progress
The original work observed monotonic convergence to the global optimum in extensive tests on ensembles of up to four pure or mixed states in dimensions two through four, but supplied neither a proof nor a counterexample for arbitrary ensembles [JRF02].
Tyson’s directional-iterate framework proves the general monotonicity bound
\begin{equation} P_k\leq\operatorname{Tr}\Lambda_k \leq P_{k+1}\leq P_{\mathrm{opt}}, \qquad P_k:=\sum_{i=1}^{m}\operatorname{Tr}(\xi_i\Pi_i^{(k)}), \tag{5} \end{equation}which Lü and Dong rederive from a polar decomposition [Tys10], [LD26]. Equation (5) implies that \(P_k\) has a limit, but does not show that the limit equals \(P_{\mathrm{opt}}\) or that the POVM sequence converges.
Lü and Dong prove convergence to an optimal measurement for every pure-state ensemble under a mild support condition satisfied by the uniform initialization in Eq. (3). They also obtain a conditional result for a special embedded class of mixed-state ensembles, but explain that their accumulation-point argument does not extend to arbitrary mixed states [LD26].
Comment
The pure-state case is solved. The remaining issue is whether the uniform initialization prevents nonoptimal accumulation points or nonconvergent last-iterate behavior for arbitrary mixed-state ensembles. The existence of convergent semidefinite-programming methods for Eq. (2) does not establish convergence of the specific nonlinear map in Eq. (3).