Practical Period Finding on IBM Q – Quantum Speedups in the Presence of Errors

by   Alexander May, et al.

We implemented Simon's quantum period finding circuit for functions F_2^n →F_2^n with period s⃗∈F_2^n up to n=7 on the 14-qubit quantum device IBM Q 16 Melbourne. Our experiments show that with a certain probability τ(n) we measure erroneous vectors that are not orthogonal to s⃗. While Simon's algorithm for extracting s⃗ runs in polynomial time in the error-free case τ(n)=0, we show that the problem of extracting s⃗∈F_2^n in the general setting 0 ≤τ(n) ≤1/2 is as hard as solving LPN (Learning Parity with Noise) with parameters n and τ(n). Hence, in the error-prone case we may not hope to find periods in time polynomial in n. However, we also demonstrate theoretically and experimentally that erroneous quantum measurements are still useful to find periods faster than with purely classical algorithms, even for large errors τ(n) close to 1/2.



page 12


Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering

We show polynomial-time quantum algorithms for the following problems: ...

Quantum Period Finding with a Single Output Qubit -- Factoring n-bit RSA with n/2 Qubits

We study quantum period finding algorithms such as Simon, Shor, and Eker...

Classical verification of quantum depth

We present two protocols for classical verification of quantum depth. Ou...

Fine-grained quantum supremacy of the one-clean-qubit model

The one-clean-qubit model (or the DQC1 model) is a restricted model of q...

Cryptanalysis of Three Quantum Money Schemes

We investigate the security assumptions behind three public-key quantum ...

Machine Learning the period finding algorithm

We use differentiable programming and gradient descent to find unitary m...

Deep Learning Gauss-Manin Connections

The Gauss-Manin connection of a family of hypersurfaces governs the chan...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.