This 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.
| Identifer | oai:union.ndltd.org:WATERLOO/oai:uwspace.uwaterloo.ca:10012/2944 |
| Date | January 2006 |
| Creators | Dickinson, Paul |
| Publisher | University of Waterloo |
| Source Sets | University of Waterloo Electronic Theses Repository |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Format | application/pdf, 367669 bytes, application/pdf |
| Rights | Copyright: 2006, Dickinson, Paul. All rights reserved. |
Page generated in 0.0023 seconds