Efficiently Computable Limits on EPR Pair Generation in Quantum Broadcast Channels

• URL: http://arxiv.org/abs/2505.07218v1
• Date: Mon, 12 May 2025 04:15:21 GMT
• Title: Efficiently Computable Limits on EPR Pair Generation in Quantum Broadcast Channels
• Authors: Patrick Hayden, Debbie Leung, Hjalmar Rall, Farzin Salek,
• Abstract summary: We investigate the generation of EPR pairs between three observers in a general causally structured setting.<n>The most general quantum codes for this setup take the form of tripartite quantum channels.
• Score: 3.637365301757111
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We investigate the generation of EPR pairs between three observers in a general causally structured setting, where communication occurs via a noisy quantum broadcast channel. The most general quantum codes for this setup take the form of tripartite quantum channels. Since the receivers are constrained by causal ordering, additional temporal relationships naturally emerge between the parties. These causal constraints enforce intrinsic no-signalling conditions on any tripartite operation, ensuring that it constitutes a physically realizable quantum code for a quantum broadcast channel. We analyze these constraints and, more broadly, characterize the most general quantum codes for communication over such channels. We examine the capabilities of codes that are fully no-signalling among the three parties, positive partial transpose (PPT)-preserving, or both, and derive simple semidefinite programs to compute the achievable entanglement fidelity. We then establish a hierarchy of semidefinite programming converse bounds -- both weak and strong -- for the capacity of quantum broadcast channels for EPR pair generation, in both one-shot and asymptotic regimes. Notably, in the special case of a point-to-point channel, our strong converse bound recovers and strengthens existing results. Finally, we demonstrate how the PPT-preserving codes we develop can be leveraged to construct PPT-preserving entanglement combing schemes, and vice versa.

Related papers

• Quantum repeaters based on stationary and flying Gottesman-Kitaev-Preskill qudits [0.0]
  We explore a quantum repeater scheme that employs quantum error correction (QEC) both on the flying (light) qubits and on the stationary (matter) qubits.<n>The idea is to combine the benefits of encoded one-way and two-way schemes where effective channel transmission and loss scaling are enhanced.
  arXiv  Detail & Related papers  (2025-08-01T11:12:39Z)
• Quantum Hypothesis Testing Lemma for Deterministic Identification over Quantum Channels [49.126395046088014]
  We show 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)
• Capacities of Entanglement Distribution From a Central Source [8.576752529284692]
  Distribution of entanglement is an essential task in quantum information processing and the realization of quantum networks. We investigate a scenario where a central source prepares an N-partite entangled state and transmits each entangled subsystem to one of N receivers through noisy quantum channels. The receivers are then able to perform local operations assisted by unlimited classical communication to distill target entangled states from the noisy channel output.
  arXiv  Detail & Related papers  (2024-11-07T18:50:51Z)
• Extendibility limits quantum-secured communication and key distillation [4.079147243688764]
  We study the task of secret-key distillation from bipartite states and point-to-point quantum channels. We extend our formalism to private communication over a quantum channel assisted by forward classical communication.
  arXiv  Detail & Related papers  (2024-10-28T18:00:11Z)
• Classical communication cost of a bipartite quantum channel assisted by non-signalling correlations [6.1108095842541]
  This paper investigates the bidirectional communication cost of a bipartite quantum channel assisted by non-signalling correlations.<n>By introducing non-signalling superchannels, we present lower and upper bounds on the one-shot $epsilon$-assisted one-way classical communication cost.
  arXiv  Detail & Related papers  (2024-08-05T14:30:50Z)
• Unextendible entanglement of quantum channels [4.079147243688764]
  We study the ability of quantum channels to perform quantum communication tasks. A quantum channel can distill a highly entangled state between two parties. We generalize the formalism of $k$-extendibility to bipartite superchannels.
  arXiv  Detail & Related papers  (2024-07-22T18:00:17Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Commitment capacity of classical-quantum channels [70.51146080031752]
  We define various notions of commitment capacity for classical-quantum channels. We prove matching upper and lower bound on it in terms of the conditional entropy.
  arXiv  Detail & Related papers  (2022-01-17T10:41:50Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Coherent control and distinguishability of quantum channels via PBS-diagrams [59.94347858883343]
  We introduce a graphical language for coherent control of general quantum channels inspired by practical quantum optical setups involving polarising beam splitters (PBS) We characterise the observational equivalence of purified channels in various coherent-control contexts, paving the way towards a faithful representation of quantum channels under coherent control.
  arXiv  Detail & Related papers  (2021-03-02T22:56:25Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Environment-assisted bosonic quantum communications [0.0]
  We consider a quantum relay which is used by two parties to perform several continuous-variable protocols of quantum communication. In the worst case scenario where bipartite entanglement is completely lost at the relay, we show that the various protocols can be reactivated by the assistance of classical (separable) correlations in the environment. Our findings are confirmed by a proof-of-principle experiment where we show, for the first time, that memory effects in the environment can drastically enhance the performance of a quantum relay.
  arXiv  Detail & Related papers  (2020-03-20T12:58:44Z)

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.