On the computational complexity of detecting possibilistic locality
| Publication Date: |
2018-03-06
|
|---|---|
| Publisher: |
Oxford University Press
|
| Print ISSN: |
0955-792X
|
| Electronic ISSN: |
1465-363X
|
| Topics: |
Computer Science
Mathematics
|
| Published by: |
| _version_ | 1836398824779677696 |
|---|---|
| autor | Simmons A. |
| beschreibung | The proofs of quantum nonlocality due to Greenberger, Horne and Zeilinger and due to Hardy are qualitatively different from that of Bell insofar as they rely only on a consideration of whether events are possible or impossible, rather than relying on specific experimental probabilities. We consider the scenario of a bipartite nonlocality experiment, in which two separated experimenters each have access to some measurements they can perform on a system. In a physical theory, some outcomes of this experiment will be labelled possible, others impossible, and an assignment of the values 0 (impossible) and 1 (possible) to these different outcomes forms a table of possibilities . Here, we consider the computational task of determining whether or not a given table of possibilities constitutes a departure from possibilistic local realism. By considering the case in which one party has access to measurements with two outcomes and the other three, it is possible to see at exactly which point this task becomes computationally difficult. |
| citation_standardnr | 6189610 |
| datenlieferant | ipn_articles |
| feed_id | 3629 |
| feed_publisher | Oxford University Press |
| feed_publisher_url | http://global.oup.com/ |
| insertion_date | 2018-03-06 |
| journaleissn | 1465-363X |
| journalissn | 0955-792X |
| publikationsjahr_anzeige | 2018 |
| publikationsjahr_facette | 2018 |
| publikationsjahr_intervall | 7984:2015-2019 |
| publikationsjahr_sort | 2018 |
| publisher | Oxford University Press |
| quelle | Journal of Logic and Computation |
| relation | https://academic.oup.com/logcom/article/28/1/203/4807376?rss=1 |
| search_space | articles |
| shingle_author_1 | Simmons A. |
| shingle_author_2 | Simmons A. |
| shingle_author_3 | Simmons A. |
| shingle_author_4 | Simmons A. |
| shingle_catch_all_1 | On the computational complexity of detecting possibilistic locality The proofs of quantum nonlocality due to Greenberger, Horne and Zeilinger and due to Hardy are qualitatively different from that of Bell insofar as they rely only on a consideration of whether events are possible or impossible, rather than relying on specific experimental probabilities. We consider the scenario of a bipartite nonlocality experiment, in which two separated experimenters each have access to some measurements they can perform on a system. In a physical theory, some outcomes of this experiment will be labelled possible, others impossible, and an assignment of the values 0 (impossible) and 1 (possible) to these different outcomes forms a table of possibilities . Here, we consider the computational task of determining whether or not a given table of possibilities constitutes a departure from possibilistic local realism. By considering the case in which one party has access to measurements with two outcomes and the other three, it is possible to see at exactly which point this task becomes computationally difficult. Simmons A. Oxford University Press 0955-792X 0955792X 1465-363X 1465363X |
| shingle_catch_all_2 | On the computational complexity of detecting possibilistic locality The proofs of quantum nonlocality due to Greenberger, Horne and Zeilinger and due to Hardy are qualitatively different from that of Bell insofar as they rely only on a consideration of whether events are possible or impossible, rather than relying on specific experimental probabilities. We consider the scenario of a bipartite nonlocality experiment, in which two separated experimenters each have access to some measurements they can perform on a system. In a physical theory, some outcomes of this experiment will be labelled possible, others impossible, and an assignment of the values 0 (impossible) and 1 (possible) to these different outcomes forms a table of possibilities . Here, we consider the computational task of determining whether or not a given table of possibilities constitutes a departure from possibilistic local realism. By considering the case in which one party has access to measurements with two outcomes and the other three, it is possible to see at exactly which point this task becomes computationally difficult. Simmons A. Oxford University Press 0955-792X 0955792X 1465-363X 1465363X |
| shingle_catch_all_3 | On the computational complexity of detecting possibilistic locality The proofs of quantum nonlocality due to Greenberger, Horne and Zeilinger and due to Hardy are qualitatively different from that of Bell insofar as they rely only on a consideration of whether events are possible or impossible, rather than relying on specific experimental probabilities. We consider the scenario of a bipartite nonlocality experiment, in which two separated experimenters each have access to some measurements they can perform on a system. In a physical theory, some outcomes of this experiment will be labelled possible, others impossible, and an assignment of the values 0 (impossible) and 1 (possible) to these different outcomes forms a table of possibilities . Here, we consider the computational task of determining whether or not a given table of possibilities constitutes a departure from possibilistic local realism. By considering the case in which one party has access to measurements with two outcomes and the other three, it is possible to see at exactly which point this task becomes computationally difficult. Simmons A. Oxford University Press 0955-792X 0955792X 1465-363X 1465363X |
| shingle_catch_all_4 | On the computational complexity of detecting possibilistic locality The proofs of quantum nonlocality due to Greenberger, Horne and Zeilinger and due to Hardy are qualitatively different from that of Bell insofar as they rely only on a consideration of whether events are possible or impossible, rather than relying on specific experimental probabilities. We consider the scenario of a bipartite nonlocality experiment, in which two separated experimenters each have access to some measurements they can perform on a system. In a physical theory, some outcomes of this experiment will be labelled possible, others impossible, and an assignment of the values 0 (impossible) and 1 (possible) to these different outcomes forms a table of possibilities . Here, we consider the computational task of determining whether or not a given table of possibilities constitutes a departure from possibilistic local realism. By considering the case in which one party has access to measurements with two outcomes and the other three, it is possible to see at exactly which point this task becomes computationally difficult. Simmons A. Oxford University Press 0955-792X 0955792X 1465-363X 1465363X |
| shingle_title_1 | On the computational complexity of detecting possibilistic locality |
| shingle_title_2 | On the computational complexity of detecting possibilistic locality |
| shingle_title_3 | On the computational complexity of detecting possibilistic locality |
| shingle_title_4 | On the computational complexity of detecting possibilistic locality |
| timestamp | 2025-06-30T23:33:13.675Z |
| titel | On the computational complexity of detecting possibilistic locality |
| titel_suche | On the computational complexity of detecting possibilistic locality |
| topic | SQ-SU SA-SP |
| uid | ipn_articles_6189610 |