--- title: Factorizability in Optimal LOCC Discrimination url: https://www.emergentmind.com/topics/factorizability-of-optimal-locc-discrimination type: topic --- # Factorizability in Optimal LOCC Discrimination Factorizability of optimal LOCC discrimination concerns the relation between two distinct structures in multipartite quantum discrimination: the algebraic factorization of measurement operators into product or separable forms, and the operational realizability of the same measurement by local operations and classical communication (LOCC). In the modern literature, these notions are sharply separated. The canonical negative result is that an optimal discrimination measurement may factorize completely at the level of POVM elements and still fail to be implementable by finite-round LOCC [1408.1142]. At the same time, there are restricted settings in which the globally optimal strategy does admit a fully local realization, sometimes with a product input and an LOCC output measurement [1711.03865], and there are also settings where factorizability depends on the discrimination criterion itself [2506.20560]. The subject therefore lies at the intersection of separable measurements, LOCC protocol geometry, state- and channel-discrimination theory, and the resource theory of entanglement. ## 1. Conceptual meaning of factorization in local discrimination In this literature, “factorizable” most often refers to the structure of the measurement operators rather than to the existence of a sequential local protocol. For a multipartite Hilbert space \[ \mathcal H=\mathcal H_1\otimes\cdots\otimes \mathcal H_P, \] a POVM element is product if it has the form \(K^{(1)}\otimes\cdots\otimes K^{(P)}\), and separable if it is a sum or convex combination of such product positive operators. LOCC measurements form a strictly smaller class: they must arise from an adaptive protocol of local operations and classical communication. The fundamental inclusion is \[ \text{LOCC} \subsetneq \text{separable measurements}, \] and the gap persists in operational discrimination tasks [1408.1142]. A central structural lesson is that factorization of operators is weaker than factorization of protocols. The double-trine minimum-error problem makes this distinction explicit: the paper proves \[ \mathrm{GLOBAL}=\mathrm{SEP}>\mathrm{LOCC}>\mathrm{LOCC}_\rightarrow, \] so a separable measurement can attain the global optimum while still failing to be LOCC-implementable, and within LOCC itself a two-way adaptive protocol can outperform one-way local sequencing [1304.1555]. This suggests that “factorizability of optimal LOCC discrimination” cannot be treated as a purely operator-theoretic question. It is also a question about protocol trees, communication rounds, and geometric constraints on the local cones generated by measurement components [1408.1142]. For linearly independent pure-state ensembles under minimum-error discrimination, another recurring structural theme is that optimality can be reduced to perfect discrimination of a unique orthonormal basis of the span [1304.1555, 1308.1737]. In that setting, LOCC-optimality becomes equivalent to whether the induced optimal detection basis is locally perfectly distinguishable. This recasts factorization as a property of the optimal detection subspaces, not merely of the signal states. ## 2. Separable but not LOCC: the archetypal negative result The cleanest negative answer is given by the multipartite unambiguous discrimination construction of Cohen [1408.1142]. The setting is a multipartite Hilbert space \[ \mathcal H=\mathcal H_1\otimes\cdots\otimes \mathcal H_P, \] with local dimensions \(d_\alpha=\dim\mathcal H_\alpha\), total dimension \[ D=d_1d_2\cdots d_P, \] and a prime \(N\ge 5\) chosen so that \[ D=N-1. \] The construction defines \(N\) product states \[ |\Psi_j\rangle = |\psi_j^{(1)}\rangle\otimes\cdots\otimes |\psi_j^{(P)}\rangle, \] with local factors \[ |\psi_j^{(\alpha)}\rangle = \frac{1}{\sqrt{d_\alpha}} \sum_{m_\alpha=0}^{d_\alpha-1} \exp\!\left(\frac{2\pi i\, j\, p_\alpha\, m_\alpha}{N}\right) |m_\alpha\rangle, \] where \[ p_1=1,\qquad p_\alpha=d_1d_2\cdots d_{\alpha-1}\quad (\alpha\ge 2). \] Their rank-1 product projectors \(\Psi_j=|\Psi_j\rangle\langle\Psi_j|\) satisfy \[ I=\frac{D}{N}\sum_{j=1}^N \Psi_j. \] From any \(D\) of these \(N\) states, specifically \[ \mathcal S_\Psi=\{|\Psi_j\rangle\}_{j=2}^N, \] one forms the reciprocal set \[ \mathcal S_\Phi=\{|\Phi_j\rangle\}_{j=2}^N \] defined by \[ \langle \Psi_k|\Phi_j\rangle=\delta_{jk}\,\langle\Psi_j|\Phi_j\rangle. \] The discrimination task is unambiguous discrimination of \(\mathcal S_\Phi\) with equal priors \[ \eta_j=\frac1D. \] A structural corollary in the paper shows that the only positive operators on \(\mathcal H\) that can unambiguously identify \(|\Phi_k\rangle\) are proportional to \(\Psi_k\). Thus every conclusive measurement operator is forced to be a product operator [1408.1142]. The main theorem states that the optimal global measurement is separable, unique on \(\mathcal H\), given by \[ \left\{\frac{D}{N}\Psi_j\right\}_{j=1}^N, \] and has failure probability \[ \Pr(f)=\frac12. \] Equivalently, the success probability is \[ \Pr(\text{succ})=\frac12. \] Because the discrimination task only concerns \(j=2,\dots,N\), the element \(j=1\) is the inconclusive outcome, so the optimal POVM may be written as \[ \mathcal M_{\mathrm{opt}}= \left\{ \frac{D}{N}\Psi_2,\dots,\frac{D}{N}\Psi_N,\frac{D}{N}\Psi_1 \right\}. \] Every element is rank-1 and product. In the strongest possible POVM-level sense, the optimal measurement factorizes completely [1408.1142]. Yet the same paper proves that this optimal separable measurement cannot be implemented by any finite-round LOCC protocol. The obstruction comes from a necessary condition for finite-round LOCC: if a separable measurement with \(N\) distinct product POVM elements \[ \{\mathcal K_j=\mathcal K_j^{(1)}\otimes\cdots\otimes \mathcal K_j^{(P)}\}_{j=1}^N \] is implementable by finite-round LOCC, then \[ \sum_{\alpha=1}^P e_\alpha \le 2(N-1), \] where \(e_\alpha\) counts the distinct extreme rays in the convex cone generated by the local factors \(\{\mathcal K_j^{(\alpha)}\}\). For the optimal measurement above, each local factor is rank-1 positive and distinct, so \[ e_\alpha=N \quad \forall \alpha, \qquad \sum_{\alpha=1}^P e_\alpha=PN. \] Since \(P\ge 2\) and \(D=N-1\), \[ PN>2(N-1), \] so the finite-round LOCC condition is violated [1408.1142]. This result directly answers the central question in the negative: optimality plus factorization of the POVM elements does not imply LOCC realizability. The paper further shows that enlarging the Hilbert space does not help. If the input states are supported only on \(\mathcal H\), then any LOCC measurement on a larger space \(\mathcal H'\supset\mathcal H\) is effectively identical, on those inputs, to an LOCC measurement on \(\mathcal H\) itself [1408.1142]. A plausible implication is that the obstruction is genuinely operational and geometric, not an artifact of representation or ancilla omission. ## 3. Minimum-error discrimination and the rigidity of optimal measurements Minimum-error discrimination exhibits the same separation in a different form. For the two-qubit double-trine ensemble \[ |D_i\rangle=|s_i\rangle\otimes |s_i\rangle,\qquad i=0,1,2, \] with priors \(p_i=1/3\), the global optimum is the Pretty Good Measurement on an entangled orthonormal basis \[ \{|\Psi^-\rangle,\ U^i\otimes U^i|F_0\rangle\}_{i=0}^2, \] and has error probability \[ P_{\mathrm{err}}^{\mathrm{GLOBAL}}=\frac12-\frac{\sqrt2}{3}\approx 2.86\times 10^{-2}, \] equivalently \[ P_{\mathrm{succ}}^{\mathrm{GLOBAL}}=\frac12+\frac{\sqrt2}{3}\approx 0.9714 \] [1304.1555]. Thus the globally optimal measurement is not factorized at the level of basis states. The same paper proves a theorem of broader structural significance: for any linearly independent pure-state ensemble, there exists a unique orthonormal basis \(\{|\phi_i\rangle\}\) of the span such that a POVM attains the optimal minimum error if and only if it perfectly distinguishes \(\{|\phi_i\rangle\}\) [1304.1555]. In the double-trine case, this basis is exactly the entangled basis \(\{|F_i\rangle\}\). Therefore any LOCC protocol attaining the global optimum would have to perfectly, or asymptotically perfectly, distinguish these entangled basis states. Using Walgate–Hardy and asymptotic LOCC constraints, the paper rules this out, establishing that even asymptotic LOCC cannot reach the global minimum-error optimum [1304.1555]. At the same time, the global optimum can be reproduced by a separable measurement. The paper constructs POVM elements \[ |\widetilde F_i\rangle\langle \widetilde F_i| = |F_i\rangle\langle F_i| +\frac13 |\Psi^-\rangle\langle\Psi^-|, \] each of which is separable and expressible as a convex combination of rank-one product projectors. Since the double-trine states are orthogonal to the singlet, the added term does not alter the ensemble statistics, and therefore \[ P_{\mathrm{err}}^{\mathrm{SEP}}=\frac12-\frac{\sqrt2}{3}, \qquad P_{\mathrm{succ}}^{\mathrm{SEP}}=\frac12+\frac{\sqrt2}{3} \] [1304.1555]. This is a second archetypal example in which the optimal statistics are attainable by a separable, product-structured POVM, yet not by LOCC. The same paper quantifies protocol-level non-factorizability inside LOCC. The optimal one-way LOCC error is \[ P_{\mathrm{err}}^{\mathrm{LOCC}_\rightarrow}=\frac12-\frac{\sqrt3}{4}\approx 6.70\times 10^{-2}, \] while an explicit two-way adaptive protocol achieves about \[ P_{\mathrm{err}}^{\mathrm{2\text{-}way\ LOCC}}\approx 6.47\times 10^{-2}. \] Thus even within LOCC, a more “factorized” one-pass structure is suboptimal relative to multiround adaptation [1304.1555]. A related rigidity appears in two-qubit minimum-error state discrimination more broadly. For linearly independent ensembles, optimality is equivalent to perfect discrimination of a unique orthogonal decomposition of the span [1308.1737]. In particular, for linearly independent two-qubit pure states, if \(n=3\), LOCC can be optimal only if the optimal orthonormal detection basis contains at least two product states; if \(n=4\), all optimal detection states must be product [1308.1737]. The same paper proves that three randomly chosen two-qubit pure states almost surely cannot be optimally discriminated by LOCC [1308.1737]. This suggests that exact LOCC factorization of the optimal measurement is non-generic. ## 4. Positive factorizability results in restricted settings Despite these negative results, there are important regimes in which optimal discrimination does factorize operationally. A particularly sharp example is single-query discrimination of two two-qubit entangling unitaries without local parts [1711.03865]. The problem is reduced to state discrimination after one use of the unknown unitary, and the main optimization is over the input state \[ |\psi\rangle. \] For two such unitaries \(U_1,U_2\), the minimum-error quantity is \[ P_E(U_1,U_2)=\frac12\left(1-\sqrt{1-4p_1p_2F(U_1,U_2)^2}\right), \] with \[ F(U_1,U_2)=\min_{|\psi\rangle}\left|\langle\psi|U_1^\dagger U_2|\psi\rangle\right|. \] The paper proves that the global optimum is always achieved by a product input state, and then invokes known LOCC results for discrimination of two pure output states to conclude that LOCC attains the same distinguishability as global operations [1711.03865]. Within this scope, factorization holds at both layers: product probe state and LOCC output measurement. An earlier related result proves the same conclusion for a restricted class of two-qubit entangling unitaries in the absence of local parts: if global perfect discrimination is possible, then LOCC perfect discrimination is also possible, while if global perfect discrimination is impossible, LOCC still attains the same optimal minimum-error probability [1601.07256]. The proof again rests on product-state attainability of the optimal overlap and LOCC-optimal discrimination of the resulting pure-state pair. There are also positive results in state discrimination under strong structural assumptions. For two bipartite mixed states of the form \[ \rho_i = r_i\, |r_i\rangle\langle r_i|\otimes |r_i'\rangle\langle r_i'| + \tilde r_i\, |\tilde r_i\rangle\langle \tilde r_i|\otimes |\tilde r_i'\rangle\langle \tilde r_i'|, \] with orthogonality and nonoverlapping-support conditions separating the \(r\)- and \(\tilde r\)-branches, the optimal global unambiguous discrimination success probability is exactly achieved by an explicit finite-round LOCC protocol [2003.06109]. The mechanism is an orthogonal-sector decomposition into two pure-state discrimination tasks. The paper does not prove that the optimal global POVM itself factorizes as a single product measurement, but it does prove operational attainability by adaptive LOCC [2003.06109]. Many-copy hypothesis testing also contains exact factorizability regimes. For certain orthogonal bipartite state pairs, including a maximally entangled state versus its orthogonal complement and extremal Werner states, a sufficient condition implies \[ P_e^{\mathrm{LOCC}(\rho_0^{\otimes n},\rho_1^{\otimes n};p)} = P_e^{\mathrm{SEP}(\cdots)} = P_e^{\mathrm{PPT}(\cdots)} = \min\{(1-p)t^n,\;p\}, \] and \[ \beta_\alpha^{\mathrm{LOCC}(\rho_0^{\otimes n},\rho_1^{\otimes n})} = (1-\alpha)t^n, \] so the optimal many-copy test is realized by tensor powers of a single-copy LOCC measurement [2011.13063]. This is an exact multiplicative factorization across copies, but only under a specific one-copy LOCC/PPT compatibility condition. ## 5. Measure dependence, protocol width, and sequence-level factorization A major development is the realization that factorization can depend on the discrimination figure of merit. The 2025 paper on “quantum nonlocality without entanglement and state discrimination measures” constructs a family of six equally probable linearly independent product states in \(3\otimes 3\) for which \[ p_{L}^{me}(E_T) \|\Phi_0-\Phi_1\|_{\mathrm{NE}}, \] so entangled inputs remain fully useful despite an LOCC restriction on the final measurement [1004.0888]. There are also channel pairs for which \[ \|\Phi_0-\Phi_1\|_{\mathrm{LOCC}} = \|\Phi_0-\Phi_1\|_{\mathrm{NE}} < \|\Phi_0-\Phi_1\|_{\diamond}, \] so the LOCC restriction erases all advantage of entangled inputs [1004.0888]. This again suggests that no universal factorization principle governs optimal LOCC discrimination. The finite- versus infinite-round boundary also remains important. In the multipartite unambiguous discrimination example of Cohen, the impossibility result excludes all finite-round LOCC protocols but does not rule out infinite-round LOCC, which is conjectured to fail as well [1408.1142]. In the \(N\)-copy trine problem, no finite \(N\) allows exact optimal LOCC discrimination, yet LOCC becomes asymptotically optimal as \(N\to\infty\) [1308.1737]. These cases indicate that exact factorizability can fail at every finite stage while re-emerging only as an asymptotic approximation. Taken together, these results define the modern understanding of the subject. Factorizability of optimal LOCC discrimination is not a single property but a family of non-equivalent properties concerning product inputs, separable POVM elements, LOCC protocol trees, copywise tensorization, and sequence-level decomposition. The strongest negative statement established so far is that even a unique optimal measurement built entirely from rank-1 product operators can fail to be finite-round LOCC [1408.1142]. The strongest positive statements are correspondingly restricted: some unitary, mixed-state, many-copy, and sequence settings do admit exact factorization or exact LOCC/global equality [1711.03865, 2003.06109, 2011.13063, 2508.05050]. A plausible overall synthesis is that factorization is best understood as a problem in geometry and protocol complexity rather than in tensor-product algebra alone. Source: https://www.emergentmind.com/topics/factorizability-of-optimal-locc-discrimination