Extending quantum correlations to arbitrary distances via parallel repetition of routed Bell tests

• URL: http://arxiv.org/abs/2504.17621v1
• Date: Thu, 24 Apr 2025 14:44:41 GMT
• Title: Extending quantum correlations to arbitrary distances via parallel repetition of routed Bell tests
• Authors: Anubhav Chaturvedi, Marcin Pawłowski, Máté Farkas,
• Abstract summary: Applications such as Device-Independent Quantum Key Distribution (DIQKD) require loophole-free certification of long-distance quantum correlations.<n>We consider parallel repetitions of the recently proposed routed Bell experiments, where transmissions from the source are actively directed either to a nearby or a distant measurement device.<n>We analytically show that the threshold detection efficiency of the distant device--needed to certify non-jointly-measurable measurements--decreases exponentially, optimally, and robustly, following $eta*=1/2N$, with the number $N$ of parallel repetitions.
• Score: 1.3654846342364308
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Applications such as Device-Independent Quantum Key Distribution (DIQKD) require loophole-free certification of long-distance quantum correlations. However, these distances remain severely constrained by detector inefficiencies and unavoidable transmission losses. To overcome this challenge, we consider parallel repetitions of the recently proposed routed Bell experiments, where transmissions from the source are actively directed either to a nearby or a distant measurement device. We analytically show that the threshold detection efficiency of the distant device--needed to certify non-jointly-measurable measurements, a prerequisite of secure DIQKD--decreases exponentially, optimally, and robustly, following $\eta^*=1/2^N$, with the number $N$ of parallel repetitions.

Related papers

• Certification of quantum correlations and DIQKD at arbitrary distances through routed Bell tests [0.0]
  We investigate the recently proposed concept of routed Bell experiments, in which one party can perform measurements either near or far from the source.<n>We prove that routed Bell tests can certify quantum correlations for arbitrary loss on the channel to the distant device, using only entangled qubits.<n>We present a DIQKD protocol for the routed Bell scenario that can operate over arbitrary distances.
  arXiv  Detail & Related papers  (2025-02-17T19:00:01Z)
• Entropy bounds for device-independent quantum key distribution with local Bell test [0.0]
  One of the main challenges in device-independent quantum key distribution (DIQKD) is achieving the required Bell violation over long distances. Recent works have explored the concept of certifying nonlocal correlations over extended distances through the use of a local Bell test. Here, an additional quantum device is placed in close proximity to one party, using short-distance correlations to verify nonlocal behavior at long distances.
  arXiv  Detail & Related papers  (2024-03-31T20:33:40Z)
• Certifying long-range quantum correlations through routed Bell tests [0.0]
  Losses in the transmission channel, which increase with distance, pose a major obstacle to photonics demonstrations of quantum nonlocality. Recently, Chaturvedi, Viola, and Pawlowski introduced a variation of standard Bell experiments with the goal of extending the range over which quantum nonlocality can be demonstrated. In these experiments, which we call 'routed Bell experiments', Bob can route his quantum particle along two possible paths and measure it at two distinct locations.
  arXiv  Detail & Related papers  (2023-10-11T13:30:52Z)
• Circuit Cutting with Non-Maximally Entangled States [59.11160990637615]
  Distributed quantum computing combines the computational power of multiple devices to overcome the limitations of individual devices. circuit cutting techniques enable the distribution of quantum computations through classical communication. Quantum teleportation allows the distribution of quantum computations without an exponential increase in shots. We propose a novel circuit cutting technique that leverages non-maximally entangled qubit pairs.
  arXiv  Detail & Related papers  (2023-06-21T08:03:34Z)
• Semi-device independent nonlocality certification for near-term quantum networks [46.37108901286964]
  Bell tests are the most rigorous method for verifying entanglement in quantum networks. If there is any signaling between the parties, then the violation of Bell inequalities can no longer be used. We propose a semi-device independent protocol that allows us to numerically correct for effects of correlations in experimental probability distributions.
  arXiv  Detail & Related papers  (2023-05-23T14:39:08Z)
• Extending loophole-free nonlocal correlations to arbitrarily large distances [0.2104687387907779]
  We exploit the properties of loophole-free nonlocal correlations to extend them over arbitrarily large distances. We show that the higher the loophole-free nonlocality close to the source, the lower the threshold requirements away from the source.
  arXiv  Detail & Related papers  (2022-11-25T16:44:44Z)
• Surpassing the repeaterless bound with a photon-number encoded measurement-device-independent quantum key distribution protocol [0.4047301375093173]
  We introduce a measurement-device-independent protocol which uses high-dimensional states prepared by two distant trusted parties. We present an experimentally feasible protocol that can be implemented with current technology.
  arXiv  Detail & Related papers  (2022-11-07T10:49:47Z)
• Continuous-variable measurement device independent quantum conferencing with post-selection [0.0]
  We derive the rate of the protocol under a collective pure-loss attack. In the symmetric configuration in which all the parties lie the same distance from the relay, we find a positive key rate over 6 km. Such postselection techniques can be used to improve the rate of multi-party quantum conferencing protocols at longer distances.
  arXiv  Detail & Related papers  (2022-03-28T11:16:57Z)
• 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)
• Path-encoded high-dimensional quantum communication over a 2 km multicore fiber [50.591267188664666]
  We demonstrate the reliable transmission over a 2 km long multicore fiber of path-encoded high-dimensional quantum states. A stable interferometric detection is guaranteed, allowing for low error rates and the generation of 6.3 Mbit/s of secret key rate.
  arXiv  Detail & Related papers  (2021-03-10T11:02:45Z)
• Crosstalk Suppression for Fault-tolerant Quantum Error Correction with Trapped Ions [62.997667081978825]
  We present a study of crosstalk errors in a quantum-computing architecture based on a single string of ions confined by a radio-frequency trap, and manipulated by individually-addressed laser beams. This type of errors affects spectator qubits that, ideally, should remain unaltered during the application of single- and two-qubit quantum gates addressed at a different set of active qubits. We microscopically model crosstalk errors from first principles and present a detailed study showing the importance of using a coherent vs incoherent error modelling and, moreover, discuss strategies to actively suppress this crosstalk at the gate level.
  arXiv  Detail & Related papers  (2020-12-21T14:20:40Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.