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:2504.14499 · Physical Review A

Limitation of maximally entangled probes for single-shot distinguishability of unitaries

Satyaki Manna, Anandamay Das Bhowmik, Debashis Saha

Published Sep 26, 2025• 5 citations
arXivHTMLPDF

Abstract

There have been many instances where the maximally entangled state as a probe acts better than the product and the nonmaximally entangled states in the task of distinguishing quantum channels. We provide a proof that for the single-shot discrimination of two unitary channels, entangled and product states are operationally equivalent. However, we identify pairs of unitaries that are perfectly distinguishable using a nonmaximally entangled state, but not with a maximally entangled one. This contrast becomes more pronounced when the number of unitaries exceeds two. In every $\text{dimension}\phantom{\rule{0.16em}{0ex}}\ensuremath{\geqslant}3$, we show that there exists a class of unitaries that is indistinguishable under maximally entangled probes, yet perfectly distinguishable using product or nonmaximally entangled inputs. Another interesting set of unitaries in every $\text{dimension}\phantom{\rule{0.16em}{0ex}}\ensuremath{\geqslant}3$ has been presented where only a nonmaximally entangled state acts as a successful probe, while product states and maximally entangled states cannot.

DOI
10.1103/bsxv-q9x7

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

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

Single-shot antidistinguishability of unitary operations

Satyaki Manna, Anandamay Das Bhowmik

The notion of antidistinguishability captures the possibility of ruling out certain alternatives in a quantum experiment without identifying the actual outcome. Although extensively studied for quantum states, the antidistinguishability of quantum channels remains largely unexplored. In this work, we investigate the single-shot antidistinguishability of unitary operations. We analyse two scenarios: antidistinguishability with single-system probes and with entangled probes. For sets of three unitaries, we first prove that all maximally entangled states are equivalent in their performance as probe. In the qubit case, we further establish that maximally entangled probes are always sufficient: if a set of three qubit unitaries is antidistinguishable with either a single-system or non-maximally entangled probe, then it is also antidistinguishable with a maximally entangled one. However, in higher dimension, this equivalence fails. In \textit{dimension 3}, there exists a set of unitaries that are antidistinguishable with non-maximally entangled probe or single-system probe but not with maximally entangled probe. We also establish that union of two antidistinguishable sets of three qubit unitaries also forms a set of antidistinguishable unitaries. Lastly, we provide methods to construct antidistinguishable unitaries from non-antidistinguishable ones.

arXiv:2510.14609•Physical Review A•Jan 29, 2026•5 citations

Distinguishing Maximally Entangled States by PPT Operations and Entanglement Catalysis Discrimination

Nengkun Yu, Runyao Duan, Mingsheng Ying

In order to better understand the class of quantum operations that preserve the positivity of partial transpose (PPT operations) and its relation to the widely used class of local operations and classical communication (LOCC), we study the problem of distinguishing orthogonal maximally entangled states (MES) by PPT operations. Firstly, we outline a rather simple proof to show that the number of $d\otimes d$ PPT distinguishable MES is at most $d$, which slightly generalizes existing results on this problem. Secondly, we construct 4 MES in $4\otimes 4$ state space that cannot be distinguished by PPT operations. Before our work, it was unknown whether there exists $d$ MES in $d\otimes d$ state space that are locally indistinguishable. This example leads us to a novel phenomenon of Entanglement Catalysis Discrimination. Moreover, we find there exists a set of locally indistinguishable states $K$ such that $K^{\otimes m}$ is locally distinguishable for some finite $m$. As an interesting application, we exhibit a quantum channel with one sender and two receivers, whose one-shot zero-error local capacity is not optimal, but multi-use would enhance the capacity to achieve the full output dimension even without entangled input. Finally, we consider the entanglement cost of distinguishing three Bell states and a $2\otimes 2$ entangled basis. In the former case a bipartite pure entangled state with the largest Schmidt coefficient at most 2/3 is necessary and sufficient, while in the latter case an additional Bell state, or one ebit, should be supplied.

•Jul 16, 2011•1 citation

Local Marking of Locally Implementable Unitary Operations

Adil Imam, Satyaki Manna

We investigate the task of local marking for locally implementable unitary operations. In this setting, multipartite quantum unitary channels, chosen randomly from a known set, are distributed among spatially separated parties without revealing their identities. The objective is to correctly identify (mark) the applied process using only local operations supplemented with classical communication (LOCC). While local distinguishability implies local marking, local marking does not guarantee either local or even global distinguishability of a set of unitaries. Thus the task of marking is not equivalent to the task of discrimination. We demonstrate a stronger manifestation of nonlocality without entanglement by constructing a set of globally distinguishable tripartite product unitaries that cannot be locally marked. In contrast to state marking, we find that marking a subset of product unitaries does not imply the ability to mark a larger subset. Finally, we explore the hierarchy of probes-entangled and product-in the context of local marking with respect to the standard discrimination scenario.

quant-pharXiv:2604.08054•Physical Review A•Apr 10, 2026•1 citation

Four Locally Indistinguishable Ququad-Ququad Orthogonal Maximally Entangled States

Nengkun Yu, Runyao Duan, Mingsheng Ying

