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:1308.4030 · Journal of Mathematical Physics

Base norms and discrimination of generalized quantum channels

Anna Jenčová

Published Feb 1, 2014• 27 citations
arXivHTMLPDF

Abstract

We introduce and study norms in the space of hermitian matrices, obtained from base norms in positively generated subspaces. These norms are closely related to discrimination of so-called generalized quantum channels, including quantum states, channels, and networks. We further introduce generalized quantum decision problems and show that the maximal average payoffs of decision procedures are again given by these norms. We also study optimality of decision procedures, in particular, we obtain a necessary and sufficient condition under which an optimal 1-tester for discrimination of quantum channels exists, such that the input state is maximally entangled.

DOI
10.1063/1.4863715

Related papers

Conditions for optimal input states for discrimination of quantum channels

Anna Jenčová, Martin Plávala

We find optimality conditions for testers in discrimination of quantum channels. These conditions are obtained using semidefinite programming and are similar to optimality conditions for discrimination of quantum states. We get a simple condition for existence of an optimal tester with any given input state with maximal Schmidt rank, in particular with a maximally entangled input state. In the case when maximally entangled state is not optimal, an upper bound on the optimal success probability is obtained. The results for discrimination of two channels are applied to covariant channels, qubit channels, unitary channels, and simple projective measurements.

arXiv:1603.01437•Journal of Mathematical Physics•Dec 1, 2016•24 citations

Generalized quantum state discrimination problems

Kenji Nakahira, Kentaro Kato, Tsuyoshi Sasaki Usuda

We address a broad class of optimization problems of finding quantum measurements, which includes the problems of finding an optimal measurement in the Bayes criterion and a measurement maximizing the average correct probability with a fixed rate of inconclusive results. Our approach can deal with any problem in which each of the objective and constraint functions is formulated by the sum of the traces of the multiplication of a Hermitian operator and a detection operator. We first derive dual problems and necessary and sufficient conditions for an optimal measurement. We also consider the minimax version of these problems and provide necessary and sufficient conditions for a minimax solution. Finally, for optimization problem having a certain symmetry, there exists an optimal solution with the same symmetry. Examples are shown to illustrate how our results can be used.

arXiv:1501.05744•Physical Review A•May 6, 2015•32 citations

Entanglement in quantum channel discrimination: sometimes less is more

Kristin Sundal Lien, Marco Túlio Quintino

Entanglement is known to be a powerful resource that improves performance in various quantum information and computational tasks. A standard example of such a phenomenon is the possibility of perfectly discriminating all four Pauli operations in a single shot via the superdense coding protocol. While entanglement is often a powerful resource for quantum channel discrimination, this is not necessarily the case. In this work, we identify scenarios in which the maximally entangled state is a bad choice of input state and, more generally, show that excessive entanglement can reduce channel discriminability dramatically. To do so, we present an explicit pair of unitary channels which are perfectly discriminable without entanglement, but for which any strategy with maximally entangled input states is $ε$-close to a blind uniform guessing strategy. To develop a systematic approach, we introduce the concepts of Maximal Entanglement Worst Case (MEWC) and Maximal Entanglement Best Case (MEBC) pairs of channels, and present conditions for a pair of channels to be MEWC or MEBC. With these conditions, we show that the optimal input states for discriminating MEWC pairs of channels are necessarily separable, and provide non-trivial examples of measurement channels for which entanglement necessarily reduces the maximum probability of discrimination.

quant-pharXiv:2605.31519•Jun 1, 2026•1 citation

Entanglement in single-shot quantum channel discrimination

Daniel Puzzuoli

