Live data from Hacker News

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

news.ycombinator.com

311–320 of 373 posts

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

#311

Do you think the state of the art in quantum computing is already more advanced than we realize, in the same way that the state of the art in cryptography was when R, S, and A thought they had discovered RSA?

If I knew the answer, I couldn't tell you. :-)

More seriously: people have mooted this possibility for as long as I've been in this field (~20 years). But keep in mind that, when Cocks and Williamson at GCHQ discovered what would later become known as RSA and Diffie-Hellman key exchange---so, 3-4 years ahead of the open world---cryptography essentially didn't yet exist as an academic subject. Almost all the action was still closely tied to the intelligence community. So, no surprise that a not-yet-existing discipline had fallen behind!

By contrast, quantum computing has been openly studied for decades and has thousands of people working on it all over the world. The central thing that causes me to be skeptical of the "million-qubit quantum computer sitting in the NSA's basement" hypothesis, is that we pretty much know who the best people are, and we haven't noticed any effort to vacuum them all up analogous to the Manhattan Project.

Like, it's no secret that the NSA and DoD, and other military and intelligence agencies around the world, are interested in this field and fund a good deal of work on it. In fact my main grant right now (the Vannevar Bush Faculty Fellowship) comes from the Office of Naval Research. But if the secret world is light-years ahead of the open world, then they'd also need to be executing a giant cover operation of pretending to care about what we in academia are doing! :) So at what point does it become an unfalsifiable conspiracy theory?

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

#312

Earlier quoted context omitted.

When I'm not flipping qubits around, I eat, sleep, blog, answer emails, play with my two kids, get depressed reading the news about US politics, and then get even more depressed reading people saying mean things about me and my nerdy friends on Twitter and Reddit.

Awwww man! That sucks, but screw those naysayers. They ain't the ones running point on quantum computing. (I don't really have much to ask you since anything I could comprehend is easily googlable and I don't wanna waste ur time. Just wanna say keep up the good work and thanks!)

Thanks!!!

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

#313

You wrote this: > For example, breaking almost any cryptographic code can be phrased as an NP problem. So if P=NP—and if, moreover, the algorithm that proved it was “practical” (meaning, not n^1000 time or anything silly like that)—then all cryptographic codes that depend on the adversary having limited computing power would be broken. Can you explain this reasoning more precisely? The class P contains difficult prob…

He explicitly says «not n^1000 time or anything silly like that» in the sentence you quote, n^googolplex would be way more silly

Yup

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

#314
post #51

How do you feel about the state of higher education? Specifically, do you think expensive degrees, underpaid PhD/Postdoc positions, and shortage of tenured jobs may discourage students from joining academia and push them into industry instead? It feels to me our best brains are at Facebook and Google doing cutting-edge research on how best to manipulate our mammal brains into buying ever more crap...

Yes, I'm (not surprisingly :-) ) a fan of increasing federal funding for academic research. Equally important, enough of the funding needs to be in unrestricted, competitively awarded grants for basic science, rather than tied up in huge projects that are someone's hobbyhorse. And dramatically cutting NSF graduate fellowships---something that the NSF will likely do if Trump gets his way with slashing the NSF budget---would obviously be a huge step in the wrong direction.

In quantum computing in the US, we have no right to complain right now about the level of federal funding, since almost everyone else has it worse! For us, the limiting factor has instead tended to be tenure-track faculty positions in CS and physics departments. All the funding and brilliant students in the world wouldn't matter if, outside of a few elite universities, the CS departments all said "this is really physics," the physics departments all said "this is really CS," and both treated it as a passing fad that might disappear in a couple years. Fortunately, though, the situation has steadily improved and I expect that to continue.

On the whole, I think the fact that Google, Microsoft, and other companies hire so many CS PhDs is good, not bad. That's a big part of what lets us admit lots of talented PhD students, and honestly tell them that their career prospects afterward are good. On the other hand, I think it's also true, as you say, that society could better capture the value of a lot of these people by trying to keep them in the open academic world.

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

#315
post #60

If I use a quantum random number to pick my actions does that mean there's a universe where I took each option? This terrifies me

Relax, my friend. If you accept the Many-Worlds Interpretation at all, then you're constantly splitting into parallel copies, millions of times per second, with every little decoherence event that takes place in your brain. Whether or not you use a quantum random number generator is totally beside the point. :-)

(But if it makes you feel less terrified, you could also choose one of the interpretations according to which "only our branch is real." As far as anyone can tell today, there are no consequences for any experiment we'll ever be able to do.)

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

#316

Hi Scott. I've read your 'Why Philosophers Should Care About Computational Complexity' - I found it to be a very nice read. Is your book 'Quantum Computing Since Democritus' worth getting my hands on? Is it not going to be too repetitive given that I've read your article?

Thanks!

Given your particular situation, it sounds to me like you should not only buy QCSD, but buy 200 copies of it to give all your friends and family. :-)

More seriously, the overlap between QCSD and WPSCACC is actually relatively small---e.g., WPSCACC just has one short section about quantum mechanics, whereas that's at least half of QCSD. QCSD is also written in a much chattier style (but at the same time, it has more space to exposit basic material). I can't guarantee that you'll like QCSD, but I hope that gives you a sense for the diff.

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

#317

Earlier quoted context omitted.

That word 'testable', is very loaded. :) But I get what you mean. Are there things that we can't test that do exist?

