arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1208.0659cs.FL
收藏

拥抱发散:当你的半环不完全时的形式主义,在量子模拟中的应用

Embracing divergence: a formalism for when your semiring is simply not complete, with applications in quantum simulation

Gregory Crosswhite

摘要:

将加权自动机推广到无限词的情况有一个基本的困难:一般来说,从给定词的权重导出的无限乘积和将发散。已经提出了许多解决这个问题的方案,包括限制使用的权重类型和采用不同的估值函数来强制收敛。在本文中,我们描述了一种替代方法,而不是试图避免不可避免的分歧,而是拥抱他们作为有用的信息来源。具体地说,我们不是从任意半环S中取系数,而是从S^N中取系数。这样做是有用的,因为它给了我们关于一个无限词的权重如何发散或不发散的信息,如果它发散了,发散的形式是什么-例如,这种方法已被证明在量子模拟领域非常有用,因为当研究无限系统时,关于感兴趣的量(如能量或磁化)如何发散的信息正是我们想要的。在本文中,我们引入了一种新的自动机,我们称之为发散自动机,它将无限个词映射到来自半环的权重序列,并且采用了类似Buchi的边界条件。然后,我们发展了一个理论的发散幂级数,证明了一个Kleene定理连接有理发散幂级数发散自动机。之后,我们通过引入将双无限词映射到S^(Z × N)中的元素的双发散自动机,发展双发散幂级数的理论,并证明另一个Kleene定理来重复这个过程。最后,我们描述了如何应用双发散自动机来模拟双无限量子系统。

英文摘要:

There is a fundamental difficulty in generalizing weighted automata to the case of infinite words: in general the infinite sum-of-products from which the weight of a given word is derived will diverge. Many solutions to this problem have been proposed, including restricting the type of weights used and employing a different valuation function that forces convergence. In this paper we describe an alternative approach that, rather than seeking to avoid the inevitable divergences, instead embraces them as a source of useful information. Specifically, rather than taking coefficients from an arbitrary semiring S we instead take them from S^N. Doing this is useful because it gives us information about how the weight of an infinite word does or does not diverge, and if it does diverge what form the divergence takes --- e.g., polynomial, exponential, etc. This approach has proved to be incredibly useful in the field of quantum simulation because when studying infinite systems, information about how quantities of interest, such as energy or magnetization, diverge is exactly what we want. In this paper we introduce a new kind of automaton which we call a diverging automaton that maps infinite words to sequences of weights from a semiring and which employs a Buchi-like boundary condition. We then develop a theory for diverging power series and prove a Kleene Theorem connecting rational diverging power series to diverging automata. Afterward we repeat this process by introducing bidiverging automata which map biinfinite words to elements in S^(Z x N), developing a theory for bidiverging power series, and proving another Kleene Theorem. We conclude by describing how bidiverging automata are applied to simulate biinfinite quantum systems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