Separable states improve protocols with finite randomness
It is known from Bellʼs theorem that quantum predictions for some entangled states cannot be mimicked using local hidden variable (LHV) models. From a computer science perspective, LHV models may be interpreted as classical computers operating on a potentially infinite number of correlated bits orig...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2014
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/100196 http://hdl.handle.net/10220/24092 |
| _version_ | 1811676667646574592 |
|---|---|
| author | Bobby, Tan Kok Chuan Paterek, Tomasz |
| author2 | School of Physical and Mathematical Sciences |
| author_facet | School of Physical and Mathematical Sciences Bobby, Tan Kok Chuan Paterek, Tomasz |
| author_sort | Bobby, Tan Kok Chuan |
| collection | NTU |
| description | It is known from Bellʼs theorem that quantum predictions for some entangled states cannot be mimicked using local hidden variable (LHV) models. From a computer science perspective, LHV models may be interpreted as classical computers operating on a potentially infinite number of correlated bits originating from a common source. As such, Bell inequality violations achieved through entangled states are able to characterize the quantum advantage of certain tasks, so long as the task itself imposes no restriction on the availability of correlated bits. However, if the number of shared bits is limited, additional constraints are placed on the possible LHV models, and separable, i.e. disentangled states may become a useful resource. Bell violations are therefore no longer necessary to achieve a quantum advantage. Here we show that, in particular, separable states improve the so-called random access codes, which is a class of communication problem wherein one party tries to read a portion of the data held by another distant party in the presence of finite shared randomness and limited classical communication. We also show how the bias of classical bits can be used to avoid wrong answers in order to achieve the optimal classical protocol and how the advantage of quantum protocols is linked to quantum discord. |
| first_indexed | 2024-10-01T02:25:07Z |
| format | Journal Article |
| id | ntu-10356/100196 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T02:25:07Z |
| publishDate | 2014 |
| record_format | dspace |
| spelling | ntu-10356/1001962023-02-28T19:38:08Z Separable states improve protocols with finite randomness Bobby, Tan Kok Chuan Paterek, Tomasz School of Physical and Mathematical Sciences DRNTU::Science::Physics::Atomic physics::Quantum theory It is known from Bellʼs theorem that quantum predictions for some entangled states cannot be mimicked using local hidden variable (LHV) models. From a computer science perspective, LHV models may be interpreted as classical computers operating on a potentially infinite number of correlated bits originating from a common source. As such, Bell inequality violations achieved through entangled states are able to characterize the quantum advantage of certain tasks, so long as the task itself imposes no restriction on the availability of correlated bits. However, if the number of shared bits is limited, additional constraints are placed on the possible LHV models, and separable, i.e. disentangled states may become a useful resource. Bell violations are therefore no longer necessary to achieve a quantum advantage. Here we show that, in particular, separable states improve the so-called random access codes, which is a class of communication problem wherein one party tries to read a portion of the data held by another distant party in the presence of finite shared randomness and limited classical communication. We also show how the bias of classical bits can be used to avoid wrong answers in order to achieve the optimal classical protocol and how the advantage of quantum protocols is linked to quantum discord. Published version 2014-10-21T06:24:26Z 2019-12-06T20:18:16Z 2014-10-21T06:24:26Z 2019-12-06T20:18:16Z 2014 2014 Journal Article Bobby, T. K. C., & Paterek, T. (2014). Separable states improve protocols with finite randomness. New journal of physics, 16(9), 093063-. 1367-2630 https://hdl.handle.net/10356/100196 http://hdl.handle.net/10220/24092 10.1088/1367-2630/16/9/093063 en New journal of physics © 2014 IOP Publishing Ltd and Deutsche Physikalische Gesellschaft. This paper was published in New Journal of Physics and is made available as an electronic reprint (preprint) with permission of IOP Publishing Ltd and Deutsche Physikalische Gesellschaft. The paper can be found at the following official DOI: [http://dx.doi.org/10.1088/1367-2630/16/9/093063]. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law. application/pdf |
| spellingShingle | DRNTU::Science::Physics::Atomic physics::Quantum theory Bobby, Tan Kok Chuan Paterek, Tomasz Separable states improve protocols with finite randomness |
| title | Separable states improve protocols with finite randomness |
| title_full | Separable states improve protocols with finite randomness |
| title_fullStr | Separable states improve protocols with finite randomness |
| title_full_unstemmed | Separable states improve protocols with finite randomness |
| title_short | Separable states improve protocols with finite randomness |
| title_sort | separable states improve protocols with finite randomness |
| topic | DRNTU::Science::Physics::Atomic physics::Quantum theory |
| url | https://hdl.handle.net/10356/100196 http://hdl.handle.net/10220/24092 |
| work_keys_str_mv | AT bobbytankokchuan separablestatesimproveprotocolswithfiniterandomness AT paterektomasz separablestatesimproveprotocolswithfiniterandomness |