<?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-22T20:05:21Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/14049" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/14049</identifier><datestamp>2025-03-26T23:35:21Z</datestamp><setSpec>com_10012_9936</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9949</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="advisor">Laflamme, Raymond</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="477abada-dbc7-4f21-91d9-64e9ae3093a2" confidence="600">Chamberland, Christopher</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2018-10-22T20:07:06Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2018-10-22T20:07:06Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2018-10-22</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2018-10-05</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/14049</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Quantum computers have the potential to solve several interesting problems in polynomial&#xd;
time for which no polynomial time classical algorithms have been found. However,&#xd;
one of the major challenges in building quantum devices is that quantum systems are very&#xd;
sensitive to noise arising from undesired interactions with the environment. Noise can lead&#xd;
to errors which can corrupt the results of the computation. Quantum error correction is&#xd;
one way to mitigate the effects of noise arising in quantum devices.&#xd;
With a plethora of quantum error correcting codes that can be used in various settings,&#xd;
one of the main challenges of quantum error correction is understanding how well various&#xd;
codes perform under more realistic noise models that can be observed in experiments.&#xd;
This thesis proposes a new decoding algorithm which can optimize threshold values of&#xd;
error correcting codes under different noise models. The algorithm can be applied to&#xd;
any Markovian noise model. Further, it is shown that for certain noise models, logical&#xd;
Clifford corrections can further improve a code&amp;apos;s threshold value if the code obeys certain&#xd;
symmetries.&#xd;
&#xd;
Since gates and measurements cannot in general be performed with perfect precision,&#xd;
the operations required to perform quantum error correction can introduce more errors&#xd;
into the system thus negating the benefits of error correction. Fault-tolerant quantum&#xd;
computing is a way to perform quantum error correction with imperfect operations while&#xd;
retaining the ability to suppress errors as long as the noise is below a code&amp;apos;s threshold.&#xd;
One of the main challenges in performing fault-tolerant error correction is the high resource&#xd;
requirements that are needed to obtain very low logical noise rates. With the use of &#xd;
flag qubits, this thesis develops new fault-tolerant error correction protocols that are applicable&#xd;
to arbitrary distance codes. Various code families are shown to satisfy the requirements&#xd;
of flag fault-tolerant error correction. We also provide circuits using a constant number of&#xd;
qubits for these codes. It is shown that the proposed flag fault-tolerant method uses fewer&#xd;
qubits than previous fault-tolerant error correction protocols.&#xd;
&#xd;
It is often the case that the noise afflicting a quantum device cannot be fully characterized.&#xd;
Further, even with some knowledge of the noise, it can be very challenging to use&#xd;
analytic decoding methods to improve the performance of a fault-tolerant scheme. This&#xd;
thesis presents decoding schemes using several state of the art machine learning techniques&#xd;
with a focus on fault-tolerant quantum error correction in regimes that are relevant to near&#xd;
term experiments. It is shown that even in low noise rate regimes and with no knowledge&#xd;
of the noise, noise can be further suppressed for small distance codes. Limitations of machine&#xd;
learning decoders as well as the classical resources required to perform active error&#xd;
correction are discussed.&#xd;
&#xd;
In many cases, gate times can be much shorter than typical measurement times of&#xd;
quantum states. Further, classical decoding of the syndrome information used in quantum&#xd;
error correction to compute recovery operators can also be much slower than gate times.&#xd;
For these reasons, schemes where error correction can be implemented in a frame (known&#xd;
as the Pauli frame) have been developed to avoid active error correction. In this thesis, we&#xd;
generalize previous Pauli frame schemes and show how Clifford frame error correction can&#xd;
be implemented with minimal overhead. Clifford frame error correction is necessary if the&#xd;
logical component of recovery operators were chosen from the Clifford group, but could&#xd;
also be used in randomized benchmarking schemes.</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 error correction</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Quantum computing</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Fault-tolerant quantum computing</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Quantum information</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">New methods in quantum error correction and fault-tolerant quantum computing</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Physics and Astronomy</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Physics (Quantum Information)</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Laflamme, Raymond</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Science</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</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>