
Google’s quantum supreme cryostat with Sycamore inside
UC Santa Barbara/Google researchers demonstrate the power of 53 entangled qubits
Researchers in UC Santa Barbara/Google scientist John Martinis’ group have made good on their claim to quantum supremacy. Using 53 entangled quantum bits (“qubits”), their Sycamore computer has taken on — and solved — a problem considered intractable for classical computers.
“A computation that would take 10,000 years on a classical supercomputer took 200 seconds on our quantum computer,” said Brooks Foxen, a graduate student researcher in the Martinis Group. “It is likely that the classical simulation time, currently estimated at 10,000 years, will be reduced by improved classical hardware and algorithms, but, since we are currently 1.5 billion times faster, we feel comfortable laying claim to this achievement.”
The feat is outlined in a paper in the journal Nature.
The milestone comes after roughly two decades of quantum computing research conducted by Martinis and his group, from the development of a single superconducting qubit to systems including architectures of 72 and, with Sycamore, 54 qubits (one didn’t perform) that take advantage of the both awe-inspiring and bizarre properties of quantum mechanics.
“The algorithm was chosen to emphasize the strengths of the quantum computer by leveraging the natural dynamics of the device,” said Ben Chiaro, another graduate student researcher in the Martinis Group. That is, the researchers wanted to test the computer’s ability to hold and rapidly manipulate a vast amount of complex, unstructured data.
“We basically wanted to produce an entangled state involving all of our qubits as quickly as we can,” Foxen said, “and so we settled on a sequence of operations that produced a complicated superposition state that, when measured, returned output (“bitstring”) with a probability determined by the specific sequence of operations used to prepare that particular superposition.” The exercise, which was to verify that the circuit’s output correspond to the sequence used to prepare the state, sampled the quantum circuit a million times in just a few minutes, exploring all possibilities — before the system could lose its quantum coherence.
‘A complex superposition state’
“We performed a fixed set of operations that entangles 53 qubits into a complex superposition state,” Chiaro explained. “This superposition state encodes the probability distribution. For the quantum computer, preparing this superposition state is accomplished by applying a sequence of tens of control pulses to each qubit in a matter of microseconds. We can prepare and then sample from this distribution by measuring the qubits a million times in 200 seconds.”
“For classical computers, it is much more difficult to compute the outcome of these operations because it requires computing the probability of being in any one of the 2^53 possible states, where the 53 comes from the number of qubits — the exponential scaling is why people are interested in quantum computing to begin with,” Foxen said. “This is done by matrix multiplication, which is expensive for classical computers as the matrices become large.”
According to the new paper, the researchers used a method called cross-entropy benchmarking to compare the quantum circuit’s bitstring to its “corresponding ideal probability computed via simulation on a classical computer” to ascertain that the quantum computer was working correctly.
“We made a lot of design choices in the development of our processor that are really advantageous,” said Chiaro. Among these advantages, he said, are the ability to experimentally tune the parameters of the individual qubits as well as their interactions.
While the experiment was chosen as a proof-of-concept for the computer, the research has resulted in a very real and valuable tool: a certified random number generator. Useful in a variety of fields, random numbers can ensure that encrypted keys can’t be guessed, or that a sample from a larger population is truly representative, leading to optimal solutions for complex problems and more robust machine learning applications. The speed with which the quantum circuit can produce its randomized bitstring is so great that there is no time to analyze and “cheat” the system.
“Quantum mechanical states do things that go beyond our day-to-day experience and so have the potential to provide capabilities and application that would otherwise be unattainable,” commented Joe Incandela, UC Santa Barbara’s vice chancellor for research. “The team has demonstrated the ability to reliably create and repeatedly sample complicated quantum states involving 53 entangled elements to carry out an exercise that would take millennia to do with a classical supercomputer. This is a major accomplishment. We are at the threshold of a new era of knowledge acquisition.”
Looking ahead
With an achievement like “quantum supremacy,” it’s tempting to think that the UC Santa Barbara/Google researchers will plant their flag and rest easy. But for Foxen, Chiaro, Martinis and the rest of the UCSB/Google AI Quantum group, this is just the beginning.
“It’s kind of a continuous improvement mindset,” Foxen said. “There are always projects in the works.” In the near term, further improvements to these “noisy” qubits may enable the simulation of interesting phenomena in quantum mechanics, such as thermalization, or the vast amount of possibility in the realms of materials and chemistry.
In the long term, however, the scientists are always looking to improve coherence times, or, at the other end, to detect and fix errors, which would take many additional qubits per qubit being checked. These efforts have been running parallel to the design and build of the quantum computer itself, and ensure the researchers have a lot of work before hitting their next milestone.
“It’s been an honor and a pleasure to be associated with this team,” Chiaro said. “It’s a great collection of strong technical contributors with great leadership and the whole team really synergizes well.”
Learn more: Achieving Quantum Supremacy
The Latest on: Quantum supremacy
[google_news title=”” keyword=”quantum supremacy” num_posts=”10″ blurb_length=”0″ show_thumb=”left”]
via Google News
The Latest on: Quantum supremacy
- Unlocking quantum supremacy for financial institutionson January 30, 2023 at 8:04 am
Financial services have a lot to explore when it comes to quantum computing capabilities as we progress towards a truly digitised fintech era. Together with artificial intelligence (AI), it paves ...
- Is China About To Destroy Encryption As We Know It? Maybeon January 29, 2023 at 12:48 pm
So is the paper a fraud, a “catastrophe,” or something in between? Gasman says that while the political race for quantum supremacy is tightening, it would be uncharacteristic of the Chinese research ...
- How quantum computing can fight climate changeon January 25, 2023 at 6:30 pm
Google laid claim to reaching quantum supremacy in 2020, for instance, which means a quantum computer can solve a problem no classical computer can in a feasible length of time. It’s well worth ...
- Everything You Wanted to Know about Quantum Computingon January 22, 2023 at 4:00 pm
This is called quantum supremacy or quantum ascendancy. There's a race to build a machine that can outperform a classical counter. Here is an example of a multi-qubit chip for computing things, such ...
- Pentagon must act now on quantum computing or be eclipsed by rivalson January 20, 2023 at 5:23 am
The battle for quantum supremacy is already under way, and is set to fundamentally change the defense sector .
- Did China Break The Quantum Barrier?on January 10, 2023 at 7:34 am
also known as "quantum supremacy," which indicates an overwhelming quantum computational speedup. (Photo by Xinhua via Getty) (Xinhua/Xinhua via Getty Images) The ultimate nightmare for ...
- New Algorithm Closes Quantum Supremacy Windowon January 9, 2023 at 11:02 pm
We preselected all newsletters you had before unsubscribing.
- Researchers develop superconducting flux qubits with unprecedented reproducibilityon January 9, 2023 at 4:01 pm
Amazon and Google to demonstrate quantum supremacy. As the processors become larger and larger (IBM just announced a processor with more than 400 transmon qubits), the questions of fidelity and ...
- New Algorithm Closes Quantum Supremacy Windowon January 8, 2023 at 4:00 pm
In what specific cases do quantum computers surpass their classical counterparts? That’s a hard question to answer, in part because today’s quantum computers are finicky things, plagued with errors ...
via Bing News