Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Science

Implementation of the Semiclassical Quantum Fourier Transform in a Scalable System

John Chiaverini, J. Britton, Dietrich G. Leibfried, Emanuel H. Knill, M. D. Barrett, R. B. Blakestad, Wayne M. Itano, John D. Jost, C. Langer, Roee Ozeri, Tobias Schaetz, David J. Wineland

Published May 12, 2005• 153 citations
Publisher

Abstract

We report the implementation of the semiclassical quantum Fourier transform in a system of three beryllium ion qubits (two-level quantum systems) confined in a segmented multizone trap. The quantum Fourier transform is the crucial final step in Shor's algorithm, and it acts on a register of qubits to determine the periodicity of the quantum state's amplitudes. Because only probability amplitudes are required for this task, a more efficient semiclassical version can be used, for which only single-qubit operations conditioned on measurement outcomes are required. We apply the transform to several input states of different periodicities; the results enable the location of peaks corresponding to the original periods. This demonstration incorporates the key elements of a scalable ion-trap architecture, suggesting the future capability of applying the quantum Fourier transform to a large number of qubits as required for a useful quantum factoring algorithm.

DOI
10.1126/science.1110335

Related papers

Recent experiments in trapped-ion quantum information processing at NIST

John Chiaverini, M. D. Barrett, R. B. Blakestad +9 more

Atomic ions confined in segmented trap arrays provide a system for quantum information processing. We report on the execution of two simple quantum algorithms, quantum error correction and the quantum Fourier transform, using this implementation. The demonstration of these algorithms in a scalable system is one step towards the execution of useful, large-scale quantum algorithms.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 2, 2006•1 citation

t-bit semiclassical quantum Fourier transform

Xiang-Qun Fu, Wan‐Su Bao, Chun Hua Zhou +1 more

