Design of quantum Fourier transforms and quantum algorithms by using circulant Hamiltonians
From MaRDI portal
(Redirected from Publication:4903102)
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.
Recommendations
Cites work
- An Algorithm for the Machine Calculation of Complex Fourier Series
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- Implementation of the semiclassical quantum Fourier transform in a scalable system
- On the Power of Quantum Computation
- Quantum algorithms and the Fourier transform
- Quantum fast Fourier transform using multilevel atoms
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Rapid solution of problems by quantum computation
- The universality of the quantum Fourier transform in forming the basis of quantum computing algorithms
Cited in
(7)- Quantum Fourier transform in computational basis
- On invariant subspace in quantum control systems and some concepts of integrable quantum systems
- Two-state behavior in N-state quantum systems: the Morris-Shore transformation reviewed
- QUANTUM SOFTWARE REUSABILITY
- Implementation of Quantum Fourier Transform and Its Applications via Quantum-Dot Spins and Microcavity
- Implementing quantum Fourier transform using three qubits
- An alternative formulation of the quantum phase estimation using projection-based tensor decompositions
This page was built for publication: Design of quantum Fourier transforms and quantum algorithms by using circulant Hamiltonians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903102)
