Quantumania.js
summary
Explains how to simulate qubits with arrays and complex numbers, implement gates as matrices, and run Deutsch, Grover and Shor‑style algorithms in plain JavaScript; demonstrates a working JavaScript simulator that applies Hadamard and identity matrices, uses the tensor product to scale to n qubits, and performs measurement collapse. Key outcomes: Deutsch distinguishes constant vs balanced with the oracle inspected once (vs two classical calls), Grover amplifies a marked item in ~square root of N iterations, and a Shor-style period-finding step factors integers.
AI-written summary · about
chapters (11)
- 0:00Quantum computing intro
- 1:09Quantum state and superposition
- 3:34Quantum measurement and collapse
- 7:45Quantum gates and matrices
- 15:17Quantum algorithms overview
- 19:15Deutsch algorithm explained
- 21:43Deutsch-Jozsa algorithm
- 23:50Grover's search algorithm
- 26:21Prime factorization
- 28:47Summary and limitations
- 30:10Q&A on challenges
related talks
48mQuantum Algorithms for JavaScripters
24mDown the Rabbit Hole: Javascript in Wonderland
36mJavaScript Puzzlers
29mJavascript in Wonderland
57mDown the Rabbit Hole: JavaScript in Wonderland
05mBinary in JavaScript
17mJavaScript and mathematical computing across servers and clients
24mShared Memory & Parallel Programming with JavaScript
