Class Log#
Mon 22 Aug 2022#
Introduced course material, Syllabus, etc.
Discussed some limitations of classical computing like Landauer’s principle that erasing information generates heat.
Briefly discussed Big-O notation.
Introduced some faculty (Michael Forbes, Mark Kuzyk, Fred Gittes, Kevin Vixie)
Breakout to discuss Monty Hall problem, expected winnings from rolling 2 dice where prime number sums win $10 but composites loose $5. Ended with mention of sock problem.
Notes: Need to breakup groups. Try asking people to distribute such that each group has:
A member with a Ph.D. in physics.
An undergraduate.
Someone from outside of physics.
Wed 25 Aug 2022#
Plan:
Postulates.
Spin 1/2 discussion.
Universal computing/Turing machines/NAND is complete for classical computing.
Classical circuits.
Show CoCalc assignment and how that works.
Introductions from online participants.
Linear algebra: Bases, Hermitian, Unitary matrices, SVD, Schmidt decomposition. (Friday)
Discussions from Hypothesis:
Turing machines and the Church-Turing thesis.
Current state (NISQ) of quantum hardware and several questions about why there are limitations and what can be done.
Philosophical debate about whether or not quantum mechanics is a mathematical framework.