Single-shot quantum channel discrimination is the fundamental task of determining, given only a single use, which of two known quantum channels is acting on a system. In this thesis we investigate the well-known phenomenon that entanglement to an auxiliary system can provide an advantage in this task. In particular, we consider the questions: (1) How much entanglement is in general necessary to achieve an optimal discrimination strategy? (2) What is the maximal advantage provided by entanglement? \n \nGiven a linear map Ψ : L(Cn) → L(Cm), its multiplicity maps are defined as the family of linear maps Ψ ⊗ 1L(Ck) : L(Cn ⊗ Ck) → L(Cm ⊗ Ck), where 1L(Ck) is the identity on L(Ck). Due to the Holevo-Helstrom theorem, the optimal performance using an auxiliary system of dimension k is quantified in terms of the norm of Ψ⊗1L(Ck), where Ψ is a linear map that depends on the parameters of the discrimination problem. Hence, the advantage provided by entanglement is represented in the growth of the norm of Ψ ⊗ 1L(Ck ) with k, a classic phenomenon in the theory of operator algebras. \n \nWe formalize question (1) by investigating, relative to the input and output dimensions of the channels to be discriminated, how large of an auxiliary system is necessary to achieve an optimal strategy. Mathematically, this is connected to when the norm of Ψ ⊗ 1L(Ck) stops growing with k. It is well- known that an auxiliary system of dimension equal to the input is always sufficient to achieve an optimal strategy, and that this is sometimes necessary when the output dimension is at least as large as the input. We prove that, even when the output dimension is arbitrarily small compared to the input, it is still sometimes necessary to use an auxiliary system as large as the input to achieve an optimal strategy. \n \nFor question (2), we investigate, with respect to a fixed input dimension, how large the gap between the optimal performances with and without entanglement can be. Mathematically, this is quantified by the rate of growth of the norm of Ψ ⊗ 1L(Ck ) in k. It is known that matrix transposition has the fastest possible growth, and we prove that it is essentially the unique linear map with this property. We use this to prove that a discrimination problem defined in terms of the Werner-Holevo channels is essentially the unique game satisfying a norm relation that states that the game can be won with certainty using entanglement, but is hard to win without entanglement. \n \nAlong the way, we prove characterizations of the structure of maximal entanglement, as measured according to the entanglement negativity, as well as relative to a large class of entanglement measures. We also give various characterizations of complete trace-norm isometries, and reversible quantum channels.

•Aug 30, 2018•0 citations

Generalized quantum process discrimination problems

Kenji Nakahira, Kentaro Kato

We study a broad class of quantum process discrimination problems that can handle many optimization strategies such as the Bayes, Neyman-Pearson, and unambiguous strategies, where each process can consist of multiple time steps and can have an internal memory. Given a collection of candidate processes, our task is to find a discrimination strategy, which may be adaptive and/or entanglement assisted, that maximizes a given objective function subject to given constraints. Our problem can be formulated as a convex problem. Its Lagrange dual problem with no duality gap and necessary and sufficient conditions for an optimal solution are derived. We also show that if a problem has a certain symmetry and at least one optimal solution exists, then there also exists an optimal solution with the same type of symmetry. A minimax strategy for a process discrimination problem is also discussed. As applications of our results, we provide some problems in which an adaptive strategy is not necessary for optimal discrimination. We also present an example of single-shot channel discrimination for which an analytical solution can be obtained.

arXiv:2104.09759•Physical Review A•Jun 14, 2021•11 citations

Minimum error discrimination of Pauli channels

M F Sacchi

We solve the problem of discriminating with minimum error probability two given Pauli channels. We show that, unlike in the case of discrimination between unitary transformations, the use of entanglement with an ancillary system can strictly improve the discrimination, and any maximally entangled state allows one to achieve the optimal discrimination. We also provide a simple necessary and sufficient condition in terms of the structure of the channels for which the ultimate minimum error probability can be achieved without entanglement assistance. When such a condition is satisfied, the optimal input state is simply an eigenstate of one of the Pauli matrices.

