Results 1 to 5 of 5

Thread: Scott Aaronson

  1. #1

  2. #2


    What quantum computing isn't | Scott Aaronson | TEDxDresden

    Nov 1, 2017

    Quantum computing, a subject as fascinating as it is intriguing. To many also an incomprehensible one. Do you know what a computer is? And what it isn't? In his fascinating and entertaining talk, Scott Aaronson elucidates the potential and the limits of quantum computing. In a sober fashion, he gives an overview of the state of research, telling us not only what we could expect from quantum computers in the future, but also what we probably shouldn't. Scott Aaronson is the David J. Bruton Centennial Professor of Computer Science at The University of Texas at Austin, USA, and director of its Quantum Information Center. He is well-known for his “complexity zoo,” which helps to classify problems that can be solved by computers, both quantum and classical, according to how hard it is to solve them.

    Scott is an accomplished academic researcher who published dozens of influential papers and won various notable awards, like the Alan T. Waterman Award in 2012. Before his current position at UT Austin, he taught at the Massachusetts Institute of Technology for nine years. In 2004, he received his Ph.D. from the University of California at Berkeley and held positions at the University of Waterloo and the Institute for Advanced Study in Princeton.

    Furthermore, Scott is well-known for his ability to explain complex topics in quantum computing to a general audience. He writes a popular blog, “Shtetl-Optimized,” has composed several famous essays, co-authored webcomics, and published a book “Quantum Computing since Democritus.

  3. #3


    03/01/2019 - DSC - Scott Aaronson: Quantum supremacy & its applications

    Apr 8, 2019

    03-01-2019
    Scott Aaronson is the David J. Bruton Centennial Professor of Computer Science at The University of Texas at Austin and director of the university's Quantum Information Center. He presented "Quantum Supremacy & Its Applications at Argonne's Director’s Special Colloquium.

    Abstract: In the near future, there will likely be special-purpose quantum computers with 50-70 high-quality qubits and controllable nearest neighbor couplings. In this talk, Aaronson discussed general theoretical foundations for how to use such devices to demonstrate ​“quantum supremacy”: that is, a clear quantum speedup for *some* task, motivated by the goal of overturning the Extended Church-Turing Thesis (which says that all physical systems can be efficiently simulated by classical computers) as confidently as possible.

    Aaronson then discussed some new work on how these sorts of experiments could be used to generate certified random bits, for use in cryptographic protocols and other applications.

  4. #4


    Scott Aaronson: Quantum Computing | AI Podcast #72 with Lex Fridman

    Feb 17, 2020

    Scott Aaronson is a professor at UT Austin, director of its Quantum Information Center, and previously a professor at MIT. His research interests center around the capabilities and limits of quantum computers and computational complexity theory more generally. This conversation is part of the Artificial Intelligence podcast.

    Outline:

    0:00 - Introduction
    5:07 - Role of philosophy in science
    29:27 - What is a quantum computer?
    41:12 - Quantum decoherence (noise in quantum information)
    49:22 - Quantum computer engineering challenges
    51:00 - Moore's Law
    56:33 - Quantum supremacy
    1:12:18 - Using quantum computers to break cryptography
    1:17:11 - Practical application of quantum computers
    1:22:18 - Quantum machine learning, questinable claims, and cautious optimism
    1:30:53 - Meaning of life

  5. #5


    Scott Aaronson: Computational Complexity and Consciousness | Lex Fridman Podcast #130

    Oct 11, 2020

    Scott Aaronson is a quantum computer scientist.

    Outline:
    0:00 - Introduction
    3:31 - Simulation
    8:22 - Theories of everything
    14:02 - Consciousness
    36:16 - Roger Penrose on consciousness
    46:28 - Turing test
    50:16 - GPT-3
    58:46 - Universality of computation
    1:05:17 - Complexity
    1:11:23 - P vs NP
    1:23:41 - Complexity of quantum computation
    1:35:48 - Pandemic
    1:49:33 - Love

Социальные закладки

Социальные закладки

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •