A Functional Architecture for Scalable Quantum Computing

Total Page:16

File Type:pdf, Size:1020Kb

A Functional Architecture for Scalable Quantum Computing A Functional Architecture for Scalable Quantum Computing Eyob A. Sete, William J. Zeng, Chad T. Rigetti Rigetti Computing Berkeley, California Email: feyob,will,[email protected] Abstract—Quantum computing devices based on supercon- ducting quantum circuits have rapidly developed in the last few years. The building blocks—superconducting qubits, quantum- limited amplifiers, and two-qubit gates—have been demonstrated by several groups. Small prototype quantum processor systems have been implemented with performance adequate to demon- strate quantum chemistry simulations, optimization algorithms, and enable experimental tests of quantum error correction schemes. A major bottleneck in the effort to devleop larger systems is the need for a scalable functional architecture that combines all thee core building blocks in a single, scalable technology. We describe such a functional architecture, based on Fig. 1. A schematic of a functional layout of a quantum computing system. a planar lattice of transmon and fluxonium qubits, parametric amplifiers, and a novel fast DC controlled two-qubit gate. kBT should be much less than the energy of the photon at the Keywords—quantum computing, superconducting integrated qubit transition energy ~!01. In a large system where supercon- circuits, computer architecture. ducting circuits are packed together, unwanted crosstalk among devices is inevitable. To reduce or minimize crosstalk, efficient I. INTRODUCTION packaging and isolation of individual devices is imperative and substantially improves the performance of the system. The underlying hardware for quantum computing has ad- vanced to make the design of the first scalable quantum Superconducting qubits are made using Josephson tunnel computers possible. Superconducting chips with 4–9 qubits junctions which are formed by two superconducting thin have been demonstrated with the performance required to electrodes separated by a dielectric material. The dielectric run quantum simulation algorithms [1]–[3], quantum machine material is thin enough (a few nm) to allow tunneling of learning [4], and quantum error correction benchmarks [5]–[7]. discrete charges (Cooper pairs) through the insulating barrier. These new hardware demonstrations have been matched One of the requirements of gate-based quantum computer with advances in applications for relatively small and is a universal set of quantum gates. Although it is possible noisy quantum computing systems. Quantum-classical hybrid to generate these gates using microwave signals applied to algorithms—including variational quantum eigensolvers [8]– the circuits, controllability and scalability remains a challenge. [10], correlated material simulations [11], and approximate op- One can instead generate the single qubit gates via microwaves timization [12]—have much promise in reducing the overhead and two qubit gates using DC controlled frequency tunable required for valuable applications. In machine learning and qubits. In the architecture proposed here, fixed frequency quantum simulation, particularly for catalysts [13] and high transmon qubits and frequency tunable fluxonium qubits are temperature superconductivity [9], scalable quantum comput- used. On one hand, transmons are easy to design and are robust ers promise performance unrivaled by classical supercomput- to charge noise, thus yielding improved coherence time [14]. ers. On the other hand, fluxonium qubits are also designed to be insensitive to charge noise and have wide frequency tunablity A. Superconducting Qubits with strong nonlinearity [15]. In particular, strong nonlinearity of the fluxonium along with DC tunability allows us to Unlike conventional integrated circuits, a quantum inte- generate fast high fidelity two qubit gates. grated circuit requires ultra-low dissipation and ultra-low noise operation. Superconducting qubits with cryogenic operation B. Quantum limited amplifiers and superconducting materials, meet these requirements. The non-dissipative nature of these circuits allows electric signals Quantum limited amplifier is an essential component of a to be carried without energy loss, preserving quantum coher- scalable quantum computing system. It allows fast high-fidelity ence. Information is stored in non-linear resonators, where single-shot readout of qubits. Each qubit is measured using the presence or absence of a photon at the resonant qubit the method of dispersive readout, where the qubit is weakly frequency !01 encodes the j1i or j0i state of the qubit. The coupled to a superconducting linear resonator. This weak cou- technology requires that the energy of the thermal fluctuations pling imparts a qubit-state dependent resonator frequency shift, . which appears as a phase shift in a reflected or transmitted . microwave signal. By measuring this signal via the homodyne . method, we can infer the state of the qubit. Quantum limited amplifiers [16]–[18] such as Joseph- . son parametric amplifier, Josephson bifurcation amplifier, and Josephson parametric converter are nonlinear superconducting resonators made of Josephson junctions and thus operates at . cryogenic temperature. Quantum limited amplifiers are de- signed by exploiting nondissipative and nonlinear properties of Josephson junction at very low temperature. These devices . are characterized by amplifier bandwidth, gain and dynamic . range. In a scalable quantum computing system, integration of Fig. 2. Solid blue circles are lower transmon qubits and solid red circles are quantum limited amplifiers on a chip is needed. Depending on upper transmon qubits. Empty circles are fluxonium qubits. Qubit couplings the bandwidth of these amplifiers each qubit readout can have are indicated by the edges and allow two different sets of natural two-qubit a dedicated amplifier or multiple qubits can be read out by gates, as described in the text. Blue edges indicate a coupling between a fluxonium and a lower transmon, allowing two-qubit gates from of the SWAP a single broadband amplifier. Figure 1 illustrates an example class. Red edges indicate a coupling between a fluxonium and an upper setup of a quantum computing system. transmon, allowing CPhase class gates II. FUNCTIONAL ARCHITECTURE III. THEORY OF TWO-QUBIT GATES We propose a functional architecture of coupled fluxonium A. The transmon-fluxonium SWAP class gate and transmon qubits. Fixed-frequency transmon qubits are Transmon and fluxonium qubits are coupled capacitively. placed at the vertices of a square lattice, while fluxonium Treating both fluxonium and transmon qubits as having arbi- qubits are placed at on the edges. The parking frequency of trary energy-level systems, the Hamiltonian can be described each fluxonium is chosen to be between the frequencies of its as (~ = 1) two neighboring transmons, so that we label one as the lower X T X F X transmon and the other as the upper transmon respectively. H = !j j jihjj + !m(t)jmihmj + gij;kmjiihjj ⊗ jkihmj; An example 40-qubit segment of this architecture, comprising j m ijkm (1) 16 transmons and 24 fluxoniums is illustrated in Figure 2. T Equivalently, the architecture is a bi-partite graph of transmon where !j is the frequency jth energy level of the transmon and F and fluxonium qubits, where edges are one of two colors. !m(t) is the frequency of the mth level of fluxonium which is tunable in time; gij;km is the coupling between the jii ! On each transmon or fluxonium qubit the single-qubit ro- j ji transition of transmon and the jki ! jmi transition of θ θ tation gates RX (θ) = exp[−i 2 X] and RY (θ) = exp[−i 2 Y] form fluxonium. Fluxnoium qubit energy levels have a strong non- a parametrized class of primitive gates, where X and Y are the linearity, and so this qubit can be accurately modeled by a two- usual Pauli matrices. The rotation angle θ may be implemented level system. As the transmon is relatively linear, we include to high enough accuracy that gates are decoherence limited, at least the j2i in our model. In view of this, the Hamiltonian i.e., it suffices to consider θ as exactly accurate, but with a of the coupled system reduces to limited gate fidelity due to finite qubit lifetimes. In practice a limited set of gates from this class are chosen for tune-up, 0 0 0 !T (2) e.g., θ 2 f±π; ±π=2; ±π=4; ±π=8; ±π=16; ±π=32g. H = 0 01 0 ⊗ I (2) 0 0 !T + !T * 01 12 + In addition to being a qubit itself, the fluxonium qubits . / 1 F (1) y y y y act as tunable couplers, enabling two classes of two- + ! (t)I ⊗ σ2z + g(σ1σ + σ σ2 + σ σ + σ1σ2); , 2 01 - 2 1 1 2 qubit gates between the transmons and fluxoniums. The T T T − T j i ! j i first class, called SWAP class, allows gates from the set where !01 and !12 = !01 η are the 0 1 and the p T fiSWAP; iSWAP; iSWAP1=4;:::g, and can be applied between j1i ! j2i transition frequencies of the transmon, with η being F any fluxonium and transmon pair. A second two-qubit gate the anharmonicity of the transmon, and !01(t) is the j0i ! class (called CPhase class) is available between a fluxonium j1i transition frequency of the fluxonium; g is the coupling and an upper transmon. This is a parametrized class of the four strength between the j0i ! j1i transition of the transmon and the fluxonium. Here I (1) and I (2) are 3 × 3 and 2 × 2 identity controlled phase gate types fC00(φ); C01(φ); C10(φ); C11(φ)g, matrices respectively, and the lowering operators of the qubits where Cij performs a phase shift of φ on input of the two qubit state jiji. are given by 0 1 0 ! The CPhase class and SWAP class two-qubit gate primi- p 0 0 σ = ⊗ I (1); σ = I (1) ⊗ : (3) tives, along with single qubit rotations on the transmons and 1 0 0 2 2 1 0 fluxoniums, enable universal quantum computation. Other two- 0 0 0 .* /+ qubit gates, such as the controlled-not can be synthesized from Instead of directly tuning the coupling strength we are tune these primitives [19].
Recommended publications
  • Simulating Quantum Field Theory with a Quantum Computer
    Simulating quantum field theory with a quantum computer John Preskill Lattice 2018 28 July 2018 This talk has two parts (1) Near-term prospects for quantum computing. (2) Opportunities in quantum simulation of quantum field theory. Exascale digital computers will advance our knowledge of QCD, but some challenges will remain, especially concerning real-time evolution and properties of nuclear matter and quark-gluon plasma at nonzero temperature and chemical potential. Digital computers may never be able to address these (and other) problems; quantum computers will solve them eventually, though I’m not sure when. The physics payoff may still be far away, but today’s research can hasten the arrival of a new era in which quantum simulation fuels progress in fundamental physics. Frontiers of Physics short distance long distance complexity Higgs boson Large scale structure “More is different” Neutrino masses Cosmic microwave Many-body entanglement background Supersymmetry Phases of quantum Dark matter matter Quantum gravity Dark energy Quantum computing String theory Gravitational waves Quantum spacetime particle collision molecular chemistry entangled electrons A quantum computer can simulate efficiently any physical process that occurs in Nature. (Maybe. We don’t actually know for sure.) superconductor black hole early universe Two fundamental ideas (1) Quantum complexity Why we think quantum computing is powerful. (2) Quantum error correction Why we think quantum computing is scalable. A complete description of a typical quantum state of just 300 qubits requires more bits than the number of atoms in the visible universe. Why we think quantum computing is powerful We know examples of problems that can be solved efficiently by a quantum computer, where we believe the problems are hard for classical computers.
    [Show full text]
  • Quantum Machine Learning: Benefits and Practical Examples
    Quantum Machine Learning: Benefits and Practical Examples Frank Phillipson1[0000-0003-4580-7521] 1 TNO, Anna van Buerenplein 1, 2595 DA Den Haag, The Netherlands [email protected] Abstract. A quantum computer that is useful in practice, is expected to be devel- oped in the next few years. An important application is expected to be machine learning, where benefits are expected on run time, capacity and learning effi- ciency. In this paper, these benefits are presented and for each benefit an example application is presented. A quantum hybrid Helmholtz machine use quantum sampling to improve run time, a quantum Hopfield neural network shows an im- proved capacity and a variational quantum circuit based neural network is ex- pected to deliver a higher learning efficiency. Keywords: Quantum Machine Learning, Quantum Computing, Near Future Quantum Applications. 1 Introduction Quantum computers make use of quantum-mechanical phenomena, such as superposi- tion and entanglement, to perform operations on data [1]. Where classical computers require the data to be encoded into binary digits (bits), each of which is always in one of two definite states (0 or 1), quantum computation uses quantum bits, which can be in superpositions of states. These computers would theoretically be able to solve certain problems much more quickly than any classical computer that use even the best cur- rently known algorithms. Examples are integer factorization using Shor's algorithm or the simulation of quantum many-body systems. This benefit is also called ‘quantum supremacy’ [2], which only recently has been claimed for the first time [3]. There are two different quantum computing paradigms.
    [Show full text]
  • COVID-19 Detection on IBM Quantum Computer with Classical-Quantum Transfer Learning
    medRxiv preprint doi: https://doi.org/10.1101/2020.11.07.20227306; this version posted November 10, 2020. The copyright holder for this preprint (which was not certified by peer review) is the author/funder, who has granted medRxiv a license to display the preprint in perpetuity. It is made available under a CC-BY-NC-ND 4.0 International license . Turk J Elec Eng & Comp Sci () : { © TUB¨ ITAK_ doi:10.3906/elk- COVID-19 detection on IBM quantum computer with classical-quantum transfer learning Erdi ACAR1*, Ihsan_ YILMAZ2 1Department of Computer Engineering, Institute of Science, C¸anakkale Onsekiz Mart University, C¸anakkale, Turkey 2Department of Computer Engineering, Faculty of Engineering, C¸anakkale Onsekiz Mart University, C¸anakkale, Turkey Received: .201 Accepted/Published Online: .201 Final Version: ..201 Abstract: Diagnose the infected patient as soon as possible in the coronavirus 2019 (COVID-19) outbreak which is declared as a pandemic by the world health organization (WHO) is extremely important. Experts recommend CT imaging as a diagnostic tool because of the weak points of the nucleic acid amplification test (NAAT). In this study, the detection of COVID-19 from CT images, which give the most accurate response in a short time, was investigated in the classical computer and firstly in quantum computers. Using the quantum transfer learning method, we experimentally perform COVID-19 detection in different quantum real processors (IBMQx2, IBMQ-London and IBMQ-Rome) of IBM, as well as in different simulators (Pennylane, Qiskit-Aer and Cirq). By using a small number of data sets such as 126 COVID-19 and 100 Normal CT images, we obtained a positive or negative classification of COVID-19 with 90% success in classical computers, while we achieved a high success rate of 94-100% in quantum computers.
    [Show full text]
  • Experimental Kernel-Based Quantum Machine Learning in Finite Feature
    www.nature.com/scientificreports OPEN Experimental kernel‑based quantum machine learning in fnite feature space Karol Bartkiewicz1,2*, Clemens Gneiting3, Antonín Černoch2*, Kateřina Jiráková2, Karel Lemr2* & Franco Nori3,4 We implement an all‑optical setup demonstrating kernel‑based quantum machine learning for two‑ dimensional classifcation problems. In this hybrid approach, kernel evaluations are outsourced to projective measurements on suitably designed quantum states encoding the training data, while the model training is processed on a classical computer. Our two-photon proposal encodes data points in a discrete, eight-dimensional feature Hilbert space. In order to maximize the application range of the deployable kernels, we optimize feature maps towards the resulting kernels’ ability to separate points, i.e., their “resolution,” under the constraint of fnite, fxed Hilbert space dimension. Implementing these kernels, our setup delivers viable decision boundaries for standard nonlinear supervised classifcation tasks in feature space. We demonstrate such kernel-based quantum machine learning using specialized multiphoton quantum optical circuits. The deployed kernel exhibits exponentially better scaling in the required number of qubits than a direct generalization of kernels described in the literature. Many contemporary computational problems (like drug design, trafc control, logistics, automatic driving, stock market analysis, automatic medical examination, material engineering, and others) routinely require optimiza- tion over huge amounts of data1. While these highly demanding problems can ofen be approached by suitable machine learning (ML) algorithms, in many relevant cases the underlying calculations would last prohibitively long. Quantum ML (QML) comes with the promise to run these computations more efciently (in some cases exponentially faster) by complementing ML algorithms with quantum resources.
    [Show full text]
  • High Energy Physics Quantum Computing
    High Energy Physics Quantum Computing Quantum Information Science in High Energy Physics at the Large Hadron Collider PI: O.K. Baker, Yale University Unraveling the quantum structure of QCD in parton shower Monte Carlo generators PI: Christian Bauer, Lawrence Berkeley National Laboratory Co-PIs: Wibe de Jong and Ben Nachman (LBNL) The HEP.QPR Project: Quantum Pattern Recognition for Charged Particle Tracking PI: Heather Gray, Lawrence Berkeley National Laboratory Co-PIs: Wahid Bhimji, Paolo Calafiura, Steve Farrell, Wim Lavrijsen, Lucy Linder, Illya Shapoval (LBNL) Neutrino-Nucleus Scattering on a Quantum Computer PI: Rajan Gupta, Los Alamos National Laboratory Co-PIs: Joseph Carlson (LANL); Alessandro Roggero (UW), Gabriel Purdue (FNAL) Particle Track Pattern Recognition via Content-Addressable Memory and Adiabatic Quantum Optimization PI: Lauren Ice, Johns Hopkins University Co-PIs: Gregory Quiroz (Johns Hopkins); Travis Humble (Oak Ridge National Laboratory) Towards practical quantum simulation for High Energy Physics PI: Peter Love, Tufts University Co-PIs: Gary Goldstein, Hugo Beauchemin (Tufts) High Energy Physics (HEP) ML and Optimization Go Quantum PI: Gabriel Perdue, Fermilab Co-PIs: Jim Kowalkowski, Stephen Mrenna, Brian Nord, Aris Tsaris (Fermilab); Travis Humble, Alex McCaskey (Oak Ridge National Lab) Quantum Machine Learning and Quantum Computation Frameworks for HEP (QMLQCF) PI: M. Spiropulu, California Institute of Technology Co-PIs: Panagiotis Spentzouris (Fermilab), Daniel Lidar (USC), Seth Lloyd (MIT) Quantum Algorithms for Collider Physics PI: Jesse Thaler, Massachusetts Institute of Technology Co-PI: Aram Harrow, Massachusetts Institute of Technology Quantum Machine Learning for Lattice QCD PI: Boram Yoon, Los Alamos National Laboratory Co-PIs: Nga T. T. Nguyen, Garrett Kenyon, Tanmoy Bhattacharya and Rajan Gupta (LANL) Quantum Information Science in High Energy Physics at the Large Hadron Collider O.K.
    [Show full text]
  • Future Directions of Quantum Information Processing a Workshop on the Emerging Science and Technology of Quantum Computation, Communication, and Measurement
    Future Directions of Quantum Information Processing A Workshop on the Emerging Science and Technology of Quantum Computation, Communication, and Measurement Seth Lloyd, Massachusetts Institute of Technology Dirk Englund, Massachusetts Institute of Technology Workshop funded by the Basic Research Office, Office of the Assistant Prepared by Kate Klemic Ph.D. and Jeremy Zeigler Secretary of Defense for Research & Engineering. This report does not Virginia Tech Applied Research Corporation necessarily reflect the policies or positions of the US Department of Defense Preface Over the past century, science and technology have brought remarkable new capabilities to all sectors of the economy; from telecommunications, energy, and electronics to medicine, transportation and defense. Technologies that were fantasy decades ago, such as the internet and mobile devices, now inform the way we live, work, and interact with our environment. Key to this technological progress is the capacity of the global basic research community to create new knowledge and to develop new insights in science, technology, and engineering. Understanding the trajectories of this fundamental research, within the context of global challenges, empowers stakeholders to identify and seize potential opportunities. The Future Directions Workshop series, sponsored by the Basic Research Office of the Office of the Assistant Secretary of Defense for Research and Engineering, seeks to examine emerging research and engineering areas that are most likely to transform future technology capabilities. These workshops gather distinguished academic and industry researchers from the world’s top research institutions to engage in an interactive dialogue about the promises and challenges of these emerging basic research areas and how they could impact future capabilities.
    [Show full text]
  • Quantum Information Processing with Superconducting Circuits: a Review
    Quantum Information Processing with Superconducting Circuits: a Review G. Wendin Department of Microtechnology and Nanoscience - MC2, Chalmers University of Technology, SE-41296 Gothenburg, Sweden Abstract. During the last ten years, superconducting circuits have passed from being interesting physical devices to becoming contenders for near-future useful and scalable quantum information processing (QIP). Advanced quantum simulation experiments have been shown with up to nine qubits, while a demonstration of Quantum Supremacy with fifty qubits is anticipated in just a few years. Quantum Supremacy means that the quantum system can no longer be simulated by the most powerful classical supercomputers. Integrated classical-quantum computing systems are already emerging that can be used for software development and experimentation, even via web interfaces. Therefore, the time is ripe for describing some of the recent development of super- conducting devices, systems and applications. As such, the discussion of superconduct- ing qubits and circuits is limited to devices that are proven useful for current or near future applications. Consequently, the centre of interest is the practical applications of QIP, such as computation and simulation in Physics and Chemistry. Keywords: superconducting circuits, microwave resonators, Josephson junctions, qubits, quantum computing, simulation, quantum control, quantum error correction, superposition, entanglement arXiv:1610.02208v2 [quant-ph] 8 Oct 2017 Contents 1 Introduction 6 2 Easy and hard problems 8 2.1 Computational complexity . .9 2.2 Hard problems . .9 2.3 Quantum speedup . 10 2.4 Quantum Supremacy . 11 3 Superconducting circuits and systems 12 3.1 The DiVincenzo criteria (DV1-DV7) . 12 3.2 Josephson quantum circuits . 12 3.3 Qubits (DV1) .
    [Show full text]
  • A Quantum Compiler for Topological Quantum Computation Caitlin Carnahan
    Florida State University Libraries Honors Theses The Division of Undergraduate Studies 2012 A Quantum Compiler for Topological Quantum Computation Caitlin Carnahan Follow this and additional works at the FSU Digital Library. For more information, please contact [email protected] Abstract A quantum computer is a device that exploits the strange proper- ties of quantum mechanics in order to perform computations that are not feasible on a classical computer. To implement a quantum com- puter, it will be necessary to maintain the delicate quantum super- positions formed during computation; this is a very difficult problem because quantum systems, by their very nature, are incredibly frag- ile. However, it is possible to implement a finite set of quantum gates to the required accuracy, which makes it possible to perform fault- tolerant quantum computing, a scheme that minimizes error prop- agation in computations. The problem then becomes developing a method to build arbitrary quantum operations using this finite set of fault-tolerant gates. This can be accomplished by using the Solovay- Kitaev theorem, which proves that any unitary operation can not only be simulated, but done so efficiently to within a small margin of ap- proximation using only the gates in the universal fault-tolerant gate set. The purpose of this research is to create an efficient program that demonstrates the process of the Solovay-Kitaev theorem using various universal gate sets. Essentially, the program presented in this paper translates a desired operation into the “machine code” of a quantum computer and therefore acts as a “quantum compiler”. This project fo- cuses specifically on topological quantum computing in which the the fault-tolerant gate set can be visualized as elementary braids formed by worldlines traced out by exotic quasiparticles known as Fibonacci anyons.
    [Show full text]
  • A Practical Introduction to Quantum Computing: from Qubits to Quantum Machine Learning and Beyond
    A Practical Introduction to Quantum Computing: From Qubits to Quantum Machine Learning and Beyond El´ıas F. Combarro [email protected] CERN openlab (Geneva, Switzerland) - University of Oviedo (Oviedo, Spain) CERN - November/December 2020 Part I Introduction: quantum computing... the end of the world as we know it? 2 / 30 I, for one, welcome our new quantum overlords Image credits: sciencenews.org 3 / 30 Philosophy of the course Image credits: Modified from an Instagram image by Bob MacGuffie 4 / 30 Tools and resources • Jupyter Notebooks • Web application to create and execute notebooks that include code, images, text and formulas • They can be used locally (Anaconda) or in the cloud (mybinder.org, Google Colab...) • IBM Quantum Experience • Free online access to quantum simulators (up to 32 qubits) and actual quantum computers (1, 5 and 15 qubits) with different topologies • Programmable with a visual interface and via different languages (python, qasm, Jupyter Notebooks) • Launched in May 2016 • https://quantum-computing.ibm.com/ Image credits: IBM 5 / 30 Tools and resources (2) • Quirk • Online simulator (up to 16 qubits) • Lots of different gates and visualization options • http://algassert.com/quirk • D-Wave Leap • Access to D-Wave quantum computers • Ocean: python library for quantum annealing • Problem specific (QUBO, Ising model...) • https://www.dwavesys.com/take-leap 6 / 30 The shape of things to come Image credits: Created with wordclouds.com 7 / 30 What is quantum computing? Quantum computing Quantum computing is a computing
    [Show full text]
  • Insolubilitщ En Абв De L'щquation Ге ¤ Жизйг
    5. E. Bernstein and U. Vazirani, ªQuantum complexity 20. A. K. Lenstra and H. W. Lenstra, Jr., eds., The Devel- theory,º in Proc. 25th ACM Symp. on Theory of Com- opment of the Number Field Sieve, Lecture Notes in putating, pp. 11±20 (1993). Mathematics No. 1554, Springer-Verlag (1993); this 6. A. Berthiaume and G. Brassard, ªThe quantum chal- book contains reprints of the articles that were critical lenge to structural complexity theory,º in Proc. 7th in the development of the fastest known factoring al- Conf. on Structure in Complexity Theory, IEEE Com- gorithm. puter Society Press, pp. 132±137 (1992). 21. H. W. Lenstra, Jr. and C. Pomerance, ªA rigorous 7. A. Berthiaume and G. Brassard, ªOracle quantum time bound for factoring integers,º J. Amer. Math. Soc. computing,º in Proc. Workshop on Physics and Com- Vol. 5, pp. 483±516 (1992). putation, pp. 195±199, IEEE Computer Society Press 22. S. Lloyd, ªA potentially realizable quantum com- (1992). puter,º Science, Vol. 261, pp. 1569±1571 (1993). 8. D. Coppersmith, ªAn approximate Fourier transform 23. S. Lloyd, ªEnvisioning a quantum supercomputer,º useful in quantum factoring,º IBM Research Report Science, Vol. 263, p. 695 (1994). RC 19642 (1994). 24. G. L. Miller, ªRiemann's hypothesis and tests for 9. D. Deutsch, ªQuantum theory, the Church±Turing primality,º J. Comp. Sys. Sci. Vol. 13, pp. 300±317 principle and the universal quantum computer,º Proc. (1976). Roy. Soc. Lond. Ser. A, Vol. 400, pp. 96±117 (1985). 25. S. Pohligand M. Hellman, ªAn improved algorithm for 10.
    [Show full text]
  • Exploring Quantum Computing Use Cases for Healthcare Accelerate Diagnoses, Personalize Medicine, and Optimize Pricing Experts on This Topic Dr
    Expert Insights Exploring quantum computing use cases for healthcare Accelerate diagnoses, personalize medicine, and optimize pricing Experts on this topic Dr. Frederik Flöther Dr. Frederik Flöther is an IBM Quantum Industry Consultant and globally leads efforts for the Life Sciences Life Sciences & Healthcare Lead and Healthcare sector. Frederik is an IBM Academy of IBM Quantum Industry Consulting Technology member and Senior Inventor. He has deep IBM Services expertise in quantum computing and artificial intelligence linkedin.com/in/frederikfloether/ and works with clients to create value through these next- [email protected] generation technologies. Frederik has authored more than 20 patents, peer-reviewed publications, and white papers. Judy Murphy, RN, Judy Murphy is Chief Nursing Officer at IBM Global Healthcare. Previously, she was Deputy National FACMI, FAAN Coordinator at ONC in Washington DC and Vice President, Chief Nursing Officer Applications at Aurora Health Care in Wisconsin. She IBM Global Healthcare has more than 30 years of health informatics experience linkedin.com/in/judy-murphy-rn- and is a fellow in the American College of Medical facmi-fhimss-faan-4066442/ Informatics and the American Academy of Nursing. [email protected] Judy has published and lectured internationally and has received numerous Health IT awards. John Murtha John Murtha sets the strategic direction for IBM’s Global Health Plan Segment and works with priority accounts Health Plan Industry Segment envisioning next generation health plans. A twenty year Leader health plan industry veteran, John has led several large IBM Industry Platforms scale transformation initiatives that extensively used linkedin.com/in/john-g-murtha/ technology, and reengineered processes.
    [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]