1. Object-Oriented Programming (OOP) Lecture No. 33 2. Recap • Templates are generic abstractions • C++ templates are of two kinds – Function Templates – Class Templates…
Slide 1Computation, Quantum Theory, and You Scott Aaronson, UC Berkeley Qualifying Exam May 13, 2002 Slide 2 Talk Outline 1.Sermon 2.Quantum Computing Overview 3.Collision…
Slide 1The Learnability of Quantum States Scott Aaronson University of Waterloo Slide 2 Quantum State Tomography Suppose we have a physical process that produces a quantum…
Slide 1Quantum Double Feature Scott Aaronson (MIT) The Learnability of Quantum States Quantum Software Copy-Protection Slide 2 Starting Point For This Work: A Practical Problem…
Slide 1New Evidence That Quantum Mechanics Is Hard to Simulate on Classical Computers Scott Aaronson (MIT) Joint work with Alex Arkhipov Slide 2 Computer Scientist / Physicist…
Slide 1Solving Hard Problems With Light Scott Aaronson (Assoc. Prof., EECS) Joint work with Alex Arkhipov vs Slide 2 In 1994, something big happened in the foundations of…
Slide 1The Computational Complexity of Linear Optics Scott Aaronson (MIT) Joint work with Alex Arkhipov vs Slide 2 In 1994, something big happened in the foundations of computer…
Slide 1Scott Aaronson (MIT) Based on joint work with John Watrous (U. Waterloo) BQP PSPACE Quantum Computing With Closed Timelike Curves Slide 2 Motivation Ordinary quantum…
Slide 1On Non-Black-Box Proofs of Security Boaz Barak Princeton Slide 2 9 OWF ) 9 signature schemes [NaorYung,Rompel] Prototypical Crypto Thm: If problem X is hard then scheme…