coassociative grammar, periodic orbits, and quantum random walk overcoassociative语法、周期轨道和量子随机走过去.pdfVIP

下载本文档

1
0
约7.53万字
约 19页
2017-08-27 发布于上海
举报
版权申诉

coassociative grammar, periodic orbits, and quantum random walk overcoassociative语法、周期轨道和量子随机走过去.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

coassociative grammar, periodic orbits, and quantum random walk overcoassociative语法、周期轨道和量子随机走过去

COASSOCIATIVE GRAMMAR, PERIODIC ORBITS, AND QUANTUM RANDOM WALK OVER Z PHILIPPE LEROUX Received 13 January 2005 and in revised form 20 September 2005 Inspired by a work of Joni and Rota, we show that the combinatorics generated by a quantisation of the Bernoulli random walk over Z can be described from a coassocia- tive coalgebra. Relationships between this coalgebra and the set of periodic orbits of the classical chaotic system x → 2x mod1, x ∈ [0,1], are also given. 1. Introduction and notation Motivated by the success of classical random walks and chaotic dynamical systems, we study the quantisation of the random walk over Z and its relationships with a classical chaotic system x → 2x mod1, x ∈ [0,1]. In the physics literature, quantum random walks have been studied, for instance, by Ambainis et al. [ 1] and Konno et al. [8, 9]. In [8], Konno shows that the quantum random walk over Z called the Hadamard random walk generates a particular combinatorics. In [6], Joni and Rota showed that some combi- natorics can be recovered from coproducts of coassociative coalgebras. Therefore, is it possible to create a coassociative coalgebra which recovers the combinatorics generated by the Hadamard random walk? We start in Section 2 with brieﬂy recalling a new formal- ism, inspired by weighted directed graph theory. In Section 3, we present a mathematical framework for studying the Hadamard random walk over Z. In Section 4, we construct a coassociative coalgebra based on results on graphs developed in Section 2. We show that the combinatorics generated by the Hadamard random walk over Z can be recovered from this coalgebra. In Section 5, we present the notion of quantum graphs developed in [15] and point out a relation between a quantum graph, the classical Bernoulli random walk, the Hadamard random walk, and the periodic orbits of the classical chaotic sys- tem x → 2x mod1 with x ∈ [0,1]. Brieﬂy speaking, we show how to relate periodic orbits of th