Notes from June 2015 containing the following: Phase kick-back, Deutsch’s algorithm, Fourier sampling, Deutsch-Jozsa algorithm, Bernstein-Vazirani algorithm, Preimage of a function, Simon’s algorithm, Grover’s algorithm, Amplitude amplification, Quantum Fourier Transform, and Shor’s algorithm.

Are different versions of the 3SUM problem equivalent?

Sage implementation.

We are given \(k > 0 \in \mathbb{R}\) and \(a_1, a_2, \ldots, a_n \ge 1 \in \mathbb{N}\) such that

$$ a_1 < a_2 < \cdots < a_n. $$

We want to solve the following equation

$$ \frac{1}{a_1} + \frac{1}{a_2} + \cdots + \frac{1}{a_n} = k. $$

Python implementation.