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:2610.22954

Quantum-Assisted Unambiguous Discrimination of Pure States with Robustness Bounds

Jinhyeok Heo, Dongkeun Lee, Junghee Ryu, Minjin Choi

quant-phSubmitted Oct 16, 2026• Announced Oct 19, 2026• 0 citations• Revised Oct 27, 2026 (v2)
v1 · Oct 16, 2026v2 · Oct 27, 2026
arXivHTMLPDF

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.

Little sign of AI-generated textIncrementalStrong assumptions

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
10 pages, 4 figures

Related papers

A hybrid quantum-classical algorithm for Bayes-optimal quantum state discrimination using the source code

Mohan, Ankith, Jamie Sikora, Sarvagya Upadhyay

Quantum state discrimination is a fundamental primitive in quantum information processing, underpinning tasks in quantum communication, sensing, and learning. We consider the general Bayes framework, as introduced by Helstrom, for state discrimination when, instead of a classical description of the candidate states, one has access to their \emph{source code}: the quantum circuit that prepares them. We show that the semidefinite program (SDP) for the discrimination problem can be reformulated in terms of the Gram matrix of these states, reducing the SDP variable dimensions from $dL$ to $NL$, where $d$ is the Hilbert space dimension, $N$ is the number of candidate states, and $L$ is the number of possible guesses. Importantly, we further introduce a quantum pre-processing procedure which efficiently constructs the reduced semidefinite program from the source code, enabling our method to operate directly on quantum data. We consider two applications. First, we characterize the optimal identifications for quantum changepoint problems under several reward structures, including multiple-changepoint settings that were previously computationally inaccessible. Second, we consider a quantum error classification problem and show how our reduction makes it tractable for systems of hundreds of qubits.

arXiv:2312.04023•Dec 7, 2023•12 citations

Noisy intermediate-scale quantum algorithm for semidefinite programming

Kishor Bharti, Tobias Haug, Vlatko Vedral +1 more

Semidefinite programs (SDPs) are convex optimization programs with vast applications in control theory, quantum information, combinatorial optimization, and operational research. Noisy intermediate-scale quantum (NISQ) algorithms aim to make an efficient use of the current generation of quantum hardware. However, optimizing variational quantum algorithms is a challenge as it is an nondeterministic polynomial time-hard problem that in general requires an exponential time to solve and can contain many far from optimal local minima. Here, we present a current term NISQ algorithm for solving SDPs. The classical optimization program of our NISQ solver is another SDP over a lower dimensional ansatz space. We harness the SDP-based formulation of the Hamiltonian ground-state problem to design a NISQ eigensolver. Unlike variational quantum eigensolvers, the classical optimization program of our eigensolver is convex and can be solved in polynomial time with the number of ansatz parameters, and every local minimum is a global minimum. We find numeric evidence that NISQ SDP can improve the estimation of ground-state energies in a scalable manner. Further, we efficiently solve constrained problems to calculate the excited states of Hamiltonians, find the lowest energy of symmetry constrained Hamiltonians, and determine the optimal measurements for quantum state discrimination. We demonstrate the potential of our approach by finding the largest eigenvalue of up to ${2}^{1000}$ dimensional matrices and solving graph problems related to quantum contextuality. We also discuss NISQ algorithms for rank-constrained SDPs. Our work extends the application of NISQ computers onto one of the most successful algorithmic frameworks of the past few decades.

arXiv:2106.03891•Physical Review A•May 31, 2022•39 citations

A Semidefinite Programming Approach to Optimal Unambiguous Discrimination of Quantum States

Yonina C. Eldar

Abstract—In this paper, 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. Index Terms—Compound geometrically uniform (CGU) quantum states, equal-probability measurement (EPM), geometrically uniform (GU) quantum states, quantum detection, semidefinite programming, unambiguous discrimination. I.

•Jun 14, 2002•87 citations

Error-Tolerant Quantum State Discrimination: Optimization and Quantum Circuit Synthesis

Chien-Kai Ma, Bo-Hung Chen, Tian-Fu Chen +2 more

