Results on two-bit gate design for quantum computers

D. DiVincenzo, J. Smolin
{"title":"Results on two-bit gate design for quantum computers","authors":"D. DiVincenzo, J. Smolin","doi":"10.1109/PHYCMP.1994.363704","DOIUrl":null,"url":null,"abstract":"We present numerical results which show how two-bit logic gates can be used in the design of a quantum computer. We show that the Toffoli gate, which is the universal gate for all classical reversible computation, can be implemented using a particular sequence of exactly five two-bit gates. An arbitrary three-bit unitary gate, which can be used to build up any arbitrary quantum computation, can be implemented exactly with six two-bit gates. The ease of implementation of any particular quantum operation is dependent upon a very nonclassical feature of the operation, its exact quantum phase factor.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"143 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"39","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Workshop on Physics and Computation. PhysComp '94","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PHYCMP.1994.363704","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 39

Abstract

We present numerical results which show how two-bit logic gates can be used in the design of a quantum computer. We show that the Toffoli gate, which is the universal gate for all classical reversible computation, can be implemented using a particular sequence of exactly five two-bit gates. An arbitrary three-bit unitary gate, which can be used to build up any arbitrary quantum computation, can be implemented exactly with six two-bit gates. The ease of implementation of any particular quantum operation is dependent upon a very nonclassical feature of the operation, its exact quantum phase factor.<>
量子计算机二比特门的设计结果
我们给出的数值结果显示了如何在量子计算机的设计中使用两位逻辑门。我们证明Toffoli门是所有经典可逆计算的通用门,可以使用恰好五个两位门的特定序列来实现。一个任意的3位一元门可以用6个2位门精确地实现,它可以用来构建任意的量子计算。任何特定量子操作的实现难易程度取决于该操作的一个非常非经典的特征,即它的精确量子相位因子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信