#quantummechanics #computers #algorithms#problemsolving
The applications of quantum computing will be endless, some examples are to conduct virtual experiments based on quantum states in the nature (quantum simulation) modeling the behavior of atoms and particles at certain conditions such as those which can only be created at the Large Hadron Collider without actually creating those conditions, model chemical reactions between different elements or in the other side search among big data environments shortening from million of steps to find an specific variable to thousands.
But what is it? Quantum computing relates theoretical computation systems that make direct use of quantum-dynamics behavior such as superposition and entanglement to perform data operations.

The difference between quantum computers versus binary digital electronic computers is that while in “traditional computing” the data are encoded into binary digits as of “0” or “1”, in the quantum field it uses quantum bits named “qubits” which are able to manage superpositions of states.
The field of quantum computing was initiated by the work of Paul Benioff and Yuri Manin in 1980, Richard Feynman in 1982 and David Deutsch in 1985.
Quantum computers would theoretically be able to solve problems faster than traditional computers that use even the best currently known algorithms, like integer factorization using Shor’s algorithm or the simulation of quantum many-body systems.
The potential for quantum computing which is now in their early years will open a new gate to develop “self-conscious” machines with an outstanding capability to solve problems in real time with “humanized” interfaces based on the 5 human senses.


Author: Jesus Padilla

Leave a Reply