Composable end-to-end security of Gaussian quantum networks with untrusted relays

• URL: http://arxiv.org/abs/2203.11969v3
• Date: Wed, 20 Jul 2022 08:56:36 GMT
• Title: Composable end-to-end security of Gaussian quantum networks with untrusted relays
• Authors: Masoud Ghalaii and Panagiotis Papanastasiou and Stefano Pirandola
• Abstract summary: We theoretically tackle composable security of arbitrary quantum networks (quantum networks) with generally untrusted nodes. We find that the key rate of a quantum amplifier-assisted chain can ideally beat the fundamental repeaterless limit with practical block sizes.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Gaussian networks are fundamental objects in network information theory. Here many senders and receivers are connected by physically motivated Gaussian channels while auxiliary Gaussian components, such as Gaussian relays, are entailed. Whilst the theoretical backbone of classical Gaussian networks is well established, the quantum analogue is yet immature. Here, we theoretically tackle composable security of arbitrary Gaussian quantum networks (quantum networks), with generally untrusted nodes, in the finite-size regime. We put forward a general methodology for parameter estimation, which is only based on the data shared by the remote end-users. Taking a chain of identical quantum links as an example, we further demonstrate our study. Additionally, we find that the key rate of a quantum amplifier-assisted chain can ideally beat the fundamental repeaterless limit with practical block sizes. However, this objective is practically questioned leading the way to new network/chain designs.

Related papers

• Teleportation fidelity of quantum repeater networks [0.0]
  We show that the average of the maximum teleportation fidelities between all pairs of nodes in a large quantum repeater network is a measure of the resourcefulness of the network as a whole.
  arXiv  Detail & Related papers  (2024-09-30T14:02:58Z)
• Neural network representation of quantum systems [0.0]
  We provide a novel map with which a wide class of quantum mechanical systems can be cast into the form of a neural network. Our findings bring machine learning closer to the quantum world.
  arXiv  Detail & Related papers  (2024-03-18T02:20:22Z)
• Guarantees on the structure of experimental quantum networks [109.08741987555818]
  Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing. As these networks grow in size, certification tools will be required to answer questions regarding their properties. We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
  arXiv  Detail & Related papers  (2024-03-04T19:00:00Z)
• Quantum walk-based protocol for secure communication between any two directly connected nodes on a network [2.501693072047969]
  This work presents an algorithm that generates entanglement between any two directly connected nodes of a quantum network. It paves the way for private inter-node quantum communication channels in the network. We show that after implementation, the probability of the walker being at all nodes other than the source and target is negligible.
  arXiv  Detail & Related papers  (2022-11-23T13:19:41Z)
• Robust Training and Verification of Implicit Neural Networks: A Non-Euclidean Contractive Approach [64.23331120621118]
  This paper proposes a theoretical and computational framework for training and robustness verification of implicit neural networks. We introduce a related embedded network and show that the embedded network can be used to provide an $ell_infty$-norm box over-approximation of the reachable sets of the original network. We apply our algorithms to train implicit neural networks on the MNIST dataset and compare the robustness of our models with the models trained via existing approaches in the literature.
  arXiv  Detail & Related papers  (2022-08-08T03:13:24Z)
• An Evolutionary Pathway for the Quantum Internet Relying on Secure Classical Repeaters [64.48099252278821]
  We conceive quantum networks using secure classical repeaters combined with the quantum secure direct communication principle. In these networks, the ciphertext gleaned from a quantum-resistant algorithm is transmitted using QSDC along the nodes. We have presented the first experimental demonstration of a secure classical repeater based hybrid quantum network.
  arXiv  Detail & Related papers  (2022-02-08T03:24:06Z)
• Strong entanglement distribution of quantum networks [3.6720510088596297]
  Large-scale quantum networks have been employed to overcome practical constraints of transmissions and storage for single entangled systems. We show any connected network consisting of generalized EPR states and GHZ states satisfies strong CKW monogamy inequality in terms of bipartite entanglement measure. We classify entangled quantum networks by distinguishing network configurations under local unitary operations.
  arXiv  Detail & Related papers  (2021-09-27T08:45:18Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• The Hintons in your Neural Network: a Quantum Field Theory View of Deep Learning [84.33745072274942]
  We show how to represent linear and non-linear layers as unitary quantum gates, and interpret the fundamental excitations of the quantum model as particles. On top of opening a new perspective and techniques for studying neural networks, the quantum formulation is well suited for optical quantum computing.
  arXiv  Detail & Related papers  (2021-03-08T17:24:29Z)
• Quantum Network Discrimination [1.9036571490366496]
  We study the discrimination of quantum networks and its fundamental limitations. The simplest quantum network capturers the structure of the problem is given by a quantum superchannel. We discuss achievability, symmetric network, the strong exponent to arbitrary quantum networks and finally an application to an active version of the quantum illumination problem.
  arXiv  Detail & Related papers  (2021-03-03T13:54:24Z)
• Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication [56.678354403278206]
  We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
  arXiv  Detail & Related papers  (2020-03-30T09:25:13Z)

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.