Bitwise Quantum Min-Entropy Sampling and New Lower Bounds for Random Access Codes

DOI10.1007/978-3-642-54429-3_11MaRDI QIDQ3453318zbMATH OpenOpenAlexFDO

Authors Jürg Wullschleger

Publication date 20 November 2015

Published in Theory of Quantum Computation, Communication, and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1012.2291

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Abstract: Min-entropy sampling gives a bound on the min-entropy of a randomly chosen subset of a string, given a bound on the min-entropy of the whole string. K"onig and Renner showed a min-entropy sampling theorem that holds relative to quantum knowledge. Their result achieves the optimal rate, but it can only be applied if the bits are sampled in blocks, and only gives weak bounds for the non-smooth min-entropy. We give two new quantum min-entropy sampling theorems that do not have the above weaknesses. The first theorem shows that the result by K"onig and Renner also applies to bitwise sampling, and the second theorem gives a strong bound for the non-smooth min-entropy. Our results imply a new lower bound for k-out-of-n random access codes: while previous results by Ben-Aroya, Regev, and de Wolf showed that the decoding probability is exponentially small in k if the storage rate is smaller than 0.7, our results imply that this holds for any storage rate strictly smaller than 1, which is optimal.

Recommendations

• Sampling of Min-Entropy Relative to Quantum Knowledge
• Quantum Sampling for Finite Key Rates in High Dimensional Quantum Cryptography
• A note on random coding bounds for classical-quantum channels
• On the Minimum Output Entropy of Random Orthogonal Quantum Channels
• Entropic Proofs of Singleton Bounds for Quantum Error-Correcting Codes
• The Quantum Communication Complexity of Sampling
• Source-device-independent randomness expansion using quantum random access codes
• A Random Coding Based Proof for the Quantum Coding Theorem
• Efficient decoding of random errors for quantum expander codes
• Semi-device-independent randomness expansion using \(n\rightarrow1\) sequential quantum random access codes

Cites work

• Constructing locally computable extractors and cryptosystems in the bounded-storage model
• The Bounded-Storage Model in the Presence of a Quantum Adversary
• The Operational Meaning of Min- and Max-Entropy

Cited in

(7)

• Entropy accumulation
• Sampling in a quantum population, and applications
• Quantum sampling and entropic uncertainty
• From Indifferentiability to Constructive Cryptography (and Back)
• Achieving the limits of the noisy-storage model using entanglement sampling
• The geometry of Bloch space in the context of quantum random access codes
• Optimal bounds for parity-oblivious random access codes

This page was built for publication: Bitwise Quantum Min-Entropy Sampling and New Lower Bounds for Random Access Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453318)