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:0910.1023 · Physical Review A

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

Boyan T. Torosov, Nikolay V. Vitanov

Published Aug 21, 2009• 8 citations
arXivHTMLPDF

Abstract

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.
DOI
10.1103/physreva.80.022329

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

Implementing quantum Fourier transform using three qubits

Mouhcine Yachi, Radouan Hab‐arrih, Ahmed Jellal

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.

arXiv:2110.15067•Journal of Physics A Mathematical and Theoretical•Mar 29, 2023•4 citations

Symmetry-protected creation of superposition states and entanglement using circulant Hamiltonians

Razmik G. Unanyan, Bruce W. Shore, Michael Fleischhauer +1 more

We describe the use of a special interaction symmetry for the robust generation of the totally symmetric superposition state or entangled state of an $N$-state system. The required symmetry of the Hamiltonian is that of a circulant matrix. Such a matrix has the important property that its eigenstates are independent of the matrix elements as long as the circulant symmetry is maintained. One of the eigenvectors is the target superposition. By inducing a slow evolution of the Hamiltonian into the circulant form, adiabatic following will generate the desired superposition out of a convenient initial state such as a product state. The creation process is robust: it is insensitive to details of the interaction as long as the final Hamiltonian has the required symmetry. We illustrate the procedure with a simple example: a ring of quantum wells that permit interwell tunneling, into which a single atom is placed. By carrying out adiabatic evolution the state vector approaches an equal distribution of probability amplitudes in each well.

Physical Review A•Feb 6, 2007•3 citations

Numerical Engineering of Adiabatic Quantum Operations

Seyed Sahand Tabatabaei

Adiabatic quantum operations are ubiquitous in fields such as quantum information processing, quantum control, and magnetic resonance, where their high fidelity and general robustness renders them an essential tool for various applications. This inherent robustness due to adiabaticity can, however, be impaired in cases where the experimental conditions strictly require very fast evolution times. In this thesis, we provide a gradient-based numerical optimization protocol for efficiently engineering adiabatic operations, allowing for the systematic inclusion of robustness criteria against various experimental non-idealities, including inhomogeneities and uncertainties in system parameters, as well as perturbations in the Hamiltonian such as spin-spin interactions. \nThe protocol is implemented in the context of adiabatic passages for magnetic resonance, and \nit is shown that in addition to conventional adiabatic pulses, it can also generate exceptionally fast operations that although slightly deviate from adiabaticity in limited instances, still lead to a high fidelity. \nThe effectiveness of our method for addressing perturbations is also demonstrated by designing a fast adiabatic passage for dipolar-coupled electrons, and numerically comparing its performance with a pulse without such considerations.

•Jan 23, 2020•0 citations

Quantum Fourier Transform in a Decoherence-Free Subspace

Jianwu Wu, Chunwen Li, Re-Bing Wu

Quantum Fourier transform is of primary importance in many quantum algorithms. In order to eliminate the destructive effects of decoherence induced by couplings between the quantum system and its environment, we propose a robust scheme for quantum Fourier transform over the intrinsic decoherence-free subspaces. The scheme is then applied to the circuit design of quantum Fourier transform over quantum networks under collective decoherence. The encoding efficiency and possible improvements are also discussed.

arXiv:quant-ph/0409122•Sep 19, 2004•1 citation

Optimal Hamiltonian Simulation by Quantum Signal Processing

Guang Hao Low, Isaac L. Chuang

The physics of quantum mechanics is the inspiration for, and underlies, quantum computation. As such, one expects physical intuition to be highly influential in the understanding and design of many quantum algorithms, particularly simulation of physical systems. Surprisingly, this has been challenging, with current Hamiltonian simulation algorithms remaining abstract and often the result of sophisticated but unintuitive constructions. We contend that physical intuition can lead to optimal simulation methods by showing that a focus on simple single-qubit rotations elegantly furnishes an optimal algorithm for Hamiltonian simulation, a universal problem that encapsulates all the power of quantum computation. Specifically, we show that the query complexity of implementing time evolution by a d-sparse Hamiltonian H[over ^] for time-interval t with error ε is O[td∥H[over ^]∥_{max}+log(1/ε)/loglog(1/ε)], which matches lower bounds in all parameters. This connection is made through general three-step "quantum signal processing" methodology, comprised of (i) transducing eigenvalues of H[over ^] into a single ancilla qubit, (ii) transforming these eigenvalues through an optimal-length sequence of single-qubit rotations, and (iii) projecting this ancilla with near unity success probability.

arXiv:1606.02685•Physical Review Letters•Jan 5, 2017•970 citations
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.
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 describe the use of a special interaction symmetry for the robust generation of the totally symmetric superposition state or entangled state of an NNN-state system. The required symmetry of the Hamiltonian is that of a circulant matrix. Such a matrix has the important property that its eigenstates are independent of the matrix elements as long as the circulant symmetry is maintained. One of the eigenvectors is the target superposition. By inducing a slow evolution of the Hamiltonian into the circulant form, adiabatic following will generate the desired superposition out of a convenient initial state such as a product state. The creation process is robust: it is insensitive to details of the interaction as long as the final Hamiltonian has the required symmetry. We illustrate the procedure with a simple example: a ring of quantum wells that permit interwell tunneling, into which a single atom is placed. By carrying out adiabatic evolution the state vector approaches an equal distribution of probability amplitudes in each well.
Adiabatic quantum operations are ubiquitous in fields such as quantum information processing, quantum control, and magnetic resonance, where their high fidelity and general robustness renders them an essential tool for various applications. This inherent robustness due to adiabaticity can, however, be impaired in cases where the experimental conditions strictly require very fast evolution times. In this thesis, we provide a gradient-based numerical optimization protocol for efficiently engineering adiabatic operations, allowing for the systematic inclusion of robustness criteria against various experimental non-idealities, including inhomogeneities and uncertainties in system parameters, as well as perturbations in the Hamiltonian such as spin-spin interactions. \nThe protocol is implemented in the context of adiabatic passages for magnetic resonance, and \nit is shown that in addition to conventional adiabatic pulses, it can also generate exceptionally fast operations that although slightly deviate from adiabaticity in limited instances, still lead to a high fidelity. \nThe effectiveness of our method for addressing perturbations is also demonstrated by designing a fast adiabatic passage for dipolar-coupled electrons, and numerically comparing its performance with a pulse without such considerations.
Quantum Fourier transform is of primary importance in many quantum algorithms. In order to eliminate the destructive effects of decoherence induced by couplings between the quantum system and its environment, we propose a robust scheme for quantum Fourier transform over the intrinsic decoherence-free subspaces. The scheme is then applied to the circuit design of quantum Fourier transform over quantum networks under collective decoherence. The encoding efficiency and possible improvements are also discussed.
The physics of quantum mechanics is the inspiration for, and underlies, quantum computation. As such, one expects physical intuition to be highly influential in the understanding and design of many quantum algorithms, particularly simulation of physical systems. Surprisingly, this has been challenging, with current Hamiltonian simulation algorithms remaining abstract and often the result of sophisticated but unintuitive constructions. We contend that physical intuition can lead to optimal simulation methods by showing that a focus on simple single-qubit rotations elegantly furnishes an optimal algorithm for Hamiltonian simulation, a universal problem that encapsulates all the power of quantum computation. Specifically, we show that the query complexity of implementing time evolution by a d-sparse Hamiltonian H[over ^] for time-interval t with error ε is O[td∥H[over ^]∥_{max}+log(1/ε)/loglog(1/ε)], which matches lower bounds in all parameters. This connection is made through general three-step "quantum signal processing" methodology, comprised of (i) transducing eigenvalues of H[over ^] into a single ancilla qubit, (ii) transforming these eigenvalues through an optimal-length sequence of single-qubit rotations, and (iii) projecting this ancilla with near unity success probability.