Overview

Last time:

• Restricted computational models
• CFGs
• Programming languages
• DFAs < CFGs < TMs

Today:

• Quantum circuits
• Quantum weirdness
• What is a qubit?
• QC = Rotations

Summary of TMs

• Defined “the” only model we need to capture computing
• Modern programming languages are simulatable by TMs
• Universality: backbone of modern computing
• Uncomputability: Reasoning about programs is uncomputable
• CFGs (limitations of CFGs, Chomsky Normal Form)

Quantum Weirdness

Discussion on double-split experiment.

How can we simulate a (quantum) system on a computer?