<?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-22T16:17:17Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/19958" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/19958</identifier><datestamp>2025-03-26T23:33:04Z</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="advisor">Godsil, Chris</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="4745981c-68fe-48e7-88a9-b258353c3ca4" confidence="600">Chen, Qiuting</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2023-09-26T17:33:00Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2023-09-26T17:33:00Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2023-09-26</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2023-09-20</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/19958</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">We study a discrete quantum walk model called bipartite walks via a spectral approach. A bipartite walk is determined by a unitary matrix U, i.e., the transition matrix of the walk. For every transition matrix U, there is a Hamiltonian H such that U = exp(iH). If there is a real skew-symmetric matrix S such that H = iS, we say there is a H-digraph associated to the walk and S is the skew-adjacency matrix of the H-digraph. The underlying unweighted non-oriented graph of the H-digraph is H-graph. Let G be a&#xd;
simple bipartite graph with no isolated vertices. The bipartite walk on G is the same as the continuous walk on the H-digraph over integer time. Two questions lie in the centre of this thesis are&#xd;
1. Is there a connection between the H-(di)graph and the underlying&#xd;
graph G? If there is, what is the connection?&#xd;
2. Is there a connection between the walk and the underlying graph G?&#xd;
If there is, what is the connection?&#xd;
Given a bipartite walk on G, we show that the underlying bipartite&#xd;
graph G determines the existence of the H-graph. If G is biregular, the&#xd;
spectrum of G determines the spectrum of U.&#xd;
We give complete characterizations of bipartite walks on paths and even&#xd;
cycles. Given a path or an even cycle, the transition matrix of the bipartite&#xd;
walk is a permutation matrix. The H-digraph is an oriented weighted complete&#xd;
graph. Using bipartite walks on even paths, we construct a in nite&#xd;
family of oriented weighted complete graphs such that continuous walks de-&#xd;
 ned on them have universal perfect state transfer, which is an interesting&#xd;
but rare phenomenon.&#xd;
Grover&amp;apos;s walk is one of the most studied discrete quantum walk model&#xd;
and it can be used to implement the famous Grover&amp;apos;s algorithm. We show&#xd;
that Grover&amp;apos;s walk is actually a special case of bipartite walks. Moreover,&#xd;
given a bipartite graph G, one step of the bipartite walk on G is the same&#xd;
as two steps of Grover&amp;apos;s walk on the same graph.&#xd;
We also study periodic bipartite walks. Using results from algebraic&#xd;
number theory, we give a characterization of periodic walks on a biregular&#xd;
graph with a constraint on its spectrum. This characterization only depends&#xd;
on the spectrum of the underlying graph and the possible spectrum for a&#xd;
periodic walk is determined by the degrees of the underlying graph. We apply this characterization of periodic bipartite walk to Grover&amp;apos;s walk to&#xd;
get a characterization of a certain class of periodic Grover&amp;apos;s walk.&#xd;
Lastly, we look into bipartite walks on the incidence graphs of incidence&#xd;
structures, t-designs (t   2) and generalized quadrangles in particular.&#xd;
Given a bipartite walk on a t-design, we show that if the underlying&#xd;
design is a partial linear space, the H-graph is the distance-two graph of the&#xd;
line graph of the underlying incidence graph. Given a bipartite walk on the&#xd;
incidence graph of a generalized quadrangle, we show that there is a homogeneous&#xd;
coherent algebra raised from the bipartite walk. This homogeneous&#xd;
coherent algebra is useful in analyzing the behavior of the walk.</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">combinatorics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">algebraic graph theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">quantum walks</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Bipartite Quantum Walks and the Hamiltonian</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">Combinatorics and Optimization</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Combinatorics and Optimization</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-etd" element="embargo" qualifier="terms" lang="en">0</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Godsil, Chris</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Mathematics</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>