The Universe's Quantum Monkeys

Total Page:16

File Type:pdf, Size:1020Kb

The Universe's Quantum Monkeys BOOKS & ARTS NATURE|Vol 445|25 January 2007 secretary for fish and wildlife and parks, once not the job of public-affairs officers to alter, usually told by cosmologists and astronomers, stated: “If we are saying that the loss of spe- filter or adjust engineering or scientific mat- energy plays the central role. First there was cies in and of itself is inherently bad — I don’t erial produced by NASA’s technical staff.” a singularity and there was no past for it to think we know enough about how the world But the damage caused by the Bush admin- emerge from. Then expansion. As the Universe works to say that.” In 2004, on the day after istration’s contempt for scientific facts is no expanded, it cooled down and various forms of Bush’s re-election, the Fish and Wildlife Serv- laughing matter. In the two years since Bush matter condensed out because the disruptive ice, which Manson oversees, fired the biologist was re-elected, “reality” — especially the reality thermal energy gradually dropped below the Andy Eller, who had charged that the service of Iraq, which, Shulman points out, the United binding energies that hold constituent parts was not fulfilling its mandate of protecting the States invaded on the basis of erroneous techni- of protons, nuclei and atoms together. Tiny Florida panther, an endangered species. The cal claims — has humbled his administration. quantum fluctuations made some regions of agency was forced to re-hire Eller after a court In November, as the death toll in Iraq surged, the Universe slightly denser, and gravity ampli- ruled in his favour. voters handed the reins of power in Congress fied this effect, which resulted in gas clouds, Some of the Bush administration’s actions to the Democrats. In December, the Iraq Study stars and galaxies. Stars exploding to super- have been almost comically incompetent. Last Group, headed by the Bush family friend James novae produced heavier elements, then our January, for example, George Deutsch, a public- Baker, issued a scathing critique of the US Sun and Solar System formed, and about 4 bil- affairs officer at NASA, tried to prevent the occupation of Iraq. Bush’s approval rating has lion years ago, life emerged on Earth. But this space agency’s James Hansen from speaking sunk to one of the lowest levels ever recorded. story leaves many questions unanswered. How to the press about the dangers of global warm- The declaration of that Bush official — “We did life arise? Why is the Universe so complex? ing. Andrew Revkin of The New York Times create our own reality” — has now taken on a Could such complexities have arisen from total quickly exposed the attempt to censor Hansen, tragic irony. ■ randomness? and it was soon revealed that Deutsch, contrary John Horgan is director of the Center for Science Now, enter computer science. Algorithmic to what it said on his CV, had never graduated Writings at the Stevens Institute of Technology, information theory shows that there are short, from university. Deutsch resigned and NASA Hoboken, New Jersey. His most recent book is random-looking programs that can cause a administrator Michael Griffin declared: “It is Rational Mysticism. computer to produce complex-looking out- puts. Lloyd illustrates this with a popular story attributed to the French mathematician Émile Borel. Imagine a bunch of monkeys typing ran- domly into typewriters. Given enough time, it The Universe’s quantum monkeys is certainly possible that one of these monkeys will type the first million digits of π or the first physics, complexity, sex, life, the Universe and act of Hamlet. Possible, but very unlikely. Now, Programming the Universe: A Quantum all that, and he does it well. Despite this pro- take the typewriters away and give the mon- Computer Scientist Takes On the Cosmos by Seth Lloyd liferation of topics, the main message stands keys computers that recognize any random Alfred A. Knopf/Jonathan Cape: 2006. out and is reiterated several times — the Uni- inputs not as text but as a computer program. 240 pp. $25.95/£18.99 verse is a quantum computer programmed by When the computers try to execute random quantum fluctuations, and the computational programs, most of the time they will crash or Artur Ekert capability of the Universe explains how com- generate garbage, but every now and then just A little less than 14 billion years ago, a huge plex systems can arise from fundamentally a few lines of random code typed by monkeys explosion gave birth to the Universe, and once simple physical laws. will give interesting outputs — for example, the it sprang into existence, the Universe began Lloyd tells the story of the evolving Universe successive digits of π, or intricate fractals. Or computing. The positions, velocities and in terms of interplay between energy and infor- perhaps much more interesting patterns if the internal states of every elementary particle, mation. In the conventional history of the ori- computer is the Universe itself. every atom and molecule, indeed every single gin and the evolution of the Universe, the story This vision of a computational Universe is physical entity register bits of information. Those bits are continually altered by physical interactions that act like sequences of logic gates — given a sufficient supply of bits and M. KULYK/SPL enough time, they can compute just about any- thing that is computable. Thus, the Universe is a computer. It is not a metaphor, it really is. More than that, the fundamental laws of phys- ics that govern any interaction are quantum; hence, the Universe is a huge quantum compu- ter that computes its own behaviour. It started in a very simple state initially, but in time, as the number of computational steps increased, the computing quantum Universe spun out more complex patterns, including galaxies, stars and planets, and then life, humans, you and me, and Seth Lloyd and his book Programming the Universe. Like many other good stories of this type, Lloyd’s book will puzzle and even irritate as much as it persuades. Lloyd writes in a lively style, weaving jokes and personal anecdotes into more technical narrative. He shares his views on cosmology, computation, quantum Get with the program: the Universe, it turns out, is actually a giant quantum computer. 366 NATURE|Vol 445|25 January 2007 BOOKS & ARTS not new: it was proposed in the 1960s by Kon- Richard Feynman and David Deutsch pointed parts are patchy and many details are brushed rad Zuse and Ed Fredkin, and revived more out this opportunity in the 1980s, the hunt has under the carpet. For example, anyone try- recently by Stephen Wolfram. However, unlike been on for interesting things for quantum ing to work out numerical estimates of the his predecessors, Lloyd stresses the quantum computers to do, and at the same time, for the physical limits to computation or the computa- nature of computation. This distinction is scientific and technological advances that could tional capacity of the Universe is much better important because, to the best of our knowl- allow us to build quantum computers. The field off consulting Lloyd’s original paper on the edge, it seems impossible to simulate the evo- is flourishing, and Lloyd provides a good pop- subject (see Nature 406, 1047–1054; 2000). It lution of a quantum system in an efficient way ular introduction to the subject. However, he is clear that Lloyd has forsaken accuracy for on a classical computer. does not stop at the level of building quantum snappiness in several places, but then this is a A classical computer simulation of quantum computers, he takes on the biggest quantum popular exposition. evolution typically involves an exponential computer there is — the Universe. Seth Lloyd is a good storyteller, but is the slowdown in time. This is because the amount The Universe is a quantum computer, and story convincing? Well, I was convinced, but of classical information needed to describe the quantum mechanics supplies the Universe with when I tried a nice line from the book — evolving quantum state is exponentially larger ‘monkeys’ in the form of ubiquitous random “programmed by quanta, physics gave rise to than that needed to describe the correspond- quantum fluctuations — the same fluctuations chemistry and then to life, programmed by ing classical system with similar accuracy. that provided the seeds of galaxy formation mutation and recombination, life gave rise to However, instead of viewing this intractability and of all that followed. The Universe has Shakespeare, programmed by experience and as an obstacle, today we regard it as an oppor- pockets of complex behaviour because, Lloyd imagination, Shakespeare gave rise to Hamlet” tunity — if that much computation is needed claims, the monkeys have been working very — on a colleague of mine, an English literature to work out what will happen in a quantum hard. He estimates that the visible Universe, fellow, he only shook his head in disbelief and multi-particle interference experiment, then programmed by quantum fluctuations, has walked away. ■ the very act of setting up such an experiment performed about 10122 operations on 1092 quan- Artur Ekert is at the Mathematical Institute, and measuring the outcome is equivalent to tum bits. No wonder we are here! University of Oxford, UK, and the National performing a complex computation. Since I think this is a delightful book, but some University of Singapore. botox, body piercing and ‘nipping and tucking’, there is someone making money out of it. And Cover story it does not necessarily have to stop just because someone is dead, as some enterprising Ancient Skin: A Natural History Egyptian undertaker realized.
Recommended publications
  • (CST Part II) Lecture 14: Fault Tolerant Quantum Computing
    Quantum Computing (CST Part II) Lecture 14: Fault Tolerant Quantum Computing The history of the universe is, in effect, a huge and ongoing quantum computation. The universe is a quantum computer. Seth Lloyd 1 / 21 Resources for this lecture Nielsen and Chuang p474-495 covers the material of this lecture. 2 / 21 Why we need fault tolerance Classical computers perform complicated operations where bits are repeatedly \combined" in computations, therefore if an error occurs, it could in principle propagate to a huge number of other bits. Fortunately, in modern digital computers errors are so phenomenally unlikely that we can forget about this possibility for all practical purposes. Errors do, however, occur in telecommunications systems, but as the purpose of these is the simple transmittal of some information, it suffices to perform error correction on the final received data. In a sense, quantum computing is the worst of both of these worlds: errors do occur with significant frequency, and if uncorrected they will propagate, rendering the computation useless. Thus the solution is that we must correct errors as we go along. 3 / 21 Fault tolerant quantum computing set-up For fault tolerant quantum computing: We use encoded qubits, rather than physical qubits. For example we may use the 7-qubit Steane code to represent each logical qubit in the computation. We use fault tolerant quantum gates, which are defined such thata single error in the fault tolerant gate propagates to at most one error in each encoded block of qubits. By a \block of qubits", we mean (for example) each block of 7 physical qubits that represents a logical qubit using the Steane code.
    [Show full text]
  • An Ecological Perspective on the Future of Computer Trading
    An ecological perspective on the future of computer trading The Future of Computer Trading in Financial Markets - Foresight Driver Review – DR 6 An ecological perspective on the future of computer trading Contents 2. The role of computers in modern markets .................................................................................. 7 2.1 Computerization and trading ............................................................................................... 7 Execution................................................................................................................................7 Investment research ................................................................................................................ 7 Clearing and settlement ........................................................................................................... 7 2.2 A coarse preliminary taxonomy of computer trading .............................................................. 7 Execution algos....................................................................................................................... 8 Algorithmic trading................................................................................................................... 9 High Frequency Trading / Latency arbitrage............................................................................... 9 Algorithmic market making ....................................................................................................... 9 3. Ecology and evolution as key
    [Show full text]
  • Arxiv:Quant-Ph/0110141V1 24 Oct 2001 Itr.Teuies a Aepromdn Oethan More Perf No Have Performed Can Have It Can Universe That the Operations History
    Computational capacity of the universe Seth Lloyd d’ArbeloffLaboratory for Information Systems and Technology MIT Department of Mechanical Engineering MIT 3-160, Cambridge, Mass. 02139 [email protected] Merely by existing, all physical systems register information. And by evolving dynamically in time, they transform and process that information. The laws of physics determine the amount of information that aphysicalsystem can register (number of bits) and the number of elementary logic operations that a system can perform (number of ops). The universe is a physical system. This paper quantifies the amount of information that the universe can register and the number of elementary operations that it can have performed over its history. The universe can have performed no more than 10120 ops on 1090 bits. ‘Information is physical’1.ThisstatementofLandauerhastwocomplementaryinter- pretations. First, information is registered and processedbyphysicalsystems.Second,all physical systems register and process information. The description of physical systems in arXiv:quant-ph/0110141v1 24 Oct 2001 terms of information and information processing is complementary to the conventional de- scription of physical system in terms of the laws of physics. Arecentpaperbytheauthor2 put bounds on the amount of information processing that can beperformedbyphysical systems. The first limit is on speed. The Margolus/Levitin theorem3 implies that the total number of elementary operations that a system can perform persecondislimitedbyits energy: #ops/sec 2E/π¯h,whereE is the system’s average energy above the ground ≤ state andh ¯ =1.0545 10−34 joule-sec is Planck’s reduced constant. As the presence × of Planck’s constant suggests, this speed limit is fundamentally quantum mechanical,2−4 and as shown in (2), is actually attained by quantum computers,5−27 including existing 1 devices.15,16,21,23−27 The second limit is on memory space.
    [Show full text]
  • Durham E-Theses
    Durham E-Theses Quantum search at low temperature in the single avoided crossing model PATEL, PARTH,ASHVINKUMAR How to cite: PATEL, PARTH,ASHVINKUMAR (2019) Quantum search at low temperature in the single avoided crossing model, Durham theses, Durham University. Available at Durham E-Theses Online: http://etheses.dur.ac.uk/13285/ Use policy The full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-prot purposes provided that: • a full bibliographic reference is made to the original source • a link is made to the metadata record in Durham E-Theses • the full-text is not changed in any way The full-text must not be sold in any format or medium without the formal permission of the copyright holders. Please consult the full Durham E-Theses policy for further details. Academic Support Oce, Durham University, University Oce, Old Elvet, Durham DH1 3HP e-mail: [email protected] Tel: +44 0191 334 6107 http://etheses.dur.ac.uk 2 Quantum search at low temperature in the single avoided crossing model Parth Ashvinkumar Patel A Thesis presented for the degree of Master of Science by Research Dr. Vivien Kendon Department of Physics University of Durham England August 2019 Dedicated to My parents for supporting me throughout my studies. Quantum search at low temperature in the single avoided crossing model Parth Ashvinkumar Patel Submitted for the degree of Master of Science by Research August 2019 Abstract We begin with an n-qubit quantum search algorithm and formulate it in terms of quantum walk and adiabatic quantum computation.
    [Show full text]
  • Dawn of a New Paradigm Based on the Information-Theoretic View of Black Holes, Universe and Various Conceptual Interconnections of Fundamental Physics Dr
    Turkish Journal of Computer and Mathematics Education Vol.12 No.2 (2021), 1208- 1221 Research Article Do They Compute? Dawn of a New Paradigm based on the Information-theoretic View of Black holes, Universe and Various Conceptual Interconnections of Fundamental Physics Dr. Indrajit Patra, an Independent Researcher Corresponding author’s email id: [email protected] Article History: Received: 11 January 2021; Accepted: 27 February 2021; Published online: 5 April 2021 _________________________________________________________________________________________________ Abstract: The article endeavors to show how thinking about black holes as some form of hyper-efficient, serial computers could help us in thinking about the more fundamental aspects of space-time itself. Black holes as the most exotic and yet simplest forms of gravitational systems also embody quantum fluctuations that could be manipulated to archive hypercomputation, and even if this approach might not be realistic, yet it is important since it has deep connections with various aspects of quantum gravity, the highly desired unification of quantum mechanics and general relativity. The article describes how thinking about black holes as the most efficient kind of computers in the physical universe also paves the way for developing new ideas about such issues as black hole information paradox, the possibility of emulating the properties of curved space-time with the collective quantum behaviors of certain kind of condensate fluids, ideas of holographic spacetime, gravitational
    [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]
  • J. Doyne Farmer SANTA FE INSTITUTE Phone: (505) 946-2795
    J. Doyne Farmer SANTA FE INSTITUTE Phone: (505) 946-2795 1399 Hyde Park Road Fax: (505) 982-0565 Santa Fe, NM 87501 [email protected] http://www.santafe.edu/~jdf/ EDUCATION Ph.D., Physics, University of California, Santa Cruz, 1981 B.S., Physics, Stanford University, 1973 University of Idaho, 1969-1970 PROFESSIONAL Santa Fe Institute, Professor, 1999–Present EXPERIENCE Potsdam Institute of Climate Change, Distinguished Fellow, 2010 – Present LUISS Guido Carli (Rome), Extraordinary Professor, 2007 – 2009. Prediction Company, 1991–1999 Co-President, 1995–1999 Chief Scientist (head of research group), 1991–1999 Los Alamos National Laboratory, 1981–1991 Leader of Complex Systems Group, Theoretical Division, 1988–1991 Staff Member, Theoretical Division, 1986–1988 Oppenheimer Fellow, Center for Nonlinear Studies, 1983–1986 Post-doctoral appointment, Center for Nonlinear Studies, 1981–1983 PROFESSIONAL Editorial Board, Quantitative Finance (2003–Present) ASSOCIATIONS Editorial Board, Artificial Life (2002–Present) Editor-in-Chief, Quantitative Finance (1999–2003) Editorial Board, Nonlinearity (1988–1991) PROFESSIONAL Complex systems, particularly social evolution of financial markets INTERESTS and technological innovation FELLOWSHIPS J. Robert Oppenheimer Fellowship March 1983–February 1986 Hertz Fellowship September 1978–June 1981 UC Regents Fellowship September 1973–June 1974 RESEARCH National Science Foundation (Principal Investigator) GRANTS Modeling the Dynamics of Technological Evolution $391,020 01/0108 – 12/31/11 rev. 9/22/11 1 National
    [Show full text]
  • Analysis of Quantum Error-Correcting Codes: Symplectic Lattice Codes and Toric Codes
    Analysis of quantum error-correcting codes: symplectic lattice codes and toric codes Thesis by James William Harrington Advisor John Preskill In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 2004 (Defended May 17, 2004) ii c 2004 James William Harrington All rights Reserved iii Acknowledgements I can do all things through Christ, who strengthens me. Phillipians 4:13 (NKJV) I wish to acknowledge first of all my parents, brothers, and grandmother for all of their love, prayers, and support. Thanks to my advisor, John Preskill, for his generous support of my graduate studies, for introducing me to the studies of quantum error correction, and for encouraging me to pursue challenging questions in this fascinating field. Over the years I have benefited greatly from stimulating discussions on the subject of quantum information with Anura Abeyesinge, Charlene Ahn, Dave Ba- con, Dave Beckman, Charlie Bennett, Sergey Bravyi, Carl Caves, Isaac Chenchiah, Keng-Hwee Chiam, Richard Cleve, John Cortese, Sumit Daftuar, Ivan Deutsch, Andrew Doherty, Jon Dowling, Bryan Eastin, Steven van Enk, Chris Fuchs, Sho- hini Ghose, Daniel Gottesman, Ted Harder, Patrick Hayden, Richard Hughes, Deborah Jackson, Alexei Kitaev, Greg Kuperberg, Andrew Landahl, Chris Lee, Debbie Leung, Carlos Mochon, Michael Nielsen, Smith Nielsen, Harold Ollivier, Tobias Osborne, Michael Postol, Philippe Pouliot, Marco Pravia, John Preskill, Eric Rains, Robert Raussendorf, Joe Renes, Deborah Santamore, Yaoyun Shi, Pe- ter Shor, Marcus Silva, Graeme Smith, Jennifer Sokol, Federico Spedalieri, Rene Stock, Francis Su, Jacob Taylor, Ben Toner, Guifre Vidal, and Mas Yamada. Thanks to Chip Kent for running some of my longer numerical simulations on a computer system in the High Performance Computing Environments Group (CCN-8) at Los Alamos National Laboratory.
    [Show full text]
  • Arxiv:2010.13186V2 [Quant-Ph] 16 Feb 2021 at the Same Time, Machine Learning (ML) Has Become a the State Is Measured
    A Unified Framework for Quantum Supervised Learning Nhat A. Nghiem,1 Samuel Yen-Chi Chen,2 and Tzu-Chieh Wei3, 1 1Department of Physics and Astronomy, State University of New York at Stony Brook, Stony Brook, NY 11794-3800, USA 2Computational Science Initiative, Brookhaven National Laboratory, Upton, NY 11973, USA 3C. N. Yang Institute for Theoretical Physics, State University of New York at Stony Brook, Stony Brook, NY 11794-3840, USA Quantum machine learning is an emerging field that combines machine learning with advances in quantum technologies. Many works have suggested great possibilities of using near-term quantum hardware in supervised learning. Motivated by these developments, we present an embedding-based framework for supervised learning with trainable quantum circuits. We introduce both explicit and implicit approaches. The aim of these approaches is to map data from different classes to separated locations in the Hilbert space via the quantum feature map. We will show that the implicit approach is a generalization of a recently introduced strategy, so-called quantum metric learning. In particular, with the implicit approach, the number of separated classes (or their labels) in supervised learning problems can be arbitrarily high with respect to the number of given qubits, which surpasses the capacity of some current quantum machine learning models. Compared to the explicit method, this implicit approach exhibits certain advantages over small training sizes. Furthermore, we establish an intrinsic connection between the explicit approach and other quantum supervised learning models. Combined with the implicit approach, this connection provides a unified framework for quantum supervised learning. The utility of our framework is demonstrated by performing both noise-free and noisy numerical simulations.
    [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]
  • “Waiting for Carnot”- Information and Complexity
    City Research Online City, University of London Institutional Repository Citation: Bawden, D. and Robinson, L. (2015). 'Waiting for Carnot': Information and complexity. Journal of the Association for Information Science and Technology, 66(11), pp. 2177-2186. doi: 10.1002/asi.23535 This is the accepted version of the paper. This version of the publication may differ from the final published version. Permanent repository link: https://openaccess.city.ac.uk/id/eprint/6432/ Link to published version: http://dx.doi.org/10.1002/asi.23535 Copyright: City Research Online aims to make research outputs of City, University of London available to a wider audience. Copyright and Moral Rights remain with the author(s) and/or copyright holders. URLs from City Research Online may be freely distributed and linked to. Reuse: Copies of full items can be used for personal research or study, educational, or not-for-profit purposes without prior permission or charge. Provided that the authors, title and full bibliographic details are credited, a hyperlink and/or URL is given for the original metadata page and the content is not changed in any way. City Research Online: http://openaccess.city.ac.uk/ [email protected] “Waiting for Carnot”: Information and complexity David Bawden and Lyn Robinson Centre for Information Science City University London Consequently: he who wants to have right without wrong, Order without disorder, Does not understand the principles Of heaven and earth. He does not know how Things hang together Chuang Tzu, Great and small. Thomas Merton (ed). The way of Chuang Tzu. New York NY: New Directions, 1965, p.
    [Show full text]
  • Quantum Machine Learning Algorithms: Read the Fine Print
    Quantum Machine Learning Algorithms: Read the Fine Print Scott Aaronson For twenty years, quantum computing has been catnip to science journalists. Not only would a quantum computer harness the notorious weirdness of quantum mechanics, but it would do so for a practical purpose: namely, to solve certain problems exponentially faster than we know how to solve them with any existing computer. But there’s always been a catch, and I’m not even talking about the difficulty of building practical quantum computers. Supposing we had a quantum computer, what would we use it for? The “killer apps”—the problems for which a quantum computer would promise huge speed advantages over classical computers—have struck some people as inconveniently narrow. By using a quantum computer, one could dramatically accelerate the simulation of quantum physics and chemistry (the original application advocated by Richard Feynman in the 1980s); break almost all of the public-key cryptography currently used on the Internet (for example, by quickly factoring large numbers, with the famous Shor’s algorithm [14]); and maybe achieve a modest speedup for solving optimization problems in the infamous “NP-hard” class (but no one is sure about the last one). Alas, as interesting as that list might be, it’s hard to argue that it would transform civilization in anything like the way classical computing did in the previous century. Recently, however, a new family of quantum algorithms has come along to challenge this relatively- narrow view of what a quantum computer would be useful for. Not only do these new algorithms promise exponential speedups over classical algorithms, but they do so for eminently-practical problems, involving machine learning, clustering, classification, and finding patterns in huge amounts of data.
    [Show full text]