1 / 23

Quantum Computing and the Limits of the Efficiently Computable

Quantum Computing and the Limits of the Efficiently Computable. Scott Aaronson MIT. GOLDBACH CONJECTURE: TRUE NEXT QUESTION. Things we never see…. Warp drive. Ü bercomputer. Perpetuum mobile.

galia
Download Presentation

Quantum Computing and the Limits of the Efficiently Computable

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Quantum Computing and the Limits of the Efficiently Computable Scott Aaronson MIT

  2. GOLDBACH CONJECTURE: TRUE NEXT QUESTION Things we never see… Warp drive Übercomputer Perpetuum mobile The (seeming) impossibility of the first two machines reflects fundamental principles of physics—Special Relativity and the Second Law respectively So what about the third one?

  3. Complexity Theory 101 Problem: “Given a flight map, is every airport reachable from every other in 5 flights or less?” Any specific map is an instance of the problem The size of an instance, n, is the number of bits used to specify it An algorithm is polynomial-time if it uses at most knc steps, for some constants k,c P is the class of all problems for which there’s a deterministic, polynomial-time algorithm that correctly solves every instance

  4. NP: Nondeterministic Polynomial Time Does 37976595177176695379702491479374117272627593301950462688996367493665078453699421776635920409229841590432339850906962896040417072096197880513650802416494821602885927126968629464313047353426395204881920475456129163305093846968119683912232405433688051567862303785337149184281196967743805800830815442679903720933 have a factor ending in 7?

  5. NP-hard: If you can solve it, then you can solve every NP problem NP-complete: NP-hard and in NP Is there a tour that visits each city once?

  6. Hamilton cycleSteiner treeGraph 3-coloringSatisfiabilityMaximum clique… Matrix permanentHalting problem… FactoringGraph isomorphism… Graph connectivityPrimality testingMatrix determinantLinear programming… NP-hard NP-complete NP P

  7. Does P=NP? The (literally) $1,000,000 question If there actually were a machine with [running time] ~Kn (or even only with ~Kn2), this would have consequences of the greatest magnitude.—Gödel to von Neumann, 1956

  8. Extended Church-Turing Thesis An important presupposition underlying P vs. NP is the... “Any physically-realistic computing device can be simulated by a deterministic or probabilistic Turing machine, with at most polynomial overhead in time and memory” So how sure are we of this thesis? Have there been serious challenges to it?

  9. Old proposal: Dip two glass plates with pegs between them into soapy water. Let the soap bubbles form a minimum Steiner tree connecting the pegs—thereby solving a known NP-hard problem “instantaneously”

  10. Other Approaches Protein folding: Can also get stuck at local optima (e.g., Mad Cow Disease) DNA computers: Just massively parallel classical computers

  11. Ah, but what about quantum computing?(you knew it was coming) Quantum mechanics: “Probability theory with minus signs”(Nature seems to prefer it that way) In the 1980s, Feynman, Deutsch, and others noticed that quantum systems with n particles seemed to take ~2n time to simulate—and had the amazing idea of building a “quantum computer” to overcome that problem Quantum computing: “The power of 2n complex numbers working for YOU” Actually building a QC: Damn hard, because of decoherence. (But seems possible in principle!)

  12. Journalists Beware:A quantum computer is NOT like a massively-parallel classical computer! Exponentially-many basis states, but you only get to observe one of them Any hope for a speedup rides on the magic of quantum interference

  13. Interesting BQP (Bounded-Error Quantum Polynomial-Time): The class of problems solvable efficiently by a quantum computer, defined by Bernstein and Vazirani in 1993 Shor 1994: Factoring integers is in BQP NP-complete NP Factoring BQP P

  14. Remember: factoring isn’t thought to be NP-complete! Today, we don’t believe BQP contains all of NP(though not surprisingly, we can’t prove that it doesn’t) Bennett et al. 1997: “Quantum magic” won’t be enough If you throw away the problem structure, and just consider an abstract “landscape” of 2n possible solutions, then even a quantum computer needs ~2n/2 steps to find the correct one (That bound is actually achievable, using Grover’s algorithm!) So, is there any quantum algorithm for NP-complete problems that would exploit their structure?

  15. Quantum Adiabatic Algorithm(Farhi et al. 2000) Hi Hf Hamiltonian with easily-prepared ground state Ground state encodes solution to NP-complete problem Problem: “Eigenvalue gap” can be exponentially small

  16. Nonlinear variants of the Schrödinger Equation Abrams & Lloyd 1998: If quantum mechanics were nonlinear, one could exploit that to solve NP-complete problems in polynomial time 1 solution to NP-complete problem No solutions

  17. Relativity Computer DONE

  18. Zeno’s Computer STEP 1 STEP 2 Time (seconds) STEP 3 STEP 4 STEP 5

  19. Here’s a polynomial-time algorithm to solve NP-complete problems (only drawback is that it requires time travel): Read an integer x{0,…,2n-1} from the future If x encodes a valid solution, then output x Otherwise, output (x+1) mod 2n Closed Timelike Curves (CTCs) If valid solutions exist, then the only fixed-points of the above program input and output them Building on work of Deutsch, [A.-Watrous 2008] defined a formal model of CTC computation, and showed that in both the classical and quantum cases, it has exactly the power of PSPACE (believed to be even larger than NP)

  20. “The No-SuperSearch Postulate”There is no physical means to solve NP-complete problems in polynomial time. Includes PNP as a special case, but is stronger No longer a purely mathematical conjecture, but also a claim about the laws of physics If true, would “explain” why adiabatic systems have small spectral gaps, the Schrödinger equation is linear, CTCs don’t exist...

  21. Question: What exactly does it mean to “solve” an NP-complete problem? Example: It’s been known for decades that, if you send n identical photons through a network of beamsplitters, the amplitude for the photons to reach some final state is given by the permanent of an nn matrix of complex numbers Lesson: If you can’t observe the answer, it doesn’t count! Recently, Alex Arkhipov and I gave the first evidence that even the observed output distribution of such a linear-optical network would be hard to simulate on a classical computer—but the argument was necessarily more subtle But the permanent is #P-complete (believed even harder than NP-complete)! So how can Nature do such a thing? Resolution: The amplitudes aren’t directly observable, and require exponentially-many probabilistic trials to estimate

  22. One could imagine worse research agendas than the following: Prove P≠NP(better yet, prove factoring is classically hard, implying P≠BQP) Prove NPBQP—i.e., that not even quantum computers can solve NP-complete problems Build a scalable quantum computer(or even more interesting, show that it’s impossible) Determine whether all of physics can be simulated by a quantum computer “Derive” as much physics as one can from No-SuperSearch and other impossibility principles Conclusion

  23. Papers, talk slides, blog: www.scottaaronson.com

More Related