• Register
PhysicsOverflow is a next-generation academic platform for physicists and astronomers, including a community peer review system and a postgraduate-level discussion forum analogous to MathOverflow.

Welcome to PhysicsOverflow! PhysicsOverflow is an open platform for community peer review and graduate-level Physics discussion.

Please help promote PhysicsOverflow ads elsewhere if you like it.


PO is now at the Physics Department of Bielefeld University!

New printer friendly PO pages!

Migration to Bielefeld University was successful!

Please vote for this year's PhysicsOverflow ads!

Please do help out in categorising submissions. Submit a paper to PhysicsOverflow!

... see more

Tools for paper authors

Submit paper
Claim Paper Authorship

Tools for SE users

Search User
Reclaim SE Account
Request Account Merger
Nativise imported posts
Claim post (deleted users)
Import SE post

Users whose questions have been imported from Physics Stack Exchange, Theoretical Physics Stack Exchange, or any other Stack Exchange site are kindly requested to reclaim their account and not to register as a new user.

Public \(\beta\) tools

Report a bug with a feature
Request a new functionality
404 page design
Send feedback


(propose a free ad)

Site Statistics

205 submissions , 163 unreviewed
5,064 questions , 2,215 unanswered
5,347 answers , 22,728 comments
1,470 users with positive rep
818 active unimported users
More ...

  Superposition as memory: unlocking quantum automatic complexity

+ 0 - 0
+ 0 - 0
Referee this paper: arXiv:1703.04878 by Bjørn Kjos-Hanssen

Please use comments to point to previous work in this direction, and reviews to referee the accuracy of the paper. Feel free to edit this submission to summarise the paper (just click on edit, your summary will then appear under the horizontal line)

(Is this your paper?)

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|≤q$ and with $U_0,U_1\in G$ such that, in terms of a standard basis $\{e_k\}$ and with $c$, we have $U_xe_1=e_2$ and $U_ye_1≠e_2$ for all $y≠x$ with $|y|=|x|$. We show that $Q_s$ is unbounded and not constant for strings of a given length. In particular,


and $Q_s(0^{120})≤(2,121)$.

requested May 4, 2017 by Dilaton (6240 points)
summarized by Dilaton.admin
paper authored Mar 14, 2017 to cs by Bjørn Kjos-Hanssen
  • [ revision history ]
    recategorized May 4, 2017 by Dilaton.admin

    Your Review:

    Please use reviews only to (at least partly) review submissions. To comment, discuss, or ask for clarification, leave a comment instead.
    To mask links under text, please type your text, highlight it, and click the "link" button. You can then enter your link URL.
    Please consult the FAQ for as to how to format your post.
    This is the review box; if you want to write a comment instead, please use the 'add comment' button.
    Live preview (may slow down editor)   Preview
    Your name to display (optional):
    Privacy: Your email address will only be used for sending these notifications.
    Anti-spam verification:
    If you are a human please identify the position of the character covered by the symbol $\varnothing$ in the following word:
    Then drag the red bullet below over the corresponding character of our banner. When you drop it there, the bullet changes to green (on slow internet connections after a few seconds).
    Please complete the anti-spam verification

    user contributions licensed under cc by-sa 3.0 with attribution required

    Your rights