4 views

Uploaded by satishqwerty

- Fixed Point
- QRW-Cambr02 quantum computing
- Quantum Computing
- F6 User Manual V1.1
- quantum computing
- pamet_sm
- 24lc2561
- v20 Application
- Stem Reaction Time Teacher Notes
- TA_Web_01
- What is Quantum Computing?
- Review.2008.JNP.coupled Cavities
- Hierarchy of Data
- Accenture Paper
- Binary Coding
- Diploma Courses -NEW SYLLABUS.pdf
- Phys402_Syl_2018S.pdf
- fiz_osnovy_eng1
- ATMEL
- 100 Years of the Quantum - Tegmark Wheeler 2000.pdf

You are on page 1of 3

ABSTRACT

A quantum computer is a device for computation that makes direct use of quantum mechanical phenomena, such as superposition and entanglement, to perform operations on data. Quantum computers are different from digital computers based on transistors. Whereas digital computers require data to be encoded into binary digits (bits), quantum computation utilizes quantum properties to represent data and perform operations on these data. A theoretical model is the quantum Turing machine, also known as the universal quantum computer. Quantum computers share theoretical similarities with non-deterministic and probabilistic computers, like the ability to be in more than one state simultaneously. The field of quantum computing was first introduced by Richard Feynman in 1982. Although quantum computing is still in its infancy, experiments have been carried out in which quantum computational operations were executed on a very small number of qubits (quantum bits). Both practical and theoretical research continues, and many national government and military funding agencies support quantum computing research to develop quantum computers for both civilian and national security purposes, such as cryptanalysis. Large-scale quantum computers could be able to solve certain problems much faster than any classical computer by using the best currently known algorithms, like integer factorization using Shor's algorithm or the simulation of quantum many-body systems. There exist quantum algorithms, such as Simon's algorithm, which run faster than any possible probabilistic classical algorithm. Given unlimited resources, a classical computer can simulate an arbitrary quantum algorithm so quantum computation does not violate the ChurchTuring thesis. However, in practice

1

TECHNICAL SEMINAR

QUANTUM COMPUTERS

infinite resources are never available and the computational basis of 500 qubits, for example, would already be too large to be represented on a classical computer because it would require 2500 complex values to be stored. Nielsen and Chuang point out that "Trying to store all these complex numbers would not be possible on any conceivable classical computer." The history of computer technology has involved a sequence of changes from one type of physical realization to another --- from gears to relays to valves to transistors to integrated circuits and so on. Today's advanced lithographic techniques can squeeze fraction of micron wide logic gates and wires onto the surface of silicon chips. Soon they will yield even smaller parts and inevitably reach a point where logic gates are so small that they are made out of only a handful of atoms; i.e. the size of the logic gates become comparable to the size of atoms. On the atomic scale matter obeys the rules of quantum mechanics, which are quite different from the classical rules that determine the properties of conventional logic gates. So if computers are to become smaller in the future, new, quantum technology must replace or supplement what we have now. The point is, however, that quantum technology can offer much more than cramming more and more bits to silicon and multiplying the clock-speed of microprocessors. It can support entirely new kind of computation with qualitatively new algorithms based on quantum principles. The story of quantum computation started as early as 1982, when the physicist Richard Feynman considered simulation of quantum-mechanical objects by other quantum systems. However, the unusual power of quantum computation was not really anticipated until the 1985 when David Deutsch of the University of Oxford published a crucial theoretical paper in which he described a universal quantum computer. After the Deutsch paper, the hunt was on for something interesting for quantum computers to do. At the time all that could be found were a few rather contrived mathematical problems

2

TECHNICAL SEMINAR

QUANTUM COMPUTERS

and the whole issue of quantum computation seemed little more than an academic curiosity. It all changed rather suddenly in 1994 when Peter Shor

from AT&T's Bell Laboratories in New Jersey devised the first quantum algorithm that, in principle, can perform efficient factorization. This became a `killer application' --- something very useful that only a quantum computer could do. To explain what makes quantum computers so different from their classical counterparts we begin by having a closer look at a basic chunk of information namely one bit. A bit is the basic unit of information in a digital computer. From a physical point of view, a bit is a physical system which can be prepared in one of the two different states representing two logical values --- no or yes, false or true, or simply 0 or 1. For example, in digital computers, the voltage between the plates in a capacitor represents a bit of information: a charged capacitor denotes bit value 1 and an uncharged capacitor bit value 0. One bit of information can be also encoded using two different polarizations of light or two different electronic states of an atom. In any of the systems listed above, a bit can store a value of logical 1 or logical 0 using some method which depends on the system used. In quantum computers also, the basic unit of information is a bit. The concept of quantum computing first arose when the use of an atom as a bit was suggested. If we choose an atom as a physical bit then quantum mechanics tells us that apart from the two distinct electronic states (the excited state and the ground state), the atom can be also prepared in what is known as a coherent superposition of the two states. The above information was inspired from Google, Wikipedia and the internet content.

