Optimizing Quantum Circuits for Modular Exponentiation

被引:0
作者
Das, Rakesh [1 ]
Chattopadhyay, Anupam [2 ]
Rahaman, Hafizur [1 ]
机构
[1] Indian Inst Engn Sci & Technol, Dept Informat Technol, Sibpur 711103, India
[2] Nanyang Technol Univ, Sch Comp Sci & Engn, Singapore 639798, Singapore
来源
2019 32ND INTERNATIONAL CONFERENCE ON VLSI DESIGN AND 2019 18TH INTERNATIONAL CONFERENCE ON EMBEDDED SYSTEMS (VLSID) | 2019年
关键词
Quantum Algorithm(QA); Modular Exponentiation; Quantum Error Correcting Codes (QECC); Linear Nearest Neighbor (LNN);
D O I
10.1109/VLSID.2019.00088
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Today's rapid progress in the physical implementation of quantum computers demands scalable synthesis methods to map practical logic designs to quantum architectures. There exist many quantum algorithms which use classical functions with superposition of states. Motivated by recent trends, in this paper, we show the design of quantum circuit to perform modular exponentiation functions using two different approaches. In the design phase, first we generate quantum circuit from a verilog implementation of exponentiation functions using synthesis tools and then apply two different Quantum Error Correction techniques. Finally the circuit is further optimized using the Linear Nearest Neighbor (LNN) Property. We demonstrate the effectiveness of our approach by generating a set of networks for the reversible modular exponentiation function for a set of input values. At the end of the work, we have summarized the obtained results, where a cost analysis over our developed approaches has been made. Experimental results show that depending on the choice of different QECC methods the performance figures can vary by up to 11%, 10%, 8% in T-count, number of qubits, number of gates respectively.
引用
收藏
页码:407 / 412
页数:6
相关论文
共 20 条
[1]   Polynomial-Time T-Depth Optimization of Clifford plus T Circuits Via Matroid Partitioning [J].
Amy, Matthew ;
Maslov, Dmitri ;
Mosca, Michele .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2014, 33 (10) :1476-1489
[2]  
[Anonymous], ARXIV180702023
[3]  
[Anonymous], 2012, ARXIV12026614
[4]  
[Anonymous], ARXIV12070511
[5]  
[Anonymous], 2015, ARXIV151108253
[6]  
[Anonymous], ARXIV180502342
[7]  
[Anonymous], INT C REV COMP
[8]   LOGICAL REVERSIBILITY OF COMPUTATION [J].
BENNETT, CH .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1973, 17 (06) :525-532
[9]  
Brayton R, 2010, LECT NOTES COMPUT SC, V6174, P24, DOI 10.1007/978-3-642-14295-6_5
[10]  
Draper T.G., 2000, QUANTPH0008033 ARXIV