Distributing bipartite quantum systems under timing constraints

• URL: http://arxiv.org/abs/2011.00936v2
• Date: Wed, 10 Feb 2021 17:56:29 GMT
• Title: Distributing bipartite quantum systems under timing constraints
• Authors: Kfir Dolev, Alex May, Kianna Wan
• Abstract summary: We study how bipartite states may be distributed in the context of a quantum network limited by timing constraints. This builds on earlier work on summoning single and bipartite systems.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In many quantum information processing protocols, entangled states shared among parties are an important resource. In this article, we study how bipartite states may be distributed in the context of a quantum network limited by timing constraints. We explore various tasks that plausibly arise in this context, and characterize the achievability of several of these in settings where only one-way communication is allowed. We provide partial results in the case where two-way communication is allowed. This builds on earlier work on summoning single and bipartite systems.

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)
• 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)
• Scalable multiparty steering based on a single pair of entangled qubits [0.6553834611557042]
  We show that multiparty loophole-free quantum steering is achievable by constructing a quantum network from a set of qubits of which only one pair is entangled. This work introduces a scalable approach to rigorously verify quantum nonlocality across multiple parties, thus providing a practical tool towards developing the future quantum internet.
  arXiv  Detail & Related papers  (2023-08-04T13:01:51Z)
• Multipartite entanglement theory with entanglement-nonincreasing operations [91.3755431537592]
  We extend the resource theory of entanglement for multipartite systems beyond the standard framework of local operations and classical communication. We demonstrate that in this adjusted framework, the transformation rates between multipartite states are fundamentally dictated by the bipartite entanglement entropies of the respective quantum states.
  arXiv  Detail & Related papers  (2023-05-30T12:53:56Z)
• Resource analysis for quantum-aided Byzantine agreement with the four-qubit singlet state [1.2094859111770522]
  In distributed computing, a Byzantine fault is a condition where a component behaves inconsistently, showing different symptoms to different components of the system. Our work highlights important engineering aspects of the future deployment of quantum communication protocols with multi-qubit entangled states.
  arXiv  Detail & Related papers  (2022-07-11T15:17:58Z)
• 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)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• 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)
• Quantum Conference Key Agreement: A Review [0.0]
  Multipartite key distribution is a cryptographic task where more than two parties wish to establish a common secret key. Here, we review the existing quantum CKA protocols based on multipartite entanglement.
  arXiv  Detail & Related papers  (2020-03-23T11:29:24Z)
• Genuine Network Multipartite Entanglement [62.997667081978825]
  We argue that a source capable of distributing bipartite entanglement can, by itself, generate genuine $k$-partite entangled states for any $k$. We provide analytic and numerical witnesses of genuine network entanglement, and we reinterpret many past quantum experiments as demonstrations of this feature.
  arXiv  Detail & Related papers  (2020-02-07T13:26: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.