Scott’s Supreme Quantum Supremacy FAQ
scottaaronson.com
Scott’s Supreme Quantum Supremacy FAQ
1–10 of 215 posts
Re: Scott’s Supreme Quantum Supremacy FAQ
#2What exactly is a qubit? I'm not asking what does it mean, because I know there's superpositions and all that jazz, but as in...like, in an electronic circuit, what is a qubit? Is it made out of logic gates? Which ones?
If we can make one qubit, can't we just make a bunch of them by copy and pasting circuits similar to how we used vacuum tubes in the 60s and 70s? How come our current limit is only around 54 or so?
Are qubits, and quantum computers by extension, not even electronic circuits? If so...what the hell are they?
Re: Scott’s Supreme Quantum Supremacy FAQ
#3He has exceeded my expectations with this post, which cuts through all the hype to communicate exactly what the results of this experiment mean for the field. It's worth reading and sharing.
Re: Scott’s Supreme Quantum Supremacy FAQ
#4Re: Scott’s Supreme Quantum Supremacy FAQ
#5Preface: I know nothing about quantum computing. What exactly is a qubit? I'm not asking what does it mean, because I know there's superpositions and all that jazz, but as in...like, in an electronic circuit, what is a qubit? Is it made out of logic gates? Which ones? If we can make one qubit, can't we just make a bunch of them by copy and pasting circuits similar to how we used vacuum tubes in the 60s and 70s? How c…
Re: Scott’s Supreme Quantum Supremacy FAQ
#6Re: Scott’s Supreme Quantum Supremacy FAQ
#7Preface: I know nothing about quantum computing. What exactly is a qubit? I'm not asking what does it mean, because I know there's superpositions and all that jazz, but as in...like, in an electronic circuit, what is a qubit? Is it made out of logic gates? Which ones? If we can make one qubit, can't we just make a bunch of them by copy and pasting circuits similar to how we used vacuum tubes in the 60s and 70s? How c…
It's an entirely new type of computing apparatus, using the fundamental state of particles. No electron circuits, those won't work.
And it's expensive because of the above. These things are massive, have to be kept at cyrogenic temperature, and isolation gets harder the more particles you have.
Re: Scott’s Supreme Quantum Supremacy FAQ
#8"I’m trying to understand the chain of inference from Google’s leaked result of quantum supremacy to theoretical computer-science “hardness” of the computation.
Computing the exact probabilities of a random quantum circuit is proven hard, but computing the exact probability of a random algorithm is also an open problem, so what you really care about is approximation of computing the probability (up to epsilon), or even weaker, just sampling from a probability (also up to epsilon under some metric of comparing distributions).
Their computer implements Random Circuit Sampling, and their cited “theoretical” hardness results are your paper from 2017, of QUATH => HOG, and as far as I understood from your paper, proving that approximation / sampling from a (random) quantum computer/circuit is hard is still an open problem (Am I wrong here? I’m not up to date with everything), and a difficult one. But you did make a compelling argument that even if QUATH was solvable, it will lead to new insights.
Their actual benchmark uses cross-entropy benchmarking, called xeb in their paper, and defined as 2^n* [P(x_i)] _i-1 (Can’t type brackets). I could not find any ‘theoretical hardness’ paper at all using this benchmark, some results talk about different XEB using log but they prove these are not strong enough and can be reached classically.
Are there any hardness results for their benchmark? I wonder why they would use that instead of the proven HOG, even for smaller input sizes, I would see more value in a benchmark which has theoretical roots. I feel intuitively like their benchmark is much more similar to the log variation of XEB than to HOG, but didn’t think it through completely.
As for their gates, I understand they are not general random quantum gates, but instead they have a variation of iSWAP and controlled phase CZ. The hardness results that do exist also don’t address the limited gates, in how it changes the distribution of random circuits. Are those two gates at least universal, so that we have hope that this could be proved? Their statement was “but reliably generating a target unitary remains an active area of research”, so I assume they aren’t universal. I would love to see some heuristic argument as to why those two in particular are hard, especially given results like Gottesman–Knill theorem, it seems like some surprising gates do have classical simulation. iSWAP is just swap and phase gates, and CZ is phase gate only on the 11 state. Doesn’t feel like it could be universal to me but maybe I’m wrong.
I probably missed some things, so I’d love it if you could point to papers filling the gaps between their results and a real theoretical statement. I don’t have the intuition to tell which gaps are important and which are not. I also don’t know which papers/results already exist and I can’t really search as I am not an academic, and don’t have full access to many papers, and you probably know the state of the art results. "
Re: Scott’s Supreme Quantum Supremacy FAQ
#9Preface: I know nothing about quantum computing. What exactly is a qubit? I'm not asking what does it mean, because I know there's superpositions and all that jazz, but as in...like, in an electronic circuit, what is a qubit? Is it made out of logic gates? Which ones? If we can make one qubit, can't we just make a bunch of them by copy and pasting circuits similar to how we used vacuum tubes in the 60s and 70s? How c…
Okay, now what can we do with that?
"crack encryption by simulating a state!" yeah but what? is that something I should be concerned about now? "hahaha no no no silly normie we'd need two thousand qubits for that, this machine only has 53!" oooookay, and you did that number in your head, how??? "we just solved the first unsolvable problem that a mere bit bound supercomputer couldn't solve, look at this math formula!" but that didn't explain "we are celebrating, are you not celebrating"
There just seems to be a lack of non-introductory but non-PhD level information. Where is the "explain it like I've been accepted into college at all".
Re: Scott’s Supreme Quantum Supremacy FAQ
#10Preface: I know nothing about quantum computing. What exactly is a qubit? I'm not asking what does it mean, because I know there's superpositions and all that jazz, but as in...like, in an electronic circuit, what is a qubit? Is it made out of logic gates? Which ones? If we can make one qubit, can't we just make a bunch of them by copy and pasting circuits similar to how we used vacuum tubes in the 60s and 70s? How c…
You can do it with electron spin or photon polarization or by any number of properties, but it's the state of a fundamental particle. It's an entirely new type of computing apparatus, using the fundamental state of particles. No electron circuits, those won't work. And it's expensive because of the above. These things are massive, have to be kept at cyrogenic temperature, and isolation gets harder the more particles…