I've been interested in Quantum Computing since the early 2000s because of its potential to revolutionize materials science (see here). A few years back I wrote an article talking about Google's aggressive pursuit of Quantum Computing (article found here). Now it looks like Google is ready to demonstrate quantum computing supremacy, which basically is a term that means a quantum computer built by Google will solve a problem that a supercomputer can't. Quantum computers, because of the way that they work, can solve some classes of problems that can't be solve by traditional computers and thus you don't need a very big Quantum computer to do some amazing stuff.
Here is the article talking about Google's preparations for this momentous moment:
Google’s New Chip Is a Stepping Stone to Quantum Computing Supremacy
He’s leader of the Google research group working on building astonishingly powerful computer chips that manipulate data using the quirks of quantum physics. By the end of this year, Martinis says, his team will build a device that achieves “quantum supremacy,” meaning it can perform a particular calculation that’s beyond the reach of any conventional computer. Proof will come from a kind of drag race between Google’s chip and one of the world’s largest supercomputers.
“We think we’re ready to do this experiment. It’s something we can do now,” says Martinis.
One reason for his confidence is that Google’s roughly 25-strong group has made a new quantum chip that tests out key design features needed to make a device for that head-to-head contest.
Quantum chips represent digital bits of data using qubits, devices that can shortcut through some tough calculations by exploiting the counterintuitive physics of quantum mechanics. Researchers have so far demonstrated quantum computing with only small groups of qubits, though. Google has released results from a chip that has nine qubits arranged in a line, but Martinis says he’ll need a grid of 49 qubits for his quantum supremacy experiment.
Article Continues Here
Good Answers:
"Almost" Good Answers: