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

arXiv:1111.4831

Analytical calculation of optimal POVM for unambiguous discrimination of quantum states using KKT method

Naser Karimi

Published Nov 21, 2011• 0 citations
arXivHTMLPDF

Abstract

In the present paper, an exact analytic solution for the optimal unambiguous state discrimination (OPUSD) problem involving an arbitrary number of pure linearly independent quantum states with real and complex inner product is presented. Using semidefinite programming and Karush-Kuhn-Tucker convex optimization method, we derive an analytical formula which shows the relation between optimal solution of unambiguous state discrimination problem and an arbitrary number of pure linearly independent quantum states.

DOI
10.48550/arxiv.1111.4831

Related papers

Optimal unambiguous discrimination of quantum states

M. A. Jafarizadeh, Mahdi Rezaei, Naser Karimi +1 more

Unambiguous discrimination between nonorthogonal but linearly independent quantum states is a challenging problem in quantum information processing. In this study, using the connection between Lewenstein-Sanpera decomposition (LSD) and optimal unambiguous state discrimination (OPUSD), an analytic relation for the feasible region of $N$ linearly independent quantum states is presented in terms of inner product of reciprocal states. Then, for the real inner product of states, an exact analytic solution for the OPUSD problem involving an arbitrary number of pure linearly independent quantum states is presented using the Karush-Kuhn-Tucker convex optimization method. In another approach, an analytic relation for the feasible region for an arbitrary number of pure linearly independent quantum states is presented in terms of the inner product of states. To this end, the relevant semidefinite programming task is reduced to a linear programming (LP) one with a feasible region of polygon type which can be solved via simplex method. Moreover, using the obtained feasible region, an exact analytic solution to an OPUSD problem involving two and three pure linearly independent quantum states is provided.

arXiv:0708.2323•Physical Review A•Apr 16, 2008•40 citations

Complete solution for unambiguous discrimination of three pure states with real inner products

H. Sugimoto, T. Hashimoto, M. Horibe +1 more

Complete solutions are given in a closed analytic form for unambiguous discrimination of three general pure states with real mutual inner products. For this purpose, we first establish some general results on unambiguous discrimination of $n$ linearly independent pure states. The uniqueness of solution is proved. The condition under which the problem is reduced to an ($n\ensuremath{-}1$)-state problem is clarified. After giving the solution for three pure states with real mutual inner products, we examine some difficulties in extending our method to the case of complex inner products. There is a class of set of three pure states with complex inner products for which we obtain an analytical solution.

arXiv:1007.5112•Physical Review A•Sep 30, 2010•32 citations

Analysis of optimal unambiguous discrimination of three pure quantum states

Donghoon Ha, Younghun Kwon

We consider unambiguous discrimination of three pure quantum states. Necessary and sufficient conditions to decide which states should be detected for optimal measurement of unambiguous discrimination are provided in terms of inner products and the geometric phase $\mathrm{\ensuremath{\Phi}}$. We get the optimal measurement and the optimal failure probability when the optimal unambiguous discrimination does not require the detection of every given quantum state. When at least two quantum states are orthogonal to each other, we supply the optimal measurement and optimal failure probability in analytic form. When all three quantum states are not orthogonal to each other and $\mathrm{\ensuremath{\Phi}}\ensuremath{\ne}0$, we find an analytic condition to determine the zero and nonzero elements for an optimal positive operator valued measure. We explain how to determine the solution in a geometric manner. Using the known solution of a case where the mutual inner products are real, we check the necessary and sufficient conditions when $\mathrm{\ensuremath{\Phi}}=\ensuremath{\pi}$ and analyze the property of the singular point when $\mathrm{\ensuremath{\Phi}}=0$ and the relation between the optimal points.

Physical Review A•Jun 9, 2015•25 citations

Optimal Unambiguous Discrimination of Pure Quantum States

János A. Bergou, Ulrike Futschik, Edgar Feldman

A complete geometric view is presented for the optimal unambiguous discrimination among N > 2 pure states. A single intuitive picture contains all aspects of the problem: linear independence of the states, positivity of the detection operators, and a graphic method for finding and classifying the optimal solutions. The method is illustrated on the example of three states. We show that the problem depends on the phases of the complex inner products only through an invariant combination, the Berry phase φ, and present complete analytical results for φ = 0 and φ = π. The optimal solution exhibits full permutational symmetry and is single valued for a large range of parameters. However, for φ = 0 it can be bivalued: beyond a critical value of the parameters a second, less symmetric solution becomes optimal. The bifurcation is analogous to a second-order symmetry-breaking phase transition. We conclude with a discussion of the unambiguous discrimination of N > 3 states.

