Ordinary, classical computers in their work are based on the laws of classical physics. The data that these computers operate on is represented as a sequence of logical ones and zeros. These logical levels are realized in the form of the presence or absence of electric charge in the active element of the memory cell, in the form of an open or closed state of the transistors that make up the logical elements that perform arithmetic or logical data operations.

The internal organization of quantum computers is much more complicated than the organization of classical computers. The amazing laws of quantum mechanics allow a quantum bit to take a value equal to one and zero at the same time. This unique state, called the state of quantum superposition, allows quantum computers to perform a variety of operations on various data, doing the work for which a classical computer needs to execute a sufficiently long sequence of commands. And it is this feature of quantum computers that should allow them to perform algorithms optimized for this, for example, Shor’s algorithm (factoring), many times faster than classic computers.

Quantum computer

Just recently, a group of scientists from the University of Technology in Munich, Germany, the Institute for Quantum Computing at the University of Waterloo, Canada, and IBM successfully demonstrated the principle of quantum superiority. For these purposes, a quantum scheme was created, focused on solving a complex and computationally heavy algebraic problem. A distinctive feature of this scheme was that each of the qubits used in it could perform a strictly fixed number of operations, in other words, this quantum scheme had a fixed functional “depth”. Moreover, the scientists proved that the solved algebraic problem cannot be solved on a classical computer system with a fixed functional depth.

Once again, we note that, until now, no one has yet been able to prove or experimentally demonstrate quantum supremacy. “The results we obtained demonstrate that the principles of quantum information processing do provide superiority. In addition, in the future we will no longer need to rely on complex theoretical guesses that do not provide reliable evidence,” says lead researcher Robert Konig, “ The quantum scheme developed by us can become the first prototype of a real quantum computer, although, due to its simplicity, it can so far be considered only an experimental implementation of one of the quantum alloys of the rhythms. ”

Picture Credit: TheDigitalArtist

The post Scientists Prove a Quantum Computing Advantage over Classical appeared first on SEO TECH GUEST BLOG.

The system, named Project Debater, showed its skills in a special press event. During the demonstration, the algorithm conducted two rounds of debates with people and won in one of them.

In the first round, rivals discussed the need for government support for space research, and two people from several dozen spectators gave a victory to Noah Ovadia, a debate specialist who opposed state support for the space industry. However, in the second round, where the master of the Dan Zafrir debate competed with the computer, nine spectators immediately named the IBM algorithm as the winner, who convinced them of the need for the development of telemedicine.

The development of the Project Debater since 2011 was carried out by the IBM research laboratory in Haifa (Israel). The creators taught the algorithm various methods of conducting debates, but the system is engaged in searching for information relevant to the topic of specific debates independently before they begin. For this, the algorithm uses a database of 300 million news articles and scientific papers. At the same time, the program does not just need to find facts and data, but also listen to the interlocutor in order to formulate a counterargument.

During the debate, the program, speaking in a pleasant female voice, successfully demonstrated its skills. The algorithm not only used phrases from the database, but also built its own. Also, Project Debater showed that it is not without a sense of humor: the algorithm successfully inserted a joke in its performance.

The debate was not without gaffes. Thus, during the discussion of the topic of space, the program stated that subsidizing space research is more important than building good roads, as well as developing education and health. In the debate between the two politicians, such an argument would severely undermine the chances of one of the opponents to win.

Nevertheless, the development of IBM was very impressive for the public. According to one of the experts, the algorithm successfully used information for conducting debates, did not allow grammatical errors, and even showed the ability to foresee the opponent’s arguments and warn them.

Image credit:  Screenshot YouTube

The post IBM shows off an artificial intelligence that can debate a human appeared first on SEO TECH GUEST BLOG.

Newly adapted IBM XWork Server is basically, the Lotus Domino 8.5x application server running of course without the email stack. The server license can be purchased for just about $2,000 according to Ed Brill’s Blog Post.

The XWork Server installation is allowed to have up to 4 applications, where an application is defined as a group of 1 to 3 NSF databases. Note, systems databases do not count.  Therefore, an XWork Server install can have a total of 16 production databases/applications.

As being just a Domino server with license restrictions, the XWork Server can work with any regular Domino application–XPages, Lotusscript, @functions.

The post IBM’s New XWork Server appeared first on SEO TECH GUEST BLOG.