## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

On completion of this lesson you will know: • • • Basic concepts of quantum computer Quantum Algorithms Challenges for the quantum computer

Quantum Computing

Introduction: People all over this world are thinking about atomic scale computing and scientist all over the world work on it. Quantum mechanics is a science where we get the mysterious information about the tiny particle. Now we are trying to utilize the advantage of this mysterious behaviour of these tiny particles. Nobel prize-winning physicist Richard Feynman at the year of 1982, start to thinking about the Quantum computer where he thought that use Quantum mechanics phenomena. After this great start of Richard Feynman scientist over the world start to dream about Quantum computer. First it seems like theoretical work, but then scientist start to work for make it practical one. The superposition is the main advantage of Quantum computer and scientist all over the world try to use this superposition for advance work. Another phenomenon of Quantum mechanics is used by future Quantum computing named entanglement. Using these characteristic of Quantum Mechanics, scientist want to build future computer.

Basics: Main property of Quantum computing is, it use Quantum properties for data representation and operation on data. In Classical computer is we find bits what are the basic of computing only 0 and 1. What we done in classical computer is done by these bits but in Quantum Computer we find 0, 1 and superposition of this two states. We can think this superposition as a mixture of these two states. Generally in Quantum Computer using n qubits it can represent 2^n different states simultaneously. Operating on these qubits a Quantum computer working and using these qubits Quantum computer do whatever it needs. Scientist all over the world working on these area and many people

But using a Quantum register which is build with qubits if these qubits are in superposition the register can represent the numbers from 0 to 7 at the same time. |↓> = 0 z y z x |↑> = 1 Figure: Bloch sphere is a representation of a qubit. it can calculation using all possible values of the input register at once. . Suppose we use a register of three bits for a representing a number from 0 to 7 and we can represent one number among the numbers. If we can make a processor of Qubits. But Quantum computer the scenario is little bit different. Working scheme: We know from previous that the basic building block of a classical computer is bit which consist of two states 0 and 1.from all over the world successfully represent different small scale simulation for Quantum Computer what give a hope for making a real Quantum Computer. . Above the picture represent a Bolch sphere. like when the spin is up then it is one and when the spin direction is down then it is zero. We can think these qubits using two spin states particle. This behaviour of qubits is known as quantum parallelism. We can represent a qubit using this geometrical figure. |↓> is known as 0 and when the |↑> the it is known as 1.

Shor’s algorithm 2. Main two quantum algorithms are 1. Still people are in experimental stage and not independently work with nano particles. But Grover’s algorithm shows that it possible by using root N number of search. Its may take hundreds of years to build the Quantum computer but it help to people to understand the real quantum phenomena. Grover’s algorithm Shor’s Algorithm: Peter Shor has written this algorithm for factoring a number for Quantum computer. Different types of experiment going on based on different materials. Different challenges: First step for making a quantum computer is making quantum gates. Quantum phenomenons are very critical to work with normal environment than isolated environment. But it’s very hopeful that people all over the world working on it and many hopeful outputs come out from the research. Experimenters work on different type of particle for finding which type of particle is based selection for making quantum gates. This one is for factoring numbers. Different type of experimental and theoretical research in quantum computation is going on all over the world and day by day it increasing. Factoring a big number is one of the challenges for classical computer but in Quantum computer it is very quick to find a factor for a big number. This algorithm is based on quantum phenomena and tries to utilize the Quantum parallelism. Grover’s algorithm: Lov Grover has written an algorithm for searching a unsorted database to find a specific entity which is build for quantum computer and it faster than classical computer. But first have to build quantum computer. .Quantum Algorithms: Based on Quantum phenomena different type of algorithms build and they only work for Quantum computer. When a classical computer algorithm try to find a specific entity from a unsorted database it takes N/2 number of search when the total number of entities is N. When the database size is become big then this becomes more significant.

- n 480793100
- Introduction.pdf
- PhysRev.48.696.pdf
- Intuition- Delusion or Perception
- List of QC Simulators - Quantiki _ Quantum Information Wiki and Portal
- Quantam ..- Stapp
- Science and Aesthetics
- 3rd_law[1]
- A History of movement science in present scenario
- Quantum Magnetism
- Physiqs
- Schroedinger - The Present Situation in Quantum Mechanics (Part 8)
- 2014-05-google-gates-quantum-playground.pdf
- Alexis Karpouzos | Cosmology
- Quant Comp
- Jerey Yepez, Guy P. Seeley and Norman H. Margolus- Lattice-Gas Automata Fluids on Parallel Supercomputers
- Cosmic quantum mechanics
- Boolean Logic is Sufficient to Work With Quantum Mechanics
- Physics is the Scientific Study Of
- Peter Bruza et al- Is there something quantum-like about the human mental lexicon?
- Quantum Coherence in Biological Systems-Lloyd (M.I.T.) 2011
- Training a Quantum Neural Network
- PP-01-12
- Andromeda 6
- Quantum Mechanics
- Chaoism and Chaos Magic, A personal View
- Fukuda Equivalence
- 06 OK on the Lack of a General Theory of Physical Biology
- Dudley Shapere
- Atomic Interferometer

- SENATE HEARING, 109TH CONGRESS - FUTURE OF SCIENCE
- tmp1DDC
- tmpB89E.tmp
- Tmp 5867
- UT Dallas Syllabus for msen6319.501.07s taught by Kyeongjae Cho (kxc067000)
- Hologram World
- Analysis of Boolean Functions
- UT Dallas Syllabus for phys4302.001.10f taught by Yuri Gartstein (yxg037000)
- UT Dallas Syllabus for phys6301.001 05f taught by Yuri Gartstein (yxg037000)
- UT Dallas Syllabus for phys6301.001.11s taught by Mohammad Abolfath (rxa082100)
- tmpAA43.tmp
- UT Dallas Syllabus for ee6319.501.07f taught by William Frensley (frensley)
- UT Dallas Syllabus for phys6300.001 05f taught by Joseph Izen (joe)
- tmp105E
- UT Dallas Syllabus for phys4301.001.08s taught by James Huffman (jhuffman)
- UT Dallas Syllabus for phys6400.001.09f taught by Joseph Izen (joe)
- UT Dallas Syllabus for taught by William Frensley (frensley)
- UT Dallas Syllabus for phys6300.001.11f taught by Joseph Izen (joe)
- tmpE147
- tmp8D04.tmp
- tmp821B.tmp
- tmpC39.tmp
- UT Dallas Syllabus for phys6400.501.07f taught by Joseph Izen (joe)
- tmpBD2A.tmp
- UT Dallas Syllabus for phys3352.501.08s taught by Roy Chaney (chaneyr)
- tmpEB02
- Tmp 1804
- tmp570C.tmp
- tmp807B.tmp
- tmpDD40.tmp

Sign up to vote on this title

UsefulNot usefulClose Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Close Dialog## This title now requires a credit

Use one of your book credits to continue reading from where you left off, or restart the preview.

Loading