Design of quantum Fourier transforms and quantum algorithms by using circulant Hamiltonians
From MaRDI portal
Publication:4903102
DOI10.1103/PhysRevA.80.022329zbMath1255.81214arXiv0910.1023OpenAlexW2012967667MaRDI QIDQ4903102
Boyan T. Torosov, N. V. Vitanov
Publication date: 19 January 2013
Published in: Physical Review A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0910.1023
Related Items (2)
On invariant subspace in quantum control systems and some concepts of integrable quantum systems ⋮ Two-state behavior inN-state quantum systems: The Morris–Shore transformation reviewed
Cites Work
- Unnamed Item
- The universality of the quantum Fourier transform in forming the basis of quantum computing algorithms
- Implementation of the Semiclassical Quantum Fourier Transform in a Scalable System
- Rapid solution of problems by quantum computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum algorithms and the Fourier transform
- On the Power of Quantum Computation
- Quantum fast Fourier transform using multilevel atoms
- An Algorithm for the Machine Calculation of Complex Fourier Series
This page was built for publication: Design of quantum Fourier transforms and quantum algorithms by using circulant Hamiltonians
