Answer : Quantum Computation is a device that uses an arithmetic quantum mechanical phenomena, such as superposition and linkages, to perform data operations. In classical computing, the number of data bits is computed; in quantum computers, this is done with qubits. A combined knowledge of mathematical astronomy, physics, and computer science developed in the last two decades become a visionary idea that quantum mechanics. Quantum computing is supported by several algorithms, which are:
1. Shor's algorithm
2. Grover's algorithm
3. Adiabatic Algorithm
Q2 : What is Entanglement?
Answer : Entanglement is a quantum mechanical effect that blurs the distance between individual particles so difficult to describe the particles separately even though you are trying to move them. Entanglement itself is still part of Quantum Computation. What's Entanglement? Entanglement is a quantum mechanical theory that describes how fast and how strong 'connected-ness' particles in quantum computers where if a particle is treated "A" then it will have an impact "A" also to other particles.
Q3 : How is Qubit Data Operation?
Answer : Quantum computing consists of the qubit. Where, in contrast to qubit number of bits (binary) consisting of 0 and 1. While qubit consisting of {00, 01, 10, and 11}. Quantum Computing supported also by a quantum gate that consists of NAND gates (NOT and AND), and combined with the XOR gate (exclusive OR) so that it can be said as well as the CNOT gate as follows:
Q4 : What is Quantum Gates?
Answer : Quantum gate is usually represented as a matrix. A gate acting on qubit k is represented by a 2 x 2 matrix kk unity. The number of qubits in the input and output of the gate should be the same. Action of quantum gates is found by multiplying the matrix representing the vector representing the gate with quantum state. Unlike many classical logic gates, quantum logic gates are reversible (model computing where computing process is reversible up to a certain limit, the time-reversed).
Q5 : What is Shor's Algorithm??
Answer : Shor's algorithm for factoring numbers which are polynomial-time category showed that quantum computers have the ability to exceed the quantum computer in the fact that quantum computers can work more efficiently than a classical computer. Shor's algorithm gives an example of how to exploit the properties of a quantum state and exploit them so as to solve specific problems. It encourages research on how to design an algorithm that can exploit quantum phenomena.
Shor's algorithm can solve the RSA code, but will remain anecdotal if the largest number that can be a factor is 15. Problem in a model-based circuits is to achieve scalable quantum system which at the same time will allow a person to
(1) sturdy represent quantum information,
(2 ) perform transformations universal family unity,
(3) preparing baseline state, and (4) measuring the output results.
Alternative paradigm might trade some of these requirements with other people, but the point remains the same, ie, one must reach one's control of quantum systems such that the system will remain "quantum" although mesoscopic or even macroscopic dimensions in the company.
Credits :
http://id.wikipedia.org/wiki/Komputer_kuantum
http://flashintata.blogspot.com/2013/05/quantum-computation.html
http://hansgaptek.blogspot.com/2012/04/apakah-quantum-computing-itu.html
http://hansgaptek.blogspot.com/2012/04/apakah-quantum-computing-itu.html
