Gemalto Crypto Club 23 Feb 2017
Alan Robertson
Sarah Kaiser
Deutch-Jozsa: Free$^{*}$ parallelism, reduces from $O(2^{n-1})$ to $O(1)$ function calls
Grover's Algorithm: Search an unsorted list for an$^{**}$ element in $O(\sqrt{n})$, best classical is $O(n)$
Shor's Algorithm: A faster prime factoring algorithm, because fourier transforms are unitary
GNFS: Generate polynomials and hope that their roots form a smooth ring such that the 'square root' of the ring is a homomorphism to the prime factors
Shor's algorithm: Find the period of the prime field using the quantum fourier transform, the 'square root' then gives the prime factors
Quantum computers are NOT universally faster or more powerful than classical computers
Quantum computers will NOT be here tomorrow.
have:100 qubits / need: 100 million
Dwave is NOT a quantum computer. Evidence shows quantum annealer at best
There is no one right material or system to make qubits
Hardware developments
Distance/Loss: $\approx 300$ km
Realistic device security models
QKD receiver satellite