Improving Emulation of Quantum Algorithms using Space-Efficient Hardware Architectures

被引:0
|
作者
Mahmud, Naveed [1 ]
El-Araby, Esam [1 ]
机构
[1] Univ Kansas, Elect Engn & Comp Sci, Lawrence, KS 66045 USA
关键词
Quantum Computing Emulation; Field-Programmable-Gate-Arrays;
D O I
10.1109/ASAP.2019.000-1
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
With rapid advancement in quantum computing technology, continuous efforts are being directed to simulation and emulation of quantum algorithms on classical platforms. A well-known limitation to classical emulation of quantum circuits is scalability. Existing hardware emulators implement gate-based circuit models of quantum circuits that result in heavy resource utilization and degrade the scalability of the system. Also, current quantum emulation hardware use fixed-point arithmetic, which has an adverse effect on accuracy when the system is scaled up. In this work, we employ a complex-multiply-and-accumulate (CMAC) and lookup-based emulation approach that greatly reduces resource utilization and improves system scalability in terms of number of emulated qubits. We demonstrate emulation of up to 16 fully-entangled qubits which is highest among existing work. We design fully-pipelined, high-throughput hardware architectures that use floating-point precision for higher accuracy. Experimental evaluation and analysis of the architectures in terms of speed and area is also provided. The emulator is prototyped on a high-performance reconfigurable computing (HPRC) system and our results demonstrate quantitative improvement over existing Field-Programmable-Gate-Array (FPGA)-based hardware emulators.
引用
收藏
页码:206 / 213
页数:8
相关论文
共 50 条
  • [31] ON SPACE-EFFICIENT ALGORITHMS FOR CERTAIN NP-COMPLETE PROBLEMS
    FERREIRA, A
    [J]. THEORETICAL COMPUTER SCIENCE, 1993, 120 (02) : 311 - 315
  • [32] Space-efficient algorithms for approximating polygonal curves in two-dimensional space
    Chen, DZ
    Daescu, O
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 2003, 13 (02) : 95 - 111
  • [33] Space-efficient approximation algorithms for MAXCUT and COLORING semidefinite programs
    Klein, PN
    Lu, HI
    [J]. ALGORITHMS AND COMPUTATIONS, 1998, 1533 : 387 - 396
  • [34] TIME-EFFICIENT AND SPACE-EFFICIENT ALGORITHMS FOR LEAST MEDIAN OF SQUARES REGRESSION
    SOUVAINE, DL
    STEELE, JM
    [J]. JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1987, 82 (399) : 794 - 801
  • [35] Quantum Optimization for the Graph Coloring Problem with Space-Efficient Embedding
    Tabi, Zsolt
    El-Safty, Kareem H.
    Kallus, Zsofia
    Haga, Peter
    Kozsik, Tamas
    Glos, Adam
    Zimboras, Zoltan
    [J]. IEEE INTERNATIONAL CONFERENCE ON QUANTUM COMPUTING AND ENGINEERING (QCE20), 2020, : 56 - 62
  • [36] Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
    Aravind, Alex A.
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2013, 73 (08) : 1029 - 1038
  • [37] Space-Efficient and Output-Sensitive Implementations of Greedy Algorithms on Intervals
    Saitoh, Toshiki
    Kirkpatrick, David G.
    [J]. WALCOM: ALGORITHMS AND COMPUTATION, WALCOM 2017, 2017, 10167 : 320 - 332
  • [38] Faster Space-Efficient Algorithms for Subset Sum and k-Sum
    Bansal, Nikhil
    Garg, Shashwat
    Nederlof, Jesper
    Vyas, Nikhil
    [J]. STOC'17: PROCEEDINGS OF THE 49TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2017, : 198 - 209
  • [39] New space-efficient quantum algorithm for binary elliptic curves using the optimized division algorithm
    Kim, Hyeonhak
    Hong, Seokhie
    [J]. QUANTUM INFORMATION PROCESSING, 2023, 22 (06)
  • [40] New space-efficient quantum algorithm for binary elliptic curves using the optimized division algorithm
    Hyeonhak Kim
    Seokhie Hong
    [J]. Quantum Information Processing, 22