<?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-22T08:08:00Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/4458" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/4458</identifier><datestamp>2017-03-21T17:34:25Z</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" authority="7a3d34dc-d42e-4978-a620-33a680de1e50" confidence="600">Ozols, Maris</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2009-05-22T18:24:52Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2009-05-22T18:24:52Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2009-05-22T18:24:52Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2009-05</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/4458</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">We consider a communication method, where the sender encodes n classical bits into 1 qubit and sends it to the receiver who performs a certain measurement depending on which of the initial bits must be recovered. This procedure is called (n,1,p) quantum random access code (QRAC) where p &amp;gt; 1/2 is its success probability. It is known that (2,1,0.85) and (3,1,0.79) QRACs (with no classical counterparts) exist and that (4,1,p) QRAC with p &amp;gt; 1/2 is not possible.&#xd;
&#xd;
We extend this model with shared randomness (SR) that is accessible to both parties. Then (n,1,p) QRAC with SR and p &amp;gt; 1/2 exists for any n &amp;gt; 0. We give an upper bound on its success probability (the known (2,1,0.85) and (3,1,0.79) QRACs match this upper bound). We discuss some particular constructions for several small values of n.&#xd;
&#xd;
We also study the classical counterpart of this model where n bits are encoded into 1 bit instead of 1 qubit and SR is used. We give an optimal construction for such codes and find their success probability exactly---it is less than in the quantum case.&#xd;
&#xd;
Interactive 3D quantum random access codes are available on-line at&#xd;
http://home.lanet.lv/~sd20008/racs</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="subject" lang="en">quantum random access codes</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">shared randomness</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Yao&amp;apos;s principle</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Bloch sphere</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Quantum Random Access Codes with Shared Randomness</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="comment" qualifier="hidden" lang="en">I updated my PDF file according to your suggestions.</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>