t-bit semiclassical quantum Fourier transform

查看全文 作　　者：FU [1]XiangQun;BAO [1]WanSu;ZHOU [1]Chun;SONG [1]Zhen

机构地区：[1]Institute of Electronic Technology,The PLA Information Engineering University,Zhengzhou 450004,China

出　　处：《Chinese Science Bulletin》索引2012年第57卷第1期,共6页

摘　　要：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. 关键词：量子寄存器傅里叶变换量子电路分解算法量子比特执行情况计算资源 QFT

相关文献

参考文献（20）
引证文献（5）
耦合文献（73）

参考文献(20)

引证文献(5)

耦合文献(73)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

t-bit semiclassical quantum Fourier transform

参考文献(20)

引证文献(5)

耦合文献(73)

用户提示