We develop error-tolerant quantum state discrimination(QSD) strategies that maintain reliable performance under moderate noise. Two complementary approaches are proposed: CrossQSD, which generalizes unambiguous discrimination with tunable confidence bounds to balance accuracy and efficiency, and FitQSD, which optimizes the measurement outcome distribution to approximate that of the ideal noiseless case. Furthermore, we provide a unified hybrid-objective QSD framework that continuously interpolates between minimum-error discrimination (MED) and FitQSD, allowing flexible trade-offs among competing objectives. The associated optimization problems are formulated as convex programs and efficiently solved via disciplined convex programming or, in many cases, semidefinite programming. Additionally, a circuit synthesis framework based on a modified Naimark dilation and isometry synthesis enables hardware-efficient implementations with substantially reduced qubit and gate resources. An open-source toolkit automates the full optimization and synthesis workflow, providing a practical route to QSD on current quantum devices.

quant-pharXiv:2602.10731•Lecture notes in computer science•Feb 12, 2026•0 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

Quantum State Discrimination With Stabilizer Circuits

Benjamin Stratton, Santiago Zamora, Rafael Chaves

The task of quantum state discrimination provides an operational characterization of distinguishability and plays a central role in quantum information science. Since the achievable success probability in quantum state discrimination depends both on the states being discriminated and on the allowed measurements, it is natural to study discrimination under physically motivated measurement constraints. Here, we investigate minimum-error quantum state discrimination under measurements implementable by both fixed and adaptive stabilizer circuits. Given arbitrary stabilizer-state ancillas, we show that fixed stabilizer circuits provide no additional discrimination power, whereas adaptive circuits do. Then, focusing on single-qubit systems, we derive analytical expressions for the success probability across both circuit classes when supplied with arbitrary (non-stabilizer) ancillas, showing that the performance gap between fixed and adaptive circuits persists. We further consider discrimination with non-stabilizerness incorporated directly into the measurement operators. Here, the optimization is formulated as a semidefinite program, and analytical bounds interpolating between the stabilizer and Helstrom limits for qubits are derived. Finally, we illustrate applications in quantum random access codes and bounds on unitary synthesis fidelity with a finite number of magic states.

