<?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-22T10:08:35Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/3322" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/3322</identifier><datestamp>2017-03-21T16:16:51Z</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="87a3b1dc-7503-44b1-bc22-15dfd77259fd" confidence="600">Cheung, Donny</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2007-09-26T18:33:14Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2007-09-26T18:33:14Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2007-09-26T18:33:14Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2007</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/3322</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">In Part I of this thesis, we present a new model of quantum cellular automata&#xd;
(QCA) based on local unitary operations. We will describe a set of desirable&#xd;
properties for any QCA model, and show that all of these properties are&#xd;
satisfied by the new model, while previous models of QCA do not. We will also&#xd;
show that the computation model based on Local Unitary QCA is equivalent to&#xd;
the Quantum Circuit model of computation, and give a number of applications of&#xd;
this new model of QCA. We also present a physical model of classical CA, on&#xd;
which the Local Unitary QCA model is based, and Coloured QCA, which is an&#xd;
alternative to the Local Unitary QCA model that can be used as the basis for&#xd;
implementing QCA in actual physical systems.&#xd;
&#xd;
In Part II, we explore the quantum separability problem, where we are given a&#xd;
density matrix for a state over two quantum systems, and we are to determine&#xd;
whether the state is separable with respect to these systems. We also look at&#xd;
the converse problem of finding an entanglement witness, which is an&#xd;
observable operator which can give a verification that a particular quantum&#xd;
state is indeed entangled. Although the combined problem is known to be&#xd;
NP-hard in general, it reduces to a convex optimization problem, and by&#xd;
exploiting specific properties of the set of separable states, we introduce a&#xd;
classical algorithm for solving this problem based on an Interior Point&#xd;
Algorithm introduced by Atkinson and Vaidya in 1995.&#xd;
&#xd;
In Part III, we explore the use of a low-depth AQFT (approximate quantum&#xd;
Fourier transform) in quantum phase estimation. It has been shown previously&#xd;
that the logarithmic-depth AQFT is as effective as the full QFT for the&#xd;
purposes of phase estimation. However, with sub-logarithmic depth, the phase&#xd;
estimation algorithm no longer works directly. In this case, results of the&#xd;
phase estimation algorithm need classical post-processing in order to retrieve&#xd;
the desired phase information. A generic technique such as the method of&#xd;
maximum likelihood can be used in order to recover the original phase.&#xd;
&#xd;
Unfortunately, working with the likelihood function analytically is&#xd;
intractable for the phase estimation algorithm. We develop some computational&#xd;
techniques to handle likelihood functions that occur in phase estimation&#xd;
algorithms. These computational techniques may potentially aid in the analysis&#xd;
of certain likelihood functions.</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="title" lang="en">On Algorithms, Separability and Cellular Automata in Quantum Computing</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Combinatorics and Optimization</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">Doctor of Philosophy</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>