Physical Review Letters•Jun 21, 2012•77 citations

Optimum unambiguous discrimination of linearly independent pure states

Shengshi Pang, Shengjun Wu

Given $n$ linearly independent pure states and their prior probabilities, we study the optimum unambiguous state discrimination problem. We derive the conditions for the optimum measurement strategy to achieve the maximum average success probability and establish two sets of equations that must be satisfied by the optimum solution in different situations. We also provide the detailed steps to find the optimum measurement strategy. The method and results we obtain are given a geometrical illustration with a numerical example. Furthermore, using these equations, we derive a formula which shows a clear analytical relation between the optimum solution and the $n$ states to be discriminated. We also solve a generalized equal-probability measurement problem analytically. Finally, as another application of our result, the unambiguous discrimination problem of three pure states is studied in detail and analytical solutions are obtained for some interesting cases.

arXiv:0906.2990•Physical Review A•Nov 12, 2009•60 citations

Quantum-Assisted Unambiguous Discrimination of Pure States with Robustness Bounds

Jinhyeok Heo, Dongkeun Lee, Junghee Ryu +1 more

We propose a hybrid quantum-classical framework for the unambiguous discrimination of pure states by combining the noisy intermediate-scale quantum semidefinite program solver (NSS) with the reciprocal-state representation. In NSS, a given semidefinite program (SDP) is represented within a subspace spanned by chosen ansatz states, with the required quantities estimated using quantum circuits, and the resulting optimization is performed classically. This makes NSS naturally applicable to discrimination problems involving circuit-prepared states, as finding a discrimination measurement can be formulated as an SDP. By choosing the discriminated states themselves as the ansatz and exploiting the reciprocal-state representation, the general matrix-variable NSS formulation is reduced to an optimization over N scalar variables, where N is the number of discriminated states. The resulting formulation reduces the number of optimization variables and positive-semidefinite constraints compared with the original NSS formulation. We further establish robustness guarantees against Gram matrix estimation errors, including a rescaling procedure that guarantees a valid positive operator-valued measure (POVM) under bounded perturbations. The resulting bounds quantify both the deviation in average success probability and violations of the no-error condition using only the estimated Gram matrix, its SDP solution, and a characterized perturbation bound, without access to the ideal Gram matrix. Numerical simulations validate the derived robustness bounds and characterize finite-shot scaling. We also perform experiments on IBM quantum hardware to estimate pairwise overlaps, and then evaluate the performance of the resulting POVMs.

quant-pharXiv:2610.22954•Oct 19, 2026•0 citations
In the present paper, an exact analytic solution for the optimal unambiguous state discrimination (OPUSD) problem involving an arbitrary number of pure linearly independent quantum states with real and complex inner product is presented. Using semidefinite programming and Karush-Kuhn-Tucker convex optimization method, we derive an analytical formula which shows the relation between optimal solution of unambiguous state discrimination problem and an arbitrary number of pure linearly independent quantum states.
Unambiguous discrimination between nonorthogonal but linearly independent quantum states is a challenging problem in quantum information processing. In this study, using the connection between Lewenstein-Sanpera decomposition (LSD) and optimal unambiguous state discrimination (OPUSD), an analytic relation for the feasible region of NNN linearly independent quantum states is presented in terms of inner product of reciprocal states. Then, for the real inner product of states, an exact analytic solution for the OPUSD problem involving an arbitrary number of pure linearly independent quantum states is presented using the Karush-Kuhn-Tucker convex optimization method. In another approach, an analytic relation for the feasible region for an arbitrary number of pure linearly independent quantum states is presented in terms of the inner product of states. To this end, the relevant semidefinite programming task is reduced to a linear programming (LP) one with a feasible region of polygon type which can be solved via simplex method. Moreover, using the obtained feasible region, an exact analytic solution to an OPUSD problem involving two and three pure linearly independent quantum states is provided.
Complete solutions are given in a closed analytic form for unambiguous discrimination of three general pure states with real mutual inner products. For this purpose, we first establish some general results on unambiguous discrimination of nnn linearly independent pure states. The uniqueness of solution is proved. The condition under which the problem is reduced to an ($n\ensuremath{-}1$)-state problem is clarified. After giving the solution for three pure states with real mutual inner products, we examine some difficulties in extending our method to the case of complex inner products. There is a class of set of three pure states with complex inner products for which we obtain an analytical solution.
We consider unambiguous discrimination of three pure quantum states. Necessary and sufficient conditions to decide which states should be detected for optimal measurement of unambiguous discrimination are provided in terms of inner products and the geometric phase $\mathrm{\ensuremath{\Phi}}$. We get the optimal measurement and the optimal failure probability when the optimal unambiguous discrimination does not require the detection of every given quantum state. When at least two quantum states are orthogonal to each other, we supply the optimal measurement and optimal failure probability in analytic form. When all three quantum states are not orthogonal to each other and $\mathrm{\ensuremath{\Phi}}\ensuremath{\ne}0$, we find an analytic condition to determine the zero and nonzero elements for an optimal positive operator valued measure. We explain how to determine the solution in a geometric manner. Using the known solution of a case where the mutual inner products are real, we check the necessary and sufficient conditions when $\mathrm{\ensuremath{\Phi}}=\ensuremath{\pi}$ and analyze the property of the singular point when $\mathrm{\ensuremath{\Phi}}=0$ and the relation between the optimal points.
A complete geometric view is presented for the optimal unambiguous discrimination among N > 2 pure states. A single intuitive picture contains all aspects of the problem: linear independence of the states, positivity of the detection operators, and a graphic method for finding and classifying the optimal solutions. The method is illustrated on the example of three states. We show that the problem depends on the phases of the complex inner products only through an invariant combination, the Berry phase φ, and present complete analytical results for φ = 0 and φ = π. The optimal solution exhibits full permutational symmetry and is single valued for a large range of parameters. However, for φ = 0 it can be bivalued: beyond a critical value of the parameters a second, less symmetric solution becomes optimal. The bifurcation is analogous to a second-order symmetry-breaking phase transition. We conclude with a discussion of the unambiguous discrimination of N > 3 states.
Given nnn linearly independent pure states and their prior probabilities, we study the optimum unambiguous state discrimination problem. We derive the conditions for the optimum measurement strategy to achieve the maximum average success probability and establish two sets of equations that must be satisfied by the optimum solution in different situations. We also provide the detailed steps to find the optimum measurement strategy. The method and results we obtain are given a geometrical illustration with a numerical example. Furthermore, using these equations, we derive a formula which shows a clear analytical relation between the optimum solution and the nnn states to be discriminated. We also solve a generalized equal-probability measurement problem analytically. Finally, as another application of our result, the unambiguous discrimination problem of three pure states is studied in detail and analytical solutions are obtained for some interesting cases.
We propose a hybrid quantum-classical framework for the unambiguous discrimination of pure states by combining the noisy intermediate-scale quantum semidefinite program solver (NSS) with the reciprocal-state representation. In NSS, a given semidefinite program (SDP) is represented within a subspace spanned by chosen ansatz states, with the required quantities estimated using quantum circuits, and the resulting optimization is performed classically. This makes NSS naturally applicable to discrimination problems involving circuit-prepared states, as finding a discrimination measurement can be formulated as an SDP. By choosing the discriminated states themselves as the ansatz and exploiting the reciprocal-state representation, the general matrix-variable NSS formulation is reduced to an optimization over N scalar variables, where N is the number of discriminated states. The resulting formulation reduces the number of optimization variables and positive-semidefinite constraints compared with the original NSS formulation. We further establish robustness guarantees against Gram matrix estimation errors, including a rescaling procedure that guarantees a valid positive operator-valued measure (POVM) under bounded perturbations. The resulting bounds quantify both the deviation in average success probability and violations of the no-error condition using only the estimated Gram matrix, its SDP solution, and a characterized perturbation bound, without access to the ideal Gram matrix. Numerical simulations validate the derived robustness bounds and characterize finite-shot scaling. We also perform experiments on IBM quantum hardware to estimate pairwise overlaps, and then evaluate the performance of the resulting POVMs.