arXiv:2610.22954
Quantum-Assisted Unambiguous Discrimination of Pure States with Robustness Bounds
Jinhyeok Heo, Dongkeun Lee, Junghee Ryu, Minjin Choi
Abstract
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.
AI Summary
The paper studies how to construct unambiguous discrimination measurements for linearly independent, circuit-prepared pure states when only estimated pairwise overlaps are available. It combines the NISQ semidefinite-program solver framework with reciprocal states, using the discriminated states themselves as the ansatz. This recovers the established Gram-matrix SDP: maximize $\sum_n\eta_n q_n$ subject to $q_n\geq0$ and $E-\operatorname{diag}(q)\succeq0$. Compared with the general NSS formulation, this uses $N$ scalar variables rather than $N$ positive-semidefinite matrix variables. The main analysis concerns an estimated Gram matrix $\hat E$ with $\|\hat E-E\|_2\leq\varepsilon$ and $\hat\lambda_{\min}>\varepsilon$. Rescaling the inferred conclusive operators by $\mu=\hat\lambda_{\min}/(\hat\lambda_{\min}+\varepsilon)$ guarantees a valid POVM, although discrimination is no longer exactly unambiguous. Computable bounds give $O(\varepsilon)$ success-probability deviations and $O(\varepsilon^2)$ misidentification probabilities for a fixed ensemble. The SDP optimum obeys $|Q(\hat E)-Q(E)|\leq\varepsilon Q(\hat E)/\hat\lambda_{\min}$. Proofs use matrix-order inequalities and perturbation estimates; Hoeffding bounds connect finite-shot sampling to $\varepsilon$. Simulations use three-qubit ensembles with $N=2,3,4$. IBM hardware overlap estimates, using $2^{14}$ shots per overlap, yield classically evaluated relative success deviations of $1.38\%$–$6.82\%$ and maximum misidentification below $3.73\times10^{-3}$. These benchmarks use the known ideal Gram matrix to determine the perturbation magnitude. Limitations include quadratic overlap acquisition, independently characterizing hardware-error bounds, and implementing the inferred POVMs, which is not demonstrated. The analysis targets intended pure states rather than the actual noisy mixed-state ensemble.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 10 pages, 4 figures