The introduction of classical computing brought the languages of classical physics (electricity and magnetism) and joined it into a new assembly of people in the future called computer scientists. Comparable to most technologies, classical computers like ENIAC (Electronic Numerical Integrator and Computer) began under the purview of engineers and progressed to a shared services setting (where businesses could purchase time on the computer). With the assistance of a common simplified language and operational contexts, traditional computing moved from the scientific/government dominion to usage by large enterprises, in anticipation of what could be considered general availability for both content (data and program) inventors and content consumers.

The commencement of the simplified language for classical computing was the description of the bit, the smallest of information illustration. The bit was a language of abstraction, a representation of electrical and/or magnetic physical properties. The bit was zero while voltage was off and one when voltage was applied. Bits are usually used to symbolize data or commands. In order to create commands, voltages were combined using various methods called gates (AND, OR, NAND and COPY making up the complete classical set). These were physical representations (i.e., combinations of voltages) of logic command arrangements to integrate bits in different ways.

As programming advanced in this evolutionary sequence, not only were certain objects on lower foundation layers abstracted, but innovative languages of representation were produced. Nowadays it is innocuous to assume that a Java programmer who utilizes an object oriented program does not distress himself with how the bits are flipped.

When I interviewed Dr. Vinton â€œVintâ€ Cerf, I asked him, â€œWhat are your views or view on quantum computing in today’s world in comparison to classical computers?â€

He stated,â€ Quantum computing (see also D-Wave web site) has the promise of getting answers much faster FOR CERTAIN KINDS OF PROBLEMS than conventional computing. It is not a general purpose method, however, and is extremely sensitive to maintaining entanglement coherence for long enough for the computation to be performed. It appears to have application for factoring and for optimization (e.g. traveling salesman problem). Computing is becoming a key element of everyday life, especially in conjunction with mobiles – together they harness the power of the Internet, World Wide Web and cloud computing from virtually anywhere on the globe. I am very excited about the “internet of things” and also about computers that hear and see and can be part of the traditional human dialog. I like the idea of being able to have a conversation with a search engine or a discussion with a control system. Of course, Google Glass and Google self-driving cars are capturing attention where ever one goes. I am also quite excited about the extension of the Internet to interplanetary operation, as you may discover if you google “interplanetary internetâ€.

The **Quantum Computer** is a computer that connects the power of atoms and molecules to accomplish memory and processing tasks. It has the potential to perform particular calculations billions of times quicker than any silicon-constructed computer. The field of Quantum Computing was first introduced in 1980 and 1981.

The classical desktop computer functions by manipulating bits, digits that are binary — i.e., which can either signify a zero or a one. Everything from statistics and letters to the status of the modem or computer mouse are all expressed by an accumulation of bits in combinations of ones and zeros. These bits correspond very well with the approach classical physics represents the globe. Quantum computers are not restricted by the binary nature of the classical physical world. Nonetheless, they rely upon inspecting the condition of quantum bits or qubits that might represent a one or a zero, might appear as a combination of the two or might exhibit a number conveying that the state of the qubit is somewhere between 1 and 0.

With regards to the classical model of a computer, the most essential building block – the bit, can only occur in one of two distinct states, a ‘0’ or a ‘1’. In a quantum computer the procedures are altered. Not only is the qubit capable of remaining in the classical ‘0’ and ‘1’ states, but it can also be in a superposition of both. In this coherent state, the bit exists as a ‘0’ and a ‘1’ in a particular manner. If an individual considers a register of three classical bits: it would be attainable to use this register to represent any one of the numbers from 0 to 7 at any one time. If a register of three qubits is deliberated, it can be observed that if each bit is in the superposition or coherent state, the register can represent all the numbers from 0 to 7 simultaneously.

A processor that can utilize registers of qubits will basically have the ability to perform calculations applying all the likely values of the input registers simultaneously. This phenomenon is known as quantum parallelism, and is the inspiring force concerning the research which is presently being carried out out in quantum computing.

Quantum computers are beneficial in the way they encode a bit, the vital unit of information. A number – 0 or 1, stipulates the state of a bit in a classical digital computer. An n-bit binary word in a regular computer is for that reason described by a string of n zeros and ones. A qubit may be represented by an atom in one of two unalike states, which can also be indicated as 0 or 1. Two qubits, like two classical bits, can reach four different well-defined states (0 and 0, 0 and 1, 1 and 0, or 1 and 1).

