This repository consists of the study I did during my internship at the Indian Institute of Science (IISc) in Fall 2020 under the guidance of Dr. Anandi Giridharan. My teammates were Vrushali Chittaranjan, Rahul Bhat, and Reshma Bhat. I hope this repository serves as a guide for someone who is getting started in the field of Quantum Computing. If there are any errors (technical or non-technical), pull requests will be appreciated.
Gordon Earl Moore in 1965 stated a law which is now very well known as the Moore’s Law and states that the “number of transistors in a dense Integrated Circuit (IC) doubles every two years.” The size of the transistors is essentially defined as the distance from source-to-drain. In 2020, the size has reached to as low as 5nm. With the size decreasing every year, we have to think about the Quantum Mechanics which tells us that even if there is a potential barrier between source and the drain, it is possible that electron can flow between them because of “Quantum Tunneling”. Therefore, it becomes a challenge to keep the potential barrier high enough while the barrier between the source and the drain is extremely thin. This is the engineering problem that needs to solved. Hence, we can see that now, the scientists have been working on building a computational machine that uses the laws of Quantum Mechanics to give us exponentially greater computing power. An important point to note here is that quantum computers do not make individual operations faster compared to the most advanced classical computer currently in existence. The main advantage that quantum computers offer is in terms of making the total number of operations significantly lesser compared to a classical computer. Thus, quantum computers are not to be thought of as replacement for classical computers but for certain tasks, they provide an exponential edge in terms of computing power.
- Breaking RSA Encryption – an Update on the State-of-the-Art blog by Quintessence labs.
- C. E. Shannon, "Communication theory of secrecy systems," in The Bell System Technical Journal, vol. 28, no. 4, pp. 656-715, Oct. 1949.
- Charles H. Bennett, Gilles Brassard, Quantum cryptography: Public key distribution and coin tossing, Theoretical Computer Science.
- "One-Time Pad (OTP)". Cryptomuseum.com.
- TU - Delft Open Courseware - Quantum Cryptography
- C. H. Bennett and G. Brassard. "Quantum cryptography: Public key distribution and coin tossing". In Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, volume 175, page 8. New York, 1984
- G. Brassard and L. Salvail "Secret key reconciliation by public discussion" Advances in Cryptology: Eurocrypt 93 Proc. pp 410-23 (1993).
- Bennett, C. H.; Bessette, F.; Brassard, G.; Salvail, L.; Smolin, J. (1992). "Experimental Quantum Cryptography" (PDF). Journal of Cryptology. 5 (1): 3–28.
- Shenoy, Akshata & Radhakrishna, Srikanth & Srinivas, Talabattula. (2013). Semicounterfactual cryptography. EPL (Europhysics Letters).
- Imre, Sandor. (2013). Quantum Communications: Explained for Communication Engineers. Communications Magazine, IEEE. 51. 28-35.
- Quantum Computers, Explained With Quantum Physics
- Introduction to Quantum Computing with Python and Qiskit
- Quantum communication | QuTech Academy
- Why Can't You Use Quantum Mechanics To Communicate Faster Than Light?
- Quantum Instruction Set - Computerphile
- Quantum Computing 'Magic' - Computerphile
- Quantum Cryptography Explained
- Solving Quantum Cryptography
- Quantum Key Distribution Animation
- The incredible physics behind quantum computing | Brian Greene, Michio Kaku, & more | Big Think
- A Beginner's Guide To Quantum Computing
- Quantum cryptography, animated
- How Quantum Computers Break Encryption | Shor's Algorithm Explained
- Are Quantum Computers Really A Threat To Cryptography?
- The Bernstein-Vazirani Algorithm
- Quantum cryptography