Average concurrence and entanglement swapping

• URL: http://arxiv.org/abs/2106.00848v1
• Date: Tue, 1 Jun 2021 23:01:18 GMT
• Title: Average concurrence and entanglement swapping
• Authors: J\'anos A. Bergou, Dov Fields, Mark Hillery, Siddhartha Santra and Vladimir S. Malinovsky
• Abstract summary: We study the role of average concurrence in entanglement swapping in quantum networks. We look at examples of mixed qubit states, and find the relation for pure states gives an upper bound on what is possible with mixed states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study the role of average concurrence in entanglement swapping in quantum networks. We begin with qubit pure states, and there is a very simple rule governing the propagation of average concurrence in multiple swaps. We look at examples of mixed qubit states, and find the relation for pure states gives an upper bound on what is possible with mixed states. We then move on to qudits, where we make use of the I-concurrence. Here the situation is not as simple as for qubits, but in some cases relatively straightforward results can be obtained.

Related papers

• Optimal quantum state tomography with local informationally complete measurements [25.33379738135298]
  We study whether a general MPS/MPDO state can be recovered with bounded errors using only a number of state copies in the number of qubits. We provide a positive answer for a variety of common many-body quantum states, including typical short-range entangled states, random MPS/MPDO states, and thermal states of one-dimensional Hamiltonians.
  arXiv  Detail & Related papers  (2024-08-13T17:58:02Z)
• Multi-partite entanglement monotones [0.0]
  We construct a family of quantifying multipartite entanglement measures that are monotonic under local operations and classical communication. Using these measures we bound the success probability of transforming a given state into another state using local quantum operations and classical communication.
  arXiv  Detail & Related papers  (2024-06-25T10:33:45Z)
• Entanglement and Teleportation in a 1-D Network with Repeaters [2.624902795082451]
  The flow of information as well as the percolation of entanglement in a network between the source and target node is an important area of study. In this article we investigate how the concurrence of the final entangled state is connected with the concurrences of the initial entangled states present in a 1-D chain. These results have tremendous future applications in sending quantum information between two quantum processors in remote entangled distribution.
  arXiv  Detail & Related papers  (2023-06-02T09:53:56Z)
• 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)
• Probabilistic pure state conversion on the majorization lattice [0.0]
  Entanglement is among the most fundamental-and at the same time puzzling-properties of quantum physics. We show that the majorization lattice provides an efficient framework in order to characterize the allowed transformations of pure entangled states.
  arXiv  Detail & Related papers  (2023-03-17T16:10:50Z)
• Entangled States are Harder to Transfer than Product States [0.0]
  The distribution of entangled states is a key task of utmost importance for many quantum information processing protocols. We quantify the difference between the quantum-state transfer fidelity for entangled and factorized states. We find that genuine multipartite entanglement has a more detrimental effect on the fidelity than two-qubit entanglement.
  arXiv  Detail & Related papers  (2023-01-11T12:59:19Z)
• Entanglement swapping and swapped entanglement [5.906364609925367]
  Entanglement swapping is gaining widespread attention due to its application in entanglement distribution among different parts of quantum appliances. We explore the relationship between the entanglement of initial states and the average entanglement of final states in terms of concurrence and negativity. We also discuss how successfully the output state can be used as a channel for the teleportation of an unknown qubit.
  arXiv  Detail & Related papers  (2022-12-07T02:46:02Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Stochastic approximate state conversion for entanglement and general quantum resource theories [41.94295877935867]
  An important problem in any quantum resource theory is to determine how quantum states can be converted into each other. Very few results have been presented on the intermediate regime between probabilistic and approximate transformations. We show that these bounds imply an upper bound on the rates for various classes of states under probabilistic transformations. We also show that the deterministic version of the single copy bounds can be applied for drawing limitations on the manipulation of quantum channels.
  arXiv  Detail & Related papers  (2021-11-24T17:29:43Z)
• Jordan-Wigner transformation and qubits with nontrivial exchange rule [91.3755431537592]
  Well-known (spinless) fermionic qubits may need more subtle consideration in comparison with usual (spinful) fermions. considered method has some relation with construction of super-spaces, but it has some differences with standard definition of supersymmety sometimes used for generalizations of qubit model.
  arXiv  Detail & Related papers  (2021-03-08T09:31: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.