Abstract
dc:description.abstractThis thesis includes a survey of the results known for private and approximate private quantum channels. We develop the best known upper bound for ε-randomizing maps, <em>n</em> + 2log(1/ε) + <em>c</em> bits required to ε-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 ε-randomizing. We provide the first known nontrivial lower bound for ε-randomizing maps, and develop several conditions on them which we hope may be useful in proving stronger lower bounds in the future.
Degree
thesis:*- Grantor dc:publisher
- University of Waterloo
- Year dc:date.issued
- 2006
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Dickinson, Paul
Subjects
dc:subject × 8Rights
dc:rights- Statement dc:rights
-
- Copyright: 2006, Dickinson, Paul. All rights reserved.
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/10012/2944