量子理论的算法方法1:许多粒子量子动力学的特征

Y. Ozhigov, I. Semenihin
{"title":"量子理论的算法方法1:许多粒子量子动力学的特征","authors":"Y. Ozhigov, I. Semenihin","doi":"10.1117/12.683114","DOIUrl":null,"url":null,"abstract":"Algorithmic approach to quantum theory is considered. It is based on the supposition that every evolution of many particle system can be simulated by classical algorithms of polynomial complexity. This hypothesis agrees with all known experiments but it presumes the principle cut-off of quantum formalism because it excludes a scalable quantum computer. Algorithmic approach describes quantum evolution uniformly, without separation of measurements from the unitary dynamics; it is shown how Bohrn rule for quantum probability follows from the basic principles of this approach. The radical difference of algorithmic approach from the standard and its perspectives are discussed.","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":"33 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2006-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Algorithmic approach to quantum theory 1: features of many particle quantum dynamics\",\"authors\":\"Y. Ozhigov, I. Semenihin\",\"doi\":\"10.1117/12.683114\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Algorithmic approach to quantum theory is considered. It is based on the supposition that every evolution of many particle system can be simulated by classical algorithms of polynomial complexity. This hypothesis agrees with all known experiments but it presumes the principle cut-off of quantum formalism because it excludes a scalable quantum computer. Algorithmic approach describes quantum evolution uniformly, without separation of measurements from the unitary dynamics; it is shown how Bohrn rule for quantum probability follows from the basic principles of this approach. The radical difference of algorithmic approach from the standard and its perspectives are discussed.\",\"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\":\"33 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-05-24\",\"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.683114\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","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.683114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

考虑了量子理论的算法方法。它基于一个假设,即多粒子系统的每一次演化都可以用多项式复杂度的经典算法来模拟。这个假设与所有已知的实验一致,但它假定了量子形式主义的基本切断,因为它排除了可扩展的量子计算机。算法方法均匀地描述量子演化,没有将测量与统一动力学分离;从这种方法的基本原理出发,说明了量子概率的玻恩规则是如何遵循的。从标准及其视角讨论了算法方法的根本区别。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Algorithmic approach to quantum theory 1: features of many particle quantum dynamics
Algorithmic approach to quantum theory is considered. It is based on the supposition that every evolution of many particle system can be simulated by classical algorithms of polynomial complexity. This hypothesis agrees with all known experiments but it presumes the principle cut-off of quantum formalism because it excludes a scalable quantum computer. Algorithmic approach describes quantum evolution uniformly, without separation of measurements from the unitary dynamics; it is shown how Bohrn rule for quantum probability follows from the basic principles of this approach. The radical difference of algorithmic approach from the standard and its perspectives are discussed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信