<?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-21T06:42:05Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/31638" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/31638</identifier><datestamp>2026-09-24T22:22:17Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Doliskani, Jake</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Mousavi, Seyed Ali</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2025-05-06T19:05:28Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2025-05-06T19:05:28Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2025</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/31638</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/23317</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">This thesis explores the foundations of quantum computation, focusing on quantum walks&#xd;
and their application to quantum money. Quantum walks, particularly continuous-time&#xd;
quantum walks based on group actions, serve as a powerful computational tool with applications&#xd;
in search algorithms and cryptographic protocols. We examine their mathematical&#xd;
structure and their advantages over classical random walks, emphasizing their efficiency in&#xd;
state evolution and probability distribution spreading. As a part of this work, we examine&#xd;
efficient implementations of transforms such as the Quantum Fourier Transform (QFT) and&#xd;
the Quantum Hartley Transform (QHT), analyzing their role in encoding quantum states&#xd;
for secure cryptographic applications. In particular, we discuss a novel instantiation of a&#xd;
quantum money scheme based on QHT, leveraging its unique properties for improved security&#xd;
and efficiency. To ensure the robustness of this quantum money scheme, we develop a&#xd;
verification mechanism utilizing quantum walks. Unlike previous approaches, which rely on&#xd;
standard quantum state measurements, our method employs continuous-time quantum walks&#xd;
to authenticate quantum money, preventing counterfeiting while maintaining computational&#xd;
feasibility. Additionally, we present a detailed discussion on the efficient implementation of&#xd;
this scheme, including optimized circuit designs and error mitigation strategies.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Master of Applied Science (MASc)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Quantum Walks and Application to Quantum Money</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>