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

IEEE International Symposium on Information Theory (ISIT)

State and Measurement Design for Quantum Detection Over Quantum Channels

Jeremy Johnston, Xiaodong Wang

Published Jun 22, 2025• 0 citations
Publisher

Abstract

In quantum state discrimination, typically the design of measurement operators or probe state is formulated assuming the set of possible states is perfectly known, but this may yield designs which are sensitive to deviations in the realized set of states. For example, the channel through which a transmitted state is sent may not be deterministic, but instead characterized by a classical distribution over quantum channels. In this paper, we consider the design of measurement schemes and probe states for quantum detection over an uncertain quantum channel. We present stochastic gradient-based algorithms to maximize the expected performance over the channel distribution for various design objectives, including the detection probability and mutual information. Furthermore, we introduce a scheme that leverages the isometric extension of a quantum channel to measure the channel output in an enlarged Hilbert space such that the channels are more distinguishable, while simultaneously reducing the effective dimension and thereby reducing the optimization complexity. Finally, we apply the proposed algorithms to multicopy channel discrimination.

DOI
10.1109/isit63088.2025.11195294

Related papers

Quantum Detection Over Quantum Channels With Uncertainty

Jeremy Johnston, Xiaodong Wang

In quantum state discrimination, typically the design of measurement operators or probe state is formulated assuming the set of possible states is perfectly known, but this may yield designs which are sensitive to deviations in the realized set of states. For example, the channel through which a transmitted state is sent may not be deterministic, but instead characterized by a classical distribution over quantum channels. In this paper, we consider the design of measurement schemes and probe states for quantum detection over an uncertain quantum channel. We present stochastic gradient-based algorithms to maximize the expected performance over the channel distribution under two design scenarios, joint design and two-stage design. We consider various design objectives, including the detection probability and mutual information, with the latter leading to a hybrid scheme consisting of von Neumann measurement and classical hypothesis test. Furthermore, we introduce a channel discrimination scheme which leverages the isometric extension of a quantum channel which increases the channel distinguishability, while simultaneously reducing the effective dimension and thereby reducing the optimization complexity. In addition, we apply amortized optimization to train a recurrent neural network in order to improve the convergence speed of the proposed algorithms. Finally, we apply the proposed algorithms to multi-copy channel discrimination as well as a novel joint channel-state discrimination scenario.

IEEE Transactions on Quantum Engineering•Oct 27, 2025•0 citations

Single shot distinguishability of noisy quantum channels

Satyaki Manna

Among the intriguing features of quantum theory, the problem of distinguishing quantum channels is of fundamental interest. In this paper, we focus on the single-shot discrimination of two noisy quantum channels using two distinct classes of probes: single-system (product) probes and entangled probes. Our aim is to identify optimal probing state for specific discrimination tasks and to analyze the necessity and role of entanglement in enhancing channel distinguishability. We show that maximally entangled probes are optimal for discriminating two qubit depolarizing channels, with any nonzero entanglement providing an advantage over single-system probes. In contrast, for dephasing channels in arbitrary dimensions, we prove that single-system probe can be optimal and that entanglement offers no improvement, even when the dephasing unitary is generalized. For qubit amplitude-damping channels, we identify distinct noise-dependent regimes in which either single-system probe outperforms maximally entangled probes and vice-versa. Moreover, we demonstrate that non-maximally entangled probes can act as the optimum probe if the noise parameters restricted to certain values in this task. We also present examples of noisy unitary channels for which discrimination is possible using non-maximally entangled probe, while both single-systems and maximally entangled probes fail. We introduce another class of noisy unitary channels for which perfect discrimination is achievable with a single system, while maximally entangled probes are insufficient. Finally, we show that two erasure channels can be optimally discriminated using any pure single-system probe, with no advantage gained from entanglement.

quant-pharXiv:2602.05521•Feb 6, 2026•2 citations

Preserving measurements for optimal state discrimination over quantum channels

Spiros Kechrimparis, Tanmay Singal, Chahan M. Kropf +1 more

