Nonsignaling Deterministic Models for Nonlocal Correlations have to be Uncomputable

Quantum mechanics postulates random outcomes. However, a model making the same output predictions but in a deterministic manner would be, in principle, experimentally indistinguishable from quantum theory. In this work we consider such models in the context of nonlocality on a device-independent sce...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Bendersky, Ariel Martín, Figueira, Santiago Daniel
Publicado:	2017
Materias:	Parallel processing systems Deterministic mechanism Deterministic models Model-making Nonlocal Nonlocal correlations Nonlocalities Time complexity Upper Bound Quantum theory
Acceso en línea:	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00319007_v118_n13_p_Bendersky http://hdl.handle.net/20.500.12110/paper_00319007_v118_n13_p_Bendersky
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	paper:paper_00319007_v118_n13_p_Bendersky
record_format	dspace
spelling	paper:paper_00319007_v118_n13_p_Bendersky2023-06-08T14:58:20Z Nonsignaling Deterministic Models for Nonlocal Correlations have to be Uncomputable Bendersky, Ariel Martín Figueira, Santiago Daniel Parallel processing systems Deterministic mechanism Deterministic models Model-making Nonlocal Nonlocal correlations Nonlocalities Time complexity Upper Bound Quantum theory Quantum mechanics postulates random outcomes. However, a model making the same output predictions but in a deterministic manner would be, in principle, experimentally indistinguishable from quantum theory. In this work we consider such models in the context of nonlocality on a device-independent scenario. That is, we study pairs of nonlocal boxes that produce their outputs deterministically. It is known that, for these boxes to be nonlocal, at least one of the boxes' outputs has to depend on the other party's input via some kind of hidden signaling. We prove that, if the deterministic mechanism is also algorithmic, there is a protocol that, with the sole knowledge of any upper bound on the time complexity of such an algorithm, extracts that hidden signaling and uses it for the communication of information. © 2017 American Physical Society. Fil:Bendersky, A. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Figueira, S. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. 2017 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00319007_v118_n13_p_Bendersky http://hdl.handle.net/20.500.12110/paper_00319007_v118_n13_p_Bendersky
institution	Universidad de Buenos Aires
institution_str	I-28
repository_str	R-134
collection	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic	Parallel processing systems Deterministic mechanism Deterministic models Model-making Nonlocal Nonlocal correlations Nonlocalities Time complexity Upper Bound Quantum theory
spellingShingle	Parallel processing systems Deterministic mechanism Deterministic models Model-making Nonlocal Nonlocal correlations Nonlocalities Time complexity Upper Bound Quantum theory Bendersky, Ariel Martín Figueira, Santiago Daniel Nonsignaling Deterministic Models for Nonlocal Correlations have to be Uncomputable
topic_facet	Parallel processing systems Deterministic mechanism Deterministic models Model-making Nonlocal Nonlocal correlations Nonlocalities Time complexity Upper Bound Quantum theory
description	Quantum mechanics postulates random outcomes. However, a model making the same output predictions but in a deterministic manner would be, in principle, experimentally indistinguishable from quantum theory. In this work we consider such models in the context of nonlocality on a device-independent scenario. That is, we study pairs of nonlocal boxes that produce their outputs deterministically. It is known that, for these boxes to be nonlocal, at least one of the boxes' outputs has to depend on the other party's input via some kind of hidden signaling. We prove that, if the deterministic mechanism is also algorithmic, there is a protocol that, with the sole knowledge of any upper bound on the time complexity of such an algorithm, extracts that hidden signaling and uses it for the communication of information. © 2017 American Physical Society.
author	Bendersky, Ariel Martín Figueira, Santiago Daniel
author_facet	Bendersky, Ariel Martín Figueira, Santiago Daniel
author_sort	Bendersky, Ariel Martín
title	Nonsignaling Deterministic Models for Nonlocal Correlations have to be Uncomputable
title_short	Nonsignaling Deterministic Models for Nonlocal Correlations have to be Uncomputable
title_full	Nonsignaling Deterministic Models for Nonlocal Correlations have to be Uncomputable
title_fullStr	Nonsignaling Deterministic Models for Nonlocal Correlations have to be Uncomputable
title_full_unstemmed	Nonsignaling Deterministic Models for Nonlocal Correlations have to be Uncomputable
title_sort	nonsignaling deterministic models for nonlocal correlations have to be uncomputable
publishDate	2017
url	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00319007_v118_n13_p_Bendersky http://hdl.handle.net/20.500.12110/paper_00319007_v118_n13_p_Bendersky
work_keys_str_mv	AT benderskyarielmartin nonsignalingdeterministicmodelsfornonlocalcorrelationshavetobeuncomputable AT figueirasantiagodaniel nonsignalingdeterministicmodelsfornonlocalcorrelationshavetobeuncomputable
_version_	1768543503534522368

Nonsignaling Deterministic Models for Nonlocal Correlations have to be Uncomputable

Ejemplares similares