scholarly journals Symmetrized persistency of Bell correlations for Dicke states and GHZ-based mixtures

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Marcin Wieśniak
Keyword(s):  
Communication Complexity ◽  
Quantum Communication ◽  
Bell Inequality ◽  
Bell Inequalities ◽  
Quantum Correlations ◽  
Complexity Reduction ◽  
Main Difficulty ◽  
Quantum Communication Complexity ◽  
Number Of Particles ◽  
Dicke States

AbstractQuantum correlations, in particular those, which enable to violate a Bell inequality, open a way to advantage in certain communication tasks. However, the main difficulty in harnessing quantumness is its fragility to, e.g, noise or loss of particles. We study the persistency of Bell correlations of GHZ based mixtures and Dicke states. For the former, we consider quantum communication complexity reduction (QCCR) scheme, and propose new Bell inequalities (BIs), which can be used in that scheme for higher persistency in the limit of large number of particles N. In case of Dicke states, we show that persistency can reach 0.482N, significantly more than reported in previous studies.

scholarly journals Symmetrized persistency of Bell correlations for Dicke states and GHZ-based mixtures: Studying the limits of monogamy

2021 ◽  
Author(s):  
Marcin Wieśniak
Keyword(s):  
Communication Complexity ◽  
Quantum Communication ◽  
Bell Inequality ◽  
Bell Inequalities ◽  
Quantum Correlations ◽  
Complexity Reduction ◽  
Main Difficulty ◽  
Quantum Communication Complexity ◽  
Number Of Particles ◽  
Dicke States

Abstract Quantum correlations, in particular those, which enable to violate a Bell inequality 1 , open a way to advantage in certain communication tasks. However, the main difficulty in harnessing quantumness is its fragility to, e.g, noise or loss of particles. We study the persistency of Bell correlations of GHZ based mixtures and Dicke states. For the former, we consider quantum communication complexity reduction (QCCR) scheme, and propose new Bell inequalities (BIs), which can be used in that scheme for higher persistency in the limit of large number of particles N. In case of Dicke states, we show that persistency can reach 0.482N, significantly more than reported in previous studies.

scholarly journals Quantum communication complexity advantage implies violation of a Bell inequality

2016 ◽  
Vol 113 (12) ◽  
pp. 3191-3196 ◽  
Author(s):  
Harry Buhrman ◽  
Łukasz Czekaj ◽  
Andrzej Grudka ◽  
Michał Horodecki ◽  
Paweł Horodecki ◽  
...  
Keyword(s):  
Communication Complexity ◽  
Quantum Communication ◽  
Bell Inequality ◽  
Main Tool ◽  
Classical Communication ◽  
Quantum Communication Complexity ◽  
Bell Nonlocality ◽  
Large Quantum ◽  
General Connection ◽  
Inputs And Outputs

We obtain a general connection between a large quantum advantage in communication complexity and Bell nonlocality. We show that given any protocol offering a sufficiently large quantum advantage in communication complexity, there exists a way of obtaining measurement statistics that violate some Bell inequality. Our main tool is port-based teleportation. If the gap between quantum and classical communication complexity can grow arbitrarily large, the ratio of the quantum value to the classical value of the Bell quantity becomes unbounded with the increase in the number of inputs and outputs.

scholarly journals Does violation of a Bell inequality always imply quantum advantage in a communication complexity problem?

Quantum ◽  
2020 ◽  
Vol 4 ◽  
pp. 316 ◽  
Author(s):  
Armin Tavakoli ◽  
Marek Żukowski ◽  
Časlav Brukner
Keyword(s):  
Communication Complexity ◽  
Bell Inequality ◽  
Bell Inequalities ◽  
Quantum Correlations ◽  
Fixed Number ◽  
Communication Strategy ◽  
Small Quantum ◽  
Complexity Problem ◽  
Classical Models ◽  
Quantum Protocol

