Computing & Cybersecurity

Quantum Complexity: Lecture 24 of Quantum Computation at CMU

Quantum Probability: Lecture 22 of Quantum Computation at CMU

The Adversary Method: Lecture 20 of Quantum Computation at CMU

Mixed States and Density Matrices: Lecture 21 of Quantum Computation at CMU

Quantum Query Complexity: Lecture 19 of Quantum Computation at CMU

Grover's Algorithm: Lecture 18 of Quantum Computation at CMU

How to code up a model with discrete parameters in Stan

How to code up a bespoke probability density in Stan

The Hidden Subgroup Problem: Lecture 17 of Quantum Computation at CMU

Shor's Factoring Algorithm: Lecture 16 of Quantum Computation at CMU

Period-Finding (Simon's Algorithm over Z_N): Lecture 15 of Quantum Computation at CMU

The Fourier Transform over Z_n: Lecture 14 of Quantum Computation at CMU

Simon's Algorithm: Lecture 13 of Quantum Computation at CMU

Revealing XOR-patterns II: Lecture 12 of Quantum Computation at CMU

Revealing XOR-patterns I: Lecture 11 of Quantum Computation at CMU

Basics of Quantum Computing: Lecture 10 of Quantum Computation at CMU

The CHSH Game: Lecture 7 of Quantum Computation at CMU

Partial Measurements and Spooky Action at a Distance: Lecture 6 of Quantum Computation at CMU

Multi-Qubit Systems: Lecture 5 of Quantum Computation at CMU

Discriminating Two Qubits: Lecture 4.5 of Quantum Computation at CMU

Unitary Transformations and the Elitzur--Vaidman Bomb: Lecture 4 of Quantum Computation at CMU

Rotate, Compute, Rotate: Lecture 2 of Quantum Computation and Information at CMU

10^500 Parallel Universes: Lecture 1 of Quantum Computation and Information at CMU

Star Citizen ATV FR Le nouveau vaisseau Drake !

Star Citizen ATV FR The new Drake ship!

STAR CITIZEN ATV FR : Misc Razor & Conception des Vaisseaux

STAR CITIZEN ATV FR: Misc Razor & Ship Design

Toda's 2nd Theorem and lower bounds for uniform ACC: Graduate Complexity Lecture 23 at CMU

Razborov--Smolensky lower bounds for AC0[p]: Graduate Complexity Lecture 22 at CMU

Ironic complexity: Graduate Complexity Lecture 27 at CMU

Hardness vs. Randomness II: Graduate Complexity Lecture 25 at CMU

Hardness vs. Randomness I: Graduate Complexity Lecture 24 at CMU

Hardness amplification: Graduate Complexity Lecture 26 at CMU

Monotone circuit lower bounds: Graduate Complexity Lecture 21 at CMU

Toda's 1st Theorem and the Permanent: Graduate Complexity Lecture 14 at CMU

Permanent is #P-complete: Graduate Complexity Lecture 20 (out of order) at CMU

The Switching Lemma: PRST version: Graduate Complexity Lecture 19 at CMU

Algebraic "NP vs. P" vs. "Boolean NP vs. P": Graduate Complexity Lecture 15 postscript at CMU

Random Restrictions and AC0 Circuit Lower Bounds: Graduate Complexity Lecture 18 at CMU

IP = PSPACE: Graduate Complexity Lecture 17 at CMU

Instance Checking and the Permanent: Graduate Complexity Lecture 16 at CMU

Algebraic Circuit Complexity: Graduate Complexity Lecture 15 at CMU