Probing the quantum–classical boundary with compression software

doi:10.1088/1367-2630/18/3/035011

Probing the quantum–classical boundary with compression software

Communities & Collections

pcg.skipToMenu

Probing the quantum–classical boundary with compression software

View Usage Statistics

Show full item record

dc.contributor.author	Poh, Hou Shun	pl
dc.contributor.author	Markiewicz, Marcin [SAP14019544]	pl
dc.contributor.author	Kurzyński, Paweł	pl
dc.contributor.author	Cerè, Alessandro	pl
dc.contributor.author	Kaszlikowski, Dagomir	pl
dc.contributor.author	Christian Kurtsiefer	pl
dc.date.accessioned	2017-04-05T13:55:53Z
dc.date.available	2017-04-05T13:55:53Z
dc.date.issued	2016	pl
dc.identifier.uri	http://ruj.uj.edu.pl/xmlui/handle/item/39321
dc.language	eng	pl
dc.rights	Udzielam licencji. Uznanie autorstwa 3.0	*
dc.rights.uri	http://creativecommons.org/licenses/by/3.0/legalcode	*
dc.title	Probing the quantum–classical boundary with compression software	pl
dc.type	JournalArticle	pl
dc.abstract.en	We adapt an algorithmic approach to the problem of local realism in a bipartite scenario. We assume that local outcomes are simulated by spatially separated universal Turing machines. The outcomes are calculated from inputs encoding information about a local measurement setting and a description of the bipartite system sent to both parties. In general, such a description can encode some additional information not available in quantum theory, i.e., local hidden variables. Using the Kolmogorov complexity of local outcomes we derive an inequality that must be obeyed by any local realistic theory. Since the Kolmogorov complexity is in general uncomputable, we show that this inequality can be expressed in terms of lossless compression of the data generated in such experiments and that quantum mechanics violates it. Finally, we confirm experimentally our findings using pairs of polarisation-entangled photons and readily available compression software. We argue that our approach relaxes the independent and identically distributed (i.i.d.) assumption, namely that individual bits in the outcome bit-strings do not have to be i.i.d.	pl
dc.description.volume	18	pl
dc.description.number	3	pl
dc.identifier.doi	10.1088/1367-2630/18/3/035011	pl
dc.identifier.eissn	1367-2630	pl
dc.title.journal	New Journal of Physics	pl
dc.language.container	eng	pl
dc.affiliation	Wydział Fizyki, Astronomii i Informatyki Stosowanej : Instytut Fizyki im. Mariana Smoluchowskiego	pl
dc.subtype	Article	pl
dc.identifier.articleid	035011	pl
dc.rights.original	CC-BY; otwarte czasopismo; ostateczna wersja wydawcy; w momencie opublikowania; 0;	pl
dc.identifier.project	ROD UJ / P	pl
.pointsMNiSW	[2016 A]: 40