> Are there things that we can't test that do exist? Lots of people think so (e.g. unmeasurable things predicted by theory like parallel universes, but also things like evil or God or the color purple), but by definition it's hard to be very sure, or to transfer your own confidence in such things to others. Lots of these kinds of questions reduce to quibbling about definitons; and also by definition, if we can't test…

> if we can't test the thing then the universe isn't going to punish us either way for believing or not.

If we can’t test the thing then what we are discussing is faith, not science.

Nothing wrong with faith and beliefs but I think it’s important to differentiate between these things and science because often times science is used as a basis for untestable beliefs and then people really start to think that those untestable beliefs are actually backed by scientific research.

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

#318
post #129

Hi Scott, what would you say are the main reasons why you in your mid-thirties are a professor at a prestigious university? Sheer determination and perseverance? Less partying and more learning? Your upbringing? I’m asking, because sometimes there’s an interesting story behind it, like with Matt Might ( http://matt.might.net/articles/tenure/ ) who found himself in a objectively bad situation — a child believed to die…

Well, the "less partying" part sounds accurate. :-) In grad school, for example, I had some good friends, but very little "party life" and certainly very little dating life---not out of choice, just because I didn't even know how to start. As a result, I was often severely depressed. On the positive side, though, I was more productive at research than I've ever been since! I had unlimited time to think, and also enormous drive to succeed so that at least something would be going right in my life. Just as important, though, I loved actually working on research problems (still do), as opposed to just the recognition you get from other people after you've solved one. I could form an infatuation with a particular problem that would last weeks or months.

Now that I have tenure and a wife and two kids, and get to travel the world and study what interests me, I'd like to tell myself a story according to which "all the hard work and sacrifice ultimately paid off." On the other hand, I know people who had fantastic social lives all throughout college and are now also highly successful---an instance of the general phenomenon that there's no justice in the universe. :-D

Anyway, if you're interested, I told some more of my story in my Scientific American interview with John Horgan - https://blogs.scientificamerican.com/cross-check/scott-aaron...

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

#319

Scott what do you think is going to be a successor to the scientific paper/academic journal? What do you think of platforms like distill.pub and Fermat's Library and the impact they might have?

I'd seen Fermat's Library but haven't used it. I hadn't heard of distill.pub before your comment.

Honestly, I don't see scientific papers going away anytime soon. What's the alternative to an individual or group setting out clearly in writing what they discovered, the evidence that it's true, and the background and context to the discovery, putting the writeup where interested people can easily find it, and then taking full responsibility for it, so others can cite and build on the work? As far as I'm concerned, that's all a "scientific paper" means---regardless of whether it appears in a prestigious journal or just the arXiv or somewhere else on the web, and whether it otherwise follows normal academic writing conventions or flouts them. Even an answer on a website like MathOverflow, were it sufficiently well-written and sourced, could as far as I'm concerned be cited as a research paper and given academic credit.

But while "papers," for some definition, are probably here to stay, I'm optimistic about deep reform to the system of journals. The first step, of course, should be for academics to shake off the yoke of the truly brazen predatory publishers like Elsevier. Many of us have already pledged never again to review for or submit to those publishers, at least until they fundamentally change their practices. For more about this, see my review of "The Access Principle": https://www.scottaaronson.com/writings/journal.html

As the next step, we should break free even of society journals, insofar as they put research results behind a paywall. Everything---certainly if it was funded by the taxpayers---should be freely accessible on the web. (In math, CS, and physics, we already put essentially all our papers on the arXiv, where they're freely available, and have been doing that for ~25 years. But the fact that the paywalls even exist still rankles---and other fields, like biology, have yet to catch up.)

Ultimately, we might converge on the model of journals as "arXiv overlays": that is, stamps of approval that particular arXiv preprints have been peer-reviewed (which is pretty much the only service that journals now provide anyway). Or maybe we'll even handle peer review in some other way entirely. E.g., people keep trying to experiment with peer reviews being public, but it keeps failing---possibly because, lo and behold, most academics don't want their frank commentary on the importance of each other's work to be made public with their names on it! :-)

As it happens, my friend and colleague Michael Nielsen used to work in quantum computing, but now spends full time at Y Combinator thinking about the future of scientific communication. He wrote a book that had lots of interesting ideas for how we could improve things, and surely there are many other good ideas waiting to be proposed, possibly taking advantage of recent or near-future technologies. While the concept of a "paper" (or treatise, or monograph, or note, or other unit of written research) strikes me as mostly determined by the nature of science itself, as far as I'm concerned almost everything else is up for grabs.

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

#320

I took a grad-level quantum computing class which I didn't quite have the physics background for, and the lecture that lost me, about 3 weeks in, was on the different kinds of physical gates quantum computers use. My recollection is that there were 3 necessary gates for a quantum functionally complete set: One gate was classically functionally complete, the other two are where I got lost. Can you explain like I'm 5 (…

Actually, if you already have a classically functionally complete gate (say, the Fredkin or Toffoli gates), then you only need one other gate to get a functionally complete set for quantum computing. This one other gate could be the Hadamard, which I discussed in other answers. The Hadamard gate is needed to put your machine into a superposition of states, and then also to create interference between the different branches of the superposition. Of course, if you have no superposition and no interference, then it isn't much of a quantum computer!

If your question was instead to explain the concepts of superposition and interference themselves, then unfortunately that would take more time. However, you could try some essays that I wrote a while ago

https://www.scottaaronson.com/writings/highschool.html

https://www.scottaaronson.com/blog/?p=208

in addition to the resources that have been linked to elsewhere on this thread.

Post reply on HN