Quantum Computing from Introductory Linear AlgebraPublic
Downloadable Contentopen in viewer
Since its conception in the early 1980s, quantum computing has rapidly grown as a field of study. This growth has placed it in the eye of the public, where it is often seen as inscrutable and restricted to post-graduate studies. Furthermore, the rapid development of physical quantum computers, the existence of algorithms that prove the distinct advantage that quantum computing holds over classical computing, and the threat to current cryptographic schemes has emphasized the need for “quantum computer literacy” now more than ever. This paper aims to rigorously instruct the reader on the basics of quantum computing with only the assumption of introductory linear algebra—no physics background necessary. A collection of algorithms is discussed, including the Deutsch-Jozsa problem and Shor’s algorithm. Alongside each algorithm is an explanation of how to implement and simulate that algorithm using Qiskit.
- This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.
- Date created
- Resource type
- Rights statement
- In Collection:
|Thumbnail||Title||Visibility||Embargo Release Date||Actions|
Permanent link to this page: https://digital.wpi.edu/show/4t64gr37k