On the optimality of quantum encryption schemes

DOI10.1063/1.2339014zbMath1112.81019arXivquant-ph/0509169OpenAlexW2014255764WikidataQ59482338 ScholiaQ59482338MaRDI QIDQ3442020

Daniel Nagaj, Iordanis Kerenidis

Publication date: 16 May 2007

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60)

Related Items (4)

Sample-size-reduction of quantum states for the noisy linear problem ⋮ Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker ⋮ Secure sequential transmission of quantum information ⋮ Quantum encryption and generalized Shannon impossibility

Cites Work

• Unnamed Item
• An analysis of completely-positive trace-preserving maps on \({\mathcal M}_{2}\)
• Randomizing quantum states: constructions and applications
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Optimality of private quantum channels
• Communication Theory of Secrecy Systems*
• Simple Constructions of Almost k-wise Independent Random Variables
• Additivity for unital qubit channels
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

This page was built for publication: On the optimality of quantum encryption schemes