On the power of non-local boxes

被引:26
作者
Broadbent, Anne [1 ]
Methot, Andre Allan [1 ]
机构
[1] Univ Montreal, Dept Informat & Rech Operat, Montreal, PQ H3C 3J7, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
quantum information; non-locality; non-local boxes; entanglement; entanglement simulation; pseudo-telepathy;
D O I
10.1016/j.tcs.2005.08.035
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A non-local box is a virtual device that has the following property: given that Alice inputs a bit at her end of the device and that Bob does likewise, it produces two bits, one at Alice's end and one at Bob's end, such that the XOR of the outputs is equal to the AND of the inputs. This box, inspired from the CHSH inequality, was first proposed by Popescu and Rohrlich to examine the question: given that a maximally entangled pair of qubits is non-local, why is it not maximally non-local? We believe that understanding the power of this box will yield insight into the non-locality of quantum mechanics. It was shown recently by Cerf, Gisin, Massar and Popescu, that this imaginary device is able to simulate correlations from any measurement on a singlet state. Here, we show that the non-local box can in fact do much more: through the simulation of the magic square pseudo-telepathy game and the Mermin-GHZ pseudo-telepathy game, we show that the non-local box can simulate quantum correlations that no entangled pair of qubits. can, in a bipartite scenario and even in a multi-party scenario. Finally we show that a single non-local box cannot simulate all quantum correlations and propose a generalization for a multi-party non-local box. In particular, we show quantum correlations whose simulation requires an exponential amount of non-local boxes, in the number of maximally entangled qubit pairs. (C) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:3 / 14
页数:12
相关论文
共 27 条
[1]   Bell's theorem without inequalities and only two distant observers [J].
Aravind, PK .
FOUNDATIONS OF PHYSICS LETTERS, 2002, 15 (04) :397-405
[2]  
Bell JS., 1964, PHYS PHYS FIZIKA, V1, P195, DOI [10.1103/Physics-PhysiqueFizika.1.195, 10.1103/PhysicsPhysiqueFizika.1.195, DOI 10.1103/PHYSICSPHYSIQUEFIZIKA.1.195]
[3]  
Brassard G, 2005, QUANTUM INF COMPUT, V5, P538
[4]  
Brassard G, 2005, QUANTUM INF COMPUT, V5, P275
[5]   Cost of exactly simulating quantum entanglement with classical communication [J].
Brassard, G ;
Cleve, R ;
Tapp, A .
PHYSICAL REVIEW LETTERS, 1999, 83 (09) :1874-1877
[6]  
BRASSARD G, IN PRESS FDN PHYS, V35
[7]  
BRASSARD G, LIMIT NONLOCALITY AN
[8]   Entanglement and non-locality are different resources [J].
Brunner, N ;
Gisin, N ;
Scarani, V .
NEW JOURNAL OF PHYSICS, 2005, 7
[9]   Quantum entanglement and communication complexity [J].
Buhrman, H ;
Cleve, R ;
Van Dam, W .
SIAM JOURNAL ON COMPUTING, 2001, 30 (06) :1829-1841
[10]   Simulating maximal quantum entanglement without communication [J].
Cerf, NJ ;
Gisin, N ;
Massar, S ;
Popescu, S .
PHYSICAL REVIEW LETTERS, 2005, 94 (22)