This work is a tutorial on Shor's factoring algorithm by means of a worked out example. Some basic concepts of Quantum Mechanics and quantum circuits are reviewed. It is intended for non-specialists which have basic knowledge on undergraduate Linear Algebra.

It is an empirical observation that the Riemann zeta function can be well approximated in its critical strip using the Number-Theoretical Spin Chain. A proof of this would imply the Riemann Hypothesis. Here we relate that question to the one of spectral radii of a family of Markov chains. This in turn leads to the question whether certain graphs are Ramanujan. The general idea is to explain the...

This work is a tutorial on Shor's factoring algorithm by means of a worked out example. Some basic concepts of Quantum Mechanics and quantum circuits are reviewed. It is intended for non-specialists which have basic knowledge on undergraduate Linear Algebra.

I Given n students and n colleges, each with preferences over the other. Can we find a stable matching? I Stability: Don’t want to match c with s and c′ with s′ if c and s′ would prefer to switch to being matched with each other. I Yes! Propose and Reject Algorithm. I Algorithm terminates in n2 iterations I Everyone gets matched I Resulting matching is stable! Big-O: Motivation What is the runn...

-

0

-