We explicitly exhibit a set of four ququad-ququad orthogonal maximally entangled states that cannot be perfectly distinguished by means of local operations and classical communication. Before our work, it was unknown whether there is a set of d locally indistinguishable d⊗d orthogonal maximally entangled states for some positive integer d. We further show that a 2⊗2 maximally entangled state can be used to locally distinguish this set of states without being consumed, thus demonstrate a novel phenomenon of entanglement discrimination catalysis. Based on this set of states, we construct a new set K consisting of four locally indistinguishable states such that K(⊗m) (with 4(m) members) is locally distinguishable for some m greater than one. As an immediate application, we construct a noisy quantum channel with one sender and two receivers whose local zero-error classical capacity can achieve the full dimension of the input space but only with a multi-shot protocol.

arXiv:1107.3224•Physical Review Letters•Jul 13, 2012•152 citations
There have been many instances where the maximally entangled state as a probe acts better than the product and the nonmaximally entangled states in the task of distinguishing quantum channels. We provide a proof that for the single-shot discrimination of two unitary channels, entangled and product states are operationally equivalent. However, we identify pairs of unitaries that are perfectly distinguishable using a nonmaximally entangled state, but not with a maximally entangled one. This contrast becomes more pronounced when the number of unitaries exceeds two. In every dimension\ensuremath⩾3\text{dimension}\phantom{\rule{0.16em}{0ex}}\ensuremath{\geqslant}3dimension\ensuremath⩾3, we show that there exists a class of unitaries that is indistinguishable under maximally entangled probes, yet perfectly distinguishable using product or nonmaximally entangled inputs. Another interesting set of unitaries in every dimension\ensuremath⩾3\text{dimension}\phantom{\rule{0.16em}{0ex}}\ensuremath{\geqslant}3dimension\ensuremath⩾3 has been presented where only a nonmaximally entangled state acts as a successful probe, while product states and maximally entangled states cannot.
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.
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.
The notion of antidistinguishability captures the possibility of ruling out certain alternatives in a quantum experiment without identifying the actual outcome. Although extensively studied for quantum states, the antidistinguishability of quantum channels remains largely unexplored. In this work, we investigate the single-shot antidistinguishability of unitary operations. We analyse two scenarios: antidistinguishability with single-system probes and with entangled probes. For sets of three unitaries, we first prove that all maximally entangled states are equivalent in their performance as probe. In the qubit case, we further establish that maximally entangled probes are always sufficient: if a set of three qubit unitaries is antidistinguishable with either a single-system or non-maximally entangled probe, then it is also antidistinguishable with a maximally entangled one. However, in higher dimension, this equivalence fails. In \textit{dimension 3}, there exists a set of unitaries that are antidistinguishable with non-maximally entangled probe or single-system probe but not with maximally entangled probe. We also establish that union of two antidistinguishable sets of three qubit unitaries also forms a set of antidistinguishable unitaries. Lastly, we provide methods to construct antidistinguishable unitaries from non-antidistinguishable ones.
In order to better understand the class of quantum operations that preserve the positivity of partial transpose (PPT operations) and its relation to the widely used class of local operations and classical communication (LOCC), we study the problem of distinguishing orthogonal maximally entangled states (MES) by PPT operations. Firstly, we outline a rather simple proof to show that the number of d⊗dd\otimes dd⊗d PPT distinguishable MES is at most ddd, which slightly generalizes existing results on this problem. Secondly, we construct 4 MES in 4⊗44\otimes 44⊗4 state space that cannot be distinguished by PPT operations. Before our work, it was unknown whether there exists ddd MES in d⊗dd\otimes dd⊗d state space that are locally indistinguishable. This example leads us to a novel phenomenon of Entanglement Catalysis Discrimination. Moreover, we find there exists a set of locally indistinguishable states KKK such that K⊗mK^{\otimes m}K⊗m is locally distinguishable for some finite mmm. As an interesting application, we exhibit a quantum channel with one sender and two receivers, whose one-shot zero-error local capacity is not optimal, but multi-use would enhance the capacity to achieve the full output dimension even without entangled input. Finally, we consider the entanglement cost of distinguishing three Bell states and a 2⊗22\otimes 22⊗2 entangled basis. In the former case a bipartite pure entangled state with the largest Schmidt coefficient at most 2/3 is necessary and sufficient, while in the latter case an additional Bell state, or one ebit, should be supplied.
We investigate the task of local marking for locally implementable unitary operations. In this setting, multipartite quantum unitary channels, chosen randomly from a known set, are distributed among spatially separated parties without revealing their identities. The objective is to correctly identify (mark) the applied process using only local operations supplemented with classical communication (LOCC). While local distinguishability implies local marking, local marking does not guarantee either local or even global distinguishability of a set of unitaries. Thus the task of marking is not equivalent to the task of discrimination. We demonstrate a stronger manifestation of nonlocality without entanglement by constructing a set of globally distinguishable tripartite product unitaries that cannot be locally marked. In contrast to state marking, we find that marking a subset of product unitaries does not imply the ability to mark a larger subset. Finally, we explore the hierarchy of probes-entangled and product-in the context of local marking with respect to the standard discrimination scenario.
We explicitly exhibit a set of four ququad-ququad orthogonal maximally entangled states that cannot be perfectly distinguished by means of local operations and classical communication. Before our work, it was unknown whether there is a set of d locally indistinguishable d⊗d orthogonal maximally entangled states for some positive integer d. We further show that a 2⊗2 maximally entangled state can be used to locally distinguish this set of states without being consumed, thus demonstrate a novel phenomenon of entanglement discrimination catalysis. Based on this set of states, we construct a new set K consisting of four locally indistinguishable states such that K(⊗m) (with 4(m) members) is locally distinguishable for some m greater than one. As an immediate application, we construct a noisy quantum channel with one sender and two receivers whose local zero-error classical capacity can achieve the full dimension of the input space but only with a multi-shot protocol.