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

作为记忆的叠加:解锁量子自动复杂性

Superposition as memory: unlocking quantum automatic complexity

Bjørn Kjos-Hanssen

摘要:

假设一个锁有两个状态,“锁定”和“解锁”,可以使用两个操作进行操作,称为0和1。此外,使用四个操作(确定地)解锁的唯一方法是以序列0011来执行它们,即,$0^n1^n$,其中$n=2$。在这种情况下,人们可能会认为锁在每次操作之后都需要处于某些进一步的状态,以便对到目前为止所做的事情有一些记忆。在这里,我们表明,这种记忆可以完全编码在叠加的两个基本状态“锁定”和“解锁”,其中,由量子力学规定,操作是由酉矩阵。此外,我们使用约旦舒尔引理,类似的锁是不可能的$n=60$。我们定义一个词$x$的半经典量子自动复杂度$Q_{s}(x)$为那些非负整数对$(n,q)$的字典序下确界,使得存在射影酉群PU $(n)$的子群$G$,其中$|G|\le q$和$U_0,U_1\in G$使得,根据标准基$\{e_k\}$和$U_z=\prod_k U_{z(k)}$,对于所有$y\ne x$和$|y|=|x|$,我们有$U_x e_1=e_2$和$U_y e_1 \ne e_2$。我们证明了$Q_s$是无界的,对于给定长度的字符串不是常数。特别是\[ Q_{s}(0^21^2)\le (2,12) < (3,1) \le Q_{s}(0^{60}1^{60}) \]和$Q_s(0^{120})\le (2,121)$。

英文摘要:

Imagine a lock with two states, "locked" and "unlocked", which may be manipulated using two operations, called 0 and 1. Moreover, the only way to (with certainty) unlock using four operations is to do them in the sequence 0011, i.e., $0^n1^n$ where $n=2$. In this scenario one might think that the lock needs to be in certain further states after each operation, so that there is some memory of what has been done so far. Here we show that this memory can be entirely encoded in superpositions of the two basic states "locked" and "unlocked", where, as dictated by quantum mechanics, the operations are given by unitary matrices. Moreover, we show using the Jordan--Schur lemma that a similar lock is not possible for $n=60$. We define the semi-classical quantum automatic complexity $Q_{s}(x)$ of a word $x$ as the infimum in lexicographic order of those pairs of nonnegative integers $(n,q)$ such that there is a subgroup $G$ of the projective unitary group PU$(n)$ with $|G|\le q$ and with $U_0,U_1\in G$ such that, in terms of a standard basis $\{e_k\}$ and with $U_z=\prod_k U_{z(k)}$, we have $U_x e_1=e_2$ and $U_y e_1 \ne e_2$ for all $y\ne x$ with $|y|=|x|$. We show that $Q_s$ is unbounded and not constant for strings of a given length. In particular, \[ Q_{s}(0^21^2)\le (2,12) < (3,1) \le Q_{s}(0^{60}1^{60}) \] and $Q_s(0^{120})\le (2,121)$.

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

↑