Laman

Minggu, 11 Mei 2014

Quantum Computation

 What is quantum computation ?
Quantum computing is system computation technology based on the principles of quantum theory, which explains the nature and behavior of energy and matter on the quantum (atomic and subatomic) level. This computation use qubit not bit. quantu coomputation make  to solve some types of mathematical problems on few second. This super computer can try all possible solutions at the same time, and choose the best.

Entanglement
Entanglement is a term used in quantum theory to describe the way that particles of energy/matter can become correlated to predictably interact with each other regardless of how far apart they are. Particles, such as photons, electrons, or qubits that have interacted with each other retain a type of connection and can be entangled with each other in pairs, in the process known as correlation.

Data qubit operations
A qubit is a quantum bit , the counterpart in quantum computing to the binary digit or bit of classical computing. Just as a bit is the basic unit of information in a classical computer, a qubit is the basic unit of information in a quantum computer . In a quantum computer, a number of elemental particles such as electrons or photons can be used (in practice, success has also been achieved with ions), with either their charge or polarization acting as a representation of 0 and/or 1. Each of these particles is known as a qubit; the nature and behavior of these particles (as expressed in quantum theory ) form the basis of quantum computing. The two most relevant aspects of quantum physics are the principles of superposition and entanglement .

Quantum gates
quantum gate (or quantum logic gate) is a basic quantum circuit operating on a small number of qubits. They are the building blocks of quantum circuits, like classical logic gates are for conventional digital circuits. Unlike many classical logic gates, quantum logic gates are reversible. However, classical computing can be performed using only reversible gates. For example, the reversible Toffoli gate can implement all Boolean functions. This gate has a direct quantum equivalent, showing that quantum circuits can perform all operations performed by classical circuits.

Shors algorithm
Shors algorithm named after the mathematician Peter Shor, is a quantum algorithm . This algorithm  runs on a quantum computer and useful for integer factorization. Shors algorithm was formulated in 1994. Essence of this algorithm is how to resolve the factorization of the number interger or a large integers.




Reference :
http://whatis.techtarget.com/
http://en.wikipedia.org/