Eight Bit Quantum Fourier Transform Using the FDTD Method

被引:1
|
作者
Houle, Jennifer [1 ]
Sullivan, Dennis [1 ]
机构
[1] Univ Idaho, Moscow, ID 83843 USA
来源
2021 IEEE WORKSHOP ON MICROELECTRONICS AND ELECTRON DEVICES (WMED) | 2021年
关键词
Computer simulation; Finite difference methods; Quantum computing; TIME-DOMAIN SIMULATION; EIGENFUNCTIONS;
D O I
10.1109/WMED49473.2021.9425066
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A way of using the Finite Difference Time Domain method is described to simulate the Quantum Fourier Transform, which is an essential component of Shor's factoring algorithm. This simulation is based on the direct implementation of the time-dependent Schrodinger equation in one dimension. Each bit is simulated as an electron in a harmonic oscillator. The behavior of each quantum gate is simulated by applying a magnetic field in specific orientations for set amounts of time based on the amount of time the electron requires to precess. By using a combination of these quantum gates, it is possible to simulate the behavior of the full Quantum Fourier Transform. An eight bit Quantum Fourier Transform was simulated for this work, but it could easily be expanded to reach higher numbers of bits. Results were compared with computational results and shown to match. Simulations were done in Python without requiring significant computational power.
引用
收藏
页码:1 / 5
页数:5
相关论文
共 50 条
  • [21] Scaling and better approximating quantum Fourier transform by higher radices
    Zilic, Zeljko
    Radecka, Katarzyna
    IEEE TRANSACTIONS ON COMPUTERS, 2007, 56 (02) : 202 - 207
  • [22] New look on quantum representation of images: Fourier transform representation
    Grigoryan, Artyom M.
    Agaian, Sos S.
    QUANTUM INFORMATION PROCESSING, 2020, 19 (05)
  • [23] Representation-theoretical properties of the approximate quantum Fourier transform
    Roetteler, Martin
    Beth, Thomas
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2008, 19 (03) : 177 - 193
  • [24] A Scalable Emulator for Quantum Fourier Transform Using Multiple-FPGAs with High-Bandwidth-Memory
    Waidyasooriya, Hasitha Muthumala
    Oshiyama, Hiroki
    Kurebayashi, Yuya
    Hariyama, Masanori
    Ohzeki, Masayuki
    IEEE ACCESS, 2022, 10 : 65103 - 65117
  • [25] Obtaining the Quantum Fourier Transform from the classical FFT with QR decomposition
    Marquezino, F. L.
    Portugal, R.
    Sasse, F. D.
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2010, 235 (01) : 74 - 81
  • [26] A PARTIAL FOURIER TRANSFORM METHOD FOR A CLASS OF HYPOELLIPTIC KOLMOGOROV EQUATIONS
    Reisinger, Christoph
    Suli, Endre
    Whitley, Alan
    SIAM JOURNAL ON NUMERICAL ANALYSIS, 2017, 55 (04) : 1867 - 1891
  • [27] Three-Qubit Implementation of Quantum Fourier Transform for Shor's Algorithm
    Trivedi, Deepanshu
    Saharia, Ankur
    Choure, Kamalkishor
    Tiwari, Manish
    Maddila, Ravi Kumar
    Singh, Ghanshyam
    OPTICAL AND WIRELESS TECHNOLOGIES, OWT 2020, 2022, 771 : 115 - 121
  • [28] Paired quantum Fourier transform with log2N Hadamard gates
    Artyom M. Grigoryan
    Sos S. Agaian
    Quantum Information Processing, 2019, 18
  • [29] Paired quantum Fourier transform with log2N Hadamard gates
    Grigoryan, Artyom M.
    Agaian, Sos S.
    QUANTUM INFORMATION PROCESSING, 2019, 18 (07)
  • [30] Robust Inverse Quantum Fourier Transform Inspired Algorithm for Unsupervised Image Segmentation
    Akinola, Taoreed A.
    Li, Xiangfang
    Wilkins, Richard
    Obiomon, Pamela H.
    Qian, Lijun
    IEEE ACCESS, 2024, 12 : 99029 - 99044