Entanglement in quantum channel discrimination: sometimes less is more

• URL: http://arxiv.org/abs/2605.31519v1
• Date: Fri, 29 May 2026 16:36:17 GMT
• Title: Entanglement in quantum channel discrimination: sometimes less is more
• Abstract summary: Entanglement is a powerful resource that improves performance in various quantum information and computational tasks.<n>We show that excessive entanglement can reduce channel discriminability dramatically.
• Score: 0.5729426778193399
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Entanglement cost of bipartite quantum channel discrimination under positive partial transpose operations [7.065586557684262]
  We study the class of $k$-injectable positive-partial-transpose (PPT) testers, which constitutes a numerically tractable relaxation of the practically relevant class of LOCC testers.<n>For every $k$, we derive a semidefinite program (SDP) for the optimal success probability, which in turn yields an efficiently computable one-shot entanglement cost.
  arXiv  Detail & Related papers  (2026-03-12T16:31:33Z)
• Adversarial Hypothesis Testing for Quantum Channels [57.214837874007856]
  We study adversarial hypothesis testing for quantum-quantum (QQ) and classical-quantum (CQ) channels.<n>For QQ channels with i.i.d. inputs, Bob's knowledge of the input significantly enhances distinguishability.<n>For CQ channels, Bob being informed provides a consistent advantage over the corresponding entanglement-breaking channels for both i.i.d. and general inputs.
  arXiv  Detail & Related papers  (2026-01-15T10:04:10Z)
• Optimizing entanglement distribution via noisy quantum channels [44.99833362998488]
  Entanglement distribution is a crucial problem in quantum information science.<n>We investigate strategies for distributing quantum entanglement between two distant parties through noisy quantum channels.
  arXiv  Detail & Related papers  (2025-06-06T13:48:20Z)
• Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels [49.126395046088014]
  This work shows that the existence of a DI code in the quantum setting follows from a suitable packing in a modified space of output quantum states.<n>This result enables us to tighten the capacity lower bound for DI over quantum channels beyond the simultaneous decoding approach.
  arXiv  Detail & Related papers  (2025-04-29T17:57:36Z)
• Characterising memory in quantum channel discrimination via constrained separability problems [4.007882727805384]
  Quantum memories are a crucial precondition in many protocols for processing quantum information. We characterise the quality of channel discrimination protocols when the quantum memory is limited. This insight allows to systematically characterise quantum and classical memories in adaptive channel discrimination protocols.
  arXiv  Detail & Related papers  (2024-11-12T19:00:02Z)
• Zero-entropy encoders and simultaneous decoders in identification via quantum channels [49.126395046088014]
  We show that all four combinations (pure/mixed encoder, simultaneous/general decoder) have a double-exponentially growing code size. We show that the simultaneous identification capacity of a quantum channel equals the simultaneous identification capacity with pure state encodings.
  arXiv  Detail & Related papers  (2024-02-14T11:59:23Z)
• The Multiple-Access Channel with Entangled Transmitters [67.92544792239086]
  Communication over a classical multiple-access channel (MAC) with entanglement resources is considered.<n>We establish inner and outer bounds on the capacity region for the general MAC with entangled transmitters.<n>Using superdense coding, entanglement can double the conferencing rate.
  arXiv  Detail & Related papers  (2023-03-18T16:51:08Z)
• Composite Classical and Quantum Channel Discrimination [9.877005520976846]
  We study the problem of binary composite channel discrimination in the asymmetric setting, where the hypotheses are given by fairly arbitrary sets of channels.<n>We show that there can be an advantage to channel discrimination strategies with composite hypotheses for classical channels, unlike in general general simple hypotheses.
  arXiv  Detail & Related papers  (2023-03-03T15:31:38Z)
• Usefulness of adaptive strategies in asymptotic quantum channel discrimination [43.7637825272776]
  We investigate the usefulness of adaptive methods in the framework of binary hypothesis testing. There is a fundamental distinction between adaptive and non-adaptive strategies with respect to the channel uses. We show that adaptive strategies with classical feedback do not increase the discrimination power of the channel beyond non-adaptive product input strategies.
  arXiv  Detail & Related papers  (2020-11-12T18:40:47Z)
• Idler-Free Multi-Channel Discrimination via Multipartite Probe States [0.0]
  Multi-channel discrimination creates a scenario in which the discrimination of multiple quantum channels can be equated to the idea of pattern recognition. We develop general classes of unassisted multi-channel discrimination protocols which are not assisted by idler modes. Our findings uncover the existence of strongly quantum advantageous, idler-free protocols for the discrimination of bosonic loss and environmental noise.
  arXiv  Detail & Related papers  (2020-10-23T12:35:15Z)
• Unambiguous discrimination of Fermionic states through local operations and classical communication [68.8204255655161]
  The paper studies unambiguous discrimination of Fermionic states through local operations and classical communication (LOCC) We show that it is not always possible to distinguish two Fermionic states through LOCC unambiguously with the same success probability as if global measurements were allowed.
  arXiv  Detail & Related papers  (2020-09-11T21:08:52Z)
• Ultimate limits for multiple quantum channel discrimination [0.966840768820136]
  This paper studies the problem of hypothesis testing with quantum channels. We establish a lower limit for the ultimate error probability affecting the discrimination of an arbitrary number of quantum channels. We also show that this lower bound is achievable when the channels have certain symmetries.
  arXiv  Detail & Related papers  (2020-07-29T03:08:48Z)
• Fermionic state discrimination by local operations and classical communication [68.8204255655161]
  Local operations and classical communication (LOCC) discrimination between two bipartite pure states of fermionic systems is studied. We show that, contrary to the case of quantum systems, for fermionic systems it is generally not possible to achieve the ideal state discrimination performances.
  arXiv  Detail & Related papers  (2020-02-24T12:25:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.