MIT builds a quantum computer out of 5 atoms

Scalable logic that will be deterimental to contemporary encryption systems


Scientists from MIT successfully create a quantum computer out of only five atoms that factors numbers in a scalable way using an algorithm proposed by Professor Peter Shor back in 1994. The feat marks an important landmark development in quantum computer technology.

To understand the significance of quantum computing, we must first review the underlying logic of traditional computing. As most of you already know, the binary logic of 1’s and 0’s dominates the logic flow, meaning that only one of the values can be active at one time. Conversely, quantum computing uses qubits to calculate all possible values simultaneously, enabling data processing to occur at an exponentially faster rate.

Given its small-scale, the quantum computer created at MIT is specific in its application and solely responsible for factoring the number 15 into prime numbers 3 and 5. This is accomplished using laser pulses to establish four of the five atoms as logic gates while the remaining atom performs storage and output functions. The system can be scaled to factor larger numbers by adding more atoms and lasers to make a faster quantum computer.

Although this is a rudimentary actualization of an advanced concept, it’s the first implementation of Shor’s algorithm, an algorithm proposed by MIT Professor Peter Shor in 1994 that factors large numbers more efficiently than a classical computer. No one has able to implement Shor’s algorithm into a quantum system, until now.

Therefore, the question that ultimately needs answering is, what are some real world applications? In short, none yet, but eventually, encryption will take center stage.

As a result of quantum computing’s parallel operating logic, most tasks completed on silicon chips cannot benefit or even function in a quantum scenario. The complex operations involved in everyday business and gaming applications are grounded in serial logic by their very nature; thus, there’s no need for parallel logic even if quantum computing becomes reasonably priced—which won’t occur anytime soon. Brute force guessing and checking operations like encryption and password cracking are an exception to the rule, inadvertently placing a premium on quantum computing and sparking a computational arms race in the eyes of governments and the entities which wish to protect themselves.

Maintaining encryption is paramount in securing the network traffic that houses all the sensitive data exchanged between banks, health care, companies, governments, mobile devices, and their users. It’s the encryption that ensures prevents outside forces from tampering with the data and making sense of it.

Contemporary encryption protocols like 128-bit and 256-bit encryption rely on factoring, and the inability of binary logic-based computing to properly factor lengthy prime numbers within a reasonable amount of time. To put this into perspective, it takes 13 billion years to crack a password encrypted with 256-bits; the computer cannot brute force guess and check the solution if it needs to perform the operation in a serial flow.

The rise of quantum computing threatens the stability of the entire world’s information systems lest we develop quantum computing-resistant encryption.

Source: Delidded Tech via
Img: Rodolfo Goulart Sabatino/Getty Images

Learn more about Electronic Products Magazine

Leave a Reply