On the other hand, in contrasting classical bits, qubits can be existent simultaneously as 0 and 1, with the likelihood for each state given by a numerical coefficient. Revealing a two-qubit quantum computer demands four coefficients. As a general rule, n qubits demand 2n numbers, which speedily become a sizeable set for greater values of n. By way of example, if n equals 50, about 1050 numbers are necessary to describe all the probabilities for the possible states of the quantum machine-a number that surpasses the capacity of the largest conventional computer. A quantum computer gives the assurance that it will be impressively powerful because it can be in superposition and can act on all its potential states simultaneously. As a result, this sort of computer could unsurprisingly accomplish myriad tasks in parallel, using merely a single processing unit.

Quantum Computing is the skill of utilizing all of the prospects that the laws of quantum mechanics offer humans to solve computational problems. Conventional or “Classical” computers only use a minor subset of these possibilities. In principle, they calculate in the same way that people compute by hand. There are numerous outcomes about the wonderful things humanity would be able to do if there was a sufficiently large quantum computer. The utmost significant of these is that we would be able to perform simulations of quantum mechanical procedures in chemistry, biology and physics which will never come within the range of classical computers.

This figure demonstrates the Bloch sphere which is a depiction of a Qubit, the fundamental building block of quantum computers.

Both practical and theoretical study continues and a number of national government and military funding agencies support quantum computing research to improve quantum computers for both civilian and national security purposes, for example cryptanalysis.

There exist a number of quantum computing models, distinguished by the main features in which the computation is determined. The four central versions of practical significance are:

- One-way quantum computer (computation divided into sequence of one-qubit measurements applied to an extremely entangled early state or cluster state)
- Quantum gate array (computation divided into sequence of few-qubit quantum gates)
- Adiabatic quantum computer or computer based on Quantum annealing (computation distributed into an unhurried constant conversion of an initial Hamiltonian into a final Hamiltonian, whose ground states comprises of the solution)
- Topological quantum computer (computation divided into the braiding of anyons in a 2D lattice)

The Quantum Turing machine is theoretically meaningful but direct implementation of this model is not pursued. The four models of computation have been revealed to be equal to each other in the sense that each one can simulate the other with no more than polynomial overhead.

In Modern Day, there has been a great level of controversy about the worldâ€™s only commercial quantum computer. The concern with this machine is that there has been an issue in deciphering whether it is truly a quantum device or just a regular computer. The Canadian software company D-Wave created this technological device which has been verified to work on a quantum level.

Unlike a common computer, this kind that is named an â€œAnnealerâ€, cannot answer any query tossed at it. As an alternative, it can only answer â€˜discrete optimizationâ€™ problems. This is the sort of issue where a set of criteria are all struggling to be met at the same time and there is one best resolution that meets the most of them. One sample is being the simulation of protein folding, in which the arrangement seeks a state of minimal free energy. The hope is that a quantum annealer should be able to solve these problems much quicker than a classical one.

Professor Scott Aaronson, a theoretical computer scientist at MIT has historically been skeptical of D-Waveâ€™s assertions. He stated in the past that he is fairly persuaded by the data but that there are plenty of important questions remaining. These include whether the current or future versions of the D-Wave computer will truly be any faster than classical machines.

An Australian crew led by researchers at the University of New South Wales has accomplished a breakthrough in quantum science that brings the prospect of a network of ultra-powerful quantum computers that are joined via a quantum internet, closer to reality. The team is the first to have discovered the spin, or quantum state, of a single atom using a combined optical and electrical approach. The study is a group effort between investigators from the ARC Centre of Excellence for Quantum Computation and Communication Technology based at UNSW, the Australian National University and the University of Melbourne.

UNSW’s Professor Sven Rogge alleged that the technical feat was done with a single atom of erbium – an unusual earth element normally used in communications that is embedded in silicon. â€œWe have the best of both worlds with our combination of an electrical and optical system. This is a revolutionary new technique, and people had doubts it was possible. It is the first step towards a global quantum internet,” Professor Rogge indicated.

Quantum computers guarantee to provide an exponential increase in processing power over conventional computers by using a single electron or nucleus of an atom as the basic processing unit â€“ the qubit. By carrying out multiple calculations simultaneously, quantum computers are projected to have applications in economic modeling, quick database searches, modeling of quantum materials and biological molecules as well as drugs, in addition to encryption and decryption of information.

**THE DIFFERENCES BETWEEN QUANTUM COMPUTERS AND CONVENTIONAL COMPUTERS ARE**:

