Abstract
Because of the difficulty of building a high-dimensional quantum register, this paper presents an implementation of the high-dimensional quantum Fourier transform (QFT) based on a low-dimensional quantum register. First, we define the t-bit semiclassical quantum Fourier transform. In terms of probability amplitude, we prove that the transform can realize quantum Fourier transformation, illustrate that the requirement for the two-qubit gate reduces obviously, and further design a quantum circuit of the transform. Combining the classical fixed-window method and the implementation of Shor’s quantum factorization algorithm, we then redesign a circuit for Shor’s algorithm, whose required computation resource is approximately equal to that of Parker’s. The requirement for elementary quantum gates for Parker’s algorithm is O(⌈ log N⌉3, and the quantum register for our circuit requires t−1 more dimensions than Parker’s. However, our circuit is t 2 times as fast as Parker’s, where t is the width of the window.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Shor P W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput, 1997, 26: 1484–1509
Grover L K. A fast quantum mechanics algorithm for database search. In: Proceeding of the 28th ACM Symposium on Theory of Computation. New York: ACM Press, 1996. 212–219
Long G L, Xiao L. Parallel quantum computing in a single ensemble quantum computer. Phys Rev A, 2004, 69: 052303
Zhong P C, Bao W S. Quantum mechanical meet-in-the-middle search algorithm for triple-DES. Chin Sci Bull, 2010, 55: 321–325
Gao F, Guo F Z, Wen Q Y, et al. Revisiting the security of quantum dialogue and bidirectional quantum secure direct communication. Sci China Ser G-Phys Mech Astron, 2008, 51: 559–566
Chen W, Han Z F, Mo X F, et al. Active phase compensation of quantum key distribution system. Chin Sci Bull, 2008, 53: 1310–1314
Fang X M, Zhu X W, Hong M, et al. Realization of quantum discrete Fourier transform with NMR. Chin Sci Bull, 2000, 45: 1071–1075
He Y G, Sun J G. Complete quantum circuit of HAAR wavelet based MRA. Chin Sci Bull, 2005, 50: 1796–1798
Cao Y, Peng S G, Zgeng C, et al. Quantum Fourier transform and phase estimation in qudit system. Commun Theor Phys, 2011, 55: 790–794
Wang X, Bao W S, Fu X Q. A quantum algorithm for searching a target solution of fixed weight. Chin Sci Bull, 2011, 56: 484–488
Zhou C, Bao W S, Fu X Q. Decoy-state quantum key distribution for the heralded pair coherent state photon source with intensity fluctuations. Sci China Inf Sci, 2010, 53: 2485–2494
Lieven M K V, Matthias S, Gregory B, et al. Experimental realization of Shor’s quantum factorization algorithm using nuclear magnetic resonance. Nature, 2001, 414: 883–887
Vedral V, Barenco A, Ekert A. Quantum networks for elementary arithemetic operations. Phys Rev A, 1996, 54: 147–153
Beckman D, Chari A N, Devabhaktuni S, et al. Efficient networks for quantum factoring. Phys Rev A, 1996, 54:1034–1063
Zalka C. Fast versions of Shor’s quantum factoring algorithm. Arxiv: quant-ph/9806084v1, 1998
Nielsen M A, Chuang I L. Quantum Computation and Quantum Information. London: Cambridge University Press, 2000
Griffiths R B, Niu C S. Semiclassical Fourier transform for quantum computation. Phys Rev Lett. 1996,76: 3228–3232
Parker S, Plenio M B. Efficient factorization with a single pure qubit and logN mixed qubits. Phys Rev Lett, 2000, 85: 3048–3052
Fu X Q, Bao W S, Zhou C. Speeding up implementation for Shor’s factorization quantum algorithm. Chin Sci Bull, 2010, 55: 3648–3653
Kenji K, Yukio T. Speeding up elliptic cryptosystems using a signed binary window method. In: Proceeding of the 12th Annual International Cryptology Conference on Advances in Cryptology. Berlin: Springer-Verlag, 1993. 345–357
Author information
Authors and Affiliations
Corresponding author
Additional information
This article is published with open access at Springerlink.com
Rights and permissions
This article is published under an open access license. Please check the 'Copyright Information' section either on this page or in the PDF for details of this license and what re-use is permitted. If your intended use exceeds what is permitted by the license or if you are unable to locate the licence and re-use information, please contact the Rights and Permissions team.
About this article
Cite this article
Fu, X., Bao, W., Zhou, C. et al. t-bit semiclassical quantum Fourier transform. Chin. Sci. Bull. 57, 119–124 (2012). https://doi.org/10.1007/s11434-011-4692-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11434-011-4692-8