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

2009/08/21 by Boyan T. Torosov, B. T. Torosov, Nikolay V. Vitanov +1
Computer Science · Physics and Astronomy · #Neural Networks and Reservoir Computing #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #quant-ph

paper · pdf · doi:10.1103/physreva.80.022329

published as Phys. Rev. A 80, 022329 (2009) · 5 pages, 3 figures

openalex publication_date 2009/08/21 · arxiv created 2009/10/06 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Experimental Demonstration of a Compiled Version of Shor’s Algorithm with Quantum Entanglement
• On the Power of Quantum Computation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer