Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
| Hi-index | 0.00 |
We show how to teach and motivate small quantum computer programs as a supplemental topic in a CS2 data structures class. A traditional example such as Shor's factorization [8] could be used, but we focus instead on the area of quantum pseudo-telepathy games. Examples in this area require less mathematics than factorization and are easy to motivate with short proofs that the problems solved have no solutions in a world of classical computing. A CS2 class is a good location to present this work because of the matrix storage and manipulation that is required.