Approximate Randomization of Quantum States With Fewer Bits of Key

DOI10.1063/1.2400876zbMath1139.81315arXivquant-ph/0611033OpenAlexW1597310767MaRDI QIDQ5432053

Ashwin Nayak, Paul A. Dickinson

Publication date: 2 January 2008

Published in: AIP Conference Proceedings (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0611033

zbMATH Keywords

lower boundsquantum cryptographyencryptionquantum statesprivate keystabilizer stateskey lengthapproximate randomizationalmost-uniform distributionepsilon-biased distribution

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60)

Related Items (8)

On almost randomizing channels with a short Kraus decomposition ⋮ On the Power of Quantum Encryption Keys ⋮ Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker ⋮ Secure sequential transmission of quantum information ⋮ Nonmalleable encryption of quantum information ⋮ Entropic security in quantum cryptography ⋮ Quantum encryption and generalized Shannon impossibility ⋮ Quantum Key Recycling with 8-state encoding (The Quantum One-Time Pad is more interesting than we thought)

This page was built for publication: Approximate Randomization of Quantum States With Fewer Bits of Key