Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-40084-1_19
DC FieldValue
dc.titleAchieving the limits of the noisy-storage model using entanglement sampling
dc.contributor.authorDupuis, F.
dc.contributor.authorFawzi, O.
dc.contributor.authorWehner, S.
dc.date.accessioned2014-07-04T03:11:14Z
dc.date.available2014-07-04T03:11:14Z
dc.date.issued2013
dc.identifier.citationDupuis, F.,Fawzi, O.,Wehner, S. (2013). Achieving the limits of the noisy-storage model using entanglement sampling. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 8043 LNCS (PART 2) : 326-343. ScholarBank@NUS Repository. <a href="https://doi.org/10.1007/978-3-642-40084-1_19" target="_blank">https://doi.org/10.1007/978-3-642-40084-1_19</a>
dc.identifier.isbn9783642400834
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/77997
dc.description.abstractA natural measure for the amount of quantum information that a physical system E holds about another system A = A1,...,An is given by the min-entropy Hmin (A|E). Specifically, the min-entropy measures the amount of entanglement between E and A, and is the relevant measure when analyzing a wide variety of problems ranging from randomness extraction in quantum cryptography, decoupling used in channel coding, to physical processes such as thermalization or the thermodynamic work cost (or gain) of erasing a quantum system. As such, it is a central question to determine the behaviour of the min-entropy after some process M is applied to the system A. Here we introduce a new generic tool relating the resulting min-entropy to the original one, and apply it to several settings of interest, including sampling of subsystems and measuring in a randomly chosen basis. The results on random measurements yield new high-order entropic uncertainty relations with which we prove the optimality of cryptographic schemes in the bounded quantum storage model. This is an abridged version of the paper; the full version containing all proofs and further applications can be found in [13]. © 2013 International Association for Cryptologic Research.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/978-3-642-40084-1_19
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1007/978-3-642-40084-1_19
dc.description.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.description.volume8043 LNCS
dc.description.issuePART 2
dc.description.page326-343
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


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