Transformations in quantum networks via local operations assisted by finitely many rounds of classical communication

• URL: http://arxiv.org/abs/2105.01090v3
• Date: Sun, 10 Mar 2024 12:00:56 GMT
• Title: Transformations in quantum networks via local operations assisted by finitely many rounds of classical communication
• Authors: Cornelia Spee, Tristan Kraft
• Abstract summary: Recent advances have led towards first prototypes of quantum networks in which entanglement is distributed by sources producing bipartite entangled states. This raises the question of which states can be generated in quantum networks based on bipartite sources using local operations and classical communication. We study state transformations under finite rounds of local operations and classical communication in networks based on maximally entangled two-qubit states.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent advances have led towards first prototypes of quantum networks in which entanglement is distributed by sources producing bipartite entangled states. This raises the question of which states can be generated in quantum networks based on bipartite sources using local operations and classical communication. In this work, we study state transformations under finite rounds of local operations and classical communication (LOCC) in networks based on maximally entangled two-qubit states. We first derive the symmetries for arbitrary network structures, as these determine which transformations are possible. Then, we show that contrary to tree graphs, for which it has already been shown that any state within the same entanglement class can be reached, there exist states which can be reached probabilistically but not deterministically if the network contains a cycle. Furthermore, we provide a systematic way to determine states which are not reachable in networks consisting of a cycle. Moreover, we provide a complete characterization of the states which can be reached in a cycle network with a protocol where each party measures only once, and each step of the protocol results in a deterministic transformation. Finally, we present an example which cannot be reached with such a simple protocol, and constitutes, up to our knowledge, the first example of a LOCC transformation among fully entangled states requiring three rounds of classical communication.

Related papers

• Deterministic multipartite entanglement via fractional state transfer across quantum networks [0.0]
  We propose a fractional quantum state transfer, in which the excitation of an emitter is partially transmitted through the quantum communication channel. We show that genuine multipartite entangled states can be faithfully prepared within current experimental platforms.
  arXiv  Detail & Related papers  (2024-08-02T10:59:16Z)
• Certification of non-classicality in all links of a photonic star network without assuming quantum mechanics [52.95080735625503]
  Full network nonlocality goes beyond standard nonlocality in networks by falsifying any model in which at least one source is classical. We report on the observation of full network nonlocality in a star-shaped network featuring three independent sources of photonic qubits and joint three-qubit entanglement-swapping measurements.
  arXiv  Detail & Related papers  (2022-12-19T19:00:01Z)
• A scheme for multipartite entanglement distribution via separable carriers [68.8204255655161]
  We develop a strategy for entanglement distribution via separable carriers that can be applied to any number of network nodes. We show that our protocol results in multipartite entanglement, while the carrier mediating the process is always in a separable state with respect to the network.
  arXiv  Detail & Related papers  (2022-06-20T10:50:45Z)
• Entanglement and Causal Relation in distributed quantum computation [0.0]
  We investigate two different aspects of entanglement and classical communication in distributed quantum computation (DQC) In the first part, we analyze implementable computation over a given quantum network resource by introducing a new concept, quantum network coding for quantum computation. In the second part, we show that entanglement required for local state discrimination can be substituted by less entanglement by increasing the rounds of classical communication.
  arXiv  Detail & Related papers  (2022-02-14T07:23:17Z)
• Determining ground-state phase diagrams on quantum computers via a generalized application of adiabatic state preparation [61.49303789929307]
  We use a local adiabatic ramp for state preparation to allow us to directly compute ground-state phase diagrams on a quantum computer via time evolution. We are able to calculate an accurate phase diagram on both two and three site systems using IBM quantum machines.
  arXiv  Detail & Related papers  (2021-12-08T23:59:33Z)
• 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)
• Full network nonlocality [68.8204255655161]
  We introduce the concept of full network nonlocality, which describes correlations that necessitate all links in a network to distribute nonlocal resources. We show that the most well-known network Bell test does not witness full network nonlocality. More generally, we point out that established methods for analysing local and theory-independent correlations in networks can be combined in order to deduce sufficient conditions for full network nonlocality.
  arXiv  Detail & Related papers  (2021-05-19T18:00:02Z)
• Classical-quantum network coding: a story about tensor [0.0]
  We study the conditions to perform the distribution of a pure state on a quantum network using quantum operations. We develop a formalism which encompasses both types of distribution protocols.
  arXiv  Detail & Related papers  (2021-04-10T12:05:38Z)
• A Reconfigurable Quantum Local Area Network Over Deployed Fiber [1.1713998235451095]
  We implement flex-grid entanglement distribution in a deployed network for the first time. We quantify the quality of the distributed polarization entanglement via log-negativity. We demonstrate one possible quantum protocol enabled by the distributed entanglement network.
  arXiv  Detail & Related papers  (2021-02-26T17:08:03Z)
• Realization of a multi-node quantum network of remote solid-state qubits [0.45823749779393547]
  We report on the experimental realization of a three-node entanglement-based quantum network. We achieve real-time communication and feed-forward gate operations across the network. We capitalize on the novel capabilities of this network to realize two canonical protocols without post-selection.
  arXiv  Detail & Related papers  (2021-02-08T19:00:03Z)
• Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
  We show how to make quantum networks, both standard and entanglement-based, genuine quantum. We provide them with the possibility of handling superposed tasks and superposed addressing.
  arXiv  Detail & Related papers  (2020-04-30T18:00:06Z)

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.