Elementary Quantum Gate Realizations for Multiple-Control Toffoli Gates

D. Michael Miller, R. Wille, Zahra Sasanian
{"title":"Elementary Quantum Gate Realizations for Multiple-Control Toffoli Gates","authors":"D. Michael Miller, R. Wille, Zahra Sasanian","doi":"10.1109/ISMVL.2011.54","DOIUrl":null,"url":null,"abstract":"A new method for determining elementary quantum gate realizations for multiple-control Toffoli (MCT) gates is presented. The realization for each MCT gate is formed as a composition of realizations of smaller MCT gates. A marking algorithm which is more effective than the traditional moving rule is used to optimize the final circuit. The main improvement is that the resulting circuits make significantly better use of ancillary lines than has been achieved in earlier approaches. Initial results are also presented for circuits with nearest-neighbour communication. These results show that the overall approach is not as effective for that problem indicating that research on direct synthesis of nearest-neighbour quantum circuits should be considered. While, the results presented are for the NCV quantum gate library (i.e. for quantum circuits composed of NOT gates, controlled-NOT gates, and controlled-V=V+ gates), the approach can be applied to other libraries of elementary quantum gates.","PeriodicalId":234611,"journal":{"name":"2011 41st IEEE International Symposium on Multiple-Valued Logic","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"147","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 41st IEEE International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2011.54","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 147

Abstract

A new method for determining elementary quantum gate realizations for multiple-control Toffoli (MCT) gates is presented. The realization for each MCT gate is formed as a composition of realizations of smaller MCT gates. A marking algorithm which is more effective than the traditional moving rule is used to optimize the final circuit. The main improvement is that the resulting circuits make significantly better use of ancillary lines than has been achieved in earlier approaches. Initial results are also presented for circuits with nearest-neighbour communication. These results show that the overall approach is not as effective for that problem indicating that research on direct synthesis of nearest-neighbour quantum circuits should be considered. While, the results presented are for the NCV quantum gate library (i.e. for quantum circuits composed of NOT gates, controlled-NOT gates, and controlled-V=V+ gates), the approach can be applied to other libraries of elementary quantum gates.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多控制Toffoli门的基本量子门实现
提出了一种确定多控制Toffoli (MCT)门的基本量子门实现的新方法。每个MCT门的实现是由更小的MCT门的实现组成的。采用比传统移动规则更有效的标记算法对最终电路进行优化。主要的改进是所得到的电路比以前的方法更好地利用了辅助线路。对于具有最近邻通信的电路,也给出了初步结果。这些结果表明,整体方法对该问题并不有效,表明应该考虑直接合成最近邻量子电路的研究。虽然本文给出的结果是针对NCV量子门库(即由非门、控制-非门和控制-V=V+门组成的量子电路),但该方法可以应用于其他基本量子门库。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Improved Complexity of Quantum Oracles for Ternary Grover Algorithm for Graph Coloring Invitation to Clone Theory with Partial Clones and Hyperclones From Truth Tables to Programming Languages: Progress in the Design of Reversible Circuits A Graph-Based Approach to Designing Multiple-Valued Arithmetic Algorithms The Lattice of the Clones of Self-Dual Functions in Three-Valued Logic
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1