量子门级三门模板可逆电路的优化

Pyreddy Mary Arpita, K. Datta, R. Vemula, I. Sengupta
{"title":"量子门级三门模板可逆电路的优化","authors":"Pyreddy Mary Arpita, K. Datta, R. Vemula, I. Sengupta","doi":"10.1109/EDCAV.2015.7060551","DOIUrl":null,"url":null,"abstract":"The paper presents an approach for optimizing a reversible netlist consisting of multiple-control Toffoli (MCT) gates with the objective of reducing quantum cost. The MCT gates are first decomposed into smaller gates with up to three control lines, and then a template matching method is applied on the netlist for optimization. The templates are constructed by considering all possible 3-gate sequences with up to four lines. This work constitutes an extension of a previous work by Dueck et al., where 2-gate sequences were considered in the templates. The input gate netlists are generated from the reversible benchmarks available in RevLib, followed by Barenco decomposition to produce Toffoli gates with at most three control connections. The proposed approach is applied on these netlists, and the final quantum cost calculated. Experimental results on standard benchmarks show that the method can lead to reductions in quantum cost.","PeriodicalId":277103,"journal":{"name":"2015 International Conference on Electronic Design, Computer Networks & Automated Verification (EDCAV)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Optimization of reversible circuits using triple-gate templates at quantum gate level\",\"authors\":\"Pyreddy Mary Arpita, K. Datta, R. Vemula, I. Sengupta\",\"doi\":\"10.1109/EDCAV.2015.7060551\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents an approach for optimizing a reversible netlist consisting of multiple-control Toffoli (MCT) gates with the objective of reducing quantum cost. The MCT gates are first decomposed into smaller gates with up to three control lines, and then a template matching method is applied on the netlist for optimization. The templates are constructed by considering all possible 3-gate sequences with up to four lines. This work constitutes an extension of a previous work by Dueck et al., where 2-gate sequences were considered in the templates. The input gate netlists are generated from the reversible benchmarks available in RevLib, followed by Barenco decomposition to produce Toffoli gates with at most three control connections. The proposed approach is applied on these netlists, and the final quantum cost calculated. Experimental results on standard benchmarks show that the method can lead to reductions in quantum cost.\",\"PeriodicalId\":277103,\"journal\":{\"name\":\"2015 International Conference on Electronic Design, Computer Networks & Automated Verification (EDCAV)\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Electronic Design, Computer Networks & Automated Verification (EDCAV)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EDCAV.2015.7060551\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Electronic Design, Computer Networks & Automated Verification (EDCAV)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDCAV.2015.7060551","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种以降低量子成本为目标,优化由多控制Toffoli (MCT)门组成的可逆网络列表的方法。首先将MCT门分解为具有最多3条控制线的小门,然后在网表上应用模板匹配方法进行优化。模板的构建考虑了所有可能的3门序列,最多有4行。这项工作构成了Dueck等人先前工作的延伸,其中在模板中考虑了2门序列。输入门网络列表由RevLib中可用的可逆基准生成,然后通过Barenco分解生成最多具有三个控制连接的Toffoli门。将该方法应用于这些网络列表,并计算最终的量子成本。在标准基准上的实验结果表明,该方法可以降低量子成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimization of reversible circuits using triple-gate templates at quantum gate level
The paper presents an approach for optimizing a reversible netlist consisting of multiple-control Toffoli (MCT) gates with the objective of reducing quantum cost. The MCT gates are first decomposed into smaller gates with up to three control lines, and then a template matching method is applied on the netlist for optimization. The templates are constructed by considering all possible 3-gate sequences with up to four lines. This work constitutes an extension of a previous work by Dueck et al., where 2-gate sequences were considered in the templates. The input gate netlists are generated from the reversible benchmarks available in RevLib, followed by Barenco decomposition to produce Toffoli gates with at most three control connections. The proposed approach is applied on these netlists, and the final quantum cost calculated. Experimental results on standard benchmarks show that the method can lead to reductions in quantum cost.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Numerical modelling for a basic switching unit based on nonlinear plasmonic two mode waveguide Color image noise removal by modified adaptive threshold median filter for RVIN A review on accelerating scientific computations using the Conjugate Gradient method A novel approach for constrained via minimization problem in VLSI channel routing A method for determination of depletion width of single and double gate junction less transistor
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1