Quantum correlations which violate a Bell inequality are presumed to power better-than-classical protocols for solving communication complexity problems (CCPs). How general is this statement? We show that violations of correlation-type Bell inequalities allow advantages in CCPs, when communication protocols are tailored to emulate the Bell no-signaling constraint (by not communicating measurement settings). Abandonment of this restriction on classical models allows us to disprove the main result of, inter alia, \cite{BZ02}; we show that quantum correlations obtained from these communication strategies assisted by a small quantum violation of the CGLMP Bell inequalities do not imply advantages in any CCP in the input/output scenario considered in the reference. More generally, we show that there exists quantum correlations, with nontrivial local marginal probabilities, which violate the I3322 Bell inequality, but do not enable a quantum advantange in any CCP, regardless of the communication strategy employed in the quantum protocol, for a scenario with a fixed number of inputs and outputs

scholarly journals Robust Bell inequalities from communication complexity

Quantum ◽  
2018 ◽  
Vol 2 ◽  
pp. 72 ◽  
Author(s):  
Sophie Laplante ◽  
Mathieu Laurière ◽  
Alexandre Nolin ◽  
Jérémie Roland ◽  
Gabriel Senno
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Communication Complexity ◽  
Bell Inequality ◽  
Bell Inequalities ◽  
Local Distribution ◽  
Classical Communication ◽  
Quantum Communication Complexity ◽  
Complexity Lower Bounds ◽  
Quantum Distributions

The question of how large Bell inequality violations can be, for quantum distributions, has been the object of much work in the past several years. We say that a Bell inequality is normalized if its absolute value does not exceed 1 for any classical (i.e. local) distribution. Upper and (almost) tight lower bounds have been given for the quantum violation of these Bell inequalities in terms of number of outputs of the distribution, number of inputs, and the dimension of the shared quantum states. In this work, we revisit normalized Bell inequalities together with another family: inefficiency-resistant Bell inequalities. To be inefficiency-resistant, the Bell value must not exceed 1 for any local distribution, including those that can abort. This makes the Bell inequality resistant to the detection loophole, while a normalized Bell inequality is resistant to general local noise. Both these families of Bell inequalities are closely related to communication complexity lower bounds. We show how to derive large violations from any gap between classical and quantum communication complexity, provided the lower bound on classical communication is proven using these lower bound techniques. This leads to inefficiency-resistant violations that can be exponential in the size of the inputs. Finally, we study resistance to noise and inefficiency for these Bell inequalities.

scholarly journals Monogamy of non-local quantum correlations

2008 ◽  
Vol 465 (2101) ◽  
pp. 59-69 ◽  
Author(s):  
Ben Toner
Keyword(s):  
Probability Distributions ◽  
Bell Inequality ◽  
Arbitrary Dimension ◽  
Bell Inequalities ◽  
Quantum Correlations ◽  
Interactive Proof ◽  
Proof Systems ◽  
Non Local ◽  
A New Technique ◽  
Tsirelson Bound

We describe a new technique for obtaining Tsirelson bounds, which are upper bounds on the quantum value of a Bell inequality. Since quantum correlations do not allow signalling, we obtain a Tsirelson bound by maximizing over all no-signalling probability distributions. This maximization can be cast as a linear programme. In a setting where three parties, A, B and C, share an entangled quantum state of arbitrary dimension, we (i) bound the trade-off between AB's and AC's violation of the Clauser–Horne–Shimony–Holt inequality and (ii) demonstrate that forcing B and C to be classically correlated prevents A and B from violating certain Bell inequalities, relevant for interactive proof systems and cryptography.

Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography

2009 ◽  
Vol 38 (5) ◽  
pp. 1695-1708 ◽  
Author(s):  
Dmitry Gavinsky ◽  
Julia Kempe ◽  
Iordanis Kerenidis ◽  
Ran Raz ◽  
Ronald de Wolf
Keyword(s):  
Communication Complexity ◽  
Quantum Communication ◽  
Exponential Separation ◽  
Quantum Communication Complexity
Sign in / Sign up

Export Citation Format

Share Document