Ask Me Anything! Tenure Edition
Monday, May 6th, 2013Update (5/7): Enough! Thanks, everyone, for asking so many imaginative questions, and please accept my apologies if yours remains unaddressed. (It’s nothing personal: they simply came fast and furious, way faster than I could handle in an online fashion—so I gave up on chronological order and simply wrote answers in whatever order they popped into my head.) At this point, I’m no longer accepting any new questions. I’ll try to answer all the remaining questions by tomorrow night.
By popular request, for the next 36 hours—so, from now until ~11PM on Tuesday—I’ll have a long-overdue edition of “Ask Me Anything.” (For the previous editions, see here, here, here, and here.) Today’s edition is partly to celebrate my new, tenured “freedom to do whatever the hell I want” (as well as the publication after 7 years of Quantum Computing Since Democritus), but is mostly just to have an excuse to get out of changing diapers (“I’d love to, honey, but the world is demanding answers!”). Here are the ground rules:
- One question per person, total.
- Please check to see whether your question was already asked in one of the previous editions—if it was, then I’ll probably just refer you there.
- No questions with complicated backstories, or that require me to watch a video, read a paper, etc. and comment on it.
- No questions about D-Wave. (As it happens, Matthias Troyer will be giving a talk at MIT this Wednesday about his group’s experiments on the D-Wave machine, and I’m planning a blog post about it—so just hold your horses for a few more days!)
- If your question is offensive, patronizing, nosy, or annoying, I reserve the right to give a flippant non-answer or even delete the question.
- Keep in mind that, in past editions, the best questions have almost always been the most goofball ones (“What’s up with those painting elephants?”).
That’s it: ask away!
Update (5/12): I’ve finally answered all ~90 questions, a mere 4 days after the official end of the “Ask Me Anything” session! Thanks so much to everyone for all the great questions. For your reading convenience, here’s a guide to my answers (personal favorites are in bold):
- The probability that we live in the Matrix (see followups here, here, here, here)
- Glauber dynamics
- My behavior as Waterloo lunch organizer
- The saddest thing
- Quantum cellular automata
- P!=NP vs. P!=PSPACE
- My knowledge of general relativity
- Advantages of Dirac ket notation
- The evolution of my career goals
- Open problems related to BosonSampling
- Book-signing for Quantum Computing Since Democritus
- In an infinite universe, must all possible earthlike planets exist?
- Was 9/11 an inside job?
- The fine-structure constant and quantum computing
- Accessible open problems in complexity theory
- Tightening Razborov’s monotone lower bound for CLIQUE
- In what sense is the quadratic Grover speedup “provable”?
- Fisher information
- “Associate Professor Without Tenure”
- Is the whole universe “just” a vector in Hilbert space?
- How to initialize a qubit
- My knowledge of my tenure case
- How I’d build a quantum computer in 20-30 years
- Could God solve the halting problem?
- “Who’s yer daddy?”
- How long I’d want to live
- Could the difficulty of building a QC grow exponentially with number of qubits?
- Why does quantum computing require physically different hardware?
- The double-slit experiment and “lazy evaluation”
- Bioengineered flying horses vs. flying robot horses: which will be first?
- The last program I wrote
- How much I sleep
- Recent TCS advances with practical applications in the near future
- What I’d ask Terry Tao
- How many digits will the largest known prime have in 10 or 100 years?
- Whether I believe in free will
- The nature of time
- My progress in learning Hebrew
- Social science breakthroughs that could bring about world peace
- Superquadratic advantage of the quantum adiabatic algorithm over classical search?
- Is a classical world also a quantum world?
- The name of the blog
- John Sidles’ prognostiquestion
- Books and films for Lily to grow up with
- Does QM generate “true” randomness?
- Fictitious proofs of P!=NP
- The secret of happiness
- What I did in college
- The blowup in reducing theorem-proving to 3SAT
- Whether CUP objected to the free QCSD lecture notes
- The top 5 not-yet-written books that I’d most like to read
- Does the continuum “exist” in physical reality? (see followup here)
- Could Nature itself be inconsistent?
- Zen koan about a mouse eating cat food
- “Maybe, it’s the equality sign?”
- Classical computer is to QC as QC is to what?
- Why are CS theorists obsessed with polynomial time?
- My favorite complexity theorist
- A bad approach to factoring large integers
- Am I a Bayesian?
- How to build an intelligent machine
- Will automated theorem provers become as standard as Mathematica/Maple?
- My initiation into theoretical computer science
- How to get an 8-year-old excited about programming
- “Am I insane?”
- Levin universal search
- Brain emulation by 2023? A $10,000 bet
- How being in “communist Berkeley” in my formative years shaped my worldview (see followup here)
- Israel vs. Apartheid South Africa
- Will useful QC precede its public announcement, or vice versa?
- My work habits
- US immigration policy
- My favorite Israeli foods
- If I guess randomly, how likely am I to get this question right?
- Busy Beaver numbers: is BB(n+1) provably much larger than BB(n)? (see followups here and here)
- Computational complexity and biological/social evolution
- P vs. NP vs. Shannon capacity of cycles problem
- Video games based on my research interests
- Bayesian reasoning when there are copies of yourself
- Pr[ PH=PSPACE | PH collapses ]
- My favorite interpretation of QM
- What I’d do if I proved P=NP
- QM and consciousness
- QM and free will
- Cultures of Clarkson, Cornell, Berkeley, IAS, Waterloo, MIT
- How I decide what’s ethical
- American vs. Chilean universities
