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

DOI10.1007/978-3-642-54429-3_11zbMath1451.81122arXiv1012.2291OpenAlexW2114202657MaRDI QIDQ3453318

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)

Related Items (2)

From Indifferentiability to Constructive Cryptography (and Back) ⋮ Entropy accumulation

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

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