CERN Accelerating science

Talk
Title	Quantum Computing and the Limits of the Efficiently Computable
Video	If you experience any problem watching the video, click the download button below Download Embed Show n. of views Mp4: 1080p (presentation) 360p (presentation) 480p (presentation) 720p (presentation) 1080p (presenter) 360p (presenter) 480p (presenter) 720p (presenter) Subtitles: English FrançAis Copy-paste this code into your page: <iframe width="640" height="360" frameborder="0" src="http://cds.cern.ch/video/1981892?" allowfullscreen></iframe>
Author(s)	Aaronson, Scott (speaker) (MIT)
Corporate author(s)	CERN. Geneva
Imprint	2015-01-15. - 5021.
Series	(CERN Colloquium)
Lecture note	on 2015-01-15T16:30:00
Subject category	CERN Colloquium
Abstract	I'll discuss how computational complexity---the study of what can and can't be feasibly computed---has been interacting with physics in interesting and unexpected ways. I'll first give a crash course about computer science's P vs. NP problem, as well as about the capabilities and limits of quantum computers. I'll then touch on speculative models of computation that would go even beyond quantum computers, using (for example) hypothetical nonlinearities in the Schrodinger equation. Finally, I'll discuss BosonSampling ---a proposal for a simple form of quantum computing, which nevertheless seems intractable to simulate using a classical computer---as well as the role of computational complexity in the black hole information puzzle.
Copyright/License	© 2015-2024 CERN
Submitted by	[email protected]