Intro to Quantum Computing Algorithms

Presenter: Dan Muldrew

I’ll first introduce quantum computation with a motivating analogy. Then explain some of the computational advantages of manipulating information at the quantum level, such as superposition and entanglement, compared to classical computation. Finally, I’ll talk about how proposed quantum languages, such as IBM Qiskit and Q#, are designed to take these features into account, within the context of Shor’s factoring algorithm (and potentially other algorithms as well), which essentially started the field.



• For IBM Qiskit, here is an implementation of Shor’s algorithm:
  https://github.com/Qiskit/qiskit-tutorials/blob/master/community/awards/teach_me_quantum_2018/intro2qc/8.Shor's%20algorithm.ipynb


• For Q#, we'll look at simpler algorithms.


• I’ll run some of the algorithm implementations on a Raspberry Pi---which include a free copy of Mathematica

• For those interested in a classic paper on quantum computing, here is one I'll be presenting the following night at the Papers We Love @ Seattle meetup:
  https://arxiv.org/pdf/quant-ph/0010034.pdf