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:2009.01000 · Journal of Physics A Mathematical and Theoretical

Discriminating qubit amplitude damping channels

Milajiguli Rexiti, Stefano Mancini

Published Mar 10, 2021• 11 citations
arXivHTMLPDF

Abstract

Abstract We address the issue of the discrimination between two-qubit amplitude damping channels by exploring several strategies. For the single-shot, we show that the excited state does not always give the optimal input, and that side entanglement assistance has limited benefit. On the contrary, feedback assistance from the environment is more beneficial. For the two-shot, we prove the in-utility of entangled inputs. Then focusing on individual (local) measurements, we find the optimal adaptive strategy.

DOI
10.1088/1751-8121/abed68

Related papers

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

Discrimination of dephasing channels

Milajiguli Rexiti, Laleh Memarzadeh, Stefano Mancini

Abstract The problem of dephasing channel discrimination is addressed for finite-dimensional systems. In particular, the optimization with respect to input states without energy constraint is solved analytically for qubit, qutrit and ququart. Additionally, it is shown that resorting to side entanglement assisted strategy is completely useless in this case.

arXiv:2201.00388•Journal of Physics A Mathematical and Theoretical•May 5, 2022•10 citations

Entanglement-Assisted Timing Optimization for Discriminating Amplitude-Damping Dynamics

Massimiliano F. Sacchi, Milajiguli Rexiti, Stefano Mancini

We analyze minimum-error discrimination of two qubit dynamical processes generated by phase-covariant amplitude-damping Lindbladians in a single-use scenario. The optimization involves both the input probe, possibly entangled with an isolated ancilla, and the interrogation time. For unassisted probes we obtain a closed expression for the optimal trace-norm distinguishability at fixed time, with distinct interior and boundary branches. For entanglement-assisted probes, the common phase covariance of the two channels reduces the diamond-norm optimization to a one-parameter Schmidt family. The resulting formula gives transparent sufficient conditions for fixed-time entanglement advantage and separates this local advantage from advantage after global optimization over time. We exhibit examples in which the best unassisted strategy is approached only asymptotically, whereas an entangled probe achieves a strictly smaller error probability at finite time.

quant-pharXiv:2607.03757•Jul 7, 2026•0 citations

Optimal entanglement-assisted discrimination of quantum measurements

Martina Miková, Michal Sedlák, Ivo Straka +5 more

We investigate optimal discrimination between two projective single-qubit measurements in a scenario where the measurement can be performed only once. We consider general setting involving a tunable fraction of inconclusive outcomes and we prove that the optimal discrimination strategy requires an entangled probe state for any nonzero rate of inconclusive outcomes. We experimentally implement this optimal discrimination strategy for projective measurements on polarization states of single photons. Our setup involves a real-time electrooptical feed-forward loop which allows us to fully harness the benefits of entanglement in discrimination of quantum measurements. The experimental data clearly demonstrate the advantage of entanglement-based discrimination strategy as compared to unentangled single-qubit probes.

arXiv:1408.0940•Physical Review A•Aug 15, 2014•10 citations

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

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
Abstract We address the issue of the discrimination between two-qubit amplitude damping channels by exploring several strategies. For the single-shot, we show that the excited state does not always give the optimal input, and that side entanglement assistance has limited benefit. On the contrary, feedback assistance from the environment is more beneficial. For the two-shot, we prove the in-utility of entangled inputs. Then focusing on individual (local) measurements, we find the optimal adaptive strategy.
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.
We analyze minimum-error discrimination of two qubit dynamical processes generated by phase-covariant amplitude-damping Lindbladians in a single-use scenario. The optimization involves both the input probe, possibly entangled with an isolated ancilla, and the interrogation time. For unassisted probes we obtain a closed expression for the optimal trace-norm distinguishability at fixed time, with distinct interior and boundary branches. For entanglement-assisted probes, the common phase covariance of the two channels reduces the diamond-norm optimization to a one-parameter Schmidt family. The resulting formula gives transparent sufficient conditions for fixed-time entanglement advantage and separates this local advantage from advantage after global optimization over time. We exhibit examples in which the best unassisted strategy is approached only asymptotically, whereas an entangled probe achieves a strictly smaller error probability at finite time.
We investigate optimal discrimination between two projective single-qubit measurements in a scenario where the measurement can be performed only once. We consider general setting involving a tunable fraction of inconclusive outcomes and we prove that the optimal discrimination strategy requires an entangled probe state for any nonzero rate of inconclusive outcomes. We experimentally implement this optimal discrimination strategy for projective measurements on polarization states of single photons. Our setup involves a real-time electrooptical feed-forward loop which allows us to fully harness the benefits of entanglement in discrimination of quantum measurements. The experimental data clearly demonstrate the advantage of entanglement-based discrimination strategy as compared to unentangled single-qubit probes.
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.
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.