In this work, we consider optimal discrimination among quantum states that are sent through a quantum channel. We show the conditions on a quantum channel and an ensemble of states to preserve a measurement for optimal state discrimination over the channel. In particular, we show that for an ensemble of states where the states are given with equal a priori probabilities, an optimal measurement can be preserved over any quantum channel by applying local operations and classical communication, that is, by manipulating the quantum states before and after the channel application. Examples are provided for illustration in the case of quantum communication protocols. Our results can be readily applied to optimal state discrimination over various types of noise.

arXiv:1811.07721•Physical Review A•Jun 3, 2019•13 citations

Techniques For Computing and Approximating Large Optimization Problems in Quantum Information

Ankith Mohan

Many fundamental problems in quantum information theory can be formulated as optimization tasks over quantum states and measurements. While the convex structure of quantum theory often enables powerful semidefinite programming formulations, a major challenge persists: the exponential growth of Hilbert space dimension with system size. This dissertation discusses techniques to address these and related obstacles across several core problems in quantum information. We first study optimization over separable quantum states. Such problems are typically NP-hard and standard semidefinite programming hierarchies suffer from the curse of dimensionality. We introduce a hybrid algorithm that leverages a quantum co-processor to reduce the effective dimension of the problem. While several existing approaches provide only a numerical bound on the optimal value, our method is guaranteed to return an explicit feasible solution: a valid separable state, even in instances where it is not optimal. We apply this framework to approximate the minimum separable energy of many-body Hamiltonians, define an entanglement measure for their ground spaces, and demonstrate numerical scalability to systems of up to 28 qubits. We next 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 source code: the quantum circuit that prepares them. We show that the typical semidefinite program for the discrimination problem can be reformulated in terms of the Gram matrix of these states, reducing the 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 problem 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 whose associated discrimination problems 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. We also analyze structural measurement strategies. As a counterpart to the well-known pretty good measurement for minimum-error state discrimination, we introduce the pretty bad measurement for the exclusion variant, in which the goal is to identify a state that was not sent, rather than to identify the one that was, and prove that both are guaranteed to perform at least as well as blind guessing in their respective objectives. Finally, we consider evaluating Boolean functions under severe memory constraints and prove that a simple local "greedy" measurement strategy is globally optimal precisely for affine Boolean functions, while more generally achieving at least the square of the optimal global success probability. Together, these results demonstrate that high-dimensional quantum optimization problems often admit hidden structure enabling dimension reduction, hybrid computation, and provable approximation guarantees.

•Aug 18, 2026•0 citations

Training a quantum measurement device to discriminate unknown non-orthogonal quantum states

Daniel Concha, Luís Pereira, L. Zambrano +1 more

Here, we study the problem of decoding information transmitted through unknown quantum states. We assume that Alice encodes an alphabet into a set of orthogonal quantum states, which are then transmitted to Bob. However, the quantum channel that mediates the transmission maps the orthogonal states into non-orthogonal states, possibly mixed. If an accurate model of the channel is unavailable, then the states received by Bob are unknown. In order to decode the transmitted information we propose to train a measurement device to achieve the smallest possible error in the discrimination process. This is achieved by supplementing the quantum channel with a classical one, which allows the transmission of information required for the training, and resorting to a noise-tolerant optimization algorithm. We demonstrate the training method in the case of minimum-error discrimination strategy and show that it achieves error probabilities very close to the optimal one. In particular, in the case of two unknown pure states, our proposal approaches the Helstrom bound. A similar result holds for a larger number of states in higher dimensions. We also show that a reduction of the search space, which is used in the training process, leads to a considerable reduction in the required resources. Finally, we apply our proposal to the case of the phase flip channel reaching an accurate value of the optimal error probability.

arXiv:2111.13568•Scientific Reports•May 8, 2023•4 citations

Quantum State Detector Design: Optimal Worst-Case a posteriori Performance

Robert L. Kosut, Ian A. Walmsley, Yonina C. Eldar +1 more

