<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T11:12:23Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/2944" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/2944</identifier><datestamp>2017-03-21T21:39:08Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9928</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en" authority="1e993c93-beae-4f61-8eba-384e04185f1f" confidence="600">Dickinson, Paul</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2007-05-08T14:01:52Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2007-05-08T14:01:52Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2006</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2006</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/2944</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">This thesis includes a survey of the results known for private and approximate private quantum channels.   We develop the best known upper bound for  &amp;amp;epsilon;-randomizing maps, &amp;lt;em&amp;gt;n&amp;lt;/em&amp;gt; + 2log(1/&amp;amp;epsilon;) + &amp;lt;em&amp;gt;c&amp;lt;/em&amp;gt; bits required to  &amp;amp;epsilon;-randomize an arbitrary &amp;lt;em&amp;gt;n&amp;lt;/em&amp;gt;-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  &amp;amp;epsilon;-randomizing.   We provide the first known nontrivial lower bound for  &amp;amp;epsilon;-randomizing maps, and develop several conditions on them which we hope may be useful in proving stronger lower bounds in the future.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">367669 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en">Copyright: 2006, 
  Dickinson, Paul. All rights reserved.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Mathematics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">quantum</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">approximate</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">randomization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">cryptography</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">small bias</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">epsilon-randomize</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">independent space</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Approximate Private Quantum Channels</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>