期刊文献+

t-bit semiclassical quantum Fourier transform 被引量:5

t-bit semiclassical quantum Fourier transform
原文传递
导出
摘要 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 semi- classical 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 3 O (logN),and the quantum register for our circuit re- quires t-1 more dimensions than Parker's.However,our circuit is t2 times as fast as Parker's,where t is the width of the window. 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 t2 times as fast as Parker's, where t is the width of the window.
出处 《Chinese Science Bulletin》 SCIE CAS 2012年第1期119-124,共6页
关键词 量子寄存器 傅里叶变换 量子电路 分解算法 量子比特 执行情况 计算资源 QFT semiclassical quantum Fourier transform, Shor's quantum algorithm, window method
作者简介 Corresponding author:BAO WanSu,email:2010thzz@sina.com.
  • 相关文献

参考文献9

二级参考文献68

共引文献72

同被引文献32

  • 1HAO Liang1,LIU Dan2 & LONG GuiLu1,3 1Key Laboratory for Atomic and Molecular NanoSciences and Department of Physics,Tsinghua University,Beijing 100084,China,2School of Sciences,Dalian Nationalities University,Dalian 116600,China,3Tsinghua National Laboratory for Information Science and Technology,Beijing 100084,China.An N/4 fixed-point duality quantum search algorithm[J].Science China(Physics,Mechanics & Astronomy),2010,53(9):1765-1768. 被引量:8
  • 2HAO Liang1, LI JunLin1 & LONG GuiLu1,2 1Key Laboratory for Atomic and Molecular NanoSciences and Department of Physics, Tsinghua University, Beijing 100084, China,2Tsinghua National Laboratory for Information Science and Technology, Beijing 100084, China.Eavesdropping in a quantum secret sharing protocol based on Grover algorithm and its solution[J].Science China(Physics,Mechanics & Astronomy),2010,53(3):491-495. 被引量:20
  • 3潘承洞,潘承彪.初等数论[M].第2版.北京:北京大学出版社,2003.
  • 4Diffie W and Heilman M E. New directions on cryptography[J]. IEEE Transactions on Information Theory, 1976,IT-22(6): 644-654.
  • 5Shor P W. Polynomial-time algorithms for primefactorization and discrete logarithms on a quantum computer[J]. SIAM Journal on Computing, 1997, 26(5): 1484-1509.
  • 6Grover L K. A fast quantum mechanics algorithm fordatabase search [C]. Proceedings of the Twenty-EighthAnnual ACM Symposium on the Theory of computing,Philadelphia, 1996: 212-219.
  • 7Ajtai M. Generating hard instances of lattice problems[C].Proceedings of the Twenty-Eighth Annual ACM Symposiumon the Theory of Computing, Philadelphia, 1996: 1-32.
  • 8Menezes A J, Oorschot P C V, and Vanstone S A. Handbookof Applied Cryptography[M]. Canda: CRC Press LLC, 1997:103-104.
  • 9Gordon D M. Discrete Logarithms in GF(P) using thenumber field sieve[J]. SIAM Journal on Discrete Mathematics,1993,6(1): 124-138.
  • 10Hallgren S. Polynomial-time Quantum algorithm for Pell,sequation and the principal Ideal problem[C]. Proceedings ofthe 34th Annual ACM Symposium on Theory ofComputation, New York, 2002: 653-658.

引证文献5

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部