TY - JOUR
T1 - Bounds on quantum correlations in Bell-inequality experiments
AU - Liang, Yeong Cherng
AU - Doherty, Andrew C.
PY - 2007/4/9
Y1 - 2007/4/9
N2 - Bell-inequality violation is one of the most widely known manifestations of entanglement in quantum mechanics; indicating that experiments on physically separated quantum mechanical systems cannot be given a local realistic description. However, despite the importance of Bell inequalities, it is not known in general how to determine whether a given entangled state will violate a Bell inequality. This is because one can choose to make many different measurements on a quantum system to test any given Bell inequality and the optimization over measurements is a high-dimensional variational problem. In order to better understand this problem we present algorithms that provide, for a given quantum state and Bell inequality, both a lower bound and an upper bound on the maximal violation of the inequality. In many cases these bounds determine measurements that would demonstrate violation of the Bell inequality or provide a bound that rules out the possibility of a violation. Both bounds apply techniques from convex optimization and the methodology for creating upper bounds allows them to be systematically improved. Examples are given to illustrate how these algorithms can be used to conclude definitively if some quantum states violate a given Bell inequality.
AB - Bell-inequality violation is one of the most widely known manifestations of entanglement in quantum mechanics; indicating that experiments on physically separated quantum mechanical systems cannot be given a local realistic description. However, despite the importance of Bell inequalities, it is not known in general how to determine whether a given entangled state will violate a Bell inequality. This is because one can choose to make many different measurements on a quantum system to test any given Bell inequality and the optimization over measurements is a high-dimensional variational problem. In order to better understand this problem we present algorithms that provide, for a given quantum state and Bell inequality, both a lower bound and an upper bound on the maximal violation of the inequality. In many cases these bounds determine measurements that would demonstrate violation of the Bell inequality or provide a bound that rules out the possibility of a violation. Both bounds apply techniques from convex optimization and the methodology for creating upper bounds allows them to be systematically improved. Examples are given to illustrate how these algorithms can be used to conclude definitively if some quantum states violate a given Bell inequality.
UR - http://www.scopus.com/inward/record.url?scp=34147129757&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34147129757&partnerID=8YFLogxK
U2 - 10.1103/PhysRevA.75.042103
DO - 10.1103/PhysRevA.75.042103
M3 - Article
AN - SCOPUS:34147129757
SN - 1050-2947
VL - 75
JO - Physical Review A - Atomic, Molecular, and Optical Physics
JF - Physical Review A - Atomic, Molecular, and Optical Physics
IS - 4
M1 - 042103
ER -