Quantum Computation it self
is a field of study that is focused on developing computer technology based on
the principles of quantum theory, which explains the nature and behavior of
energy and matter on quantum (atomic and subatomic) levels.
There is also Quantum
Computer. Then what's the difference with Quantum Computer?
It is a calculating tool
that uses quantum mechanics such as superposition and interconnection, which is
used for data operations. The calculation of the amount of data in classical
computing is calculated with bits, while calculating the amount of data on
quantum computers is done with qubit. The basic principle of quantum computers
is that the quantum properties of particles can be used to represent data and
data structures, and that quantum mechanics can be used to perform operations
with this data. In this case to develop a computer with a quantum system
required a new logic in accordance with quantum principles.
Operation of Qubit Data
A qubit is the basic unit of
information in a quantum computer. While few can represent just one of two
possibilities such as 0/1, yes / no, the qubit can represent more: 0/1, 1 and
0, the probability of occurrence at any time combined with more qubits, and all
that simultaneously. In general quantum computers with qubit n can be in
arbitrary superposition of up to 2 n different states simultaneously (this is
compared to a normal computer that can only be in one state n 2 at a time).
To manipulate a qubit, then
use Quantum Gates (Quantum Gate). The way it works is that a quantum gate works
similar to a classical logic gate. The classical logical gate takes the bit as
input, evaluates and processes the input and generates the new bit as output.
Quantum Gates
Quantum Gates / Quantum
Gates is a logic / gate logic rule that applies to quantum computing. The
working principle of quantum gates is almost the same as logic gates on digital
computers. If on a digital computer there are some logical operations such as
AND, OR, NOT, on quantum computing quantum gates composed of several qubits, so
that quantum gates is harder to calculate than logic on digital computers.
Example of Quatum Gate :
https://www.youtube.com/watch?v=0XJp3akoocY&feature=youtu.be
Shor’s Algorithm
The algorithm invented by Peter Shor in 1995. By using this algorithm, a quantum computer can decode a secret code that is currently commonly used to secure data transmission. Code called RSA code, if encoded through the RSA code, the data sent will be safe because the RSA code can not be solved in a short time. In addition, RSA code splitting requires the work of thousands of computers in parallel so that the work of solving it is not effective.
Shor's algorithm depends on
the result of number theory. These results are: periodic function. In the
context of the Shor algorithm, n will be the number to be factored into. If the
two numbers are coprime it means that the divisor is generally 1. The
calculation of this function is for the exponential number, than it will take
the exponential time on the classical computer. Shor's algorithm utilizes
quantum parallelism to perform an exponential number of operations in one step.
Example of Shor's Algorithm :
https://youtu.be/zSmHXpVK6EA
Example of Shor's Algorithm :
https://youtu.be/zSmHXpVK6EA
About Quantum Gates dan Shor’s
Algorithm
About the quantum gates and
the shor algorithm, the Shor algorithm is based on a number theory: the
function F (a) = xamod n is a periodic function if x is a relatively prime
integer with n. In the Shor Algorithm, n will be an integer that wants to be
factored. Calculating this functionality in a conventional computer for an
exponential number will require an exponential time as well. On this issue the
quantum shor algorithm utilizes quantum parallelism to do so in just one step.
Since F (A) is a periodic function, then this function has a period r. Given
x0mod n = 1, then xr mod n = 1, so is x2r mod n and so on
.
Entanglement
After a little understanding
what is quantum computation and quantum computer we will enter the discussion
of Entanglement. Entanglement itself is still part of Quantum Computation. What
is Entanglement? Entanglement is a quantum mechanical theory that describes how
quickly and how strongly the connected particles of a Quantum computer are
where if a particle is treated "A" it will give an "A"
effect to other particles as well.
There is also another
understanding of Entanglement according to Albert Einstein's "Quantum
Entanglement" in term "Remote Wizarding" which is the basic
nature of quantum mechanics. Entanglement allows quantum information to spread
over tens of thousands of kilometers, and is only limited by how fast and how
many entanglement pairs can work in space. From the source I get from the
internet: [Quantum entanglement] is a phenomenon that connects two particles in
such a way that the changes that occur in one particle are instantly reflected
in other particles, although physically may be among them apart several light
years.
source :
https://amoekinspirasi.wordpress.com/2014/05/15/pengertian-quantum-computing-dan-implementasinya/ with translate
https://pandyapriyandi.blogspot.co.id/2016/04/pengoperasian-data-qubit-quantum-gates.html with translate
source :
https://amoekinspirasi.wordpress.com/2014/05/15/pengertian-quantum-computing-dan-implementasinya/ with translate
https://pandyapriyandi.blogspot.co.id/2016/04/pengoperasian-data-qubit-quantum-gates.html with translate