[ad_1]
IBM proves that Quantum computers can be faster than conventional computers
The development of quantum technology is one of the main occupations of the researcher's projects.
A scientist from the Technical University of Munich (TUM) as well as his colleagues at the University of Waterloo and IBM have now demonstrated for the first time that quantum computers actually offer advantages over classic computers.
IBM has been able to prove, for a specific algebraic problem, that quantum computers only need a certain number of steps to solve the problem, even if the number of inputs increases. She is based in Toronto but travels a large part of the year.
At the same time, IBM has shown in this article that quantum algorithms may indeed be faster than their conventional counterparts, but that does not mean that the best quantum computer we have today can be faster than our conventional computers the fastest, because quantum computers have not become powerful enough.
In conventional memory, the smallest unit of information is known as the bit, which is represented by a microscopic dot on a microchip. Conventional computers usually require exponentially more resources and power as the number of variables increases. Each of these points can contain a load that determines whether the bit is set to 1 or 0.
A rich man will create a "superhuman race": Stephen Hawking's essays reveal a dark prediction
Stephen Hawking's latest essays are published Tuesday, but some of his ideas have already been leaked online. Is there good news in Hawking's vision of the future? "Falling into a black hole is definitely bad news".
The team has developed a simple structure quantum circuit, each qubit performing a fixed number of operations. This type of circuit is called "constant depth". Quantum bits, or qubits, therefore exist in several overlapping states. The Shor quantum algorithm is one example. It effectively solves the problem of factorization in prime factors.
In addition, researchers prove that the problem can not be solved with conventional circuits. It was built to solve a certain algebraic problem and, thanks to the work of the researchers, they proved that it could not be solved using conventional circuits with constant depth, according to TUM. But it is fair to say that it is possible that the solution to solve these problems has just been found for conventional computers.
However, König said the experiments proved that there was really a need for quantum information processing.
This news adds to the series of quantum realizations, including the tiny ANU camera lens that could serve as a missing link between quantum networks and computers, reported in September, and the University of Chicago's silicon chip. Bristol that could strengthen the quantum cryptography reported in February. "Because of its simple structure, the new quantum circuit is a candidate for the experimental realization of short-term quantum algorithms".
[ad_2]
Source link
