Show simple item record

dc.contributor.authorHeinosaari, Teiko
dc.contributor.authorKerppo, Oskari
dc.contributor.authorLeppäjärvi, Leevi
dc.contributor.authorPlávala, Martin
dc.date.accessioned2024-04-26T10:24:43Z
dc.date.available2024-04-26T10:24:43Z
dc.date.issued2024
dc.identifier.citationHeinosaari, T., Kerppo, O., Leppäjärvi, L., & Plávala, M. (2024). Simple information-processing tasks with unbounded quantum advantage. <i>Physical Review A</i>, <i>109</i>(3), Article 032627. <a href="https://doi.org/10.1103/PhysRevA.109.032627" target="_blank">https://doi.org/10.1103/PhysRevA.109.032627</a>
dc.identifier.otherCONVID_213160797
dc.identifier.urihttps://jyx.jyu.fi/handle/123456789/94514
dc.description.abstractCommunication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by measuring the state of the system. We show that already in the simplest possible scenarios it is possible to detect a definite, unbounded advantage of quantum systems over classical systems. We do this by constructing a family of operationally meaningful communication tasks, each of which, on the one hand, can be implemented by using just a single qubit but which, on the other hand, require an unboundedly larger classical system for classical implementation. Furthermore, we show that even though, with the additional resource of shared randomness, the proposed communication tasks can be implemented by both quantum and classical systems of the same size, the number of coordinated actions needed for the classical implementation also grows unboundedly. In particular, no finite storage can be used to store all the coordinated actions required to implement all possible quantum communication tasks with classical systems. As a consequence, shared randomness cannot be viewed as a free resource.en
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.publisherAmerican Physical Society
dc.relation.ispartofseriesPhysical Review A
dc.rightsIn Copyright
dc.subject.othercomputational complexity
dc.subject.otherquantum communication
dc.subject.otherquantum foundations
dc.subject.otherquantum information processing
dc.subject.otherquantum information theory
dc.subject.otherquantum protocols
dc.subject.otherresource theories
dc.titleSimple information-processing tasks with unbounded quantum advantage
dc.typearticle
dc.identifier.urnURN:NBN:fi:jyu-202404263141
dc.contributor.laitosInformaatioteknologian tiedekuntafi
dc.contributor.laitosFaculty of Information Technologyen
dc.type.urihttp://purl.org/eprint/type/JournalArticle
dc.type.coarhttp://purl.org/coar/resource_type/c_2df8fbb1
dc.description.reviewstatuspeerReviewed
dc.relation.issn2469-9926
dc.relation.numberinseries3
dc.relation.volume109
dc.type.versionpublishedVersion
dc.rights.copyright© 2024 American Physical Society
dc.rights.accesslevelopenAccessfi
dc.relation.grantnumber343228
dc.relation.grantnumber349945
dc.relation.grantnumber8582/31/2022
dc.subject.ysokvanttiteoria
dc.subject.ysokvanttilaskenta
dc.subject.ysoviestintä
dc.subject.ysokvantti-informaatio
dc.format.contentfulltext
jyx.subject.urihttp://www.yso.fi/onto/yso/p5565
jyx.subject.urihttp://www.yso.fi/onto/yso/p39209
jyx.subject.urihttp://www.yso.fi/onto/yso/p36
jyx.subject.urihttp://www.yso.fi/onto/yso/p38824
dc.rights.urlhttp://rightsstatements.org/page/InC/1.0/?language=en
dc.relation.doi10.1103/PhysRevA.109.032627
dc.relation.funderResearch Council of Finlanden
dc.relation.funderResearch Council of Finlanden
dc.relation.funderBusiness Finlanden
dc.relation.funderSuomen Akatemiafi
dc.relation.funderSuomen Akatemiafi
dc.relation.funderBusiness Finlandfi
jyx.fundingprogramOthers, AoFen
jyx.fundingprogramAcademy Project, AoFen
jyx.fundingprogramCo-Innovation, BFen
jyx.fundingprogramMuut, SAfi
jyx.fundingprogramAkatemiahanke, SAfi
jyx.fundingprogramCo-Innovation, BFfi
jyx.fundinginformationT.H. and O.K. acknowledge financial support from Business Finland under the project TORQS, Grant No. 8582/31/2022, and from the Academy of Finland under the mobility funding Grant No. 343228, and under the project DEQSE, Grant No. 349945. L.L. acknowledges support from the European Union’s Horizon 2020 research and innovation program under the program SASPRO 2 COFUND, Marie Sklodowska-Curie Grant Agreement No. 945478, as well as from projects APVV-22-0570 (DeQHOST) and VEGA 2/0183/21 (DESCOM). M.P. acknowledges support from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation Projects No. 447948357 and No. 440958198), the Sino-German Center for Research Promotion (Project No. M-0294), the ERC (Consolidator Grant No. 683107/TempoQ), the German Ministry of Education and Research (Project QuKuK, BMBF Grant No. 16KIS1618K), and the Alexander von Humboldt Foundation.
dc.type.okmA1


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

In Copyright
Except where otherwise noted, this item's license is described as In Copyright