Quantum computing is going to change the world as we know it. Even the lamest quantum computer is orders of magnitude more powerful than anything we could ever make today. But figuring out how to program one is ridiculously hard.
Classical computing power has grown by leaps and bounds, even as form factors shrink, multiply, and require less energy. Some early Supercomputers ran on maybe 13,000 transistors. Classical computers are limited in their problem-solving.
But the Quantum Computing is going to change the world.
A Quantum Computer could possibly solve difficult types of problems in a time frame that’s more reasonable than the life of the universe, maybe a couple of years, or a couple of days, or a couple of seconds, and “Exponentially faster. http://msft.it/0235SQ
Quantum computing is a field of research that applies the principles of quantum physics and new directions in materials science to building a new type of computers that use quantum effects in computation. Beyond creating quantum computers, the field also includes studies of algorithms that such computers can execute.
As this fantastic animation from PHD TV explains, the true power of quantum computers comes from qubits, which have way more states than standard binary bits. And those states can translate into raw, compact computing power. But the downsides are big too. Even looking at a quantum computer while it’s working can screw everything up. Just imagine trying to debug that code.
In possible University of Cambridge scientist know how to build a quantum computer. At first, start with simple quantum logic gates, and connect them up into quantum networks. A quantum logic gate, like a classical gate, is a very simple computing advice that performs one elementary quantum operation, usually on two qubits, in a given time. Absolutely, quantum logic gates differ from their classical counterparts in that they can create and perform operations, on quantum superposition.
How Powerful are Quantum Computers ::
For an algorithm, to be efficient, the time it takes to execute the algorithm must increase no faster than a polynomial function of the size of the input. The input size as the total number of bits needed to specify the input to the problem. For example, the number of bits needed to encode the number we want to factorize.
How to build QUANTUM Computer ::
Generally, to build the Quantum Computer, create a simple quantum Logic Gate (logic gates are AND, NAND, OR, NOR, NOT ) and connect them up into quantum networks.