TECHNICAL SEMINAR

- Fixed PointUploaded bysvasanth007
- QRW-Cambr02 quantum computingUploaded byranadip das
- Quantum ComputingUploaded byPrasanth Kumar
- F6 User Manual V1.1Uploaded byKashif Aziz Awan
- quantum computingUploaded byswati k
- pamet_smUploaded byOsoo Sarda
- 24lc2561Uploaded byricardo_Massis
- v20 ApplicationUploaded bySyed Ali
- Stem Reaction Time Teacher NotesUploaded bynong
- TA_Web_01Uploaded byyuritabasco
- What is Quantum Computing?Uploaded byStemiac
- Review.2008.JNP.coupled CavitiesUploaded byDirk Englund
- Hierarchy of DataUploaded byapi-3826459
- Accenture PaperUploaded bySaransh Dhawan
- Binary CodingUploaded bysahildeora
- Diploma Courses -NEW SYLLABUS.pdfUploaded byMohammad Mizanur Rahman Nayan
- Phys402_Syl_2018S.pdfUploaded byRoshan Shetty
- fiz_osnovy_eng1Uploaded byVerónica Serrato Quezada
- ATMELUploaded byDarko Rendulić
- 100 Years of the Quantum - Tegmark Wheeler 2000.pdfUploaded byTangthietgiap
- uwrt2 minir2Uploaded byapi-341606660
- Pointer Action in SDHUploaded byPardeep Sharma
- PIC16C72AUploaded bysafsa
- Dual Time Supercausality by Chris C. King Department of Mathematics and Statistics University of Auckland, New ZealandUploaded byDanToledo
- HISTOR~1.docUploaded byjehosha
- 1. Avr Asm Bit Manipulation - Avr Asm IntroductionUploaded byadrian_viso
- Budget of Lesson Computer Systems ServicingUploaded byEi
- Niels Bohr’s Interpretation and the Copenhagen Interpretation—Are the Two Incompatible.pdfUploaded byIgor Vogel
- Ultracold Atoms - Optical LatticesUploaded byAnonymous tp9Xatf3U
- Critique of “Quantum Enigma: Physics Encounters Consciousness”Uploaded byJarkko Tabula Rasanen

- 1tabu Century ManualUploaded byTamino14
- Car HackingUploaded byalbasud
- 07_2764Uploaded byMiki Arsovski
- The AS400® NetServer AdvantageUploaded byneerajmontu
- Control Flow GraphsUploaded byGilco333
- 7. Scheduling.pptUploaded byYasir Alam
- Tm4c123gh6pm StartupUploaded byyoubemine56
- LECT02.pdfUploaded byAnirodh
- Dld ReportUploaded bySyed Ariful Islam Emon
- Java_I_Lecture_14.ppsUploaded byMarin_1wq
- A Survey on Using Artificial Intelligence Techniques in the Software Development ProcessUploaded byAnonymous 7VPPkWS8O
- dmesgUploaded bylucas
- Hardware BookUploaded byAkshay Vyas
- Absynth 3 EnglishUploaded bygeobv77
- Using Modbus Library With Step7 Siemens PlcsUploaded byQuoc Han
- MSP430brochure.Uploaded byBhushan PAwar
- WCDP: A protocol for web cache consistency.pdfUploaded bykostas_ntougias5453
- Manual Ecografo Eximed Mantenimiento AV-3618 OkUploaded byEliana Caceres Torrico
- Informatica QuestionnaireUploaded byShiva CH
- DTMF Encoding and DecodingUploaded bymastelecentro
- Doc 4088Uploaded byAnglila Nayanggita
- 1065 Snap Analog Input Mods Data SheetUploaded byFernando Sanz
- A Short Guide to Networking in Virtual Box With Oracle Linux Inside.Uploaded byAnonymous 8RhRm6Eo7h
- logoUploaded byNst Tnagar
- Micom ProtectionsUploaded bykjfens
- M1M OP ManualUploaded byDavide Sesti
- Anue Net tool optimizerUploaded byGenesys123
- Est 3 Wire GuideUploaded byKVSureshkumar
- book-rev8Uploaded bymarkkiksmith
- Veritas cluster Interview Questions-2 - UnixArena.pdfUploaded byAdelMohamed