Design of quantum Fourier transforms and quantum algorithms by using circulant Hamiltonians
arXiv:0910.1023 · doi:10.1103/PhysRevA.80.022329
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.
5 pages, 3 figures
References in corpus (12)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
- Semiclassical Fourier Transform for Quantum Computation
- Experimental demonstration of Shor's algorithm with quantum entanglement
- Implementation of the Quantum Fourier Transform
- Demonstration of Shor's quantum factoring algorithm using photonic qubits
- Efficient Networks for Quantum Factoring
- Approximate Quantum Fourier Transform and Decoherence
- A Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation
- Experimental Realization of an Order-Finding Algorithm with an NMR Quantum Computer
- Quantum Algorithms and the Fourier Transform
- Quantum fast Fourier transform using multilevel atoms