Entanglement cost of bipartite quantum channel discrimination under positive partial transpose operations

• URL: http://arxiv.org/abs/2603.12130v1
• Date: Thu, 12 Mar 2026 16:31:33 GMT
• Title: Entanglement cost of bipartite quantum channel discrimination under positive partial transpose operations
• Abstract summary: 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.
• Score: 7.065586557684262
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum channel discrimination is a fundamental task in quantum information processing. In the one-shot regime, discrimination between two candidate channels is characterized by the diamond norm. Beyond this basic setting, however, many scenarios in distributed quantum information processing remain unresolved, motivating notions of distinguishability that capture the power of the available resources. In this work, we formulate a theory of testers for bipartite channel discrimination, leading to the concept of the entanglement cost of bipartite channel discrimination: the minimum Schmidt rank $k$ of a shared maximally entangled state required for local protocols to achieve the globally optimal success probability. We introduce $k$-injectable testers as a tester-based description of entanglement-assisted local discrimination and, in particular, 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. For every $k$, we derive a semidefinite program (SDP) for the optimal success probability, which in turn yields an efficiently computable one-shot PPT entanglement cost. To render these optimization problems numerically feasible, we prove a symmetry-reduction principle for covariant channel pairs, thereby reducing the effective dimension of the associated SDPs. Finally, by dualizing the SDP, we derive bounds on the composite channel-discrimination problem and illustrate our framework with proof-of-principle examples based on the depolarizing channel, the depolarized SWAP channel, and the Werner--Holevo channels.

Related papers

• DUET: Decentralized Bilevel Optimization without Lower-Level Strong Convexity [77.51981761667302]
  We introduce a new single-loop DBO algorithm called diminishing quadratically-regularized bilevel decentralized optimization (DUET)<n>DUET eliminates the need for LLSC by introducing a diminishing quadratic regularization to the lower-level (LL) objective.<n>To the best of our knowledge, this is the first work to tackle DBO without LLSC under decentralized settings with data heterogeneity.
  arXiv  Detail & Related papers  (2026-06-19T06:45:13Z)
• Stratified Sampling for Quasi-Probability Decompositions [0.0]
  Quasi-probability decompositions (QPDs) have proven essential in many quantum algorithms and protocols.<n>We develop a broad framework for accounting for and reducing this variance.<n> Numerical simulations of typical QPDs demonstrate constant-factor reductions in overall variance.
  arXiv  Detail & Related papers  (2026-02-11T17:46:40Z)
• EconProver: Towards More Economical Test-Time Scaling for Automated Theorem Proving [64.15371139980802]
  Large Language Models (LLMs) have recently advanced the field of Automated Theorem Proving (ATP)<n>We show that different test-time scaling strategies for ATP models introduce significant computational overhead for inference.<n>We propose two complementary methods that can be integrated into a unified EconRL pipeline for amplified benefits.
  arXiv  Detail & Related papers  (2025-09-16T03:00:13Z)
• 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)
• Adversarial quantum channel discrimination [11.59751616011475]
  We show that in asymmetric hypothesis testing, the optimal type-II error exponent is precisely characterized by the minimum output channel divergence.<n>This serves as a direct analog of the quantum Stein's lemma in the adversarial channel discrimination.
  arXiv  Detail & Related papers  (2025-06-03T16:39:01Z)
• Resolvability of classical-quantum channels [54.825573549226924]
  We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and form the fixed independent and identically distributed (i.i.d.) input. For the fixed-input setting, while the direct part follows from the known quantum soft covering result, we exploit the recent alternative quantum Sanov theorem to solve the strong converse.
  arXiv  Detail & Related papers  (2024-10-22T05:18:43Z)
• Preference-Based Multi-Agent Reinforcement Learning: Data Coverage and Algorithmic Techniques [65.55451717632317]
  We study Preference-Based Multi-Agent Reinforcement Learning (PbMARL)<n>We identify the Nash equilibrium from a preference-only offline dataset in general-sum games.<n>Our findings underscore the multifaceted approach required for PbMARL.
  arXiv  Detail & Related papers  (2024-09-01T13:14:41Z)
• Bi-discriminator Domain Adversarial Neural Networks with Class-Level Gradient Alignment [87.8301166955305]
  We propose a novel bi-discriminator domain adversarial neural network with class-level gradient alignment. BACG resorts to gradient signals and second-order probability estimation for better alignment of domain distributions. In addition, inspired by contrastive learning, we develop a memory bank-based variant, i.e. Fast-BACG, which can greatly shorten the training process.
  arXiv  Detail & Related papers  (2023-10-21T09:53:17Z)
• Deterministic Entanglement Transmission on Series-Parallel Quantum Networks [2.86989372262348]
  This paper explores and amplifies a new and more effective mapping of QN, referred to as concurrence percolation theory (ConPT) We implement ConPT via a novel deterministic entanglement transmission scheme that is fully analogous to resistor network analysis. The DET is designed for general d-dimensional information carriers, scalable and adaptable for any series-parallel QN, and experimentally feasible as tested on IBM's quantum platform.
  arXiv  Detail & Related papers  (2021-10-11T03:29:03Z)
• Learning to Perform Downlink Channel Estimation in Massive MIMO Systems [72.76968022465469]
  We study downlink (DL) channel estimation in a Massive multiple-input multiple-output (MIMO) system. A common approach is to use the mean value as the estimate, motivated by channel hardening. We propose two novel estimation methods.
  arXiv  Detail & Related papers  (2021-09-06T13:42:32Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)
• Bounds on amplitude damping channel discrimination [0.0]
  adaptivity has been shown to improve the performance of discrimination protocols. We present a tighter lower bound on the achievable trace norm between protocol outputs. The upper and lower bounds are compared with existing bounds and then applied to quantum hacking and biological quantum sensing scenarios.
  arXiv  Detail & Related papers  (2020-09-10T11:35:47Z)
• From Information Theory Puzzles in Deletion Channels to Deniability in Quantum Cryptography [0.0]
  We first conjecture on the basis of experimental data that the entropy of the posterior is minimized by the constant strings. We then establish a connection between covert communication and deniability to propose DC-QKE. We present an efficient coercion-resistant and quantum-secure voting scheme, based on fully homomorphic encryption.
  arXiv  Detail & Related papers  (2020-03-25T22:20:47Z)

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.