Re:Google claims to have reached quantum supremacy
by The_rationalist on Friday September 20, 2019 @05:41PM
(#21031596)
Yes, What computation are we talking about?
Re:Google claims to have reached quantum supremacy
by buboard on Sunday September 22, 2019 @06:18AM
(#21040597)
> To demonstrate quantum supremacy, we compare our
quantum processor against state-of-the-art classical com-
puters in the task of sampling the output of a pseudo-
random quantum circuit[24{26]. Random circuits are a
suitable choice for benchmarking since they do not pos-
sess structure and therefore allow for limited guarantees
of computational hardness[24, 25, 27, 28]. We design the
circuits to entangle a set of quantum bits (qubits) by re-
peated application of single-qubit and two-qubit logical
operations. Sampling the quantum circuit’s output pro-
duces a set of bitstrings, e.g. f0000101, 1011100, ...g.
Due to quantum interference, the probability distribution
of the bitstrings resembles a speckled intensity pattern
produced by light interference in laser scatter, such that
some bitstrings are much more likely to occur than oth-
ers. Classically computing this probability distribution
becomes exponentially more dicult as the number of
qubits (width) and number of gate cycles (depth) grows.
"A paper by Google’s researchers seen by the FT, that was briefly posted earlier this week on a Nasa website before being removed, claimed that their processor was able to perform a calculation in three minutes and 20 seconds that would take today’s most advanced classical computer, known as Summit, approximately 10,000 years."
Why was that paper removed on the Nasa website? Also, I'm curious if supplementary data was provided to support the claims?