Introduction to Quantum Computation Abstract

Overview:
First of all in this seminar we will answer to some very important questions concerning the need of quantum computation and the advantages they offer us in compare with the classical computers. We will also point out what is the relation between physics, information and computation and then we will mention some of the consequences of this relation. Of course, as we all know every, coin has two sides, so we will also have not to forget that right with the advantages are also coming and the disadvantages. We will discuss the sequences of this disadvantages and the obstacles that they are for building a real device. We will briefly discuss the topic of how feasible are the quantum computers and even though, that I don't understand them completely, we will mention some suggestions concerning the hardware representation of quantum computers, because it may be useful as a starting point for searching for related literature. The next topic will have the aim to show how is a particular calculation performed on a Quantum Turing Machine. For that reason we will compare the Classical Turing Machine with quantum one. We will define terms as probability amplitude, constructive and destructive interference. We will define also transition matrixes and we will point out the restriction they have to obey. In the last topic we will observe the ability for transforming every classical computation into reversible one. This topic is important for quantum computing because of the following reason. According to Landeur principle erasure of information costs energy which is emitted into the environment in the form of heat. In modern computers the elements are cooling with fans or something different preventing them from melting. Unfortunately this is not possible for quantum computes because it will lead to decoherence of the system. And since classical computations are special case of quantum computation the topic is very important.

The basic questions to which we will try to give answers:

The presentation is divided into eight logical parts. Every part starts with a question whose answer is important for understanding the quantum computation process. Here we will briefly mark these questions:

1.Why quantum computers?

- all classical computers and their models are based on the lows of the classical physics, so they are not using all possibilities offered from the nature - the quantum computer represents the first challenge to the efficiently oriented Church-Turing thesis -as the dimensions of modern computer elements continue to shrink, we will reach the phase where the laws of Quantum Mechanics dominate.

2.What is the relation between physics, information and computation and what does it means to base a computer on the laws of quantum mechanics? -according to Landauer's principle the physics and the information are
tightly connected, since energy is physical -furthermore, the information is coded into the state of a physical system

3.Where lie the differences between the classical and quantum computational process? -classical information can be read, duplicated and transmitted. On other hand the same is not true about the quantum information -the way the computational process goes in quantum computer has a random element but it differences a lot from the classical randomized computing due to the property of the quantum systems called quantum parallelism. - in quantum computers the smallest unit of information is called Qbit, which can be in one of infinite number of states -Entanglement the state of a quantum mechanical system can not be represented as states of its subsystems, which is not true with classical physical systems. 4.Where are the drawback and bottlenecks of the quantum computer?
-applying a measure (receiving an information) we can get from a state that carries a lot of information only one classical result and will lose all the other information. -The quantum information can not be copied -The interaction between the environment and the quantum system can lead to the so called decoherence effect. This may result in complete destroy of the system.

5.How will the Quantum hardware look?

-nobody knows yet -but the requirements for this hardware are known -Storage: We'll need to store Qbits long enough to perform an interesting computation -Isolation: The Obits must be well isolated from the environment to minimize the decoherece effect. -Readout: We'll need to measure the Qbits efficiently and reliably. -Gates: We'll need to manipulate the quantum states of individual Qbit, so that we can perform quantum gates. -Precision: The quantum gates should be implemented with highly precision if we want the device to work properly.

-here are some suggestion for realization of the Qbit. I've read them on page 24 of the lectures note on Quantum computation prepared from John Preskil from California Institute of Technologies. Unfortunately I didn't understand a lot. Here is the website on which this lecture notes are available: http://www.theory.caltech.edu/people/preskill/ph229 -Ion Trap: This idea has been suggested by Ignacio Cirac and Peter Zoller. In this scheme the Qbit is represented by a single ion held in linear Paul trap. -Cavity QED: Pellizzari, Cardiner, Cirac and Zoller have suggested that several neutral atoms to be stored in a small high finesse optical cavity. The quantum information can be stored in the internal states of the atoms -NMR: This scheme uses nuclear magnetic resonance technology and the Qbits are carried by a a certain nuclear spin in a particular molecule.

5.Are not the current computers quantum?

-in some very restricted sense of the world they are

6.How is the classical random computation performed on a Probability Turing Machine?

-we will give the formal definition of probability Turing machine and we will observe how a particular computation is performed. -we will define terms as local and global probability conditions, superposition of configurations and transition matrixes

7.How is the quantum computation performed on a Quantum Turing Machine with comparison to the classical one ?
-we will give the formal definition of quantum Turing machine and we will observe how a particular computation is performend. -we will define terms as local and global probability conditions, superposition of configurations and transition matrixes -we will show what does are the positive and negative interference between the configurations of PTM -we will define the restriction to transition matrixes needed for satisfaction the global probability condition -we will discuss the disability to observe the computational path on QTM

8.What about the energy costs and can we make all classical computations reversible?
-for answering this question we will construct reversible gates with which we can construct every reversible function -furthermore we will show how every not one-to-one function can be made reversible -at the end we will define reversible Turing machine

This document was created with Win2PDF available at http://www.daneprairie.com. The unregistered version of Win2PDF is for evaluation or non-commercial use only.