{"id":991,"date":"2014-07-01T16:48:47","date_gmt":"2014-07-01T14:48:47","guid":{"rendered":"https:\/\/webs.uab.cat\/giq\/seminar\/unbounded-entanglement-can-be-needed-achieve-optimal-success-probability\/"},"modified":"2014-07-01T16:48:47","modified_gmt":"2014-07-01T14:48:47","slug":"unbounded-entanglement-can-be-needed-achieve-optimal-success-probability","status":"publish","type":"seminar","link":"https:\/\/webs.uab.cat\/giq\/seminar\/unbounded-entanglement-can-be-needed-achieve-optimal-success-probability\/","title":{"rendered":"Unbounded entanglement can be needed to achieve the optimal success probability"},"content":{"rendered":"<p><span style=\"font-family: arial,sans-serif;\">Quantum entanglement is known to provide a strong advantage in many two-party distributed tasks. We investigate the question of how much entanglement is needed to reach optimal performance. For the first time we show that there exists a purely classical scenario for which no finite amount of entanglement suffices. To this end we introduce a simple two-party nonlocal game $H$, inspired by Hardy&#8217;s paradox. In our game each player has only two possible questions and can provide bit strings of any finite length as answer. We exhibit a sequence of strategies which use entangled states in increasing dimension $d$ and succeed with probability $1-O(d^{-c})$ for some $c\\geq 0.13$. On the other hand, we show that any strategy using an entangled state of local dimension $d$ has success probability at most $1-\\Omega(d^{-2})$. In addition, we show that any strategy restricted to producing answers in a set of cardinality at most $d$ has success probability at most $1-\\Omega(d^{-2})$. <\/span><span style=\"font-family: arial,sans-serif;\">(Joint work with Thomas Vidick.)<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Quantum entanglement is known to provide a strong advantage in many two-party distributed tasks. We investigate the question of how much entanglement is needed to reach optimal performance. For the first time we show that there exists a purely classical scenario for which no finite amount of entanglement suffices. To this end we introduce a [&hellip;]<\/p>\n","protected":false},"author":20,"featured_media":0,"template":"","class_list":["post-991","seminar","type-seminar","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/webs.uab.cat\/giq\/wp-json\/wp\/v2\/seminar\/991","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/webs.uab.cat\/giq\/wp-json\/wp\/v2\/seminar"}],"about":[{"href":"https:\/\/webs.uab.cat\/giq\/wp-json\/wp\/v2\/types\/seminar"}],"author":[{"embeddable":true,"href":"https:\/\/webs.uab.cat\/giq\/wp-json\/wp\/v2\/users\/20"}],"wp:attachment":[{"href":"https:\/\/webs.uab.cat\/giq\/wp-json\/wp\/v2\/media?parent=991"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}