DOCSLIB.ORG

Understanding Quantum Computing

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

International Journal of Scientific Engineering and Applied Science (IJSEAS) - Volume-1, Issue-6, September 2015 ISSN: 2395-3470 www.ijseas.com Understanding Quantum Computing Dr. K J Sarma, SMIEEE; Dept of Humanities and Mathematics & Academic cell Malla Reddy Engineering College (Autonomous ), Secunderabad, India, Abstract: It has been decided that Quantum estimated number of atoms in the universe and Computing (Q.C.) should be pursued, as it this enormous potential computational power is would be one of the priority research areas of the well worth harvesting.” M.A. Nielsen and I.L. future having a potential for computational Chuang [ 26 ] technology development and growth. Hence there is a need to motivate and involve The digital computers operate with the help of youngsters in research activity related to transistors. Digital computers require data to be quantum computing. There is a need to keep the encoded into binary digits (bits), each of which youngsters informed of the what, why, where, is always in one of two definite states (0 or 1), when, how of quantum computing. A review and the memory is made up of the bits. The of the origin and the progress of the binary digits for data encoding quantum developments in Quantum Computing is made computation uses qubits (quantum bits), which In this paper the author tried to review various can be in super-positions of states. aspects of the Quantum Computing like A Quantum Turing machine [40] is a theoretical Architecture, Operating system, Infrastructure model of such a computer, and is also known as required if any, links with other computing the universal quantum computer. Quantum technologies, Uses, Examples, Theoretical & computers share theoretical similarities with non Practical and class-room Applications, - deterministic and probabilistic computers. In Challenges, Algorithms, Security issues and other words a quantum Turing machine (QTM), Future trends. also a universal quantum computer, is an abstract machine used to model the effect of Key words: Quantum computing, Quantum a quantum computer. It provides a very simple mechanics, qubit, quantum information, model, which captures all of the power of quantum mechanics, Richard Feynman. quantum computation. Any quantum algorithm can be expressed formally as a 1. Introduction particular quantum Turing machine. Such Turing machines were first proposed in a Quantum computing is one of the hottest topics 1985 paper written by Oxford of 21 st century. This is a computational process University physicist David that uses the quantum mechanical phenomenon Deutsch suggesting quantum gates could different from the usual digital computers. function in a similar fashion to traditional digital Quantum computing studies computing with binary logic gates[41]. theoretical computation systems that make direct use of quantum-mechanical phenomena, Quantum Turing machines are not always used such as superposition and entanglement, to for analyzing quantum computation. perform operations on data. The quantum circuit is a more common model. “ It is very interesting and well worth noting, These models are computationally equivalent. that a quantum system of 500 qubits already Quantum Turing machines can be related to requires 2 500 amplitudes to fully describe its classical and probabilistic Turing machines in a quantum state. This number is larger than the framework based on transition matrices, shown 370 International Journal of Scientific Engineering and Applied Science (IJSEAS) - Volume-1, Issue-6, September 2015 ISSN: 2395-3470 www.ijseas.com by Lance Fortnow [42]. Iriyama et. al have been great developments in VLSI designs since developed a model of a Linear Quantum Turing the introduction of valve technology. In recent Machine (LQTM). This is a generalization of a times along with the thinking of optimization of classical QTM that has mixed states and that performance greater miniaturization of the allows irreversible transition functions. These systems also took a big leap [18]. It seems the allow the representation of quantum miniaturization has almost reached saturation. measurements without classical outcomes [43]. Also if transistors are reduced in size further it A quantum Turing machine with post would hinder the research in quantum selection was defined by Scott Aaronson, who mechanics. to hinder their performance. One showed that the class of polynomial time on must pay greater attention on this limitation as such a machine is equal to the classical Quantum computers share theoretical complexity class PP [44]. similarities with non-deterministic and probabilistic computers. This is similar to the The field of quantum computing was initiated by ability to be in more than one state the work of Yuri Manin in 1980, [2] Richard simultaneously. It may be noted that the field Feynman in 1982 [22], and David Deutsch [41]. of quantum computing was first introduced by A quantum computer with spins as quantum bits Richard Feynman in 1982 [22]. The Nobel was also formulated for use as a quantum space– prize-winning physicist Richard Feynman time in 1968. Experiments have been carried out thought of the idea of a 'quantum computer', a in which quantum computational operations computer that uses the effects of quantum were executed on a very small number of mechanics to its advantage as early as in qubits. Both practical and theoretical research 1982 [22]. For quite good length of time, the continues in an effort to develop notion of a quantum computer was primarily of quantum computers for civilian, business, trade, theoretical interest only. In the recent times and national security purposes, such quantum computers have received more as cryptanalysis. attention. This interest may also be due to the Large-scale quantum computers will be able to invention of an algorithm to factor large solve certain problems much more quickly than numbers, on a quantum computer, by Peter Shor any classical computers that use even the best (Bell Laboratories). By the use of this currently known algorithms, like integer algorithm, quantum computer is able to crack factorization using Shor's algorithm [30] or codes much more quickly than any ordinary the simulation of quantum many-body systems. computer. It is reported that quantum computer There are quantum algorithms, such as Simon's is capable of performing Shor's algorithm [ 24 ] algorithm, that run faster than any possible and is able to break current cryptography probabilistic classical algorithm.[8] When techniques in a matter of seconds. sufficient computational facility is available a classical computer could be made to simulate It is expected that Quantum computers will any quantum algorithm, as quantum someday replace silicon chips, just like the computation does not violate the Church–Turing transistor replaced the vacuum tube. It seems at thesis. the moment the technology required to develop such a quantum computer may take sufficiently long time. In fact most research in quantum 2. History & Genesis Of Quantum computing remained theoretical. The most Computers: advanced quantum computers have not gone 3. beyond manipulating more than 16 qubits,; In the following we trace the origin and the meaning that they are a far away from practical genesis of Quantum Computing. There have applications. But is expected that someday the 371 International Journal of Scientific Engineering and Applied Science (IJSEAS) - Volume-1, Issue-6, September 2015 ISSN: 2395-3470 www.ijseas.com quantum computers could perform faster Shor's Algorithm is a method for finding the calculations, which are time-consuming on prime factors of numbers (which plays an conventional computers. Many advancements intrinsic role in cryptography). The scientists of have been made in quantum computing in the IBM in 2001 used a 7-qubit computer to find the last few years. We would learn of some of the factors of 15 [24]. The computer correctly developments in research on quantum deduced that the prime factors were 3 and 5. computers. The scientists at the Institute of Optics in 2005, created the first qubyte or series of 8 qubits, In 1998 Los Alamos and MIT researchers using ion traps. managed to spread a single qubit across three nuclear spins in each molecule of a liquid In 2006 Scientists in Waterloo and solution of alkaline (an amino acid used to Massachusetts devised methods for quantum analyze quantum state or trichloro-ethylene (a control on a 12-qubit system and Quantum chlorinated hydrocarbon used for quantum error control becomes more complex as systems correction) molecules. Investigators used the employ more qubits. idea of entanglement, to study interactions The computer developed in 2007 by D-Wave between states as an indirect method for demonstrated a 16-qubit quantum computer analyzing the quantum information. which is used to solve Sudoku puzzle and other The quantum computer uses nuclear magnetic pattern matching problems. The D - Wave resonance (NMR) to manipulate particles in the Company claimed to produce practical systems atomic nuclei of molecules of trans-crotonic by 2008. But some of the pessimists believed acid, a simple fluid consisting of molecules that the practical quantum computers are still made up of six hydrogen and four carbon atoms. decades away. Also the system designed by D- The NMR is used to apply Wave is not scale-able, and that many of the electromagnetic pulses, which force the particles claims on D-Wave's Web site are simply to line up. These particles in positions parallel or impossible. The name quantum comes due to counter to the magnetic field allow the quantum quantum mechanics in its inner workings. So the computer to mimic the information-encoding name is not from the problems it is solving, but of bits in digital computers. This work was how it is solving them. carried out in 2000 March. The scientists at Los Alamos National Laboratory announced the There are several limitations on the computers. development of a 7-qubit quantum computer What they can and cannot depend on the laws within a single drop of liquid.
Recommended publications
  • LN13.Digi.Pdf (4.880Mb)

    LN13.Digi.Pdf (4.880Mb)

    Jarkko Kari (Editor) Proceedings of JAC 2010 Journées Automates Cellulaires Turku Centrefor Computer Science TUCS Lecture Notes No 13, Dec 2010 Proceedings of JAC 2010 Journ´eesAutomates Cellulaires December 15-17, 2010, Turku, Finland Editor: Jarkko Kari TUCS Lecture Notes 13 December 2010 ISBN 978-952-12-2503-1 (printed) ISBN 978-952-12-2504-8 (electronic) ISSN 1797-8823 (printed) ISSN 1797-8831 (electronic) Foreword The second Symposium on Cellular Automata “Journ´eesAutomates Cellulaires” (JAC 2010) took place in Turku, Finland, on December 15-17, 2010. The first two conference days were held in the Educarium building of the University of Turku, while the talks of the third day were given onboard passenger ferry boats in the beautiful Turku archipelago, along the route Turku–Mariehamn–Turku. The con- ference was organized by FUNDIM, the Fundamentals of Computing and Discrete Mathematics research center at the mathematics department of the University of Turku. The program of the conference included 17 submitted papers that were selected by the international program committee, based on three peer reviews of each paper. These papers form the core of these proceedings. I want to thank the members of the program committee and the external referees for the excellent work that have done in choosing the papers to be presented in the conference. In addition to the submitted papers, the program of JAC 2010 included four dis- tinguished invited speakers: Michel Coornaert (Universit´ede Strasbourg, France), Bruno Durand (Universit´ede Provence, Marseille, France), Dora Giammarresi (Uni- versit`adi Roma Tor Vergata, Italy) and Martin Kutrib (Universit¨atGießen, Ger- many).
  • Teaching Computer Scientists Quantum Mechanics N

    Teaching Computer Scientists Quantum Mechanics N

    From Cbits to Qbits: Teaching computer scientists quantum mechanics N. David Mermin Laboratory of Atomic and Solid State Physics, Cornell University, Ithaca, New York 14853-2501 ͑Received 22 July 2002; accepted 26 September 2002͒ A strategy is suggested for teaching mathematically literate students, with no background in physics, just enough quantum mechanics for them to understand and develop algorithms in quantum computation and quantum information theory. Although the article as a whole addresses teachers of physics well versed in quantum mechanics, the central pedagogical development is addressed directly to computer scientists and mathematicians, with only occasional asides to their teacher. Physicists uninterested in quantum pedagogy may be amused ͑or irritated͒ by some of the views of standard quantum mechanics that arise naturally from this unorthodox perspective. © 2003 American Association of Physics Teachers. ͓DOI: 10.1119/1.1522741͔ I. COMPUTER SCIENCE AND QUANTUM to realize—is an extremely simple example of a physical MECHANICS system. It is discrete, not continuous. It is made out of a finite number of units, each of which is the simplest possible These ‘‘bras’’ and ‘‘kets’’—they’re just vectors! kind of quantum mechanical system, a 2-state system, whose —Newly enlightened computer scientist1 possible behavior is highly constrained and easily analyzed. There is a new audience for the teaching of quantum me- Much of the analytical complexity of learning quantum me- chanics whose background and needs require a new style of chanics is connected to mastering the description of continu- quantum pedagogy. The audience consists of computer sci- ous ͑infinite-state͒ systems in (3ϩ1)-dimensional space- entists.

  • INFIERY-GSIERRA.Pdf

    Germán Sierra (Instituto de Física Teórica UAM-CSIC, Madrid) 6th INFIERY Summer School Madrid, 1st September 2021 Plan of the lecture - Part I: Historial background - Part II: The qubit and quantum gates Quantum Computation and Quantum Information Quantum Mechanics Quantum Computation and Quantum Information Quantum Mechanics Computer Sciences Quantum Computation and Quantum Information Quantum Mechanics Computer Sciences Quantum Computation and Quantum Information Information Theory Quantum Mechanics Computer Sciences Quantum Computation and Quantum Information Information Theory Cryptography Quantum Mechanics Quantum Mechanics Golden age of Physics Quantum Mechanics Golden age of Physics First Quantum Revolution About an improvement of Wien's spectral equation Max Planck 1858 - 1947 On the theory of the law of energy distribution in normal spectrum is light a wave or a particle? is light a wave or a particle? Isaac Newton 1642-1727 is light Thomas Young 1773-1829 a wave or a particle? Isaac Newton 1642-1727 is light Thomas Young 1773-1829 a wave or a particle? Isaac Newton 1642-1727 James Maxwell 1831-1879 is light Thomas Young 1773-1829 a wave or a particle? Isaac Newton 1642-1727 James Maxwell 1831-1879 Albert Einstein (1879-1955) On a heuristic point of view about the creation and generation of light Annalen der Physik, 1905 when a ray of light propagates from a point, energy is not distributed continuously over increasing volume, but it is composed of a finite number of energy quanta, in space,that move without being divided and that they can be absorbed or emitted only as a whole. On a heuristic point of view about the creation and generation of light Annalen der Physik, 1905 when a ray of light propagates from a point, energy is not distributed continuously over increasing volume, but it is composed of a finite number of energy quanta, in space,that move without being divided and that they can be absorbed or emitted only as a whole.
  • Experimental Realization of Schumacher's Information

    Experimental Realization of Schumacher's Information

    Experimental Realization of Schumacher's Information Geometric Bell Inequality Tahereh Rezaei,1 Shahabeddin M. Aslmarand,1 Robert Snyder,1, 2 Behzad Khajavi,3 Paul M. Alsing,4 Michael Fanto,4 Doyeol (David) Ahn,5, 1 and Warner A. Miller1 1)Department of Physics, Florida Atlantic University, Boca Raton, FL, 33431 2)L3Harris, 10001 Jack Finney Blvd, CBN018, Greenville, TX 75402, USA. 3)Dept of Biomedical Engineering, University of Houston, Houston, Texas, 77204 4)Air Force Research Laboratory, Information Directorate,Rome, NY 13441 5)Center Quantum Information Processing, Department of Electrical and Computer Engineering, University of Seoul, Seoul 130-743, Republic of Korea Abstract Quantum mechanics can produce correlations that are stronger than classically allowed. This stronger{than{ classical correlation is the \fuel" for quantum computing. In 1991 Schumacher forwarded a beautiful geometric approach, analogous to the well-known result of Bell, to capture non-classicality of this correlation for a singlet state. He used well-established information distance defined on an ensemble of identically{prepared states. He calculated that for certain detector settings used to measure the entangled state, the resulting geometry violated a triangle inequality | a violation that is not possible classically. This provided a novel information{based geometric Bell inequality in terms of a \covariance distance." Here we experimentally- reproduce his construction and demonstrate a definitive violation for a Bell state of two photons based on the usual spontaneous parametric down-conversion in a paired BBO crystal. The state we produced had a visibility of Vad = 0:970. We discuss generalizations to higher dimensional multipartite quantum states. I.
  • The Physics of Quantum Information

    The Physics of Quantum Information

    The Physics of Quantum Information Complementarity, Uncertainty, and Entanglement Joseph M. Renes 12 December 2012 arXiv:1212.2379v1 [quant-ph] 11 Dec 2012 Habilitation TU Darmstadt, Fachbereich Physik 2011 Contents Preface 1 1 Introduction: What is Quantum Information? 5 1.1 Understanding Classical Information via the InformationGame ................ 6 1.2 ComplementarityintheInformationGame . .................. 7 1.3 EntanglementintheInformationGame . .................. 8 2 Illustrations and Motivations 11 2.1 TeleportationandSuperdenseCoding . ................... 11 2.2 QuantumError-Correction......................... ................... 12 2.3 EntanglementDistillation ........................ .................... 17 2.4 QuantumKeyDistribution.......................... .................. 18 3 Characterizing Quantum Information 23 3.1 Amplitude and Phase Predictability & Entanglement . ..................... 23 3.2 Duality&Decoupling.............................. .................. 28 3.3 EntropicCharacterizations. .. .. .. .. .. .. .. .. .. .. ..................... 31 3.4 SecretKeys&PrivateStates ........................ ................... 33 4 Processing Quantum Information 37 4.1 OptimalEntanglementDistillation . ..................... 37 4.2 OptimalStateMerging............................. .................. 43 4.3 Secret Key Distillation and Private Communication . ...................... 45 5 Duality of Protocols 47 5.1 Duality of Privacy Amplification and Information Reconciliation ................ 47 5.2 Different Approaches to
  • The Universe As a Cyclic Organized Information

    The Universe As a Cyclic Organized Information

    NeuroQuantology | March 2015 | Volume 13 | Issue 1 | Page 1 Meijer D.K.F., John Wheeler’s world revised The Universe as a Cyclic Organized Information System: John Wheeler’s World Revisited Dirk K. F. Meijer ABSTRACT This essay highlights the scientific vision of John Archibald Wheeler, a giant of 20th century physics. His ideas provided the important insight that humanity may be in the very center of disclosure and manifestation of the evolution of our universe. This on the basis of scientific reasoning derived from quantum physics rather than simple anthropocentrism or scale chauvinism. Wheeler, the Joseph Henry Professor of Physics Emeritus at Princeton University, became 96. Over a long, productive scientific life, he was known for his drive to address big, overarching questions in physics, subjects which he liked to be merged with philosophical questions about the origin of matter, information and the universe. His interests ranged far and wide and were characterized by true fearlessness. Wheeler's work was not only in gravity and nuclear physics. In the 1950s Wheeler grew increasingly intrigued by the philosophical implications of quantum physics. According to Wheeler, there was no universe until the rise of consciousness to perceive it. In fact, Wheeler was one of the first prominent physicists seriously to propose that reality might not be a wholly physical phenomenon. In some sense, Wheeler suggested, reality grows out of the act of observation, and thus consciousness itself: it is “participatory.” He also stated that information is the most fundamental building block of reality, and that the universe should be seen as a self- synthesized information system: a self-excited circuit that is developing through a (closed loop) cycle.
  • Qics - Periodic Activity Report Iii

    Qics - Periodic Activity Report Iii

    QICS - PERIODIC ACTIVITY REPORT III Bob Coecke Chancellor, Masters and Scholars of the University of Oxford FP6 FET STREP - project no 033763 Full name: Foundational Structures for Quantum Information and Computation Thematic priority: Quantum Information Processing and Communications Period covered: Jan. 1st 2009 – Aug. 7th 2010 Date of preparation: Aug. 7th 2010 Start date of project: Jan. 1st 2007 Duration: 42 months Q I C S QICS — proposal no 033763 — Progress report III — 7 August 2010 1 Contents I Publishable executive summary3 II Project objectives and major achievements during the reporting period7 1 Objectives, work done, comparison to state-of-the-art and other developments8 1.1 Objectives of QICS as stated in the initial proposal................................8 1.2 Objectives for the workpackages as stated in the initial proposal......................... 10 1.3 Comparison of these objectives to the current state-of-the-art........................... 11 1.4 Progress made on the objectives during the reporting period............................ 11 1.5 Next steps to be taken for reaching the objectives................................. 11 2 Recruitment, mobility, spin-off 12 3 QICS events and presentations 13 3.1 The QICS school.................................................. 13 3.2 Other QICS events and QICS supported events.................................. 17 3.3 Presentation of QICS output............................................ 17 III Workpackage progress reports of the period — includes project deliverables — 18 4 W1 – deliverable D1: Structures and methods for measurement-based quantum computation 20 4.1 Progress towards objectives and performed tasks for W1.T1............................ 21 4.1.1 Review article on W1............................................ 21 4.1.2 Study normal forms for quantum algorithms in measurement-based computer models.........
  • Cellular Automata in Operational Probabilistic Theories

    Cellular Automata in Operational Probabilistic Theories

    Cellular automata in operational probabilistic theories Paolo Perinotti QUIT Group, Dipartimento di Fisica, Università degli studi di Pavia, and INFN sezione di Pavia, via Bassi 6, 27100 Pavia, Italy The theory of cellular automata in oper- 5.3 Causal influence . 37 ational probabilistic theories is developed. 5.3.1 Relation with signalling . 38 We start introducing the composition of 5.4 Block decomposition . 39 infinitely many elementary systems, and then use this notion to define update rules 6 Homogeneity 41 for such infinite composite systems. The notion of causal influence is introduced, 7 Locality 47 and its relation with the usual property of signalling is discussed. We then introduce 8 Cellular Automata 51 homogeneity, namely the property of an 8.1 Results . 51 update rule to evolve every system in the same way, and prove that systems evolving 9 Examples 55 by a homogeneous rule always correspond 9.1 Classical case . 55 to vertices of a Cayley graph. Next, we de- 9.2 Quantum case . 55 fine the notion of locality for update rules. 9.3 Fermionic case . 56 Cellular automata are then defined as ho- mogeneous and local update rules. Finally, 10 Conclusion 56 we prove a general version of the wrapping lemma, that connects CA on different Cay- Acknowledgments 57 ley graphs sharing some small-scale struc- A Identification of the sup- and operational ture of neighbourhoods. norm for effects 57 Contents B Quasi-local states 57 1 Introduction1 C Proof of identity 94 64 2 Detailed outlook3 D Homogeneity and causal influence 64 3 Operational Probabilistic Theories4 E Proof of right and left invertibility of a 3.1 Formal framework .