|
|
Realization of quantum Fourier transform over ZN |
Fu Xiang-Qun (付向群), Bao Wan-Su (鲍皖苏), Li Fa-Da (李发达), Zhang Yu-Chao (张宇超) |
Information Engineering University, Zhengzhou 450004, China |
|
|
Abstract Since the difficulty in preparing the equal superposition state of amplitude is 1/√N, we construct a quantile transform of quantum Fourier transform (QFT) over ZN based on the elementary transforms, such as Hadamard transform and Pauli transform. The QFT over ZN can then be realized by the quantile transform, and used to further design its quantum circuit and analyze the requirements for the quantum register and quantum gates. However, the transform needs considerable quantum computational resources and it is difficult to construct a high-dimensional quantum register. Hence, we investigate the design of t-bit quantile transform, and introduce the definition of t-bit semiclassical QFT over ZN. According to probability amplitude, we prove that the transform can be used to realize QFT over ZN and further design its quantum circuit. For this transform, the requirements for the quantum register, the one-qubit gate, and two-qubit gate reduce obviously when compared with those for the QFT over ZN.
|
Received: 21 April 2013
Revised: 04 July 2013
Accepted manuscript online:
|
PACS:
|
03.67.Lx
|
(Quantum computation architectures and implementations)
|
|
03.65.Sq
|
(Semiclassical theories and applications)
|
|
03.65.Ta
|
(Foundations of quantum mechanics; measurement theory)
|
|
03.67.-a
|
(Quantum information)
|
|
Fund: Project supported by the National Basic Research Program of China (Grant No. 2013CB338002). |
Corresponding Authors:
Bao Wan-Su
E-mail: 2010thzz@sina.com
|
About author: 03.67.Lx; 03.65.Sq; 03.65.Ta; 03.67.-a |
Cite this article:
Fu Xiang-Qun (付向群), Bao Wan-Su (鲍皖苏), Li Fa-Da (李发达), Zhang Yu-Chao (张宇超) Realization of quantum Fourier transform over ZN 2014 Chin. Phys. B 23 020306
|
[1] |
Shor P W 1997 SIAM Journal on Computing 26 1484
|
[2] |
Grover L K 1996 Proceeding of the 28th ACM Symposium on Theory of Computation, 2002, May 22–24, New York, USA
|
[3] |
Zheng S B 2005 Chin. Phys. 14 11
|
[4] |
Zhong P C and Bao W S 2008 Chin. Phys. Lett. 25 8
|
[5] |
Zhou N R and Zeng G H 2005 Chin. Phys. 14 11
|
[6] |
Hallgren S 2002 Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002, May 19–21, Montreal, Canada
|
[7] |
Proos J and Zalka C 2003 Quantum Information & Computation 3 4
|
[8] |
Li J, Peng X, Du J and Suter D 2012 Nature Sci. Rep. 2 260
|
[9] |
Nielsen M A and Chuang I L 2000 Quantum Computation and Quantum Information (London: Cambridge University Press) Chap. 5, p. 216
|
[10] |
Griffiths R B and Niu C S 1996 Phys. Rev. Lett. 76 3228
|
[11] |
Chiaverini J, Britton J, Leibfried D, Knill E, Barrett M D, Blakestad R B, Itano W M, Jost J D, Langer C, Ozeri R, Schaetz T and Wineland D J 2005 Science 308 997
|
[12] |
Fu X Q, Bao W S, Zhou C and Song Z 2012 Chin. Sci. Bull. 57 1
|
No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|