- Describe RSA encryption including the steps needed to encrypt and decrypt a message. Explain why RSA encryption is safe from being cracked by classical computers but may be in danger as quantum computing technology increases.
- Describe how to perform modular arthimetic. Be able to perform modular arthimetic by hand for small numbers.
- Explain what a greatest common factor is and how to determine if two numbers share no common factors.
- Describe the set up, using number theory, for Shor’s algorithm, including what the period between two numbers is, how to find it with classical computing, how to determine a value of \(a\) for a given number to factor, and how to predict the factors.
- Explain what a hybrid classical-quantum algorithm is. Explain why Shor’s algorithm is hybrid algorithm and which steps are completed on a classical computer, and which steps are completed on a quantum computer.
- Explain how Shor’s algorithm relates to the quantum phase estimation algorithm.
- Explain and implement the quantum portion of Shor’s algorithm. Assign meaning to the measured output.
- Describe how to process the output of the quantum portion of Shor’s algorithm using classical computers. Implement this process.