Approximate Randomization of Quantum States With Fewer Bits of Key

DOI10.1063/1.2400876MaRDI QIDQ5432053zbMATH OpenOpenAlexFDO

Authors Paul A. Dickinson, Ashwin Nayak

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

almost-uniform distributionapproximate randomizationencryptionepsilon-biased distributionkey lengthlower boundsprivate keyquantum cryptographyquantum statesstabilizer states

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60)

Abstract: Randomization of quantum states is the quantum analogue of the classical one-time pad. We present an improved, efficient construction of an approximately randomizing map that uses O(d/epsilon^2) Pauli operators to map any d-dimensional state to a state that is within trace distance epsilon of the completely mixed state. Our bound is a log d factor smaller than that of Hayden, Leung, Shor, and Winter (2004), and Ambainis and Smith (2004). Then, we show that a random sequence of essentially the same number of unitary operators, chosen from an appropriate set, with high probability form an approximately randomizing map for d-dimensional states. Finally, we discuss the optimality of these schemes via connections to different notions of pseudorandomness, and give a new lower bound for small epsilon.

Recommendations

• Randomizing quantum states: constructions and applications
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• On almost randomizing channels with a short Kraus decomposition
• On the Power of Quantum Encryption Keys
• Pseudorandom quantum states

Cited in

(14)

• Entropic security in quantum cryptography
• Randomizing quantum states: constructions and applications
• One-shot randomized and nonrandomized partial decoupling
• Efficient simulation of random states and random unitaries
• Quantum encryption and generalized Shannon impossibility
• On the Power of Quantum Encryption Keys
• Nonmalleable encryption of quantum information
• Quantum key recycling with 8-state encoding (The quantum one-time pad is more interesting than we thought)
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker
• Entropically secure encryption with faster key expansion
• The power of a single Haar random state: constructing and separating quantum pseudorandomness
• Secure sequential transmission of quantum information
• On almost randomizing channels with a short Kraus decomposition

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

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