Lecture 14, Thurs March 2: Nonlocal Games Last time we talked about the CHSH Game, and how no classical strategy lets Alice and Bob win it more than 75% of the time. Today we’ll see how, by using entanglement, they can

Source URL: www.scottaaronson.com

Lecture 10, Thurs Feb 16: Teleportation, Entanglement Swapping, GHZ, Monogamy Next let’s see... Quantum Teleportation which is a result from 1991 that came as a great surprise. Science journalists still love it given i

Source URL: www.scottaaronson.com

• Quantum information science
• Quantum mechanics
• Theoretical computer science
• Physics
• Superdense coding
• Quantum teleportation
• Qubit
• Bell state
• Quantum entanglement
• GreenbergerHorneZeilinger state
• Controlled NOT gate
• W state

Lecture 16, Tues March 21: Quantum Computing, Universal Gate Sets Guest Lecture by Tom Wong Having seen lots of quantum protocols, we’re finally ready to tackle the holy grail of the field: a programmable quantum compu

Source URL: www.scottaaronson.com

• Quantum information science
• Theoretical computer science
• Quantum mechanics
• Quantum logic gate
• Quantum circuit
• Toffoli gate
• Qubit
• Quantum computing
• Controlled NOT gate
• Quantum error correction
• Quantum teleportation
• GottesmanKnill theorem

Lecture 8, Thurs Feb 9: More on Quantum Money, BB84 QKD Guest Lecture by Supartha Podder Continuation of Quantum Money Last time we discussed how classical money is copyable and described a scheme for making money uncopy

Source URL: www.scottaaronson.com

• Quantum information science
• Theoretical computer science
• Quantum mechanics
• Quantum cryptography
• Cryptography
• Quantum computing
• BB84
• Qubit
• Quantum key distribution
• Quantum information
• Controlled NOT gate
• Quantum money

THREE PUZZLES ON MATHEMATICS, COMPUTATION, AND GAMES GIL KALAI HEBREW UNIVERSITY OF JERUSALEM AND YALE UNIVERSITY Abstract. In this lecture I will talk about three mathematical puzzles involving mathematics and computati

Source URL: eta.impa.br

• Computational complexity theory
• Mathematics
• Theoretical computer science
• Complexity classes
• Analysis of algorithms
• Quantum computing
• Linear programming
• Simplex algorithm
• Quantum algorithm
• P versus NP problem
• Quantum supremacy
• Time complexity

Lecture 18, Tues March 28: Bernstein-Vazirani, Simon We ended last time with the Deutsch-Jozsa problem. Today we’ll start with another black-box problem for which quantum algorithms provide an advantage: The Bernstein-

Source URL: www.scottaaronson.com

• Theoretical computer science
• Quantum computing
• Quantum mechanics
• Quantum information science
• Emerging technologies
• Quantum algorithms
• Randomized algorithm
• Qubit
• Shor's algorithm
• DeutschJozsa algorithm

Lecture 11, Tues Feb 21: Quantifying Entanglement, Mixed State Entanglement How do you quantify how much entanglement there is between two quantum systems? It’s worth noting that we sort of get to decide what we think

Source URL: www.scottaaronson.com

• Physics
• Quantum information science
• Quantum mechanics
• Theoretical computer science
• Quantum information theory
• Statistical mechanics
• Quantum states
• Quantum entanglement
• Von Neumann entropy
• Schmidt decomposition
• Bell state
• Entropy

COSC 544 Probabilistic Proof SystemsIntroductory Lecture Lecturer: Justin Thaler

Source URL: people.cs.georgetown.edu

• Cryptography
• Complexity classes
• Computational complexity theory
• Mathematics
• Interactive proof system
• Zero-knowledge proof
• Probabilistically checkable proof
• IP
• Soundness
• NEXPTIME
• Mathematical proof
• Zero knowledge

Lecture 6, Thurs Feb 2: Mixed States So far we’ve only talked about ​pure states​ (i.e., isolated quantum systems), but you can also have quantum superposition layered together with regular, old probabilistic uncer

Source URL: www.scottaaronson.com

• Quantum mechanics
• Physics
• Quantum information science
• Theoretical computer science
• Quantum entanglement
• Density matrix
• Quantum superposition
• Matrix
• Quantum state
• Hermitian matrix
• Qubit
• Bell state

ECE/CS498: Applied Cryptography Instructor: Andrew Miller, TA: Kevin Liao Lecture 3: More Interactive Proofs 1

Source URL: gitlab-beta.engr.illinois.edu

• Cryptography
• Public-key cryptography
• Commitment scheme
• Secret sharing
• Negligible function
• XTR
• Zero-knowledge proof