Because of the difficulty of building a high-dimensional quantum register, this paper presents an implementation of the high-dimensional quantum Fourier transform (QFT) based on a low-dimensional quantum register. First, we define the t-bit semiclassical quantum Fourier transform. In terms of probability amplitude, we prove that the transform can realize quantum Fourier transformation, illustrate that the requirement for the two-qubit gate reduces obviously, and further design a quantum circuit of the transform. Combining the classical fixed-window method and the implementation of Shor’s quantum factorization algorithm, we then redesign a circuit for Shor’s algorithm, whose required computation resource is approximately equal to that of Parker’s. The requirement for elementary quantum gates for Parker’s algorithm is O(⌈ log N⌉3, and the quantum register for our circuit requires t−1 more dimensions than Parker’s. However, our circuit is t 2 times as fast as Parker’s, where t is the width of the window.

Chinese Science Bulletin•Jan 1, 2012•3 citations

Implementation of the Quantum Fourier Transform

Yaakov S. Weinstein, Marco A. Pravia, Evan M. Fortunato +2 more

A quantum Fourier transform (QFT) has been implemented on a three qubit nuclear magnetic resonance (NMR) quantum computer to extract the periodicity of an input state. Implementation of a QFT provides a first step towards the realization of Shor's factoring and other quantum algorithms. The experimental implementation of the QFT on a periodic state is presented along with a quantitative measure of its efficiency measured through state tomography. Experimentally realizing the QFT is a clear demonstration of the ability of NMR to control quantum systems.

arXiv:quant-ph/9906059•Physical Review Letters•Feb 26, 2001•301 citations

A Programmable Five Qubit Quantum Computer Using Trapped Atomic Ions

Shantanu Debnath

Quantum computers can solve certain problems more efficiently compared to conventional classical methods. In the endeavor to build a quantum computer, several competing platforms have emerged that can implement certain quantum algorithms using a few qubits. However, the demonstrations so far have been done usually by tailoring the hardware to meet the requirements of a particular algorithm implemented for a limited number of instances. Although such proof of principal implementations are important to verify the working of algorithms on a physical system, they further need to have the potential to serve as a general purpose quantum computer allowing the flexibility required for running multiple algorithms and be scaled up to host more qubits. Here we demonstrate a small programmable quantum computer based on five trapped atomic ions each of which serves as a qubit. By optically resolving each ion we can individually address them in order to perform a complete set of single-qubit and fully connected two-qubit quantum gates and alsoperform efficient individual qubit measurements. We implement a computation architecture that accepts an algorithm from a user interface in the form of a standard logic gate sequence and decomposes it into fundamental quantum operations that are native to the hardware using a set of compilation instructions that are defined within the software. These operations are then effected through a pattern of laser pulses that perform coherent rotations on targeted qubits in the chain. The architecture implemented in the experiment therefore gives us unprecedented flexibility in the programming of any quantum algorithm while staying blind to the underlying hardware. As a demonstration we implement the Deutsch-Jozsa and Bernstein-Vazirani algorithms on the five-qubit processor and achieve average success rates of 95 and 90 percent, respectively. We also implement a five-qubit coherent quantum Fourier transform and examine its performance in the period finding and phase estimation protocol. We find fidelities of 84 and 62 percent, respectively. While maintaining the same computation architecture the system can be scaled to more ions using resources that scale favorably (O(N^2)) with the number of qubits N.

Bulletin of the American Physical Society•Jan 1, 2016•15 citations

Heuristics for Shuttling Sequence Optimization for a Linear Segmented Trapped-Ion Quantum Computer

J. Durandau, C. A. Brunet, F. Schmidt-Kaler +3 more

An algorithm for the generation of shuttling sequences is necessary for the operation of a linear segmented ion-trap quantum computer. The present work provides an implementation of an algorithm that produces sequences proved to be optimal for circuits with a quantum Fourier transform-like structure. Such optimality was proved in previous work of our group. We first present an approach for qubit mapping, i.e. determining the initial ordering of the ions, termed the common ion order, and develop a heuristic algorithm for its implementation. We explain how this heuristic is integrated in the shuttling sequence generation algorithm described in the previous work. The results show the increased performance of the heuristic in terms of reducing the number of required shuttling operations. The number of ion displacements required exhibits a polynomial increase in terms of the number of qubits, such that these operations become the main contribution to the overall resource cost. Furthermore, we show that multiple zones for gate interactions can reduce the amount of qubit register reordering.

quant-pharXiv:2603.05464•Mar 6, 2026•4 citations

Deconstructing Shor’s Algorithm Using Quantum Fourier Transform

Dushyant Kumar, Balwinder Raj, Gurmohan Singh

Shor's algorithm proved a significant milestone in quantum computing since it promises an exponential speedup over conventional algorithms for integer factorization, a problem critical to modern cryptography systems. This work covers implementation steps of Shor’s algorithm and analyzes Quantum Fourier Transform (QFT) usage for extracting periodicity from quantum superpositions. Firstly, theoretical foundations of algorithm are illustrated concentrating on QFT construction and operation within the setting of the quantum circuit. Thereafter, each implementation step such as qubit optimization, modular exponentiation, and circuit design is discussed. Our findings validate the theoretical effectiveness of the QFT in solving the period-finding subroutine, while also highlighting the practical difficulties and scaling constraints presented by existing quantum hardware. The paper ends with a summary of possible advancements and future paths for error mitigation strategies and quantum algorithm design.

Indian Journal of Pure & Applied Physics•Jan 1, 2026•0 citations
We report the implementation of the semiclassical quantum Fourier transform in a system of three beryllium ion qubits (two-level quantum systems) confined in a segmented multizone trap. The quantum Fourier transform is the crucial final step in Shor's algorithm, and it acts on a register of qubits to determine the periodicity of the quantum state's amplitudes. Because only probability amplitudes are required for this task, a more efficient semiclassical version can be used, for which only single-qubit operations conditioned on measurement outcomes are required. We apply the transform to several input states of different periodicities; the results enable the location of peaks corresponding to the original periods. This demonstration incorporates the key elements of a scalable ion-trap architecture, suggesting the future capability of applying the quantum Fourier transform to a large number of qubits as required for a useful quantum factoring algorithm.
Because of the difficulty of building a high-dimensional quantum register, this paper presents an implementation of the high-dimensional quantum Fourier transform (QFT) based on a low-dimensional quantum register. First, we define the t-bit semiclassical quantum Fourier transform. In terms of probability amplitude, we prove that the transform can realize quantum Fourier transformation, illustrate that the requirement for the two-qubit gate reduces obviously, and further design a quantum circuit of the transform. Combining the classical fixed-window method and the implementation of Shor’s quantum factorization algorithm, we then redesign a circuit for Shor’s algorithm, whose required computation resource is approximately equal to that of Parker’s. The requirement for elementary quantum gates for Parker’s algorithm is O(⌈ log N⌉3, and the quantum register for our circuit requires t−1 more dimensions than Parker’s. However, our circuit is t 2 times as fast as Parker’s, where t is the width of the window.
A quantum Fourier transform (QFT) has been implemented on a three qubit nuclear magnetic resonance (NMR) quantum computer to extract the periodicity of an input state. Implementation of a QFT provides a first step towards the realization of Shor's factoring and other quantum algorithms. The experimental implementation of the QFT on a periodic state is presented along with a quantitative measure of its efficiency measured through state tomography. Experimentally realizing the QFT is a clear demonstration of the ability of NMR to control quantum systems.
Quantum computers can solve certain problems more efficiently compared to conventional classical methods. In the endeavor to build a quantum computer, several competing platforms have emerged that can implement certain quantum algorithms using a few qubits. However, the demonstrations so far have been done usually by tailoring the hardware to meet the requirements of a particular algorithm implemented for a limited number of instances. Although such proof of principal implementations are important to verify the working of algorithms on a physical system, they further need to have the potential to serve as a general purpose quantum computer allowing the flexibility required for running multiple algorithms and be scaled up to host more qubits. Here we demonstrate a small programmable quantum computer based on five trapped atomic ions each of which serves as a qubit. By optically resolving each ion we can individually address them in order to perform a complete set of single-qubit and fully connected two-qubit quantum gates and alsoperform efficient individual qubit measurements. We implement a computation architecture that accepts an algorithm from a user interface in the form of a standard logic gate sequence and decomposes it into fundamental quantum operations that are native to the hardware using a set of compilation instructions that are defined within the software. These operations are then effected through a pattern of laser pulses that perform coherent rotations on targeted qubits in the chain. The architecture implemented in the experiment therefore gives us unprecedented flexibility in the programming of any quantum algorithm while staying blind to the underlying hardware. As a demonstration we implement the Deutsch-Jozsa and Bernstein-Vazirani algorithms on the five-qubit processor and achieve average success rates of 95 and 90 percent, respectively. We also implement a five-qubit coherent quantum Fourier transform and examine its performance in the period finding and phase estimation protocol. We find fidelities of 84 and 62 percent, respectively. While maintaining the same computation architecture the system can be scaled to more ions using resources that scale favorably (O(N^2)) with the number of qubits N.
An algorithm for the generation of shuttling sequences is necessary for the operation of a linear segmented ion-trap quantum computer. The present work provides an implementation of an algorithm that produces sequences proved to be optimal for circuits with a quantum Fourier transform-like structure. Such optimality was proved in previous work of our group. We first present an approach for qubit mapping, i.e. determining the initial ordering of the ions, termed the common ion order, and develop a heuristic algorithm for its implementation. We explain how this heuristic is integrated in the shuttling sequence generation algorithm described in the previous work. The results show the increased performance of the heuristic in terms of reducing the number of required shuttling operations. The number of ion displacements required exhibits a polynomial increase in terms of the number of qubits, such that these operations become the main contribution to the overall resource cost. Furthermore, we show that multiple zones for gate interactions can reduce the amount of qubit register reordering.
Shor's algorithm proved a significant milestone in quantum computing since it promises an exponential speedup over conventional algorithms for integer factorization, a problem critical to modern cryptography systems. This work covers implementation steps of Shor’s algorithm and analyzes Quantum Fourier Transform (QFT) usage for extracting periodicity from quantum superpositions. Firstly, theoretical foundations of algorithm are illustrated concentrating on QFT construction and operation within the setting of the quantum circuit. Thereafter, each implementation step such as qubit optimization, modular exponentiation, and circuit design is discussed. Our findings validate the theoretical effectiveness of the QFT in solving the period-finding subroutine, while also highlighting the practical difficulties and scaling constraints presented by existing quantum hardware. The paper ends with a summary of possible advancements and future paths for error mitigation strategies and quantum algorithm design.