RSS
Логотип
Баннер в шапке 1
Баннер в шапке 2

Bristlecone (quantum processor)

Product
Developers: Google
Date of the premiere of the system: March, 2018
Branches: Information technologies
Technology: Processors

2018: Announcement of Bristlecone

In March, 2018 Google announced as the company claims, the most powerful quantum processor at the moment.

The chip under the name Bristlecone contains 72 quantum bits (qubits) that exceeds the most productive solution of Intel: the superconducting quantum chip announced at the beginning of 2018 under the code name Tangle Lake has 49 qubits.

One of the main problems during creation of powerful quantum computers consists that it is harder and harder to keep a large number of qubits in a superposition status, at the same time the number of errors of reading and information processing increases.

Google provided the most powerful quantum processor

Earlier 9-kubitovy computer of Google provided several years on which it was succeeded to reach the low level of errors is the basis for Bristlecone — the share of errors was at the level of 1% at data reading, 0.1% for odnokubitny quantum valves and 0.6% for dvukhkubitny quantum valves. Last option assumed use of the qubits united in a linear array, and new comprises two two-dimensional structures.

In the quantum computer of Google qubits  form two square arrays 6 on 6, located one above another. Thanks to it a system can  trace and correct  the errors arising  during calculations.

At the time of the announcement of Bristlecone the company  did not disclose detailed characteristics of the constructed device, however stated that it allows to reach quantum superiority.

File:Aquote1.png
Operation of the device, such as Bristlecone with the low level of system mistakes, requires harmony between a full range of technologies, beginning from the software and managing electronics to the processor. The correct solution requires careful development of systems throughout several iterations, said in the statement of Google.[1]
File:Aquote2.png

Notes