arXiv:quant-ph/0506072•Journal of Optics B Quantum and Semiclassical Optics•Sep 21, 2005•24 citations
We introduce and study norms in the space of hermitian matrices, obtained from base norms in positively generated subspaces. These norms are closely related to discrimination of so-called generalized quantum channels, including quantum states, channels, and networks. We further introduce generalized quantum decision problems and show that the maximal average payoffs of decision procedures are again given by these norms. We also study optimality of decision procedures, in particular, we obtain a necessary and sufficient condition under which an optimal 1-tester for discrimination of quantum channels exists, such that the input state is maximally entangled.
We find optimality conditions for testers in discrimination of quantum channels. These conditions are obtained using semidefinite programming and are similar to optimality conditions for discrimination of quantum states. We get a simple condition for existence of an optimal tester with any given input state with maximal Schmidt rank, in particular with a maximally entangled input state. In the case when maximally entangled state is not optimal, an upper bound on the optimal success probability is obtained. The results for discrimination of two channels are applied to covariant channels, qubit channels, unitary channels, and simple projective measurements.
We address a broad class of optimization problems of finding quantum measurements, which includes the problems of finding an optimal measurement in the Bayes criterion and a measurement maximizing the average correct probability with a fixed rate of inconclusive results. Our approach can deal with any problem in which each of the objective and constraint functions is formulated by the sum of the traces of the multiplication of a Hermitian operator and a detection operator. We first derive dual problems and necessary and sufficient conditions for an optimal measurement. We also consider the minimax version of these problems and provide necessary and sufficient conditions for a minimax solution. Finally, for optimization problem having a certain symmetry, there exists an optimal solution with the same symmetry. Examples are shown to illustrate how our results can be used.
Entanglement is known to be a powerful resource that improves performance in various quantum information and computational tasks. A standard example of such a phenomenon is the possibility of perfectly discriminating all four Pauli operations in a single shot via the superdense coding protocol. While entanglement is often a powerful resource for quantum channel discrimination, this is not necessarily the case. In this work, we identify scenarios in which the maximally entangled state is a bad choice of input state and, more generally, show that excessive entanglement can reduce channel discriminability dramatically. To do so, we present an explicit pair of unitary channels which are perfectly discriminable without entanglement, but for which any strategy with maximally entangled input states is εεε-close to a blind uniform guessing strategy. To develop a systematic approach, we introduce the concepts of Maximal Entanglement Worst Case (MEWC) and Maximal Entanglement Best Case (MEBC) pairs of channels, and present conditions for a pair of channels to be MEWC or MEBC. With these conditions, we show that the optimal input states for discriminating MEWC pairs of channels are necessarily separable, and provide non-trivial examples of measurement channels for which entanglement necessarily reduces the maximum probability of discrimination.
Single-shot quantum channel discrimination is the fundamental task of determining, given only a single use, which of two known quantum channels is acting on a system. In this thesis we investigate the well-known phenomenon that entanglement to an auxiliary system can provide an advantage in this task. In particular, we consider the questions: (1) How much entanglement is in general necessary to achieve an optimal discrimination strategy? (2) What is the maximal advantage provided by entanglement? \n \nGiven a linear map Ψ : L(Cn) → L(Cm), its multiplicity maps are defined as the family of linear maps Ψ ⊗ 1L(Ck) : L(Cn ⊗ Ck) → L(Cm ⊗ Ck), where 1L(Ck) is the identity on L(Ck). Due to the Holevo-Helstrom theorem, the optimal performance using an auxiliary system of dimension k is quantified in terms of the norm of Ψ⊗1L(Ck), where Ψ is a linear map that depends on the parameters of the discrimination problem. Hence, the advantage provided by entanglement is represented in the growth of the norm of Ψ ⊗ 1L(Ck ) with k, a classic phenomenon in the theory of operator algebras. \n \nWe formalize question (1) by investigating, relative to the input and output dimensions of the channels to be discriminated, how large of an auxiliary system is necessary to achieve an optimal strategy. Mathematically, this is connected to when the norm of Ψ ⊗ 1L(Ck) stops growing with k. It is well- known that an auxiliary system of dimension equal to the input is always sufficient to achieve an optimal strategy, and that this is sometimes necessary when the output dimension is at least as large as the input. We prove that, even when the output dimension is arbitrarily small compared to the input, it is still sometimes necessary to use an auxiliary system as large as the input to achieve an optimal strategy. \n \nFor question (2), we investigate, with respect to a fixed input dimension, how large the gap between the optimal performances with and without entanglement can be. Mathematically, this is quantified by the rate of growth of the norm of Ψ ⊗ 1L(Ck ) in k. It is known that matrix transposition has the fastest possible growth, and we prove that it is essentially the unique linear map with this property. We use this to prove that a discrimination problem defined in terms of the Werner-Holevo channels is essentially the unique game satisfying a norm relation that states that the game can be won with certainty using entanglement, but is hard to win without entanglement. \n \nAlong the way, we prove characterizations of the structure of maximal entanglement, as measured according to the entanglement negativity, as well as relative to a large class of entanglement measures. We also give various characterizations of complete trace-norm isometries, and reversible quantum channels.
We study a broad class of quantum process discrimination problems that can handle many optimization strategies such as the Bayes, Neyman-Pearson, and unambiguous strategies, where each process can consist of multiple time steps and can have an internal memory. Given a collection of candidate processes, our task is to find a discrimination strategy, which may be adaptive and/or entanglement assisted, that maximizes a given objective function subject to given constraints. Our problem can be formulated as a convex problem. Its Lagrange dual problem with no duality gap and necessary and sufficient conditions for an optimal solution are derived. We also show that if a problem has a certain symmetry and at least one optimal solution exists, then there also exists an optimal solution with the same type of symmetry. A minimax strategy for a process discrimination problem is also discussed. As applications of our results, we provide some problems in which an adaptive strategy is not necessary for optimal discrimination. We also present an example of single-shot channel discrimination for which an analytical solution can be obtained.
We solve the problem of discriminating with minimum error probability two given Pauli channels. We show that, unlike in the case of discrimination between unitary transformations, the use of entanglement with an ancillary system can strictly improve the discrimination, and any maximally entangled state allows one to achieve the optimal discrimination. We also provide a simple necessary and sufficient condition in terms of the structure of the channels for which the ultimate minimum error probability can be achieved without entanglement assistance. When such a condition is satisfied, the optimal input state is simply an eigenstate of one of the Pauli matrices.