DOCSLIB.ORG

Quantum Machine Learning

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Quantum Machine Learning Quantum Machine Learning Ai Jianhang 2019.11.29 Content 1. Quantum Mechanics 2. Quantum Computing 3. Quantum Computer 4. Quantum Algorithm 5. Quantum Machine Learning Chapter 1 Quantum Mechanics 壹 篇 章 Quantum Mechanics Double-slit experiment Quantum Mechanics Probability wave Particle Wave Super Position Schrödinger's cat Measurement Problem • Copenhagen Interpretation • Parallel Universes/High-dimensional projection • And all others Quantum Entanglement Classical Mechanics Quantum Mechanics --- vector in n dimensional complex space n--- Disdingishable states of the system Normalized --- Hamiltonian Schrödinger equation --- Reduced Planck Constant Quantum Mechanics https://www.reddit.com/r/p hysicsmemes/comments/b 5nksi/is_it_true_that_gravita tional_force_cannot_be/ Chapter 2 Quantum Computing 贰 篇 章 Quantum Computing Quantum computing takes advantage of quantum physics features • superposition • entanglement/ Notations Dirac Notation/Bra-ket Vector a Vector 0 Inner Product of two vectors and • • 2-dimension space over complex number Ortho-normal Basis Projection Operator : : Projection Operator : : Qubit Qubit Multiple Qubits and Uniform Superposition Basis of 2 qubit quantum system Basis of n quit quantum system Uniform superposition Quantum Gate Classical Gate Quantum Gate NOT — single CNOT -- pair AND — pair Hadamard gate -- single OR— pair Pauli-Z gate -- single Universal logic gates Universal quantum gates NAND/NOR • reversible • unitary Quantum Gate Not gate Hadamard gate Quantum Gate Pauli- Z gate CNOT gate Quantum Gate • XOR gate Quantum Gate • CNOT gate maps to Quantum Gate Chapter 3 Quantum Computers 叁 篇 章 Quantum Computers • Use particles such as electron or photon represent qubit • Quantum Circuit • Silicon Clips • Strong Magnetic • Low temperature Quantum Computers Quantum Computers Quantum Computers • Dwave/Quantum Annealing • Google/Sycamore Chapter 4 Quantum Algorithm 肆 篇 章 Quantum Algorithm • Deutsch and Deutsch-Jozsa Algorithm • Grover Algorithm —— Searching Problem • Shor Algorithm —— Factoring Problem • Quantum Annealing Algorithm —— Finding Global Minimum • HHL —— Matrix Inversion and Relevant Problem Deutsch-Jozsa Algorithm Boolean function is constant or balanced? Classical method : 2 Quantum method:? Deutsch-Jozsa Algorithm If is constant If is balance Grover Algorithm Grover Algorithm --- Oracle --- Grover Algorithm • 1 qubit system Grover Algorithm • Gerneral outline Grover Algorithm • Subroutine Grover diffusion operator Grover Algorithm • Rotation Grover Algorithm • Subroutine Grover Algorithm • Converge Grover Algorithm Chapter 5 Quantum Machine Learning 伍 篇 章 Quantum Machine Learning • To speed up the machine learning algorithm we al- ready have • Design new machine algorithm baesd on the prop- erties of quantum devices • How quantum machine learning will help to chara- cterize and control the quantum computers Quantum machine learning Linear-algebra based quantum machine learning • Quantum principal component analysis • Quantum support vector machines and kernel methods • Deep quantum learning Quantum machine learning for quantum data Designing and controlling quantum systems What has been left out • The energy principle involved during building quantum devices in practical such as transistors in silicon chips which operating the quantum gates, also the energy annealing algorithm used • The error-correction/Decohrence • And all others I even haven't noticed Reference • Biamonte J, Wittek P, Pancotti N, et al. Quantum machine learning[J]. Nature, 2017, 549(7671): 195-202. • Quantum Machine Learning • Introduction to Quantum Computing • Quantum Computing Concepts Thank you for attention.
Load more

