Approximate Private Quantum Channels

Loading...
Thumbnail Image

Date

2006

Authors

Dickinson, Paul

Advisor

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

This thesis includes a survey of the results known for private and approximate private quantum channels. We develop the best known upper bound for &epsilon;-randomizing maps, <em>n</em> + 2log(1/&epsilon;) + <em>c</em> bits required to &epsilon;-randomize an arbitrary <em>n</em>-qubit state by improving a scheme of Ambainis and Smith [5] based on small bias spaces [16, 3]. We show by a probabilistic argument that in fact the great majority of random schemes using slightly more than this many bits of key are also &epsilon;-randomizing. We provide the first known nontrivial lower bound for &epsilon;-randomizing maps, and develop several conditions on them which we hope may be useful in proving stronger lower bounds in the future.

Description

Keywords

Mathematics, quantum, approximate, randomization, cryptography, small bias, epsilon-randomize, independent space

LC Subject Headings

Citation