In Quantum Computing, information is stored in quantum bits, or qubits. A qubit can be in states labeled |0} and |1}, but it can also be in a superposition of these states, a|0} + b|1}, where a and b are complex numbers. If the state of a qubit is viewed as a vector, then superposition of states is just vector addition. For every extra qubit you get, you can store twice as many numbers. For example, with 3 qubits, you get coefficients for |000}, |001}, |010}, |011}, |100}, |101}, |110} and |111}. In addition to this, calculations are performed by unitary transformations on the state of the qubits. United with the principle of superposition, this generates possibilities that are not available for hand calculations (as in the QNOT). This translates into more efficient algorithms for a.o. factoring, searching and simulation of quantum mechanical systems. The QNOT-The classical NOT-gate flips its input bit over; NOT(1)=0, NOT(0)=1.The quantum analogue, the QNOT also does this, but it flips all states in a superposition at the same time. So if we start with 3 qubits in the state |000}+|001}+2|010}-|011}-|100}+3i|101}+7|110} and apply QNOT to the first qubit,we get|100}+|101}+2|110}-|111}-|000}+3i|001}+7|010}. Furthermore, the quantum computer is different due to Entanglement and Quantum Teleportation.

The quantum property of entanglement has a fascinating history. Einstein, who claimed that “God does not play dice with the universeâ€, utilized the property of entanglement in 1935 in an attempt to ascertain that quantum theory was unfinished. Boris Podolski, Albert Einstein and Nathan Rosen identified that the state vectors of certain quantum systems were associated or “entangled” with each other. If one modifies the state vector of one system, the corresponding state vector of the other system is changed instantaneously also, and independently of the medium through which some communicating signals ought to travel. Since nothing could move faster than the speed of light, how could one system arbitrarily far apart have an impact on the other? Einstein termed this “spooky action at a distance” and it demanded a philosophy of reality contrary to science in those years. He favored the notion that some unfamiliar or “hidden variables” were enhancing the results and since they werenâ€™t known, then quantum theory must be imperfect.

In 1964, John Bell evidenced that there could not conceivably be any hidden variables, which implied that spooky action at a distance was factual. Later in 1982, Alan Aspect performed an investigation in which he displayed that Bellsâ€™ Theorem, as it was known as, had experimental validity. Either faster-than-light speed communication was occurring or some other mechanism was in process. This basic theory has made all the modification between traditional ideas of reality and quantum ideas of reality.

Throughout all of history before, all physical phenomena were reliant on some force and some particle to transport that force. Therefore, the speed of light restriction applied. For example, as electrostatic forces are carried by the electron, gravitational forces are carried by the graviton, etc. Though, with entanglement, quantum systems are connected in some manner that does not contain a force and the speed of light restriction does not apply. The real mechanism of how one system affects the other is still unknown.

1. Collapse of the State Vector

When two quantum systems are generated while maintaining some property, their state vectors are correlated or entangled. For example, when two photons are created and their spin conserved, as an essential, one photon has a spin of 1 and a spin of -1. Through measuring one of the state vectors of the photon, the state vector falls into an intelligible state. Instantaneously and robotically, the state vector of the other photon collapses into the other identifiable state. When one photonâ€™s spin is measured and found to be 1, the other photonâ€™s spin of -1 immediately becomes recognized as well. There are no forces involved and no description of the mechanism.

2. Quantum Teleportation

The code of entanglement enables a phenomenon termed â€œquantum teleportationâ€. This type of teleportation does not include moving an entity from one physical position to another, as shown in popular science fiction stories, but a disintegration of the original and recreation of a matching duplicate at another location.

3. Brassardâ€™s Theoretical Circuit

In 1996, Gilles Brassard visualized a quantum circuit that could build and entangle two pairs of qubits, where one is entangled with two others. On the whole, â€œAliceâ€™sâ€ circuit entangles three bits (M, A, and B), and communicates M to â€œBobâ€. Bobâ€™s circuit, using information from M, produces a replica of bit B. The prompt result on B, by measuring M, is efficiently a teleportation of qubit B.

For purposes of debate and at the risk of underestimation, the gates marked L, R, S, and T, are referred to as left-rotation, right-rotation, forward-phase shift, and backward-phase shift gates, separately. The XOR gate is presented as a circumscribed cross. These gates can bring about entanglement when qubits are put through them.

Alternatively, classical computers differ to quantum computers as information is stored in bits, which take the discrete values 0 and 1. If storing one number takes 64 bits, then storing N numbers takes N times 64 bits. Calculations are done essentially in the same way as by hand. As a result, the group of problems that can be solved proficiently is the same as the category that can be solved efficiently by hand. Here “efficiently”, deals with the idea that the evaluation period doesn’t grow too quickly with the size of the input.

Applications that cannot be done now are easily possible with quantum computers. The spin-off concepts, like quantum teleportation, open outlooks only imagined before. To conclude, quantum computers are approaching in their maturity, and they will require a new way of looking at computing.