Google Confirms Quantum Supremacy Using a Programmable Superconducting Processor. All those wires are devoted to controlling individual qubits and keeping everything at incredibly cold temperatures. Photo: © Google
Google will not back down from its claim that it has achieved quantum supremacy. It was only just over a month ago when they first made the claim and of course, their competitors adamantly denied the milestone. Well, that has changed since Google’s research paper has officially been published by the scientific journal Nature.
Making such a claim is not a laughing matter. The reason is because that quantum computers have the ability to solve the problems current technology cannot even begin to fathom. In the paper, google released it stated how its 53-bit quantum computer — named Sycamore — took just 200 seconds to perform a calculation that would have taken the world’s fastest supercomputer 10,000 plus years to perform.
The Sycamore Processor
The quantum supremacy experiment was run on a fully programmable 54-qubit processor named “Sycamore.” It’s comprised of a two-dimensional grid where each qubit is connected to four other qubits. As a consequence, the chip has enough connectivity that the qubit states quickly interact throughout the entire processor, making the overall state impossible to emulate efficiently with a classical computer.Quantum Supremacy Using a Programmable Superconducting Processor
Scientists are still debating whether or not the quantum supremacy experiment actually demonstrates what it claims. Two days ago on October 21st, IBM published a blog post in which they argue the classical computer can run a more accurate outcome in just two and a half days. To say a classical computer cannot do what a quantum one can is theorized to be just ridiculous in nature.
In the journal Nature it says the following about the future:
Quantum processors based on superconducting qubits can now perform computations in a Hilbert space of dimension 253 ≈ 9 × 1015, beyond the reach of the fastest classical supercomputers available today. To our knowledge, this experiment marks the first computation that can be performed only on a quantum processor. Quantum processors have thus reached the regime of quantum supremacy. We expect that their computational power will continue to grow at a double-exponential rate: the classical cost of simulating a quantum circuit increases exponentially with computational volume, and hardware improvements will probably follow a quantum-processor equivalent of Moore’s law52,53, doubling this computational volume every few years. To sustain the double-exponential growth rate and to eventually offer the computational volume needed to run well-known quantum algorithms, such as the Shor or Grover algorithms25,54, the engineering of quantum error correction will need to become a focus of attention.
The extended Church–Turing thesis formulated by Bernstein and Vazirani55 asserts that any ‘reasonable’ model of computation can be efficiently simulated by a Turing machine. Our experiment suggests that a model of computation may now be available that violates this assertion. We have performed random quantum circuit sampling in polynomial time using a physically realizable quantum processor (with sufficiently low error rates), yet no efficient method is known to exist for classical computing machinery. As a result of these developments, quantum computing is transitioning from a research topic to a technology that unlocks new computational capabilities. We are only one creative algorithm away from valuable near-term applications.
Disclaimer: All works have been sited and even lifted from the original work to ensure accuracy. This means that if there is a number by a word it was taken from the source and leads back to the source from the original journal so that it links directly to sources the journal references.