Quantum Computing Modeling in Scala
summary
Shows a common Scala abstraction that models and evolves classical, probabilistic and quantum states using a monadic transformation. Implements and visualizes the four quantum postulates (state, evolution, measurement, composition) with examples like biased coins, dice, complex histograms and running Scala code, and includes a quantum-simulation solution for counting binary words with no consecutive ones (the Fibonacci interview problem).
AI-written summary · about
chapters (7)
- 0:00Start
- 0:47Why Scala?
- 4:08Monadic State Evolution
- 6:48State Representation and Evolution
- 9:45Portfolio Balancing
- 10:11Account Balances
- 18:53Calculating Fibonacci Numbers
related talks
30mProbabilistic modelling with Scala
42mBayes and Bool Walk into a Bar
29mProbabilistic Programming: What It Is and How It Works
59mQuantum Physics for Software Developers
29m10 Things You Should Know About Quantum Computing and ML
48mGetting Started with Quantum Programming
39mA few tips on modelling things in Scala
38mA (Very Gentle) Introduction to Quantum Computing