Slide 1Efficient Simulation of Quantum Mechanics Collapses the Polynomial Hierarchy Scott Aaronson Alex Arkhipov MIT (yes, really) Slide 2 In 1994, something big happened…
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 1A Full Characterization of Quantum Advice Scott Aaronson Andrew Drucker Slide 2 Freeze-Dried Computation Motivating Question: How much useful computational work can…
Slide 1New Computational Insights from Quantum Optics Scott Aaronson Based on joint work with Alex Arkhipov Slide 2 The Extended Church- Turing Thesis (ECT) Everything feasibly…
Slide 11 Approximate string matching using factor automata J. Holub and B. Melichar Theoretical Computer Science vol.249 p.305-311 Speaker: L. C. Chen Advisor: R. C. T. Lee…
Slide 1Automata Theory CS 3313 Chapter 4 An Introduction to Finite Automata Slide 2 Finite State Systems: *The finite automaton is a mathematical model of a system, with…