Nicholas LaRacuente "How Hard is it to Simulate Observations of a Quantum Process?"
- Event Type
- Seminar/Symposium
- Sponsor
- Illinois Computer Science
- Location
- In person 3401 SC or online
- Virtual
- Join online
- Date
- Jan 23, 2023 11:00 am
- Speaker
- Nicholas LaRacuente (U. Chicago)
- Contact
- Candice Steidinger
- steidin2@illinois.edu
- Phone
- 217-300-8564
- Views
- 105
- Originating Calendar
- Siebel School Speakers Calendar
We look forward to seeing you in person in 3401 SC or online on Monday, Jan. 23 for the Theory Seminar.
Abstract:
A key motivation for quantum computing is the generally believed hardness of simulating quantum processes on classical computers. This expectation breaks from the original extended or complexity-theoretic Church-Turing thesis, positing a realizable model of (quantum) computation that is not polynomially reducible to a (classical) Turing machine. Much recent attention has focused on models of computation believed to be less powerful than scalable quantum computing yet able to demonstrate or usefully exploit non-classical efficiencies. A large part of this talk will review major developments, including controversies and subtleties in interpretation. Then I will discuss my work with Bill Fefferman on classical hardness of sampling from processes that more closely resemble natural, physical systems. Our inquiry considers whether quantum systems in the universe may already demonstrate non-classical computation and how experiments on quantum simulators relate to random circuit models.