Statistical intrusion detection and eavesdropping in quantum channels with coupling: Multiple-preparation and single-preparation methods

• URL: http://arxiv.org/abs/2106.09280v1
• Date: Thu, 17 Jun 2021 07:04:54 GMT
• Title: Statistical intrusion detection and eavesdropping in quantum channels with coupling: Multiple-preparation and single-preparation methods
• Authors: Yannick Deville, Alain Deville, Ali Mansour, Razvan Scripcaru, Cornel Ioana
• Abstract summary: Non-quantum communications include configurations with multiple-input multiple-output (MIMO) channels. Some associated signal processing tasks consider these channels in a symmetric way, i.e. by assigning the same role to all inputs. We here address asymmetric (blind and non-blind) ones, with emphasis on intrusion detection and additional comments about eavesdropping.
• Score: 2.2469167925905777
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Classical, i.e. non-quantum, communications include configurations with multiple-input multiple-output (MIMO) channels. Some associated signal processing tasks consider these channels in a symmetric way, i.e. by assigning the same role to all channel inputs, and similarly to all channel outputs. These tasks especially include channel identification/estimation and channel equalization, tightly connected with source separation. Their most challenging version is the blind one, i.e. when the receivers have (almost) no prior knowledge about the emitted signals. Other signal processing tasks consider classical communication channels in an asymmetric way. This especially includes the situation when data are sent by Emitter 1 to Receiver 1 through a main channel, and an "intruder" (including Receiver 2) interferes with that channel so as to extract information, thus performing so-called eavesdropping, while Receiver 1 may aim at detecting that intrusion. Part of the above processing tasks have been extended to quantum channels, including those that have several quantum bits (qubits) at their input and output. For such quantum channels, beyond previously reported work for symmetric scenarios, we here address asymmetric (blind and non-blind) ones, with emphasis on intrusion detection and additional comments about eavesdropping. To develop fundamental concepts, we first consider channels with exchange coupling as a toy model. We especially use the general quantum information processing framework that we recently developed, to derive new attractive intrusion detection methods based on a single preparation of each state. Finally, we discuss how the proposed methods might be extended, beyond the specific class of channels analyzed here.

Related papers

• 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)
• 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)
• Three-Receiver Quantum Broadcast Channels: Classical Communication with Quantum Non-unique Decoding [44.37825061268399]
  In network communication, there is a hierarchy among receivers based on information they decode due. This hierarchy may result in varied information quality, such as higher-quality video for certain receivers. We explore three-receiver quantum broadcast channels with two- and three-degraded message sets.
  arXiv  Detail & Related papers  (2024-06-14T09:07:53Z)
• Non-Local and Quantum Advantages in Network Coding for Multiple Access Channels [1.6114012813668934]
  We study entanglement-assisted communication over classical network channels. We develop a framework for n-senders and 1-receiver multiple access channels based on nonlocal games.
  arXiv  Detail & Related papers  (2023-04-21T07:54:52Z)
• 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)
• Multi-Channel End-to-End Neural Diarization with Distributed Microphones [53.99406868339701]
  We replace Transformer encoders in EEND with two types of encoders that process a multi-channel input. We also propose a model adaptation method using only single-channel recordings.
  arXiv  Detail & Related papers  (2021-10-10T03:24:03Z)
• Detecting positive quantum capacities of quantum channels [9.054540533394926]
  A noisy quantum channel can be used to reliably transmit quantum information at a non-zero rate. This is because it requires computation of the channel's coherent information for an unbounded number of copies of the channel. We show that a channel's ability to transmit information is intimately connected to the relative sizes of its input, output, and environment spaces.
  arXiv  Detail & Related papers  (2021-05-13T14:26:45Z)
• Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters [78.7611537027573]
  Communication over a quantum broadcast channel with cooperation between the receivers is considered. We develop lower and upper bounds on the capacity region in each setting.
  arXiv  Detail & Related papers  (2020-11-18T11:58:48Z)
• Explicit construction of optimal witnesses for input-output correlations attainable by quantum channels [3.441021278275805]
  We consider the problem of characterizing the set of classical noisy channels that can be obtained from a quantum channel. We consider various classes of linear witnesses and compute their optimum values in closed form for several classes of quantum channels. The witnesses that we consider here are formulated as communication games, in which Alice's aim is to exploit a single use of a given quantum channel to help Bob guess some information she has received from an external referee.
  arXiv  Detail & Related papers  (2020-09-02T07:34:23Z)
• 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)
• DeepSIC: Deep Soft Interference Cancellation for Multiuser MIMO Detection [98.43451011898212]
  In multiuser multiple-input multiple-output (MIMO) setups, where multiple symbols are simultaneously transmitted, accurate symbol detection is challenging. We propose a data-driven implementation of the iterative soft interference cancellation (SIC) algorithm which we refer to as DeepSIC. DeepSIC learns to carry out joint detection from a limited set of training samples without requiring the channel to be linear.
  arXiv  Detail & Related papers  (2020-02-08T18:31:00Z)

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.