Realistic models of a quantum computer

Y. Ozhigov
{"title":"Realistic models of a quantum computer","authors":"Y. Ozhigov","doi":"10.1117/12.517919","DOIUrl":null,"url":null,"abstract":"We study a realistic quantum computational model with the permanent interaction of diagonal type between qubits. Its universality was proven in quant-ph/0202030. We propose two types of control over computations: random and periodical NOTs. The slowdown of computations in comparison with the abstract model is estimated. It is shown how fermionic computations can be implemented in the framework of this model.","PeriodicalId":90714,"journal":{"name":"Quantum bio-informatics V : proceedings of the quantum bio-informatics 2011, Tokyo University of Science, Japan, 7-12 March 2011. Quantum Bio-Informatics (Conference) (5th : 2011 : Tokyo, Japan)","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2003-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum bio-informatics V : proceedings of the quantum bio-informatics 2011, Tokyo University of Science, Japan, 7-12 March 2011. Quantum Bio-Informatics (Conference) (5th : 2011 : Tokyo, Japan)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.517919","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We study a realistic quantum computational model with the permanent interaction of diagonal type between qubits. Its universality was proven in quant-ph/0202030. We propose two types of control over computations: random and periodical NOTs. The slowdown of computations in comparison with the abstract model is estimated. It is shown how fermionic computations can be implemented in the framework of this model.
量子计算机的真实模型
研究了一个具有对角线型永久相互作用的现实量子计算模型。在quantum -ph/0202030中证明了其普适性。我们提出了两种类型的计算控制:随机和周期性的not。与抽象模型相比,估计了计算速度的减慢。它显示了如何费米子计算可以在这个模型的框架内实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信