Lars Schlieper

Quantum Period Finding is Compression Robust

2019 · arXiv (Cornell University)

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 quantum embedding of $f$ -- a quantum …