Lars Schlieper

collaborators

2 papers

cs.CR2019

Noisy Simon Period Finding

Alexander May, Lars Schlieper, Jonathan Schwinger

Let $f : F_{2}^{n} \to F_{2}^{n}$ be a Boolean function with period $s$ . It is well-known that Simon's algorithm finds $s$ in time polynomial in $n$ on q…

cs.CR2019

Quantum Period Finding is Compression Robust

Alexander May, Lars Schlieper

We study quantum period finding algorithms such as Simon and Shor (and its variants Ekerå-Håstad and Mosca-Ekert). For a periodic function $f$ these algorithms produce -- via some…