DOCSLIB.ORG

Quantum Computing 03

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Quantum Computing 03 01 Filtering the Future QUANTUM ISSUE 03 JUN 2017 COMPUTING QUANTUM COMPUTERS AND THE POTENTIAL APPLICATIONS OF THIS REVOLUTIONARY TECHNOLOGY images: Docubytes, © by James Ball © by Docubytes, images: INTRODUCTION INTRODUCTION FILTERING THE FUTURE IS BASED ON THE MOST EXCITING AND SIGNIFICANT MESSAGES OF THE FILTER FROM THE LAST MONTHS. THIS FILTERING THE FUTURE IS ABOUT QUANTUM COMPUTERS AND THE POTENTIAL APPLICATIONS OF THIS REVOLUTIONARY TECHNOLOGY. FILTERING THE FUTURE / QUANTUM COMPUTING 03 WHAT IS QUANTUM COMPUTING? Everything in the natural world can be described by quantum mechanics, and doing so has led to the development of everyday technologies from MRI scans, nanotechnology and the transistor. There are two quantum revolutions. The first one was in (quantum) physics: understanding how things work at the sub-atomic level, and that yielded some strange conclusions: particles can be in two states at the same time; two or more particles that are separated at great distance can still ‘sense’ each other; the exact position of a particle is never certain until it is measured or observed but this observation or measurement changes the situation of the particle irrevocably. In the 1920s, quantum physicists did the math that underpins these conclusions, but they were made manifest in laboratory experiments only later on in the 20th century. The practical work on quantum computing – the second quantum revolution – started in the 1980s, with the work of Paul Benioff and Yuri Manin, Richard Feynman, and David Deutsch, when scientists learned how to apply the physics and mathematics to model computers that could perform ‘quantum computations’. The main idea is that a quantum computer programs atoms to represent all possible input combinations simultaneously and run an algorithm that tests all possible combinations at once, instead of serially cycling every possibility by varying input to arrive at a solution. This method will help to solve the most complicated computations that even modern-day supercomputers take decades to do. Why? Because quantum computation is conceptually different from ‘normal computation’, or the way ‘traditional’ computers perform their operations. Three concepts - that defy our intuition - are at the center. The first is superposition. Traditional computing depends on bits that can only take on two, binary values: 0 or 1. Qubits, their quantum analogues, can be arranged in ‘states’: something like a mixture of 0, 1 or both 0 and 1 (tertiary value). To carry out a quantum computation with qubits is to act on the 0, 1 and both at the same time. WHAT IS QUANTUM COMPUTING? The concept of entanglement unleashes the power of these indeterminate state of qubits. Binary bits in a traditional computer are isolated from another, but inside a quantum computer all qubits are interrelated or correlated, or ‘entangled’ with another. And a quantum computer can run its computations on all ‘entangled superpositions’ simultaneously. That means that to operate on one qubit is to operate on all entangled qubits, making the computational power of a quantum computer an exponential function of its qubits (computational power = 2^qubits), impossible to describe by decomposing it into its constituent parts. For example, to describe all the states of a (binary) 50-bit traditional computer requires 50 bits of digital memory; a description of a (entangled) 50-qubit quantum computer would require 2.5 quadrillion (see for example IBM’s recent handbook on numerical benchmarks for quantum computing to define the computational power of quantum computing, or ‘volume’ of quantum computers). That brings us to the last quantum concept: its probability amplitude. Equations in traditional computing can predict the probability of a given event, for example how likely it is that the S&P will decline by 10% or the chance the Ajax wins the Europe League. But probabilities in quantum computing – which can also be negative – can interfere with each other and depend on the other elements of the probability equation that is used. So when a quantum computer searches a data set for example, it can take shortcuts to the right answer. It does so by reducing the probability of wrong answers and increasing the probability of the right answers from its own operations. These three properties make quantum computing so different of traditional computing, because quantum computing reverses the order and concept of a computation. Traditional computing systems deliver the output (the answer) given the input (the question). Consider, for example, that we want to know all possible computations of the number ‘1000’, using only prime numbers. Because traditional computing is binary, with isolated events and fixed probabilities, it will start factoring FILTERING THE FUTURE / QUANTUM COMPUTING 05 all possible operations with prime numbers that yield the number ‘1000’. The problem for the system is the ‘problem’ itself: what we want to know, our question. But quantum computing works otherwise, because its system uses programmed atoms that already contain every possible answer, and the problem is how to ask it. In other words, the quantum system already knows or contains how many prime number operations yield the number ‘1000’, and we only need to put the right question. So the quantum system no longer considers the operation as an ‘or…or problem’ (binary) but as ‘and…and’ (entangled superpositions) as it ‘recognizes’ all the right answers immediately that are inherent to the system. The problem is not the computation of all possible combinations or all the steps in the computational linkage, but only to filter all right answers. And that saves a lot of time. So quantum computing is both conceptually and technologically a real ‘paradigm shift’ from traditional computing. Companies are therefore rushing to make the first working quantum computer, to reach ‘quantum supremacy’: performing certain calculations traditional computers cannot do, like some physical processes cannot be emulated by non-quantum models. Some computations are so complex or large that traditional (super)computers cannot perform these in a finite time slot or would otherwise require an almost infinite amount of energy. Quantum computing can tackle these problems. DEVELOPING QUANTUM COMPUTERS FILTERING THE FUTURE / QUANTUM COMPUTING 07 DEVELOPING QUANTUM COMPUTERS Until now, researchers only succeeded to build five-qubit computers and more fragile 10- to 20-qubit test systems. But the head of Google’s quantum computing effort, Harmut Neven, claims his team is on target to build a 49-qubit system by as soon as a year from now. And this target of around 50 qubits isn’t an arbitrary one: it’s the threshold of quantum supremacy. In other words, today’s top supercomputer systems can more or less still do all the same computations these 5- to 20-qubit quantum computers can do, but at around 50 qubits this becomes impossible. But quantum computing also has its own obstacles. It is for example very expensive. That’s because quantum computers can only operate in very controlled conditions, as qubits are extremely susceptible to noise, vibrations, temperature, or fluctuating electric fields. Entangled superpositions can only be reached in ‘pure’ states, that are often just above the absolute zero of -273,15°. Creating and sustaining these conditions therefore requires a lot of energy, money and time. Not to mention the costly process of engineering and hosting quantum computers, using and creating new and rare quantum materials, and working on the edge of scientific knowledge where no one has been before and no idea seems crazy or counter-intuitive enough. That does not withhold scientists and companies to invest and experiment with quantum computing. According to MIT, all the academic and corporate quantum researchers agree that somewhere between 30 and 100 qubits - particularly qubits stable enough to perform a wide range of computations for longer durations - is where quantum computers start to have commercial value, and as soon as two to five years from now, such systems are likely to be for sale. In the long run, they expect 100,000-qubit systems or even a million-physical-qubit system could be engineered and become functional. That will put quantum computing at an unsurmountable distance to traditional computing systems and perform computations that are for now unconceivable One place where pioneering work is done is in the Netherlands, Delft, where QuTech DEVELOPING QUANTUM COMPUTERS is experimenting to design a quantum computer and a new kind of qubit. A team of scientists, led by Leo Kouwenhoven, believes the qubits they are creating, called Majorana’s, will be the building blocks for their stable and functioning quantum computer and quantum internet, because of their unique physical properties. Further breakthroughs in quantum computing’s development process came recently, when an international team of scientists published a plan to build a huge quantum computer. The device, proposed in the journal Science Advances, will be as large as a football field and cost upwards of $125 million. The proposed design uses magnetic fields to trap ions, which would be used as qubits and controlled via microwaves. Intriguingly, the team claims that it could be built now, arguing that components required for the system have been demonstrated in labs. In theory, it would be far more powerful than all currently available systems. But researchers would have to face up to many engineering problems, like how to string the elements together and ensure it all stays cool. “Such high-level issues are rarely considered by people in the field of quantum computing, either because they think it’s goofy to think that big, or because in their own physical system, it is nearly impossible to fathom such a high-level view” said Christopher Monroe, a physicist from University of Maryland in College Park, to Nature. And recently, scientists from the Ion Quantum Technology Group at Sussex University claimed to produce the first ever blueprint for a large- scale quantum computer.
Load more

