Random access Bell game by sequentially measuring the control of the quantum SWITCH
Gaurang Agrawal, Saptarshi Roy

TL;DR
This paper introduces a protocol using the quantum SWITCH and initial entanglement to maintain Bell inequality violations across multiple noisy channels, distinguishing GHZ from W states.
Contribution
It presents a novel protocol leveraging entanglement and sequential measurements with the quantum SWITCH to preserve Bell violations in noisy environments, specifically for GHZ states.
Findings
Bell violation can be guaranteed after many noisy channel applications.
Near-maximal Bell violation can be achieved at any round.
The protocol distinguishes GHZ from W states operationally.
Abstract
Preserving quantum correlations such as Bell nonlocality in noisy environments remains a fundamental challenge for quantum technologies. We introduce the Random Access Bell Game (RABG), a task where an entangled particle propagates through a sequence of identical noisy blocks, and the ability to violate a Bell inequality is tested at a randomly chosen point (access node). We consider a scenario where each noisy block is composed of two complete erasure channels, an extreme entanglement-breaking channel with vanishing quantum and classical capacities. We investigate the performance of the Random Access Bell Game in this configuration and attempt to mitigate the effect of noise by coherently controlling the order of each channel in the noise using the quantum {\tt SWITCH}. However, the quantum {\tt SWITCH} in its canonical setup with a coherent state in the control fails to provide any…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Mechanics and Applications · Quantum Computing Algorithms and Architecture
