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

arXiv:2110.15067 · Journal of Physics A Mathematical and Theoretical

Implementing quantum Fourier transform using three qubits

Mouhcine Yachi, Radouan Hab‐arrih, Ahmed Jellal

Published Mar 29, 2023• 4 citations
arXivHTMLPDF

Abstract

Abstract Using the circulant symmetry of a Hamiltonian describing three qubits, we realize the quantum Fourier transform. This symmetry allows us to construct a set of eigenvectors independently on the magnitude of physical parameters involved in the Hamiltonian and as a result the entanglement will be maintained. The realization will be leaned on trapped ions and the gate implementation requires an adiabatic transition from each spin product state to Fourier modes. The fidelity was numerically calculated and the results show important values. Finally, we discuss the acceleration of the gate by using the counter-driving field.

DOI
10.1088/1751-8121/acc8a2

Related papers

Two-qubit quantum gate and entanglement protected by circulant symmetry

Peter A. Ivanov, Nikolay V. Vitanov

We propose a method for the realization of the two-qubit quantum Fourier transform (QFT) using a Hamiltonian which possesses the circulant symmetry. Importantly, the eigenvectors of the circulant matrices are the Fourier modes and do not depend on the magnitude of the Hamiltonian elements as long as the circulant symmetry is preserved. The QFT implementation relies on the adiabatic transition from each of the spin product states to the respective quantum Fourier superposition states. We show that in ion traps one can obtain a Hamiltonian with the circulant symmetry by tuning the spin-spin interaction between the trapped ions. We present numerical results which demonstrate that very high fidelity can be obtained with realistic experimental resources. We also describe how the gate can be accelerated by using a "shortcut-to-adiabaticity" field.

arXiv:2001.09693•Scientific Reports•Mar 19, 2020•11 citations

Simplified implementation of the quantum Fourier transform with Ising-type Hamiltonians: Example with ion traps

Svetoslav S. Ivanov, M. Johanning, Christof Wunderlich

We propose a simplified mathematical construction of the quantum Fourier transform which is suited for systems described by Ising-type Hamiltonians. By contrast to the standard Cooley-Tuckey scheme, which prescribes sequences of CPHASE gates, our implementation is based on one-qubit gates and a free evolution process. We also show how to obtain a quadratic speed-up by applying the conditional interactions simultaneously. Thus rather than O($N^2$) our implementation time scales as O($N$). Finally, we show a realization of our method with homogeneous microwave driven ion traps in a magnetic field with gradient.

arXiv:1503.08806•Mar 30, 2015•5 citations

Design of quantum Fourier transforms and quantum algorithms by using circulant Hamiltonians

Boyan T. Torosov, Nikolay V. Vitanov

We propose a technique for design of quantum Fourier transforms, and ensuing quantum algorithms, in a single interaction step by engineered Hamiltonians of circulant symmetry. The method uses adiabatic evolution and is robust against fluctuations of the interaction parameters as long as the Hamiltonian retains a circulant symmetry.

arXiv:0910.1023•Physical Review A•Aug 21, 2009•8 citations

Implementation of the Semiclassical Quantum Fourier Transform in a Scalable System

John Chiaverini, J. Britton, Dietrich G. Leibfried +9 more

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.

Science•May 12, 2005•153 citations

Benchmarking logical three-qubit quantum Fourier transform encoded in the Steane code on a trapped-ion quantum computer

Karl Mayer, Ciarán Ryan-Anderson, Brown, Natalie +20 more

We implement logically encoded three-qubit circuits for the quantum Fourier transform (QFT), using the [[7,1,3]] Steane code, and benchmark the circuits on the Quantinuum H2-1 trapped-ion quantum computer. The circuits require multiple logical two-qubit gates, which are implemented transversally, as well as logical non-Clifford single-qubit rotations, which are performed by non-fault-tolerant state preparation followed by a teleportation gadget. First, we benchmark individual logical components using randomized benchmarking for the logical two-qubit gate, and a Ramsey-type experiment for the logical $T$ gate. We then implement the full QFT circuit, using two different methods for performing a logical control-$T$, and benchmark the circuits by applying it to each basis state in a set of bases that is sufficient to lower bound the process fidelity. We compare the logical QFT benchmark results to predictions based on the logical component benchmarks.

arXiv:2404.08616•Apr 12, 2024•57 citations

