A report on Quantum Computing for Algorithm Analysis and Design course duing Monsoon'20
For our project, we chose to explore the field of Quantum Computing and it's application in the world right now, and what they could be in the future.
We began by studying the prerequisites like Linear Algebra and basic understanding of quantum mechanics. After that, we went on to study quantum computing through various lectures series and books/notes.
Finally, after we had a good understanding on how things work in quantum world and the basic advantages it provides in computing, we further went on to study and understand a couple of research papers for our presentations.
Our report included a brief introduction to quantum mechanics and how it gave rise to quantum computing. It introduced and explained some of the basic fundamentals of quantum computing, the Principle of Delayed Measurement and Quantum Erasure. We then went on to explain the 3 cornerstone algorithms of computing computing in detail:
- Simon's Algorithm
- Shor's Factoring Algorithm
- Grover's Search Algorithm
Our presentation also included a talk about some of the interesting applications of quantum computing which we came across from research papers. These included
- A Simple Proof that Toffoli and Hadamard are Quantum Universal by Dorit Aharonov
- Prediction by linear regression on a quantum computer by Maria Schuld et all
- Solution to 0/1 Knapsack Problem Based on Improved Ant Colony Algorithm by Hanxiao SHI
- Ryan O'Donnel's lectures on QC at CMU [link]
- Ronald de Wolf's notes on Quantum Computing [link]
- Quantum Computing and Quantum Information by Nelson and Chuang [link]
- Quantum Mechanics and Quantum Computing by Umesh Vazirani [link]
- Qiskit community [link]
- QC - Quantum Computing Series by Jonathan Hui [link]
The team comprised of Kunal Jain, Samay Kothari and Naman Ahuja