Arbitrarily many independent observers can share the nonlocality of a single maximally entangled qubit pair

• URL: http://arxiv.org/abs/2003.12105v2
• Date: Wed, 26 Aug 2020 19:19:20 GMT
• Title: Arbitrarily many independent observers can share the nonlocality of a single maximally entangled qubit pair
• Authors: Peter J. Brown and Roger Colbeck
• Abstract summary: We show that arbitrarily many independent Bobs can have an expected CHSH violation with the single Alice. Our work represents a step towards an eventual understanding of the limitations on how much device-independent randomness can be robustly generated from a single pair of qubits.
• Score: 4.061135251278187
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Alice and Bob each have half of a pair of entangled qubits. Bob measures his half and then passes his qubit to a second Bob who measures again and so on. The goal is to maximize the number of Bobs that can have an expected violation of the Clauser-Horne-Shimony-Holt (CHSH) Bell inequality with the single Alice. This scenario was introduced in [Phys. Rev. Lett. 114, 250401 (2015)] where the authors mentioned evidence that when the Bobs act independently and with unbiased inputs then at most two of them can expect to violate the CHSH inequality with Alice. Here we show that, contrary to this evidence, arbitrarily many independent Bobs can have an expected CHSH violation with the single Alice. Our proof is constructive and our measurement strategies can be generalized to work with a larger class of two-qubit states that includes all pure entangled two-qubit states. Since violation of a Bell inequality is necessary for device-independent tasks, our work represents a step towards an eventual understanding of the limitations on how much device-independent randomness can be robustly generated from a single pair of qubits.

Related papers

• Some consequences of Sica's approach to Bell's inequalities [55.2480439325792]
  Louis Sica derived Bell's inequalities from the hypothesis that the time series of outcomes observed in one station does not change if the setting in the other station is changed. In this paper, Sica's approach is extended to series with non ideal efficiency and to the actual time structure of experimental data.
  arXiv  Detail & Related papers  (2024-03-05T13:59:52Z)
• Quantum advantage in a unified scenario and secure detection of resources [55.2480439325792]
  We consider a single task to study different approaches of having quantum advantage. We show that the optimal success probability in the overall process for a qubit communication might be higher than that for a cbit communication.
  arXiv  Detail & Related papers  (2023-09-22T23:06:20Z)
• Two quantum algorithms for communication between spacelike separated locations [0.7614628596146599]
  We argue that superluminal communication is possible through state discrimination in a higher-dimensional Hilbert space using ancilla qubits. We propose two quantum algorithms through state discrimantion for communication between two observers Alice and Bob.
  arXiv  Detail & Related papers  (2022-09-16T06:54:22Z)
• Reconciling Individual Probability Forecasts [78.0074061846588]
  We show that two parties who agree on the data cannot disagree on how to model individual probabilities. We conclude that although individual probabilities are unknowable, they are contestable via a computationally and data efficient process.
  arXiv  Detail & Related papers  (2022-09-04T20:20:35Z)
• Sharing tripartite nonlocality sequentially by arbitrarily many independent observers [0.0]
  A tripartite entangled state is shared among Alice, Bob and multiple Charlies. The goal is to maximize the number of Charlies that can observe some kind of nonlocality with the single Alice and Bob.
  arXiv  Detail & Related papers  (2022-07-01T09:44:30Z)
• Quantum cryptography with classical communication: parallel remote state preparation for copy-protection, verification, and more [125.99533416395765]
  Many cryptographic primitives are two-party protocols, where one party, Bob, has full quantum computational capabilities, and the other party, Alice, is only required to send random BB84 states to Bob. We show how such protocols can generically be converted to ones where Alice is fully classical, assuming that Bob cannot efficiently solve the LWE problem. This means that all communication between (classical) Alice and (quantum) Bob is classical, yet they can still make use of cryptographic primitives that would be impossible if both parties were classical.
  arXiv  Detail & Related papers  (2022-01-31T18:56:31Z)
• Entanglement witnessing by arbitrarily many independent observers recycling a local quantum shared state [0.0]
  An observer, Alice, shares a two-qubit state with an arbitrary number of observers, Bobs, via sequentially and independently recycling the qubit in possession of the first Bob. It is known that there exist entangled states which can be used to have an arbitrarily long sequence of Bobs who can violate the Clauser-Horne-Shimony-Holt (CHSH) Bell inequality with the single Alice. We show that there exist entangled states that do not violate the Bell inequality and whose entanglement can be detected by an arbitrary number of Bobs.
  arXiv  Detail & Related papers  (2021-09-21T16:43:00Z)
• Sharing quantum nonlocality and genuine nonlocality with independent observables [0.0]
  We show that arbitrarily many independent observers can share the nonlocality of a single arbitrary dimensional bipartite entangled but not necessary two-qubit entangled state. We also show that at most two Charlies can share the genuine nonlocality of a single generalized GHZ state with an Alice and a Bob.
  arXiv  Detail & Related papers  (2021-03-27T07:52:00Z)
• Bell nonlocality between sequential pairs of observers [0.0]
  We show that it is possible to have arbitrarily long sequences of Alices and Bobs so every (Alice, Bob) pair violates a Bell inequality. We propose an experiment to observe this effect with two Alices and two Bobs.
  arXiv  Detail & Related papers  (2021-03-22T13:39:21Z)
• Sample-efficient proper PAC learning with approximate differential privacy [51.09425023771246]
  We prove that the sample complexity of properly learning a class of Littlestone dimension $d$ with approximate differential privacy is $tilde O(d6)$, ignoring privacy and accuracy parameters. This result answers a question of Bun et al. (FOCS 2020) by improving upon their upper bound of $2O(d)$ on the sample complexity.
  arXiv  Detail & Related papers  (2020-12-07T18:17:46Z)
• Non-Boolean Hidden Variables model reproduces Quantum Mechanics' predictions for Bell's experiment [91.3755431537592]
  Theory aimed to violate Bell's inequalities must start by giving up Boolean logic. "Hard" problem is to predict the time values when single particles are detected. "Soft" problem is to explain the violation of Bell's inequalities within (non-Boolean) Local Realism.
  arXiv  Detail & Related papers  (2020-05-20T21:46:35Z)

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.