Quick Navigation

Topics

Quantum Simulation

A Quantum Bluestein's Algorithm for Arbitrary-Size Quantum Fourier Transform

arXiv
Authors: Nan-Hong Kuo, Renata Wong

Year

2025

Paper ID

6003

Status

Preprint

Abstract Read

~2 min

Abstract Words

115

Citations

N/A

Abstract

We propose a quantum analogue of Bluestein's algorithm (QBA) that implements an exact N-point Quantum Fourier Transform (QFT) for arbitrary N. Our construction factors the N-dimensional QFT unitary into three diagonal quadratic-phase gates and two standard radix-2 QFT subcircuits of size M = 2m with $M ge 2N - 1$. This achieves asymptotic gate complexity O\((log N\)2) and uses O\(log N\) qubits, matching the performance of a power-of-two QFT on m qubits while avoiding the need to embed into a larger Hilbert space. We validate the correctness of the algorithm through a concrete implementation in Qiskit and classical simulation, confirming that QBA produces the exact N-point discrete Fourier transform on arbitrary-length inputs.

Why This Paper Matters

  • This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
  • It adds a 2025 reference point for readers tracking recent quantum research.
  • We propose a quantum analogue of Bluestein's algorithm (QBA) that implements an exact N-point Quantum Fourier Transform (QFT) for arbitrary N.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #6003 #78846 Analog quantum simulation of Sh... #78810 Secure Quantum Handshakes: Quan... #78802 Quantum Co-Design of Inhomogene... #78801 Constructing Large and Structur...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.