McMaster University
Efficient Real Quantum Transforms with Applications to Quantum Money
Abstract
dc:description.abstractWe 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.
Degree
thesis:*- Department dc:contributor.department
- Computing and Software
- Year dc:date.issued
- 2026
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Morteza Mirzaei
- Advisor dc:contributor.advisor
-
- Doliskani, Jake
Rights
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Identifier URI
- https://doi.org/10.71548/6