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
2011 ◽  
Vol 11 (7&8) ◽  
pp. 574-591
Author(s):  
Ashley Montanaro

We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. The problem is a natural generalisation of the previously studied Subgroup Membership problem: Alice receives a bit string $x$, Bob receives a permutation matrix $M$, and their task is to determine whether $Mx=x$ or $Mx$ is far from $x$. The proof uses Fourier analysis and an inequality of Kahn, Kalai and Linial.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Marcin Wieśniak

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.


2017 ◽  
Vol 95 (2) ◽  
Author(s):  
Armin Tavakoli ◽  
Marcin Pawłowski ◽  
Marek Żukowski ◽  
Mohamed Bourennane

1999 ◽  
Vol 60 (4) ◽  
pp. 2737-2741 ◽  
Author(s):  
Harry Buhrman ◽  
Wim van Dam ◽  
Peter Høyer ◽  
Alain Tapp

Sign in / Sign up

Export Citation Format

Share Document