Under the Quantum Leap
While it may seem that the development of computers is at its end, that’s not the case. The n? Chste generation of computers is quantum computers.
The reason f? r continuing computer evolution is the continuing thirst we have f? r the velocity and capacitance? t of our computers. Way to? Ck in 1947 an engineer and computer expert, Howard Aiken predicted that all the United States to their f Necessity? R erf computer? Cases m? Need to six digital electronic computer. Other scientists and engineers, Aiken has succeeded to the volume on? Strength they predicted to be sufficient solid, but proved too conservative.
What no one could predict that the voluminous scientific research? sen quantities of information which had to be calculated and stored produce, nor do they predict the popularity of personal computers t, and the existence of the Internet. In fact, it is difficult to predict if humankind ever satisfied with his performance and scope.
A fundamental Pr? premise, computers, called Moore’s Law says that the number of transistors is a microprocessor doubles every 18 months and will continue to do so. What this means is that charge until later than 2030, the number of microprocessor circuits found in computers astronomically high. This will lead to the creation of quantum computers, the design of the power of the molecule? Le atoms and f? R the processing and Ged f? Memory tasks used?. Quantum computers should be able to perform certain calculations Execute? lead billion times faster than current computers based on silicon.
quantum computers exist today, although few and they are all in the H? nd of scientists and scientific organizations. You are not f? The business world and sharing – that is still many years away. The theory of quantum computers was developed in 1981 by Paul Benioff, a physicist with the Argonne National Laboratory was. Benioff theorized? About the Turing theory is based on a Turing machine capabilities with quantum-F?.
Alan Turing created the Turing machine around 1935. This machine was from a band whose length L? Unbeschr? Nkt was and it was divided into small squares. Each square either held the symbol of a symbol or the berhaupt null or not a symbol?. He created a reading and writing room Ger? T that the zero and one symbols, which in turn gave these machines – the FR? Hen computers – the instructions were read initiates the specific programs.
Benioff has the quantum level, say that the read-write head and the band w? rde both exist in a quantum state. What does this w? Rde, is that this band was one or zero symbols in a superposition that could be one and zero, at the same time, or exist somewhere in between. Because of this, the quantum Turing machine, in contrast to the standard Turing machine, k Execute? Nnten different calculations? Lead at once.
The standard Turing machine concept is what runs l? today’s silicon-based computers. In contrast, quantum computers encode computer information as quantum bits, called qubits. These qubits tats? Chlich repr? Sentier atoms, which act together as a processor and the memory of the computer. This F? Ability, several calculations in one run, and is included in several states simultaneously, which gives quantum computers the potential million times as powerful as today’s supercomputers his best.
quantum computer, qubits that RDEN 30 w?, for example, have processing power equivalent to today’s computer, the Execute with a speed of 10 teraflops (trillion calculations per second? can lead k?. ) To put this in perspective, l? the typical computer runs from today to gigaflop speeds (billions of operations per second.
As our reputation for greater speed and more power from our computers anh? lt, quantum computers are forecast to easily avail? gbar product sometime in the not too distant future. P >???????????
nhmxservers. com a>, an excellent place to find is all the computer links, resources and Objects? nde. For more information, see: Computers Resourses a> p>

September 3rd, 2010
amin 