Implementation of a Walsh-Hadamard Gate in a Superconducting Qutrit

Muhammet Ali Yurtalan, Jiahao Shi, M. Kononenko +2 more

We have implemented a Walsh-Hadamard gate, which performs a quantum Fourier transform, in a superconducting qutrit. The qutrit is encoded in the lowest three energy levels of a capacitively shunted flux device, operated at the optimal flux-symmetry point. We use an efficient decomposition of the Walsh-Hadamard gate into two unitaries, generated by off-diagonal and diagonal Hamiltonians, respectively. The gate implementation utilizes simultaneous driving of all three transitions between the three pairs of energy levels of the qutrit, one of which is implemented with a two-photon process. The gate has a duration of 35 ns and an average fidelity over a representative set of states, including preparation and tomography errors, of 99.2%, characterized with quantum-state tomography. Compensation of ac-Stark and Bloch-Siegert shifts is essential for reaching high gate fidelities.

arXiv:2003.04879•Physical Review Letters•Oct 27, 2020•87 citations
Abstract Using the circulant symmetry of a Hamiltonian describing three qubits, we realize the quantum Fourier transform. This symmetry allows us to construct a set of eigenvectors independently on the magnitude of physical parameters involved in the Hamiltonian and as a result the entanglement will be maintained. The realization will be leaned on trapped ions and the gate implementation requires an adiabatic transition from each spin product state to Fourier modes. The fidelity was numerically calculated and the results show important values. Finally, we discuss the acceleration of the gate by using the counter-driving field.
We propose a method for the realization of the two-qubit quantum Fourier transform (QFT) using a Hamiltonian which possesses the circulant symmetry. Importantly, the eigenvectors of the circulant matrices are the Fourier modes and do not depend on the magnitude of the Hamiltonian elements as long as the circulant symmetry is preserved. The QFT implementation relies on the adiabatic transition from each of the spin product states to the respective quantum Fourier superposition states. We show that in ion traps one can obtain a Hamiltonian with the circulant symmetry by tuning the spin-spin interaction between the trapped ions. We present numerical results which demonstrate that very high fidelity can be obtained with realistic experimental resources. We also describe how the gate can be accelerated by using a "shortcut-to-adiabaticity" field.
We propose a simplified mathematical construction of the quantum Fourier transform which is suited for systems described by Ising-type Hamiltonians. By contrast to the standard Cooley-Tuckey scheme, which prescribes sequences of CPHASE gates, our implementation is based on one-qubit gates and a free evolution process. We also show how to obtain a quadratic speed-up by applying the conditional interactions simultaneously. Thus rather than O(N2N^2N2) our implementation time scales as O(NNN). Finally, we show a realization of our method with homogeneous microwave driven ion traps in a magnetic field with gradient.
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.
We implement logically encoded three-qubit circuits for the quantum Fourier transform (QFT), using the [[7,1,3]] Steane code, and benchmark the circuits on the Quantinuum H2-1 trapped-ion quantum computer. The circuits require multiple logical two-qubit gates, which are implemented transversally, as well as logical non-Clifford single-qubit rotations, which are performed by non-fault-tolerant state preparation followed by a teleportation gadget. First, we benchmark individual logical components using randomized benchmarking for the logical two-qubit gate, and a Ramsey-type experiment for the logical TTT gate. We then implement the full QFT circuit, using two different methods for performing a logical control-TTT, and benchmark the circuits by applying it to each basis state in a set of bases that is sufficient to lower bound the process fidelity. We compare the logical QFT benchmark results to predictions based on the logical component benchmarks.
We have implemented a Walsh-Hadamard gate, which performs a quantum Fourier transform, in a superconducting qutrit. The qutrit is encoded in the lowest three energy levels of a capacitively shunted flux device, operated at the optimal flux-symmetry point. We use an efficient decomposition of the Walsh-Hadamard gate into two unitaries, generated by off-diagonal and diagonal Hamiltonians, respectively. The gate implementation utilizes simultaneous driving of all three transitions between the three pairs of energy levels of the qutrit, one of which is implemented with a two-photon process. The gate has a duration of 35 ns and an average fidelity over a representative set of states, including preparation and tomography errors, of 99.2%, characterized with quantum-state tomography. Compensation of ac-Stark and Bloch-Siegert shifts is essential for reaching high gate fidelities.