The problem addressed is to design a detector which is maximally sensitive to specific quantum states. Here we concentrate on quantum state detection using the worst-case a posteriori probability of detection as the design criterion. This objective is equivalent to asking the question: if the detector declares that a specific state is present, what is the probability of that state actually being present? We show that maximizing this worst-case probability (maximizing the smallest possible value of this probability) is a quasiconvex optimization over the matrices of the POVM (positive operator valued measure) which characterize the measurement apparatus. We also show that with a given POVM, the optimization is quasiconvex in the matrix which characterizes the Kraus operator sum representation (OSR) in a fixed basis. We use Lagrange Duality Theory to establish the optimality conditions for both deterministic and randomized detection. We also examine the special case of detecting a single pure state. Numerical aspects of using convex optimization for quantum state detection are also discussed.

arXiv:quant-ph/0403150•Mar 21, 2004•15 citations
In quantum state discrimination, typically the design of measurement operators or probe state is formulated assuming the set of possible states is perfectly known, but this may yield designs which are sensitive to deviations in the realized set of states. For example, the channel through which a transmitted state is sent may not be deterministic, but instead characterized by a classical distribution over quantum channels. In this paper, we consider the design of measurement schemes and probe states for quantum detection over an uncertain quantum channel. We present stochastic gradient-based algorithms to maximize the expected performance over the channel distribution for various design objectives, including the detection probability and mutual information. Furthermore, we introduce a scheme that leverages the isometric extension of a quantum channel to measure the channel output in an enlarged Hilbert space such that the channels are more distinguishable, while simultaneously reducing the effective dimension and thereby reducing the optimization complexity. Finally, we apply the proposed algorithms to multicopy channel discrimination.
In quantum state discrimination, typically the design of measurement operators or probe state is formulated assuming the set of possible states is perfectly known, but this may yield designs which are sensitive to deviations in the realized set of states. For example, the channel through which a transmitted state is sent may not be deterministic, but instead characterized by a classical distribution over quantum channels. In this paper, we consider the design of measurement schemes and probe states for quantum detection over an uncertain quantum channel. We present stochastic gradient-based algorithms to maximize the expected performance over the channel distribution under two design scenarios, joint design and two-stage design. We consider various design objectives, including the detection probability and mutual information, with the latter leading to a hybrid scheme consisting of von Neumann measurement and classical hypothesis test. Furthermore, we introduce a channel discrimination scheme which leverages the isometric extension of a quantum channel which increases the channel distinguishability, while simultaneously reducing the effective dimension and thereby reducing the optimization complexity. In addition, we apply amortized optimization to train a recurrent neural network in order to improve the convergence speed of the proposed algorithms. Finally, we apply the proposed algorithms to multi-copy channel discrimination as well as a novel joint channel-state discrimination scenario.
Among the intriguing features of quantum theory, the problem of distinguishing quantum channels is of fundamental interest. In this paper, we focus on the single-shot discrimination of two noisy quantum channels using two distinct classes of probes: single-system (product) probes and entangled probes. Our aim is to identify optimal probing state for specific discrimination tasks and to analyze the necessity and role of entanglement in enhancing channel distinguishability. We show that maximally entangled probes are optimal for discriminating two qubit depolarizing channels, with any nonzero entanglement providing an advantage over single-system probes. In contrast, for dephasing channels in arbitrary dimensions, we prove that single-system probe can be optimal and that entanglement offers no improvement, even when the dephasing unitary is generalized. For qubit amplitude-damping channels, we identify distinct noise-dependent regimes in which either single-system probe outperforms maximally entangled probes and vice-versa. Moreover, we demonstrate that non-maximally entangled probes can act as the optimum probe if the noise parameters restricted to certain values in this task. We also present examples of noisy unitary channels for which discrimination is possible using non-maximally entangled probe, while both single-systems and maximally entangled probes fail. We introduce another class of noisy unitary channels for which perfect discrimination is achievable with a single system, while maximally entangled probes are insufficient. Finally, we show that two erasure channels can be optimally discriminated using any pure single-system probe, with no advantage gained from entanglement.
In this work, we consider optimal discrimination among quantum states that are sent through a quantum channel. We show the conditions on a quantum channel and an ensemble of states to preserve a measurement for optimal state discrimination over the channel. In particular, we show that for an ensemble of states where the states are given with equal a priori probabilities, an optimal measurement can be preserved over any quantum channel by applying local operations and classical communication, that is, by manipulating the quantum states before and after the channel application. Examples are provided for illustration in the case of quantum communication protocols. Our results can be readily applied to optimal state discrimination over various types of noise.
Many fundamental problems in quantum information theory can be formulated as optimization tasks over quantum states and measurements. While the convex structure of quantum theory often enables powerful semidefinite programming formulations, a major challenge persists: the exponential growth of Hilbert space dimension with system size. This dissertation discusses techniques to address these and related obstacles across several core problems in quantum information. We first study optimization over separable quantum states. Such problems are typically NP-hard and standard semidefinite programming hierarchies suffer from the curse of dimensionality. We introduce a hybrid algorithm that leverages a quantum co-processor to reduce the effective dimension of the problem. While several existing approaches provide only a numerical bound on the optimal value, our method is guaranteed to return an explicit feasible solution: a valid separable state, even in instances where it is not optimal. We apply this framework to approximate the minimum separable energy of many-body Hamiltonians, define an entanglement measure for their ground spaces, and demonstrate numerical scalability to systems of up to 28 qubits. We next 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 source code: the quantum circuit that prepares them. We show that the typical semidefinite program for the discrimination problem can be reformulated in terms of the Gram matrix of these states, reducing the 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 problem 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 whose associated discrimination problems 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. We also analyze structural measurement strategies. As a counterpart to the well-known pretty good measurement for minimum-error state discrimination, we introduce the pretty bad measurement for the exclusion variant, in which the goal is to identify a state that was not sent, rather than to identify the one that was, and prove that both are guaranteed to perform at least as well as blind guessing in their respective objectives. Finally, we consider evaluating Boolean functions under severe memory constraints and prove that a simple local "greedy" measurement strategy is globally optimal precisely for affine Boolean functions, while more generally achieving at least the square of the optimal global success probability. Together, these results demonstrate that high-dimensional quantum optimization problems often admit hidden structure enabling dimension reduction, hybrid computation, and provable approximation guarantees.
Here, we study the problem of decoding information transmitted through unknown quantum states. We assume that Alice encodes an alphabet into a set of orthogonal quantum states, which are then transmitted to Bob. However, the quantum channel that mediates the transmission maps the orthogonal states into non-orthogonal states, possibly mixed. If an accurate model of the channel is unavailable, then the states received by Bob are unknown. In order to decode the transmitted information we propose to train a measurement device to achieve the smallest possible error in the discrimination process. This is achieved by supplementing the quantum channel with a classical one, which allows the transmission of information required for the training, and resorting to a noise-tolerant optimization algorithm. We demonstrate the training method in the case of minimum-error discrimination strategy and show that it achieves error probabilities very close to the optimal one. In particular, in the case of two unknown pure states, our proposal approaches the Helstrom bound. A similar result holds for a larger number of states in higher dimensions. We also show that a reduction of the search space, which is used in the training process, leads to a considerable reduction in the required resources. Finally, we apply our proposal to the case of the phase flip channel reaching an accurate value of the optimal error probability.
The problem addressed is to design a detector which is maximally sensitive to specific quantum states. Here we concentrate on quantum state detection using the worst-case a posteriori probability of detection as the design criterion. This objective is equivalent to asking the question: if the detector declares that a specific state is present, what is the probability of that state actually being present? We show that maximizing this worst-case probability (maximizing the smallest possible value of this probability) is a quasiconvex optimization over the matrices of the POVM (positive operator valued measure) which characterize the measurement apparatus. We also show that with a given POVM, the optimization is quasiconvex in the matrix which characterizes the Kraus operator sum representation (OSR) in a fixed basis. We use Lagrange Duality Theory to establish the optimality conditions for both deterministic and randomized detection. We also examine the special case of detecting a single pure state. Numerical aspects of using convex optimization for quantum state detection are also discussed.