quant-pharXiv:2607.27339•Jul 31, 2026•2 citations
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.
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 ∑nηnqn\sum_n\eta_n q_n∑n​ηn​qn​ subject to qn≥0q_n\geq0qn​≥0 and E−diag⁡(q)⪰0E-\operatorname{diag}(q)\succeq0E−diag(q)⪰0. Compared with the general NSS formulation, this uses NNN scalar variables rather than NNN positive-semidefinite matrix variables.
The main analysis concerns an estimated Gram matrix E^\hat EE^ with ∥E^−E∥2≤ε\|\hat E-E\|_2\leq\varepsilon∥E^−E∥2​≤ε and λ^min⁡>ε\hat\lambda_{\min}>\varepsilonλ^min​>ε. Rescaling the inferred conclusive operators by μ=λ^min⁡/(λ^min⁡+ε)\mu=\hat\lambda_{\min}/(\hat\lambda_{\min}+\varepsilon)μ=λ^min​/(λ^min​+ε) guarantees a valid POVM, although discrimination is no longer exactly unambiguous. Computable bounds give O(ε)O(\varepsilon)O(ε) success-probability deviations and O(ε2)O(\varepsilon^2)O(ε2) misidentification probabilities for a fixed ensemble. The SDP optimum obeys ∣Q(E^)−Q(E)∣≤εQ(E^)/λ^min⁡|Q(\hat E)-Q(E)|\leq\varepsilon Q(\hat E)/\hat\lambda_{\min}∣Q(E^)−Q(E)∣≤εQ(E^)/λ^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,4N=2,3,4N=2,3,4. IBM hardware overlap estimates, using 2142^{14}214 shots per overlap, yield classically evaluated relative success deviations of 1.38%1.38\%1.38%–6.82%6.82\%6.82% and maximum misidentification below 3.73×10−33.73\times10^{-3}3.73×10−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.
Quantum state discrimination is a fundamental primitive in quantum information processing, underpinning tasks in quantum communication, sensing, and learning. We consider the general Bayes framework, as introduced by Helstrom, for state discrimination when, instead of a classical description of the candidate states, one has access to their \emph{source code}: the quantum circuit that prepares them. We show that the semidefinite program (SDP) for the discrimination problem can be reformulated in terms of the Gram matrix of these states, reducing the SDP variable dimensions from dLdLdL to NLNLNL, where ddd is the Hilbert space dimension, NNN is the number of candidate states, and LLL is the number of possible guesses. Importantly, we further introduce a quantum pre-processing procedure which efficiently constructs the reduced semidefinite program from the source code, enabling our method to operate directly on quantum data. We consider two applications. First, we characterize the optimal identifications for quantum changepoint problems under several reward structures, including multiple-changepoint settings that were previously computationally inaccessible. Second, we consider a quantum error classification problem and show how our reduction makes it tractable for systems of hundreds of qubits.
Semidefinite programs (SDPs) are convex optimization programs with vast applications in control theory, quantum information, combinatorial optimization, and operational research. Noisy intermediate-scale quantum (NISQ) algorithms aim to make an efficient use of the current generation of quantum hardware. However, optimizing variational quantum algorithms is a challenge as it is an nondeterministic polynomial time-hard problem that in general requires an exponential time to solve and can contain many far from optimal local minima. Here, we present a current term NISQ algorithm for solving SDPs. The classical optimization program of our NISQ solver is another SDP over a lower dimensional ansatz space. We harness the SDP-based formulation of the Hamiltonian ground-state problem to design a NISQ eigensolver. Unlike variational quantum eigensolvers, the classical optimization program of our eigensolver is convex and can be solved in polynomial time with the number of ansatz parameters, and every local minimum is a global minimum. We find numeric evidence that NISQ SDP can improve the estimation of ground-state energies in a scalable manner. Further, we efficiently solve constrained problems to calculate the excited states of Hamiltonians, find the lowest energy of symmetry constrained Hamiltonians, and determine the optimal measurements for quantum state discrimination. We demonstrate the potential of our approach by finding the largest eigenvalue of up to 21000{2}^{1000}21000 dimensional matrices and solving graph problems related to quantum contextuality. We also discuss NISQ algorithms for rank-constrained SDPs. Our work extends the application of NISQ computers onto one of the most successful algorithmic frameworks of the past few decades.
Abstract—In this paper, 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. Index Terms—Compound geometrically uniform (CGU) quantum states, equal-probability measurement (EPM), geometrically uniform (GU) quantum states, quantum detection, semidefinite programming, unambiguous discrimination. I.
We develop error-tolerant quantum state discrimination(QSD) strategies that maintain reliable performance under moderate noise. Two complementary approaches are proposed: CrossQSD, which generalizes unambiguous discrimination with tunable confidence bounds to balance accuracy and efficiency, and FitQSD, which optimizes the measurement outcome distribution to approximate that of the ideal noiseless case. Furthermore, we provide a unified hybrid-objective QSD framework that continuously interpolates between minimum-error discrimination (MED) and FitQSD, allowing flexible trade-offs among competing objectives. The associated optimization problems are formulated as convex programs and efficiently solved via disciplined convex programming or, in many cases, semidefinite programming. Additionally, a circuit synthesis framework based on a modified Naimark dilation and isometry synthesis enables hardware-efficient implementations with substantially reduced qubit and gate resources. An open-source toolkit automates the full optimization and synthesis workflow, providing a practical route to QSD on current quantum devices.
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.
The task of quantum state discrimination provides an operational characterization of distinguishability and plays a central role in quantum information science. Since the achievable success probability in quantum state discrimination depends both on the states being discriminated and on the allowed measurements, it is natural to study discrimination under physically motivated measurement constraints. Here, we investigate minimum-error quantum state discrimination under measurements implementable by both fixed and adaptive stabilizer circuits. Given arbitrary stabilizer-state ancillas, we show that fixed stabilizer circuits provide no additional discrimination power, whereas adaptive circuits do. Then, focusing on single-qubit systems, we derive analytical expressions for the success probability across both circuit classes when supplied with arbitrary (non-stabilizer) ancillas, showing that the performance gap between fixed and adaptive circuits persists. We further consider discrimination with non-stabilizerness incorporated directly into the measurement operators. Here, the optimization is formulated as a semidefinite program, and analytical bounds interpolating between the stabilizer and Helstrom limits for qubits are derived. Finally, we illustrate applications in quantum random access codes and bounds on unitary synthesis fidelity with a finite number of magic states.