EFFICIENT IMPLEMENTATIONS OF THE QUANTUM FOURIER TRANSFORM: AN EXPERIMENTAL PERSPECTIVE
From MaRDI portal
Publication:5696628
DOI10.1142/S0219749905000967zbMath1075.81016arXivquant-ph/0211030OpenAlexW2963576964WikidataQ62577093 ScholiaQ62577093MaRDI QIDQ5696628
Publication date: 18 October 2005
Published in: International Journal of Quantum Information (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0211030
Related Items (4)
Gate-based circuit designs for quantum adder-inspired quantum random walks on superconducting qubits ⋮ NMR quantum information processing: Indian contributions and perspectives ⋮ Quantum state transfer: interplay between gate and readout errors ⋮ NMR Quantum Computing
Cites Work
- Bulk Spin-Resonance Quantum Computation
- Quantum algorithms and the Fourier transform
- Quantum algorithms revisited
- Bulk quantum computation with nuclear magnetic resonance: theory and experiment
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Explicitly solvable extremals of time optimal control for 2-level quantum systems
This page was built for publication: EFFICIENT IMPLEMENTATIONS OF THE QUANTUM FOURIER TRANSFORM: AN EXPERIMENTAL PERSPECTIVE