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:1909.00926 · International Journal of Quantum Information

Entanglement enhanced distinguishability of coherence-breaking channels

Long-Mei Yang, Tao Li, Shao-Ming Fei, Zhi‐Xi Wang

Published Jun 1, 2019• 1 citation
arXivHTMLPDF

Abstract

Originating from the superposition principle in quantum mechanics, coherence has been extensively studied as a kind of important resource in quantum information processing. We investigate the distinguishability of coherence-breaking channels with the help of quantum entanglement. By explicitly computing the minimal error probability of channel discrimination, it is shown that entanglement can enhance the capacity of coherence-breaking channel distinguishability with same types for some cases while it cannot be enhanced for some other cases. For coherence-breaking channels with different types, the channel distinguishability cannot be enhanced via entanglement.

DOI
10.1142/s0219749919500369

Related papers

Coherent Quantum Channel Discrimination

Mark M. Wilde

This paper introduces coherent quantum channel discrimination as a coherent version of conventional quantum channel discrimination. Coherent channel discrimination is phrased here as a quantum interactive proof system between a verifier and a prover, wherein the goal of the prover is to distinguish two channels called in superposition in order to distill a Bell state at the end. The key measure considered here is the success probability of distilling a Bell state, and I prove that this success probability does not increase under the action of a quantum super-channel, thus establishing this measure as a fundamental measure of channel distinguishability. Also, I establish some bounds on this success probability in terms of the success probability of conventional channel discrimination. Finally, I provide an explicit semi-definite program that can compute the success probability.

Civil War Book Review•Jun 1, 2020•8 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

Coherent Quantum Channel Discrimination

Mark M. Wilde

This paper introduces coherent quantum channel discrimination as a coherent version of conventional quantum channel discrimination. Coherent channel discrimination is phrased here as a quantum interactive proof system between a verifier and a prover, wherein the goal of the prover is to distinguish two channels called in superposition in order to distill a Bell state at the end. The key measure considered here is the success probability of distilling a Bell state, and I prove that this success probability does not increase under the action of a quantum super-channel, thus establishing this measure as a fundamental measure of channel distinguishability. Also, I establish some bounds on this success probability in terms of the success probability of conventional channel discrimination. Finally, I provide an explicit semi-definite program that can compute the success probability.

arXiv:2001.02668•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2020•9 citations

Resource theory of asymmetric distinguishability for quantum channels

Xin Wang, Mark M. Wilde

The authors propose that distinguishability is a resource that can be quantified and manipulated, similar to energy or entanglement. This take allows to solve problems that were previously unsolved in quantum channel discrimination. Their approach leads to a mathematical formula for the asymptotic rate at which two different quantum channels can be discriminated, when they are called many times and processed in the most general way allowed by quantum mechanics.

arXiv:1907.06306•Physical Review Research•Dec 11, 2019•97 citations

Entanglement can enhance the distinguishability of entanglement-breaking channels

Massimiliano Federico Sacchi

We show the rather counterintuitive result that entangled input states can strictly enhance the distinguishability of two entanglement-breaking channels.

arXiv:quant-ph/0505174•Physical Review A•Jul 15, 2005•131 citations

Quantum communication in a superposition of causal orders

Sina Salek, Daniel Ebler, Giulio Chiribella

Quantum mechanics allows for situations where the relative order between two processes is entangled with a quantum degree of freedom. Here we show that such entanglement can enhance the ability to transmit quantum information over noisy communication channels. We consider two completely dephasing channels, which in normal conditions are unable to transmit any quantum information. We show that, when the two channels are traversed in an indefinite order, a quantum bit sent through them has a 25% probability to reach the receiver without any error. For partially dephasing channels, a similar advantage takes place deterministically: the amount of quantum information that can travel through two channels in a superposition of orders can be larger than the amount of quantum information that can travel through each channel individually.

arXiv:1809.06655•Sep 18, 2018•109 citations
Originating from the superposition principle in quantum mechanics, coherence has been extensively studied as a kind of important resource in quantum information processing. We investigate the distinguishability of coherence-breaking channels with the help of quantum entanglement. By explicitly computing the minimal error probability of channel discrimination, it is shown that entanglement can enhance the capacity of coherence-breaking channel distinguishability with same types for some cases while it cannot be enhanced for some other cases. For coherence-breaking channels with different types, the channel distinguishability cannot be enhanced via entanglement.
This paper introduces coherent quantum channel discrimination as a coherent version of conventional quantum channel discrimination. Coherent channel discrimination is phrased here as a quantum interactive proof system between a verifier and a prover, wherein the goal of the prover is to distinguish two channels called in superposition in order to distill a Bell state at the end. The key measure considered here is the success probability of distilling a Bell state, and I prove that this success probability does not increase under the action of a quantum super-channel, thus establishing this measure as a fundamental measure of channel distinguishability. Also, I establish some bounds on this success probability in terms of the success probability of conventional channel discrimination. Finally, I provide an explicit semi-definite program that can compute the success probability.
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.
This paper introduces coherent quantum channel discrimination as a coherent version of conventional quantum channel discrimination. Coherent channel discrimination is phrased here as a quantum interactive proof system between a verifier and a prover, wherein the goal of the prover is to distinguish two channels called in superposition in order to distill a Bell state at the end. The key measure considered here is the success probability of distilling a Bell state, and I prove that this success probability does not increase under the action of a quantum super-channel, thus establishing this measure as a fundamental measure of channel distinguishability. Also, I establish some bounds on this success probability in terms of the success probability of conventional channel discrimination. Finally, I provide an explicit semi-definite program that can compute the success probability.
Quantum mechanics allows for situations where the relative order between two processes is entangled with a quantum degree of freedom. Here we show that such entanglement can enhance the ability to transmit quantum information over noisy communication channels. We consider two completely dephasing channels, which in normal conditions are unable to transmit any quantum information. We show that, when the two channels are traversed in an indefinite order, a quantum bit sent through them has a 25% probability to reach the receiver without any error. For partially dephasing channels, a similar advantage takes place deterministically: the amount of quantum information that can travel through two channels in a superposition of orders can be larger than the amount of quantum information that can travel through each channel individually.