<?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-21T01:10:25Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/33142" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/33142</identifier><datestamp>2026-05-14T16:17:13Z</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">Morteza Mirzaei</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Computing and Software</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2026-05-13T14:56:47Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2026</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/11375/33142</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/6</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">We introduce new techniques for implementing quantum real transforms, focusing on the Hartley and sine transforms, and analyze how they can serve as efficient building blocks in quantum cryptographic protocols. In particular, we present an exact, recursive algorithm for the quantum Hartley transform (QHT) that matches the gate complexity of standard quantum Fourier transform implementations. Leveraging QHT as a subroutine, we then describe efficient procedures for computing the quantum sine transform, demonstrating that real-valued transforms can be realized with complexity comparable to their complex-valued counterparts.

In the latter part of this work, we demonstrate how our real-transform framework can be applied to construct public-key quantum money systems based on abelian group actions. By replacing the quantum Fourier transform with QHT in the banknote generation and verification protocols, we obtain circuits that maintain similar performance and security guarantees while offering a simpler design. Our findings underscore the versatility of real-valued transforms in quantum settings and emphasize their potential to serve as practical, cryptographically secure alternatives to the more common complex-valued methods.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree">Master of Science (MSc)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="title">Efficient Real Quantum Transforms with Applications to Quantum Money</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>