Exploiting recursive structures for the design of novel quantum primitives
Ning Bao, Gun Suer

TL;DR
This paper explores how recursive circuit structures can be exploited to design new quantum primitives, using the quantum Fourier transform as a key example, potentially advancing quantum algorithms and related fields.
Contribution
It introduces a novel approach to designing quantum primitives by leveraging recursive structures, bridging classical transforms with quantum algorithms.
Findings
Recursive structures enable the design of new quantum primitives.
Quantum speedup is guaranteed for certain non-sparse classical transforms.
Potential applications in quantum algorithms, numerical analysis, and signal processing.
Abstract
The advent of fault-tolerant quantum computers marks a significant milestone, yet the development of practical quantum algorithms remains a critical challenge. Effective quantum algorithms are essential for leveraging the power of quantum computers, and their design is often non-intuitive. This paper addresses the issue of generating novel quantum primitives by focusing on recursive circuits. We explore the recursive circuit structures prevalent in existing quantum algorithms and demonstrate how these structures can be exploited to design new, potentially advantageous quantum algorithms. We base our discussion on the quantum Fourier transform (QFT), which is a primitive that is widely used in quantum algorithms. We show that the recursive structure in well-established fast classical transforms forms a fruitful bridge with quantum algorithms, enabling the design of novel quantum…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
