Please use this identifier to cite or link to this item: https://doi.org/10.1088/1367-2630/18/3/035011
DC FieldValue
dc.titleProbing the quantum-classical boundary with compression software
dc.contributor.authorPoh H.S.
dc.contributor.authorMarkiewicz M.
dc.contributor.authorKurzy?ski P.
dc.contributor.authorCerè A.
dc.contributor.authorKaszlikowski D.
dc.contributor.authorKurtsiefer C.
dc.date.accessioned2020-09-09T06:40:07Z
dc.date.available2020-09-09T06:40:07Z
dc.date.issued2016
dc.identifier.citationPoh H.S., Markiewicz M., Kurzy?ski P., Cerè A., Kaszlikowski D., Kurtsiefer C. (2016). Probing the quantum-classical boundary with compression software. New Journal of Physics 18 (3) : 35011. ScholarBank@NUS Repository. https://doi.org/10.1088/1367-2630/18/3/035011
dc.identifier.issn1367-2630
dc.identifier.urihttps://scholarbank.nus.edu.sg/handle/10635/175258
dc.description.abstractWe 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. © 2016 IOP Publishing Ltd and Deutsche Physikalische Gesellschaft.
dc.publisherInstitute of Physics Publishing
dc.sourceUnpaywall 20200831
dc.subjectAlgorithms
dc.subjectData compression
dc.subjectEncoding (symbols)
dc.subjectMachinery
dc.subjectQuantum theory
dc.subjectAlgorithmic approach
dc.subjectdescription of reality
dc.subjectEncoding informations
dc.subjectKolmogorov complexity
dc.subjectLocal measurement
dc.subjectLossless compression
dc.subjectQuantum correlations
dc.subjectUniversal Turing machine
dc.subjectTuring machines
dc.typeArticle
dc.contributor.departmentCENTRE FOR QUANTUM TECHNOLOGIES
dc.description.doi10.1088/1367-2630/18/3/035011
dc.description.sourcetitleNew Journal of Physics
dc.description.volume18
dc.description.issue3
dc.description.page35011
dc.published.statePublished
Appears in Collections:Staff Publications
Elements

Show simple item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
10_1088_1367-2630_18_3_035011.pdf938.96 kBAdobe PDF

OPEN

NoneView/Download

SCOPUSTM   
Citations

6
checked on Feb 27, 2021

Page view(s)

27
checked on Mar 5, 2021

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.