Recommended publications
  • Quantum Computing
    International Journal of Information Science and System, 2018, 6(1): 21-27 International Journal of Information Science and System ISSN: 2168-5754 Journal homepage: www.ModernScientificPress.com/Journals/IJINFOSCI.aspx Florida, USA Article Quantum Computing Adfar Majid*, Habron Rasheed Department of Electrical Engineering, SSM College of Engineering & Technology, Parihaspora, Pattan, J&K, India, 193121 * Author to whom correspondence should be addressed; E-Mail: adumajid@gmail.com . Article history: Received 26 September 2018, Revised 2 November 2018, Accepted 10 November 2018, Published 21 November 2018 Abstract: Quantum Computing employs quantum phenomenon such as superposition and entanglement for computing. A quantum computer is a device that physically realizes such computing technique. They are different from ordinary digital electronic computers based on transistors that are vastly used today in a sense that common digital computing requires the data to be encoded into binary digits (bits), each of which is always in one of two definite states (0 or 1), whereas quantum computation uses quantum bits, which can be in superposition of states. The field of quantum computing was initiated by the work of Paul Benioff and Yuri Manin in 1980, Richard Feynman in 1982, and David Deutsch in 1985. Quantum computers are incredibly powerful machines that take this new approach to processing information. As such they exploit complex and fascinating laws of nature that are always there, but usually remain hidden from view. By harnessing such natural behavior (of qubits), quantum computing can run new, complex algorithms to process information more holistically. They may one day lead to revolutionary breakthroughs in materials and drug discovery, the optimization of complex manmade systems, and artificial intelligence.
    [Show full text]
  • Adobe Acrobat PDF Document
    BIOGRAPHICAL SKETCH of HUGH EVERETT, III. Eugene Shikhovtsev ul. Dzerjinskogo 11-16, Kostroma, 156005, Russia eshi@kmtn.ru ©2003 Eugene B. Shikhovtsev and Kenneth W. Ford. All rights reserved. Sources used for this biographical sketch include papers of Hugh Everett, III stored in the Niels Bohr Library of the American Institute of Physics; Graduate Alumni Files in Seeley G. Mudd Manuscript Library, Princeton University; personal correspondence of the author; and information found on the Internet. The author is deeply indebted to Kenneth Ford for great assistance in polishing (often rewriting!) the English and for valuable editorial remarks and additions. If you want to get an interesting perspective do not think of Hugh as a traditional 20th century physicist but more of a Renaissance man with interests and skills in many different areas. He was smart and lots of things interested him and he brought the same general conceptual methodology to solve them. The subject matter was not so important as the solution ideas. Donald Reisler [1] Someone once noted that Hugh Everett should have been declared a “national resource,” and given all the time and resources he needed to develop new theories. Joseph George Caldwell [1a] This material may be freely used for personal or educational purposes provided acknowledgement is given to Eugene B. Shikhovtsev, author (eshi@kmtn.ru), and Kenneth W. Ford, editor (kwford@verizon.net). To request permission for other uses, contact the author or editor. CONTENTS 1 Family and Childhood Einstein letter (1943) Catholic University of America in Washington (1950-1953). Chemical engineering. Princeton University (1953-1956).
    [Show full text]
  • Quantum Information Science
    Quantum Information Science Seth Lloyd Professor of Quantum-Mechanical Engineering Director, WM Keck Center for Extreme Quantum Information Theory (xQIT) Massachusetts Institute of Technology Article Outline: Glossary I. Definition of the Subject and Its Importance II. Introduction III. Quantum Mechanics IV. Quantum Computation V. Noise and Errors VI. Quantum Communication VII. Implications and Conclusions 1 Glossary Algorithm: A systematic procedure for solving a problem, frequently implemented as a computer program. Bit: The fundamental unit of information, representing the distinction between two possi- ble states, conventionally called 0 and 1. The word ‘bit’ is also used to refer to a physical system that registers a bit of information. Boolean Algebra: The mathematics of manipulating bits using simple operations such as AND, OR, NOT, and COPY. Communication Channel: A physical system that allows information to be transmitted from one place to another. Computer: A device for processing information. A digital computer uses Boolean algebra (q.v.) to processes information in the form of bits. Cryptography: The science and technique of encoding information in a secret form. The process of encoding is called encryption, and a system for encoding and decoding is called a cipher. A key is a piece of information used for encoding or decoding. Public-key cryptography operates using a public key by which information is encrypted, and a separate private key by which the encrypted message is decoded. Decoherence: A peculiarly quantum form of noise that has no classical analog. Decoherence destroys quantum superpositions and is the most important and ubiquitous form of noise in quantum computers and quantum communication channels.
    [Show full text]
  • Spin-Photon Entanglement Realised by Quantum Dots Embedded in Waveguides
    Master Thesis Spin-photon Entanglement Realised by Quantum Dots Embedded in Waveguides Mikkel Bloch Lauritzen Spin-photon Entanglement Realised by Quantum Dots Embedded in Waveguides Author Mikkel Bloch Lauritzen Advisor Anders S. Sørensen1 Advisor Peter Lodahl1 1Hy-Q, The Niels Bohr Institute Hy-Q The Niels Bohr Institute Submitted to the University of Copenhagen March 4, 2019 3 Abstract Spin-photon Entanglement Realised by Quantum Dots Embedded in Waveguides by Mikkel Bloch Lauritzen Quantum information theory is a relatively new and rapidly growing field of physics which in the last decades has made predictions of exciting features with no classical counterpart. The fact that the properties of quantum systems differ significantly from classical systems create opportunities for new communication protocols and sharing of information. Within all these applications, entanglement is an essential quantum feature. Having reliable sources of highly entangled qubits is paramount when apply- ing quantum information theory. The performance of these sources is limited both by unwanted interaction with the environment and by the performance of experimental equipment. In this thesis, two protocols which creates highly entangled spin-photon quantum states are presented and imperfections in the protocols are studied. The two spin-photon entanglement protocols are both realised by quantum dots embedded in waveguides. The studied imperfections relate to both the visibility of the system, the ability to separate the ground states, and the branching ratio of spontaneous decay, photon loss and phonon induced pure dephasing. In the study, realistic parameter values are applied which are based on experimental results. It is found, that the two studied protocols are promising and likely to perform well if applied in the laboratory to create highly entangled states.
    [Show full text]
  • General Overview of the Field
    Introduction to quantum computing and simulability General overview of the field Daniel J. Brod Leandro Aolita Ernesto Galvão Outline: General overview of the field • What is quantum computing? • A bit of history; • The rules: the postulates of quantum mechanics; • Information-theoretic-flavoured consequences; • Entanglement; • No-cloning; • Teleportation; • Superdense coding; What is quantum computing? • Computing paradigm where information is processed with the rules of quantum mechanics. • Extremely interdisciplinary research area! • Physics, Computer science, Mathematics; • Engineering (the thing looks nice on paper, but building it is hard!); • Chemistry, biology and others (applications); • Promised speedup on certain computational problems; • New insights into foundations of quantum mechanics and computer science. Let’s begin with some history! Timeline of (classical) computing Charles Babbage Ada Lovelace (1791-1871) (1815-1852) Analytical Engine (1837) First computer program (1843) First proposed general purpose Written by Ada Lovelace for the mechanical computer. Not Analytical engine. Computes completed by lack of money ☹️ Bernoulli numbers. Timeline of (classical) computing Alonzo Church Alan Turing (1903-1995) (1912-1954) 1 0 1 0 0 1 1 0 1 Turing Machine (1936) World War II Abstract model for a universal Colossus, Bombe, Z3/Z4 and others; computing device. - Decryption of secret messages; - Ballistics; Timeline of (classical) computing Intel® 4004 (1971) 2.300 transistors. Intel® Core™ (2010) 560.000.000 transistors. Transistor
    [Show full text]
  • Towards a Coherent Theory of Physics and Mathematics
    Towards a Coherent Theory of Physics and Mathematics Paul Benioff∗ As an approach to a Theory of Everything a framework for developing a coherent theory of mathematics and physics together is described. The main characteristic of such a theory is discussed: the theory must be valid and and sufficiently strong, and it must maximally describe its own validity and sufficient strength. The math- ematical logical definition of validity is used, and sufficient strength is seen to be a necessary and useful concept. The requirement of maximal description of its own validity and sufficient strength may be useful to reject candidate coherent theories for which the description is less than maximal. Other aspects of a coherent theory discussed include universal applicability, the relation to the anthropic principle, and possible uniqueness. It is suggested that the basic properties of the physical and mathematical universes are entwined with and emerge with a coherent theory. Support for this includes the indirect reality status of properties of very small or very large far away systems compared to moderate sized nearby systems. Dis- cussion of the necessary physical nature of language includes physical models of language and a proof that the meaning content of expressions of any axiomatizable theory seems to be independent of the algorithmic complexity of the theory. G¨odel maps seem to be less useful for a coherent theory than for purely mathematical theories because all symbols and words of any language must have representations as states of physical systems already in the domain of a coherent theory. arXiv:quant-ph/0201093v2 2 May 2002 1 Introduction The goal of a final theory or a Theory of Everything (TOE) is a much sought after dream that has occupied the attention of many physicists and philosophers.
    [Show full text]
  • Neuroscience, Quantum Space-Time Geometry and Orch OR Theory
    Journal of Cosmology, 2011, Vol. 14. JournalofCosmology.com, 2011 Consciousness in the Universe: Neuroscience, Quantum Space-Time Geometry and Orch OR Theory Roger Penrose, PhD, OM, FRS1, and Stuart Hameroff, MD2 1Emeritus Rouse Ball Professor, Mathematical Institute, Emeritus Fellow, Wadham College, University of Oxford, Oxford, UK 2Professor, Anesthesiology and Psychology, Director, Center for Consciousness Studies, The University of Arizona, Tucson, Arizona, USA Abstract The nature of consciousness, its occurrence in the brain, and its ultimate place in the universe are unknown. We proposed in the mid 1990's that consciousness depends on biologically 'orchestrated' quantum computations in collections of microtubules within brain neurons, that these quantum computations correlate with and regulate neuronal activity, and that the continuous Schrödinger evolution of each quantum computation terminates in accordance with the specific Diósi–Penrose (DP) scheme of 'objective reduction' of the quantum state (OR). This orchestrated OR activity (Orch OR) is taken to result in a moment of conscious awareness and/or choice. This particular (DP) form of OR is taken to be a quantum-gravity process related to the fundamentals of spacetime geometry, so Orch OR suggests a connection between brain biomolecular processes and fine-scale structure of the universe. Here we review and update Orch OR in light of criticisms and developments in quantum biology, neuroscience, physics and cosmology. We conclude that consciousness plays an intrinsic role in the universe. KEY WORDS: Consciousness, microtubules, OR, Orch OR, quantum computation, quantum gravity 1. Introduction: Consciousness, Brain and Evolution Consciousness implies awareness: subjective experience of internal and external phenomenal worlds. Consciousness is central also to understanding, meaning and volitional choice with the experience of free will.
    [Show full text]
  • Local Mathematics and No Information at a Distance; Some Effects on Physics and Geometry †
    proceedings Proceedings Local Mathematics and No Information at a Distance; Some Effects on Physics and Geometry † Paul Benioff Argonne national laboratory, Argonne, IL 60439, USA; pbenioff@anl.gov † Conference Theoretical Information Studies, Berkeley, CA, USA, 2–6 June 2019. Published: 19 May 2020 Abstract: Local mathematics consists of a collection of mathematical systems located at each space and time point. The collection is limited to the systems that include numbers in their axiomatic description. A scalar map between systems at different locations is based on the distinction of two conflated concepts, number and number value. The effect that this setup has on theory descriptions of physical and geometric systems is described. This includes a scalar spin 0 field in gauge theories, expectation values in quantum mechanics and path lengths in geometry. The possible relation of the scalar map to consciousness is noted. Keywords: local mathematics; information; distance; physics; geometry 1. Introduction Local mathematics and no information at a distance affect [1] theoretical descriptions of systems in physics and geometry. The use of local mathematics as the basis for describing physics and geometry is an extension to many different types of mathematical systems of the use of separate vector spaces [2] at each point of space time for the description of gauge theories. The relation between states in the separate vector spaces is determined by properties of a map between vector spaces at different locations. The need for a map is based on the observation [3] that the meaning of a state in a vector space at one location does not determine the meaning of the same state in a vector space at another location.
    [Show full text]
  • Quantum-Mechanical Computers, If They Can Be Constructed, Will Do Things No Ordinary Computer Can Quantum-Mechanical Computers
    Quantum-mechanical computers, if they can be constructed, will do things no ordinary computer can Quantum-Mechanical Computers by Seth Lloyd very two years for the past 50, computers have become twice as fast while their components have become half as big. Circuits now contain wires and transistors that measure only one hundredth of a human hair in width. Because of this ex- Eplosive progress, today’s machines are millions of times more powerful than their crude ancestors. But explosions do eventually dissipate, and integrated-circuit technology is running up against its limits. 1 Advanced lithographic techniques can yield parts /100 the size of what is currently avail- able. But at this scale—where bulk matter reveals itself as a crowd of individual atoms— integrated circuits barely function. A tenth the size again, the individuals assert their iden- tity, and a single defect can wreak havoc. So if computers are to become much smaller in the future, new technology must replace or supplement what we now have. HYDROGEN ATOMS could be used to store bits of information in a quantum computer. An atom in its ground state, with its electron in its lowest possible en- ergy level (blue), can represent a 0; the same atom in an excited state, with its electron at a higher energy level (green), can repre- sent a 1. The atom’s bit, 0 or 1, can be flipped to the opposite value using a pulse of laser light (yellow). If the photons in the pulse have the same amount of energy as the difference between the electron’s ground state and its excited state, the electron will jump from one state to the other.
    [Show full text]
  • Contemporary Mathematics 305
    CONTEMPORARY MATHEMATICS 305 Quantum Computation and Information AMS Special Session Quantum Computation and Information January 19-21, 2000 Washington, D.C. Samuel J. Lomonaco, Jr. Howard E. Brandt Editors http://dx.doi.org/10.1090/conm/305 CoNTEMPORARY MATHEMATICS 305 Quantum Computation and Information AMS Special Session Quantum Computation and Information January 19-21, 2000 Washington, D.C. Samuel J. Lomonaco, Jr. Howard E. Brandt Editors American Mathematical Society Providence, Rhode Island Editorial Board Dennis DeTurck, managing editor Andreas Blass Andy R. Magid Michael Vogelius This volume contains the proceedings of an AMS Special Session on Quantum Com- putation and Information held in Washington, D.C., on January 19-21, 2000. 2000 Mathematics Subject Classification. Primary 81P68, 94-02; Secondary 68Q05, 81-01, 81R99, 94A60, 94A99. Library of Congress Cataloging-in-Publication Data AMS Special Session Quantum Computation and Information (2000: Washington, D.C.) Quantum computation and information : AMS Special Session Quantum Computation and Information, Washington, D.C., January 19-21, 2000 / Samuel J. Lomonaco, Jr., Howard E. Brandt, editors. p. em. -(Contemporary mathematics; v. 305) Includes bibliographic references. ISBN 0-8218-2140-7 (alk. paper) 1. Quantum computers-Congresses. I. Lomonaco, Samuel J. II. Brandt, Howard E. Ill. Title. IV. Contemporary mathematics (American Mathematical Society) ; v. 305. QA 76.889 .A47 2000 004.1'4-dc21 2002026239 Copying and reprinting. Material in this book may be reproduced by any means for edu- cational and scientific purposes without fee or permission with the exception of reproduction by services that collect fees for delivery of documents and provided that the customary acknowledg- ment of the source is given.
    [Show full text]
  • Current Trends and Challenges in Post-Quantum Cryptography
    Current trends and challenges in post-quantum cryptography Steven Galbraith University of Auckland, New Zealand Steven Galbraith Post-quantum cryptography Thanks I Eric Bach, Joshua Holden, Jen Paulhus, Andrew Shallue, Renate Scheidler, Jonathan Sorenson. I Hilary Heffley. I David Kohel, Bryan Birch, Victor Miller, Florian Hess, Nigel Smart, Alfred Menezes, Scott Vanstone, David Jao, Drew Sutherland, Gaetan Bisson, Christophe Petit, Luca de Feo. I Anton Stolbunov, Ilya Chevyrev, Chang-An Zhao, Fangqian (Alice) Qiu, Christina Delfs, Barak Shani, Yan Bo Ti, Javier Silva, Joel Laity. I Thanks to you for waking up after the banquet. Steven Galbraith Post-quantum cryptography Plan I Post-quantum cryptography and the NIST \process" I Computational problems from isogenies I Crypto based on group actions/homogeneous spaces I Crypto based on homomorphisms with co-prime kernels I Open problems Intended audience: experts in elliptic curves who don't know much crypto. Goal: Convince you to work on PQ Crypto and isogenies. *** Footnotes are corrections added after the talk. *** Steven Galbraith Post-quantum cryptography Quantum Computing I Quantum computing was proposed by: Paul Benioff (1980), Yuri Manin (1980), Richard Feynman (1982) and David Deutsch (1985). [wikipedia] I Peter Shor (1994): polynomial-time quantum algorithm for integer factorisation and discrete logs. I Late 1990s: Breakthrough in quantum computing around \10 years away". I Dave Wecker (Microsoft) invited talk at PQ Crypto 2018: Microsoft will have a quantum computer suitable for chemistry applications within 5 years and \something of interest to this crowd" in 10 years. Steven Galbraith Post-quantum cryptography Quantum computer or microbrewery? Steven Galbraith Post-quantum cryptography Quantum computer or microbrewery? Steven Galbraith Post-quantum cryptography Interesting quantum computer algorithms for number theory I Integer factoring record by Shor's algorithm on a quantum computer is 21.
    [Show full text]
  • Historical Bibliography of Quantum Computing
    City University of New York (CUNY) CUNY Academic Works Publications and Research CUNY Graduate Center 2008 Historical Bibliography of Quantum Computing Jill Cirasella The Graduate Center, CUNY How does access to this work benefit ou?y Let us know! More information about this work at: https://academicworks.cuny.edu/gc_pubs/6 Discover additional works at: https://academicworks.cuny.edu This work is made publicly available by the City University of New York (CUNY). Contact: AcademicWorks@cuny.edu Historical Bibliography of Quantum Computing∗ Jill Cirasella Brooklyn College Library cirasella@brooklyn.cuny.edu This bibliographic essay reviews seminal papers in quantum computing. Although quan- tum computing is a young science, its researchers have already published thousands of note- worthy articles, far too many to list here. Therefore, this appendix is not a comprehensive chronicle of the emergence and evolution of the field but rather a guided tour of some of the papers that spurred, formalized, and furthered its study. Quantum computing draws on advanced ideas from computer science, physics, and mathematics, and most major papers were written by researchers conversant in all three fields. Nevertheless, all the articles described in this appendix can be appreciated by com- puter scientists. Reading Scientific Articles Do not be deterred if an article seems impenetrable. Keep in mind that professors and professionals also struggle to understand these articles, and take comfort in this epigram usually attributed to the great physicist Richard Feynman: \If you think you understand quantum mechanics, you don't understand quantum mechanics." Some articles are difficult to understand not only because quantum theory is devilishly elusive but also because scientific writing can be opaque.
    [Show full text]