Recommended publications
  • Degruyter Opphil Opphil-2020-0010 147..160 ++
    Open Philosophy 2020; 3: 147–160 Object Oriented Ontology and Its Critics Simon Weir* Living and Nonliving Occasionalism https://doi.org/10.1515/opphil-2020-0010 received November 05, 2019; accepted February 14, 2020 Abstract: Graham Harman’s Object-Oriented Ontology has employed a variant of occasionalist causation since 2002, with sensual objects acting as the mediators of causation between real objects. While the mechanism for living beings creating sensual objects is clear, how nonliving objects generate sensual objects is not. This essay sets out an interpretation of occasionalism where the mediating agency of nonliving contact is the virtual particles of nominally empty space. Since living, conscious, real objects need to hold sensual objects as sub-components, but nonliving objects do not, this leads to an explanation of why consciousness, in Object-Oriented Ontology, might be described as doubly withdrawn: a sensual sub-component of a withdrawn real object. Keywords: Graham Harman, ontology, objects, Timothy Morton, vicarious, screening, virtual particle, consciousness 1 Introduction When approaching Graham Harman’s fourfold ontology, it is relatively easy to understand the first steps if you begin from an anthropocentric position of naive realism: there are real objects that have their real qualities. Then apart from real objects are the objects of our perception, which Harman calls sensual objects, which are reduced distortions or caricatures of the real objects we perceive; and these sensual objects have their own sensual qualities. It is common sense that when we perceive a steaming espresso, for example, that we, as the perceivers, create the image of that espresso in our minds – this image being what Harman calls a sensual object – and that we supply the energy to produce this sensual object.
    [Show full text]
  • 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]
  • A Simple Proof That the Many-Worlds Interpretation of Quantum Mechanics Is Inconsistent
    A simple proof that the many-worlds interpretation of quantum mechanics is inconsistent Shan Gao Research Center for Philosophy of Science and Technology, Shanxi University, Taiyuan 030006, P. R. China E-mail: [email protected]. December 25, 2018 Abstract The many-worlds interpretation of quantum mechanics is based on three key assumptions: (1) the completeness of the physical description by means of the wave function, (2) the linearity of the dynamics for the wave function, and (3) multiplicity. In this paper, I argue that the combination of these assumptions may lead to a contradiction. In order to avoid the contradiction, we must drop one of these key assumptions. The many-worlds interpretation of quantum mechanics (MWI) assumes that the wave function of a physical system is a complete description of the system, and the wave function always evolves in accord with the linear Schr¨odingerequation. In order to solve the measurement problem, MWI further assumes that after a measurement with many possible results there appear many equally real worlds, in each of which there is a measuring device which obtains a definite result (Everett, 1957; DeWitt and Graham, 1973; Barrett, 1999; Wallace, 2012; Vaidman, 2014). In this paper, I will argue that MWI may give contradictory predictions for certain unitary time evolution. Consider a simple measurement situation, in which a measuring device M interacts with a measured system S. When the state of S is j0iS, the state of M does not change after the interaction: j0iS jreadyiM ! j0iS jreadyiM : (1) When the state of S is j1iS, the state of M changes and it obtains a mea- surement result: j1iS jreadyiM ! j1iS j1iM : (2) 1 The interaction can be represented by a unitary time evolution operator, U.
    [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]
  • Quantum Inductive Learning and Quantum Logic Synthesis
    Portland State University PDXScholar Dissertations and Theses Dissertations and Theses 2009 Quantum Inductive Learning and Quantum Logic Synthesis Martin Lukac Portland State University Follow this and additional works at: https://pdxscholar.library.pdx.edu/open_access_etds Part of the Electrical and Computer Engineering Commons Let us know how access to this document benefits ou.y Recommended Citation Lukac, Martin, "Quantum Inductive Learning and Quantum Logic Synthesis" (2009). Dissertations and Theses. Paper 2319. https://doi.org/10.15760/etd.2316 This Dissertation is brought to you for free and open access. It has been accepted for inclusion in Dissertations and Theses by an authorized administrator of PDXScholar. For more information, please contact [email protected]. QUANTUM INDUCTIVE LEARNING AND QUANTUM LOGIC SYNTHESIS by MARTIN LUKAC A dissertation submitted in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY in ELECTRICAL AND COMPUTER ENGINEERING. Portland State University 2009 DISSERTATION APPROVAL The abstract and dissertation of Martin Lukac for the Doctor of Philosophy in Electrical and Computer Engineering were presented January 9, 2009, and accepted by the dissertation committee and the doctoral program. COMMITTEE APPROVALS: Irek Perkowski, Chair GarrisoH-Xireenwood -George ^Lendaris 5artM ?teven Bleiler Representative of the Office of Graduate Studies DOCTORAL PROGRAM APPROVAL: Malgorza /ska-Jeske7~Director Electrical Computer Engineering Ph.D. Program ABSTRACT An abstract of the dissertation of Martin Lukac for the Doctor of Philosophy in Electrical and Computer Engineering presented January 9, 2009. Title: Quantum Inductive Learning and Quantum Logic Synhesis Since Quantum Computer is almost realizable on large scale and Quantum Technology is one of the main solutions to the Moore Limit, Quantum Logic Synthesis (QLS) has become a required theory and tool for designing Quantum Logic Circuits.
    [Show full text]
  • Abstract for Non Ideal Measurements by David Albert (Philosophy, Columbia) and Barry Loewer (Philosophy, Rutgers)
    Abstract for Non Ideal Measurements by David Albert (Philosophy, Columbia) and Barry Loewer (Philosophy, Rutgers) We have previously objected to "modal interpretations" of quantum theory by showing that these interpretations do not solve the measurement problem since they do not assign outcomes to non_ideal measurements. Bub and Healey replied to our objection by offering alternative accounts of non_ideal measurements. In this paper we argue first, that our account of non_ideal measurements is correct and second, that even if it is not it is very likely that interactions which we called non_ideal measurements actually occur and that such interactions possess outcomes. A defense of of the modal interpretation would either have to assign outcomes to these interactions, show that they don't have outcomes, or show that in fact they do not occur in nature. Bub and Healey show none of these. Key words: Foundations of Quantum Theory, The Measurement Problem, The Modal Interpretation, Non_ideal measurements. Non_Ideal Measurements Some time ago, we raised a number of rather serious objections to certain so_called "modal" interpretations of quantum theory (Albert and Loewer, 1990, 1991).1 Andrew Elby (1993) recently developed one of these objections (and added some of his own), and Richard Healey (1993) and Jeffrey Bub (1993) have recently published responses to us and Elby. It is the purpose of this note to explain why we think that their responses miss the point of our original objection. Since Elby's, Bub's, and Healey's papers contain excellent descriptions both of modal theories and of our objection to them, only the briefest review of these matters will be necessary here.
    [Show full text]
  • Nearest Centroid Classification on a Trapped Ion Quantum Computer
    www.nature.com/npjqi ARTICLE OPEN Nearest centroid classification on a trapped ion quantum computer ✉ Sonika Johri1 , Shantanu Debnath1, Avinash Mocherla2,3,4, Alexandros SINGK2,3,5, Anupam Prakash2,3, Jungsang Kim1 and Iordanis Kerenidis2,3,6 Quantum machine learning has seen considerable theoretical and practical developments in recent years and has become a promising area for finding real world applications of quantum computers. In pursuit of this goal, here we combine state-of-the-art algorithms and quantum hardware to provide an experimental demonstration of a quantum machine learning application with provable guarantees for its performance and efficiency. In particular, we design a quantum Nearest Centroid classifier, using techniques for efficiently loading classical data into quantum states and performing distance estimations, and experimentally demonstrate it on a 11-qubit trapped-ion quantum machine, matching the accuracy of classical nearest centroid classifiers for the MNIST handwritten digits dataset and achieving up to 100% accuracy for 8-dimensional synthetic data. npj Quantum Information (2021) 7:122 ; https://doi.org/10.1038/s41534-021-00456-5 INTRODUCTION Thus, one might hope that noisy quantum computers are 1234567890():,; Quantum technologies promise to revolutionize the future of inherently better suited for machine learning computations than information and communication, in the form of quantum for other types of problems that need precise computations like computing devices able to communicate and process massive factoring or search problems. amounts of data both efficiently and securely using quantum However, there are significant challenges to be overcome to resources. Tremendous progress is continuously being made both make QML practical.
    [Show full text]
  • 1 Does Consciousness Really Collapse the Wave Function?
    Does consciousness really collapse the wave function?: A possible objective biophysical resolution of the measurement problem Fred H. Thaheld* 99 Cable Circle #20 Folsom, Calif. 95630 USA Abstract An analysis has been performed of the theories and postulates advanced by von Neumann, London and Bauer, and Wigner, concerning the role that consciousness might play in the collapse of the wave function, which has become known as the measurement problem. This reveals that an error may have been made by them in the area of biology and its interface with quantum mechanics when they called for the reduction of any superposition states in the brain through the mind or consciousness. Many years later Wigner changed his mind to reflect a simpler and more realistic objective position, expanded upon by Shimony, which appears to offer a way to resolve this issue. The argument is therefore made that the wave function of any superposed photon state or states is always objectively changed within the complex architecture of the eye in a continuous linear process initially for most of the superposed photons, followed by a discontinuous nonlinear collapse process later for any remaining superposed photons, thereby guaranteeing that only final, measured information is presented to the brain, mind or consciousness. An experiment to be conducted in the near future may enable us to simultaneously resolve the measurement problem and also determine if the linear nature of quantum mechanics is violated by the perceptual process. Keywords: Consciousness; Euglena; Linear; Measurement problem; Nonlinear; Objective; Retina; Rhodopsin molecule; Subjective; Wave function collapse. * e-mail address: [email protected] 1 1.
    [Show full text]
  • Modeling Observers As Physical Systems Representing the World from Within: Quantum Theory As a Physical and Self-Referential Theory of Inference
    Modeling observers as physical systems representing the world from within: Quantum theory as a physical and self-referential theory of inference John Realpe-G´omez1∗ Theoretical Physics Group, School of Physics and Astronomy, The University of Manchestery, Manchester M13 9PL, United Kingdom and Instituto de Matem´aticas Aplicadas, Universidad de Cartagena, Bol´ıvar130001, Colombia (Dated: June 13, 2019) In 1929 Szilard pointed out that the physics of the observer may play a role in the analysis of experiments. The same year, Bohr pointed out that complementarity appears to arise naturally in psychology where both the objects of perception and the perceiving subject belong to `our mental content'. Here we argue that the formalism of quantum theory can be derived from two related intu- itive principles: (i) inference is a classical physical process performed by classical physical systems, observers, which are part of the experimental setup|this implies non-commutativity and imaginary- time quantum mechanics; (ii) experiments must be described from a first-person perspective|this leads to self-reference, complementarity, and a quantum dynamics that is the iterative construction of the observer's subjective state. This approach suggests a natural explanation for the origin of Planck's constant as due to the physical interactions supporting the observer's information process- ing, and sheds new light on some conceptual issues associated to the foundations of quantum theory. It also suggests that fundamental equations in physics are typically
    [Show full text]
  • Collapse Theories
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by PhilSci Archive Collapse Theories Peter J. Lewis The collapse postulate in quantum mechanics is problematic. In standard presentations of the theory, the state of a system prior to a measurement is a sum of terms, with one term representing each possible outcome of the measurement. According to the collapse postulate, a measurement precipitates a discontinuous jump to one of these terms; the others disappear. The reason this is problematic is that there are good reasons to think that measurement per se cannot initiate a new kind of physical process. This is the measurement problem, discussed in section 1 below. The problem here lies not with collapse, but with the appeal to measurement. That is, a theory that could underwrite the collapse process just described without ineliminable reference to measurement would constitute a solution to the measurement problem. This is the strategy pursued by dynamical (or spontaneous) collapse theories, which differ from standard presentations in that they replace the measurement-based collapse postulate with a dynamical mechanism formulated in terms of universal physical laws. Various dynamical collapse theories of quantum mechanics have been proposed; they are discussed in section 2. But dynamical collapse theories face a number of challenges. First, they make different empirical predictions from standard quantum mechanics, and hence are potentially empirically refutable. Of course, testability is a virtue, but since we have no empirical reason to think that systems ever undergo collapse, dynamical collapse theories are inherently empirically risky. Second, there are difficulties reconciling the dynamical collapse mechanism with special relativity.
    [Show full text]
  • Quantum Computing Methods for Supervised Learning Arxiv
    Quantum Computing Methods for Supervised Learning Viraj Kulkarni1, Milind Kulkarni1, Aniruddha Pant2 1 Vishwakarma University 2 DeepTek Inc June 23, 2020 Abstract The last two decades have seen an explosive growth in the theory and practice of both quantum computing and machine learning. Modern machine learning systems process huge volumes of data and demand massive computational power. As silicon semiconductor miniaturization approaches its physics limits, quantum computing is increasingly being considered to cater to these computational needs in the future. Small-scale quantum computers and quantum annealers have been built and are already being sold commercially. Quantum computers can benefit machine learning research and application across all science and engineering domains. However, owing to its roots in quantum mechanics, research in this field has so far been confined within the purview of the physics community, and most work is not easily accessible to researchers from other disciplines. In this paper, we provide a background and summarize key results of quantum computing before exploring its application to supervised machine learning problems. By eschewing results from physics that have little bearing on quantum computation, we hope to make this introduction accessible to data scientists, machine learning practitioners, and researchers from across disciplines. 1 Introduction Supervised learning is the most commonly applied form of machine learning. It works in two arXiv:2006.12025v1 [quant-ph] 22 Jun 2020 stages. During the training stage, the algorithm extracts patterns from the training dataset that contains pairs of samples and labels and converts these patterns into a mathematical representation called a model. During the inference stage, this model is used to make predictions about unseen samples.
    [Show full text]