Live data from Hacker News

I'm Scott Aaronson, quantum computing/computational complexity researcher. AMA

news.ycombinator.com

1–10 of 373 posts

I'm Scott Aaronson, quantum computing/computational complexity researcher. AMA

#1
Hey HN,

We recently recorded a podcast (https://blog.ycombinator.com/scott-aaronson-on-computational-complexity-theory-and-quantum-computers/) where I discussed my research, AI, and advice for nerds in general or people who want careers in science.

We covered many but not all of the questions submitted over the internet so AMA!

Re: I'm Scott Aaronson, quantum computing/computational complexity researcher. AMA

#3
Hi Scott,

Shtetl-Optimized's tagline is famously "Quantum computers would not solve hard search problems instantaneously by simply trying all the possible solutions at once". What phrase do you think should replace 'trying all the possible solutions at once' in the public conciousness as a succinct description of the mechanisms of a quantum computer? Or is this topic simply too complex to be distilled into a neat synopsis while retaining accuracy?

Re: I'm Scott Aaronson, quantum computing/computational complexity researcher. AMA

#4
You were said to be a skeptic of quantum computing company d wave. Then you started believing and then went back to skepticism. What is your current status, do you think it works? What would you like to see from them?

Also, what is your take on Max Tegmark's quantum suicide experiment. Would it work? If yes would that imply that each of us should expect to live a really long time subjectively?

Re: I'm Scott Aaronson, quantum computing/computational complexity researcher. AMA

#6
post #2

Hi Scott. I did not listen to the podcast (yet), so sorry if you answered this already, but what, in your opinion, could be the greatest impact quantum computing has in society? I know its a broad question, but curious of a few bullet points.

Short answer: I think the greatest impacts might be in simulating quantum physics and chemistry themselves, and thereby giving a new window into nature that could have applications to drug design, materials science, batteries, high-temperature superconductors, and more. But I could be as badly wrong as (e.g.) someone speculating about the impacts of classical computers in the 1940s, who could see applications to weather prediction and other physical simulation problems but would've totally missed the creation of Hacker News.

Long answer: See my recent blog post https://www.scottaaronson.com/blog/?p=3848 about exactly this!

Re: I'm Scott Aaronson, quantum computing/computational complexity researcher. AMA

#9
I'm halfway through the first chapter of Neilsen and Chuang's book. I'm enjoying reading about the subject and am at the quantum parallelism part.

Can you explain why Grover's algorithm has a runtime of root N? It seems like the runtime should be log2(n) because of exponential qubits or 1 because there must be a way for all the qubits to interfere.

Also, What resources do you reccomend for self study? Are there quantum computing meetups in San Francisco that you can recommend?

Post reply on HN