Unlimited quantum correlation advantage from bound entanglement

• URL: http://arxiv.org/abs/2504.06395v1
• Date: Tue, 08 Apr 2025 19:35:14 GMT
• Title: Unlimited quantum correlation advantage from bound entanglement
• Authors: Armin Tavakoli, Carles Roch i Carceller, Lucas Tendick, Tamás Vértesi,
• Abstract summary: Entangled states that cannot be distilled to maximal entanglement are called bound entangled.<n>We show that bound entangled states, when deployed as resources between two senders who communicate with a receiver, can generate correlation advantages of unlimited magnitude.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Entangled states that cannot be distilled to maximal entanglement are called bound entangled and they are often viewed as too weak to break the limitations of classical models. Here, we show a strongly contrasting result: that bound entangled states, when deployed as resources between two senders who communicate with a receiver, can generate correlation advantages of unlimited magnitude. The proof is based on using many copies of a bound entangled state to assist quantum communication. We show that in order to simulate the correlations predicted by bound entanglement, one requires in the many-copy limit either an entanglement visibility that tends to zero or a diverging amount of overhead communication. This capability of bound entanglement is unlocked by only using elementary single-qubit operations. The result shows that bound entanglement can be a scalable resource for breaking the limitations of physical models without access to entanglement.

Related papers

• Quantile Multi-Armed Bandits with 1-bit Feedback [40.22079522118723]
  We study a variant of best-arm identification involving elements of risk sensitivity and communication constraints.<n>We propose an algorithm that utilizes noisy binary search as a subroutine, allowing the learner to estimate quantile rewards through 1-bit feedback.
  arXiv  Detail & Related papers  (2025-02-10T17:03:33Z)
• Kochen-Specker for many qubits and the classical limit [55.2480439325792]
  It is shown that quantum and classical predictions converge as the number of qubits is increases to the macroscopic scale.<n>This way to explain the classical limit concurs with, and improves, a result previously reported for GHZ states.
  arXiv  Detail & Related papers  (2024-11-26T22:30:58Z)
• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• A computational test of quantum contextuality, and even simpler proofs of quantumness [43.25018099464869]
  We show that an arbitrary contextuality game can be compiled into an operational "test of contextuality" involving a single quantum device. Our work can be seen as using cryptography to enforce spatial separation within subsystems of a single quantum device.
  arXiv  Detail & Related papers  (2024-05-10T19:30:23Z)
• Two instances of random access code in the quantum regime [0.09545101073027092]
  We consider two classes of quantum generalisations of Random Access Code (RAC) First class is based on a random access code with quantum inputs and output known as No-Signalling Quantum RAC (NS-QRAC) Second class is based on a random access code with a quantum channel and shared entanglement.
  arXiv  Detail & Related papers  (2022-08-30T17:43:37Z)
• Computable lower bounds on the entanglement cost of quantum channels [8.37609145576126]
  A class of lower bounds for the entanglement cost of any quantum state was recently introduced in [arXiv:2111.02438]. Here we extend their definitions to point-to-point quantum channels, establishing a lower bound for the quantum entanglement cost of any channel. This leads to a bound that is computable as a semidefinite program and that can outperform previously known lower bounds.
  arXiv  Detail & Related papers  (2022-01-23T13:05:36Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Solving Multi-Arm Bandit Using a Few Bits of Communication [42.13277217013971]
  Multi-armed bandit (MAB) problem is an active learning framework that aims to select the best among a set of actions by sequentially observing rewards. We address the communication problem by optimizing the communication of rewards collected by distributed agents. We establish a generic reward quantization algorithm, QuBan, that can be applied on top of any (no-regret) MAB algorithm to form a new communication-efficient counterpart.
  arXiv  Detail & Related papers  (2021-11-11T06:23:16Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Information Causality without concatenation [0.5043455303941253]
  Information Causality is a physical principle which states that the amount of randomly accessible data over a classical communication channel cannot exceed its capacity. We show that concatenation can be successfully replaced by limits on the communication channel capacity.
  arXiv  Detail & Related papers  (2021-01-29T18:05:40Z)
• On Query-to-Communication Lifting for Adversary Bounds [14.567067583556714]
  We show that the classical adversary bound lifts to a lower bound on randomized communication complexity with a constant-sized gadget. We also show that the positive-weight quantum adversary is never larger than the square of the approximate degree.
  arXiv  Detail & Related papers  (2020-12-07T02:10:37Z)
• Lowering Helstrom Bound with non-standard coherent states [0.3441021278275805]
  We study and compare quantum limits for states which generalize the Glauber-Sudarshan coherent states. We show that the Helstrom bound can be significantly lowered and even vanish in specific regimes.
  arXiv  Detail & Related papers  (2020-10-01T01:51:58Z)

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.