The hypothetical nonlocal box (NLB) proposed by Popescu and Rohrlich allows two spatially separated parties, Alice and Bob, to exhibit stronger than quantum correlations. If the generated correlations are weak, they can sometimes be distilled into a stronger correlation by repeated applications of the NLB. Motivated by the limited distillability of NLBs, we initiate here a study of the distillation of correlations for nonlocal boxes that output quantum states rather than classical bits (qNLBs). We propose a new protocol for distillation and show that it asymptotically distills a class of correlated quantum nonlocal boxes to the value 1 2 (3 √ 3 + 1) ≈ 3.098076, whereas in contrast, the optimal non-adaptive parity protocol for classical nonlocal boxes asymptotically distills only to the value 3.0. We show that our protocol is an optimal non-adaptive protocol for 1, 2 and 3 qNLB copies by constructing a matching dual solution for the associated primal semidefinite program (SDP). We conclude that qNLBs are a stronger resource for nonlocality than NLBs. The main premise that develops from this conclusion is that the NLB model is not the strongest resource to investigate the fundamental principles that limit quantum nonlocality. As such, our work provides strong motivation to reconsider the status quo of the principles that are known to limit nonlocal correlations under the framework of qNLBs rather than NLBs.
Nonlocality distillationConsider two parties, Alice and Bob, spatially separated and isolated, interested in jointly computing some boolean function f (·, ·). A third party, David, provides Alice with an input x (unbeknown to Bob) and Bob with an input y (unbeknown to Alice) and challenges them to compute the bit f (x, y). David allows Alice and Bob to communicate, but charges for each and every bit communicated between them. Alice and Bob therefore pre-agree upon a protocol that minimizes the amount of communication required for them to compute the bit f (x, y). This is what we know as communication complexity [25].It seems entirely impossible to jointly compute a non-trivial function if no information can be interchanged between Alice and Bob, and it is indeed one of the first results typically shown in any introduction to communication complexity. But as soon as one tweaks the models ever so slightly, surprising results are possible. The nonlocal box is one such tweaking.A nonlocal box (NLB) is a device shared between two parties that, in itself is incapable of transferring any information from Alice to Bob, or vice-versa. A nonlocal box takes two bits as input, a bit x from Alice and a bit y from Bob, and outputs two bits, a bit a provided to Alice (and only Alice) and a bit b provided to Bob (and only Bob). If the two input bits x and y from Alice and Bob equal (0, 0), (0, 1), or (1, 0), the box (by definition) provides Alice and Bob with identical bits. That is, either both of them receive 0 or both of them receive 1, each case happening with probability 1 2 . If the two parties both give the box ...