Sequentially witnessing entanglement by independent observer pairs

• URL: http://arxiv.org/abs/2311.10347v1
• Date: Fri, 17 Nov 2023 06:31:15 GMT
• Title: Sequentially witnessing entanglement by independent observer pairs
• Authors: Mao-Sheng Li and Yan-Ling Wang
• Abstract summary: The aim is to maximize the number of observer pairs $(A_k,B_l)$ that can witness entanglement. Prior research has demonstrated that arbitrary pairs $(A_k, B_k)$ ($kleq n$) can observe entanglement in all pure entangled states and a specific class of mixed entangled states. A novel strategy is presented, enabling every pair of arbitrarily many Alices and Bobs to witness entanglement regardless of the initial state being a Bell state or a particular class of mixed entangled states.
• Score: 2.1991772588394825
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This study investigates measurement strategies in a scenario where multiple pairs of Alices and Bobs independently and sequentially observe entangled states. The aim is to maximize the number of observer pairs $(A_k,B_l)$ that can witness entanglement. Prior research has demonstrated that arbitrary pairs $(A_k, B_k)$ ($k\leq n$) can observe entanglement in all pure entangled states and a specific class of mixed entangled states [Phys. Rev. A 106 032419 (2022)]. However, it should be noted that other pairs $(A_k, B_l)$ with $(k\neq l \leq n)$ may not observe entanglement using the same strategy. Moreover, a novel strategy is presented, enabling every pair of arbitrarily many Alices and Bobs to witness entanglement regardless of the initial state being a Bell state or a particular class of mixed entangled states. These findings contribute to understanding measurement strategies for maximizing entanglement observation in various contexts.

Related papers

• An Exponential Reduction in Training Data Sizes for Machine Learning Derived Entanglement Witnesses [45.17332714965704]
  We propose a support vector machine (SVM) based approach for generating an entanglement witness. For $N$ qubits, the SVM portion of this approach requires only $O(6N)$ training states, whereas an existing method needs $O(24N)$.
  arXiv  Detail & Related papers  (2023-11-30T00:45:04Z)
• Parameterized multipartite entanglement measures [2.4172837625375]
  We present two types of entanglement measures in $n$-partite systems, $q$-$k$-ME concurrence $(qgeq2,2leq kleq n)$ and $alpha$-$k$-ME concurrence $(0leqalphaleqfrac12,2leq kleq n)$. Rigorous proofs show that the proposed $k$-nonseparable measures satisfy all the requirements for being an entanglement measure.
  arXiv  Detail & Related papers  (2023-08-31T01:58:47Z)
• Limits on sequential sharing of nonlocal advantage of quantum coherence [13.46516066673]
  We show how many observers can share the nonlocal advantage of quantum coherence (NAQC) in a $(dtimes d)$-dimensional state. Results may shed light on the interplay between nonlocal correlations and quantum measurements on high-dimensional systems.
  arXiv  Detail & Related papers  (2022-01-31T07:08:13Z)
• Recycled entanglement detection by arbitrarily many sequential and independent pairs of observers [0.0]
  We investigate the witnessing of two-qubit entangled states by sequential and independent pairs of observers. We find that a two-qubit entangled state can be used to witness entanglement arbitrarily many times.
  arXiv  Detail & Related papers  (2022-01-07T18:37:49Z)
• Generalized $n$-locality inequalities in star-network configuration and their optimal quantum violations [0.0]
  We propose a non-trivial generalization of $n$-locality scenario in star-network configuration. We derive a family of generalized $n$-locality inequalities for any arbitrary $m$. We argue that for $m>3$, a single copy of a two-qubit entangled state may not be enough to exhibit the violation of $n$-locality inequality.
  arXiv  Detail & Related papers  (2021-12-29T15:13:43Z)
• Partitioning dysprosium's electronic spin to reveal entanglement in non-classical states [55.41644538483948]
  We report on an experimental study of entanglement in dysprosium's electronic spin. Our findings open up the possibility to engineer novel types of entangled atomic ensembles.
  arXiv  Detail & Related papers  (2021-04-29T15:02:22Z)
• Stochastic behavior of outcome of Schur-Weyl duality measurement [45.41082277680607]
  We focus on the measurement defined by the decomposition based on Schur-Weyl duality on $n$ qubits. We derive various types of distribution including a kind of central limit when $n$ goes to infinity.
  arXiv  Detail & Related papers  (2021-04-26T15:03:08Z)
• Improved Sample Complexity for Incremental Autonomous Exploration in MDPs [132.88757893161699]
  We learn the set of $epsilon$-optimal goal-conditioned policies attaining all states that are incrementally reachable within $L$ steps. DisCo is the first algorithm that can return an $epsilon/c_min$-optimal policy for any cost-sensitive shortest-path problem.
  arXiv  Detail & Related papers  (2020-12-29T14:06:09Z)
• Sequential measurements on qubits by multiple observers: Joint best guess strategy [0.0]
  We study sequential state discrimination measurements performed on the same qubit by subsequent observers. The goal of the observers is to maximize their joint probability of successfully guessing the state that the qubit was initially prepared in.
  arXiv  Detail & Related papers  (2020-05-24T04:29:23Z)
• Locally Private Hypothesis Selection [96.06118559817057]
  We output a distribution from $mathcalQ$ whose total variation distance to $p$ is comparable to the best such distribution. We show that the constraint of local differential privacy incurs an exponential increase in cost. Our algorithms result in exponential improvements on the round complexity of previous methods.
  arXiv  Detail & Related papers  (2020-02-21T18:30:48Z)
• Quantum Coupon Collector [62.58209964224025]
  We study how efficiently a $k$-element set $Ssubseteq[n]$ can be learned from a uniform superposition $|Srangle of its elements. We give tight bounds on the number of quantum samples needed for every $k$ and $n$, and we give efficient quantum learning algorithms.
  arXiv  Detail & Related papers  (2020-02-18T16:14:55Z)

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.