Achievable Identification Rates in Noisy Bosonic Broadcast Channels

• URL: http://arxiv.org/abs/2512.01833v1
• Date: Mon, 01 Dec 2025 16:13:53 GMT
• Title: Achievable Identification Rates in Noisy Bosonic Broadcast Channels
• Authors: Zuhra Amiri, Janis Nötzel,
• Abstract summary: This work analyses identification over noisy bosonic broadcast channels using coherent states.<n>We derive achievable identification rate regions while ensuring error probabilities remain bounded, even in an infinite-dimensional setting.
• Score: 3.0468273116892752
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Identification in quantum communication enables receivers to verify the presence of a message without decoding its entire content. While identification capacity has been explored for classical and finite-dimensional quantum channels, its behaviour in bosonic systems remains less understood. This work analyses identification over noisy bosonic broadcast channels using coherent states. We derive achievable identification rate regions while ensuring error probabilities remain bounded, even in an infinite-dimensional setting. Our approach leverages quantum hypothesis testing and approximates the infinite sender alphabet with discrete subsets to maintain power constraints.

Related papers

• Robustness of quantum data hiding against entangled catalysts and memory [47.791962198275066]
  We develop a general framework for state discrimination that unifies catalytic and memory-assisted local discrimination protocols.<n>We prove that when the hiding states are separable, neither entangled catalysts nor quantum memory can increase the optimal discrimination probability.<n>In contrast, for some entangled states, a reusable quantum memory turns locally indistinguishable states into ones that can be discriminated almost perfectly.
  arXiv  Detail & Related papers  (2025-11-06T14:36:36Z)
• 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)
• Quantum communication and fault-tolerance [0.0]
  We are interested in the limits of quantum communication with and without entanglement.<n>In particular, we are interested in the case where the sender and the receiver share quantum entanglement.
  arXiv  Detail & Related papers  (2024-12-30T06:18:44Z)
• Enhancing Quantum State Discrimination with Indefinite Causal Order [3.368751927358015]
  We study a noisy discrimination scenario using a protocol based on indefinite causal order. We find that, for certain channels and ensembles, the guessing probability can be significantly improved.
  arXiv  Detail & Related papers  (2024-06-27T17:51:46Z)
• 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)
• Orthogonality Broadcasting and Quantum Position Verification [3.549868541921029]
  We introduce the study of "orthogonality broadcasting"<n>We provide a new method for establishing error bounds in the no pre-shared entanglement model.<n>Our key technical contribution is an uncertainty relation that uses the geometric relation of the states that undergo broadcasting rather than the non-commutative aspect of the final measurements.
  arXiv  Detail & Related papers  (2023-11-01T17:37:20Z)
• 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)
• Semantic Security with Infinite Dimensional Quantum Eavesdropping Channel [1.5070870469725095]
  We propose a new proof method for direct coding theorems for wiretap channels.<n>The method yields errors that decay exponentially with increasing block lengths.<n>It provides a guarantee of a quantum version of semantic security.
  arXiv  Detail & Related papers  (2022-05-16T13:25:56Z)
• Identification Over Quantum Broadcast Channels [19.465727478912072]
  The decoder only identifies whether a message of his choosing was sent or not. An achievable identification region is derived for a quantum broadcast channel. Results are demonstrated for the quantum erasure broadcast channel, where our region is suboptimal, but improves on the best previously known bounds.
  arXiv  Detail & Related papers  (2022-01-26T17:00:03Z)
• 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)
• Quantum Channel State Masking [78.7611537027573]
  Communication over a quantum channel that depends on a quantum state is considered when the encoder has channel side information (CSI) and is required to mask information on the quantum channel state from the decoder. A full characterization is established for the entanglement-assisted masking equivocation region, and a regularized formula is given for the quantum capacity-leakage function without assistance.
  arXiv  Detail & Related papers  (2020-06-10T16:18:03Z)

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.