Proceedings Workshop on Physics and Computation. PhysComp '94最新文献

筛选
英文 中文
Results on two-bit gate design for quantum computers 量子计算机二比特门的设计结果
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1994-09-26 DOI: 10.1109/PHYCMP.1994.363704
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":"https://doi.org/10.1109/PHYCMP.1994.363704","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.0,"publicationDate":"1994-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122176104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 39
Computational spacetimes 计算时空
Proceedings Workshop on Physics and Computation. PhysComp '94 Pub Date : 1900-01-01 DOI: 10.1109/PHYCMP.1994.363675
E. Omtzigt
{"title":"Computational spacetimes","authors":"E. Omtzigt","doi":"10.1109/PHYCMP.1994.363675","DOIUrl":"https://doi.org/10.1109/PHYCMP.1994.363675","url":null,"abstract":"The execution of an algorithm is limited by physical constraints rooted in the finite speed of signal propagation. To optimize the usage of the physical degrees of freedom provided by a computational engine, one must apply all relevant technological and physical constraints to the temporal and spatial structure of a computational procedure. Computational spacetimes make explicit both technological and physical constraints, and facilitate reasoning about the relative efficiency of parallel algorithms through explicit physical complexity measures. Similar to Minkowski spacetime being the world model for physical events, computational spacetimes are the world model for computational events. Algorithms are specified in a spatial single-assignment form, which makes all assignments spatially explicit. The computational spacetime and the spatial single-assignment form provide the framework for the design, analysis and execution of fine-grain parallel algorithms.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121270887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信