DOCSLIB.ORG

Quantum Machine Learning Talk Copy

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Quantum Machine Learning Talk Copy Quantum Machine Learning Adam Brown, HEP-AI Quantum Computing Machine Learning Quantum MachineComputing Learning Quantum Computing Machine Learning so hot so so hot Quantum MachineComputing Learning Quantum MachineComputing Learning “I would predict that in 10 years there’s nothing but quantum machine learning.” [famous QML researcher in 2015] Classical Quantum Dataset Dataset Use Classical Classical Machine Computer Learning Use Quantum Computer The Power of Quantum Computers (in theory) The Power of Quantum Computers (in theory) easy on classical computer “P" The Power of Quantum Computers (in theory) easy on classical computer “P" • multiplication The Power of Quantum Computers (in theory) easy on quantum computer “BQP" easy on classical computer “P" • multiplication The Power of Quantum Computers (in theory) (i) BQP contains P a quantum computer can (quickly) do everything a classical computer can (quickly) do easy on quantum computer “BQP" easy on classical computer “P" • multiplication The Power of Quantum Computers (in theory) (i) BQP contains P a quantum computer can (quickly) do everything a classical computer can (quickly) do easy on quantum computer (ii) P does not contain BQP “BQP" a quantum computer can do some things quickly that a classical computer cannot do quickly ENCOURAGING • factoring • quantum simulation easy on classical computer “P" • multiplication The Power of Quantum Computers (in theory) exponential time on classical computer “EXP” (i) BQP contains P a quantum computer can (quickly) do everything a classical computer can (quickly) do easy on quantum computer (ii) P does not contain BQP “BQP" a quantum computer can do some things quickly that a classical computer cannot do quickly ENCOURAGING • factoring • quantum simulation (iii) EXP contains BQP easy on a classical computer can eventually do classical computer everything a quantum computer can do “P" • multiplication The Power of Quantum Computers (in theory) exponential time on classical computer “EXP” (i) BQP contains P • traveling salesman a quantum computer can (quickly) do • solving GO on NxN board everything a classical computer can (quickly) do easy on quantum computer (ii) P does not contain BQP “BQP" a quantum computer can do some things quickly that a classical computer cannot do quickly ENCOURAGING • factoring • quantum simulation (iii) EXP contains BQP easy on a classical computer can eventually do classical computer everything a quantum computer can do “P" (iv) BQP does not contain EXP a quantum computer does not give • multiplication generic exponential speed-up The Power of Quantum Computers (in theory) exponential time on classical computer “EXP” (i) BQP contains P • traveling salesman a quantum computer can (quickly) do • solving GO on NxN board everything a classical computer can (quickly) do easy on quantum computer (ii) P does not contain BQP “BQP" a quantum computer can do some things quickly that a classical computer cannot do quickly ENCOURAGING • factoring • quantum simulation (iii) EXP contains BQP easy on a classical computer can eventually do classical computer everything a quantum computer can do “P" (iv) BQP does not contain EXP a quantum computer does not give • multiplication generic exponential speed-up DISCOURAGING The Power of Quantum Computers (in theory) exponential time on classical computer “EXP” (i) BQP contains P • traveling salesman a quantum computer can (quickly) do • solving GO on NxN board everything a classical computer can (quickly) do easy on quantum computer (ii) P does not contain BQP “BQP" a quantum computer can do some things quickly that a classical computer cannot do quickly ENCOURAGING • factoring • quantum simulation (iii) EXP contains BQP easy on a classical computer can eventually do classical computer everything a quantum computer can do “P" (iv) BQP does not contain EXP a quantum computer does not give • multiplication generic exponential speed-up “NO FREE LUNCH” The Power of Quantum Computers (in theory) exponential time on classical computer quantum superpower: “EXP” EXPONENTIATION • traveling salesman “HILBERT SPACE IS HUGE” • solving GO on NxN board to describe state of N qubits easy on N quantum computer takes 2 real numbers “BQP" ↵ 00000000 + ...+ ↵ N 11111111 1| i 2 | i ENCOURAGING • factoring • quantum simulation (iii) EXP contains BQP easy on a classical computer can eventually do classical computer everything a quantum computer can do “P" (iv) BQP does not contain EXP a quantum computer does not give • multiplication generic exponential speed-up “NO FREE LUNCH” The Power of Quantum Computers (in theory) exponential time on classical computer quantum superpower: “EXP” EXPONENTIATION • traveling salesman “HILBERT SPACE IS HUGE” • solving GO on NxN board to describe state of N qubits easy on N quantum computer takes 2 real numbers “BQP" ↵ 00000000 + ...+ ↵ N 11111111 1| i 2 | i ENCOURAGING • factoring • quantum simulation easy on classical computer “P" quantum superweakness: LINEARITY • multiplication cannot directly see wave function “NO FREE LUNCH” Encouraging Fact #1 you are here you want to be here Encouraging Fact #1 you are here you want to be here height/T thermally fluctuate e− ⇠ Encouraging Fact #1 you are here you want to be here height/T thermally fluctuate e− ⇠ pheight width/ quantum tunnel e− ⇥ ~ ⇠ Encouraging Fact #1 you are here you want to be here height/T thermally fluctuate e− ⇠ pheight width/ quantum tunnel e− ⇥ ~ ⇠ quantum beats classical for tall, thin barriers Encouraging Fact #2 H T T H H H H T there are short quantum circuits whose output is hard to classically sample (follows directly from BQP not in P) Encouraging Fact #2 H T T H H H H T there are short quantum circuits whose output is hard to classically sample (follows directly from BQP not in P) there are functions that can be expressed with a polynomial size quantum neural network that would require an exponentially large classical neural network Encouraging Fact #3 Harrow, Hassidim, Lloyd algorithm (2008) Encouraging Fact #3 Harrow, Hassidim, Lloyd algorithm (2008) given N x N matrix H and given vector b “find” the vector x such that H x = b Encouraging Fact #3 Harrow, Hassidim, Lloyd algorithm (2008) given N x N matrix H and given vector b “find” the vector x such that H x = b c takes O(N ) classically Encouraging Fact #3 Harrow, Hassidim, Lloyd algorithm (2008) given N x N matrix H and given vector b “find” the vector x such that H x = b c takes O(N ) classically HHL: with quantum takes (log N)2 ! Encouraging Fact #3 Harrow, Hassidim, Lloyd algorithm (2008) given N x N matrix H and given vector b “find” the vector x such that H x = b c takes O(N ) classically HHL: with quantum takes (log N)2 ! 2 subroutine in classical supervised learning is minimize ( H x - b ) function ansatz gives H best fit is x datapoints are b The Power of Quantum Computers (in theory) exponential time on classical computer “EXP” (i) BQP contains P • traveling salesman a quantum computer can (quickly) do • solving GO on NxN board everything a classical computer can (quickly) do easy on quantum computer (ii) P does not contain BQP “BQP" a quantum computer can do some things quickly that a classical computer cannot do quickly ENCOURAGING • factoring • quantum simulation (iii) EXP contains BQP easy on a classical computer can eventually do classical computer everything a quantum computer can do “P" (iv) BQP does not contain EXP a quantum computer does not give • multiplication generic exponential speed-up DISCOURAGING The Power of Quantum Computers (in practice) exponential time on classical computer “EXP” (i) BQP contains P • traveling salesman a quantum computer can (quickly) do • solving GO on NxN board everything a classical computer can (quickly) do easy on quantum computer (ii) P does not contain BQP “BQP" a quantum computer can do some things quickly that a classical computer cannot do quickly ENCOURAGING • factoring • quantum simulation (iii) EXP contains BQP easy on a classical computer can eventually do classical computer everything a quantum computer can do “P" (iv) BQP does not contain EXP a quantum computer does not give • multiplication generic exponential speed-up DISCOURAGING The Power of Quantum Computers (in practice) • if “you” ever measure, coherence is destroyed • no cloning principle makes error correction hard • classical = 10 -24 errors per gate, quantum = 10 -2 errors per gate The Power of Quantum Computers (in practice) • if “you” ever measure, coherence is destroyed • no cloning principle makes error correction hard • classical = 10 -24 errors per gate, quantum = 10 -2 errors per gate CLASSICAL QUANTUM The Power of Quantum Computers (in practice) • if “you” ever measure, coherence is destroyed • no cloning principle makes error correction hard • classical = 10 -24 errors per gate, quantum = 10 -2 errors per gate CLASSICAL QUANTUM 15 = 3 x 5 The Power of Quantum Computers (in practice) • if “you” ever measure, coherence is destroyed • no cloning principle makes error correction hard • classical = 10 -24 errors per gate, quantum = 10 -2 errors per gate CLASSICAL QUANTUM 15 = 3 x 5 143 = 11 x 13 The Power of Quantum Computers (in practice) • if “you” ever measure, coherence is destroyed • no cloning principle makes error correction hard • classical = 10 -24 errors per gate, quantum = 10 -2 errors per gate CLASSICAL QUANTUM 15 = 3 x 5 143 = 11 x 13 “quantum supremacy” 2018?? The Power of Quantum Computers (in practice) “quantum supremacy” 2018?? H T T H H H H T input random state into ~50 qubit random quantum
Load more

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]
  • CS286.2 Lectures 5-6: Introduction to Hamiltonian Complexity, QMA-Completeness of the Local Hamiltonian Problem
    CS286.2 Lectures 5-6: Introduction to Hamiltonian Complexity, QMA-completeness of the Local Hamiltonian problem Scribe: Jenish C. Mehta The Complexity Class BQP The complexity class BQP is the quantum analog of the class BPP. It consists of all languages that can be decided in quantum polynomial time. More formally, Definition 1. A language L 2 BQP if there exists a classical polynomial time algorithm A that ∗ maps inputs x 2 f0, 1g to quantum circuits Cx on n = poly(jxj) qubits, where the circuit is considered a sequence of unitary operators each on 2 qubits, i.e Cx = UTUT−1...U1 where each 2 2 Ui 2 L C ⊗ C , such that: 2 i. Completeness: x 2 L ) Pr(Cx accepts j0ni) ≥ 3 1 ii. Soundness: x 62 L ) Pr(Cx accepts j0ni) ≤ 3 We say that the circuit “Cx accepts jyi” if the first output qubit measured in Cxjyi is 0. More j0i specifically, letting P1 = j0ih0j1 be the projection of the first qubit on state j0i, j0i 2 Pr(Cx accepts jyi) =k (P1 ⊗ In−1)Cxjyi k2 The Complexity Class QMA The complexity class QMA (or BQNP, as Kitaev originally named it) is the quantum analog of the class NP. More formally, Definition 2. A language L 2 QMA if there exists a classical polynomial time algorithm A that ∗ maps inputs x 2 f0, 1g to quantum circuits Cx on n + q = poly(jxj) qubits, such that: 2q i. Completeness: x 2 L ) 9jyi 2 C , kjyik2 = 1, such that Pr(Cx accepts j0ni ⊗ 2 jyi) ≥ 3 2q 1 ii.
    [Show full text]
  • Taking the Quantum Leap with Machine Learning
    Introduction Quantum Algorithms Current Research Conclusion Taking the Quantum Leap with Machine Learning Zack Barnes University of Washington Bellevue College Mathematics and Physics Colloquium Series [email protected] January 15, 2019 Zack Barnes University of Washington UW Quantum Machine Learning Introduction Quantum Algorithms Current Research Conclusion Overview 1 Introduction What is Quantum Computing? What is Machine Learning? Quantum Power in Theory 2 Quantum Algorithms HHL Quantum Recommendation 3 Current Research Quantum Supremacy(?) 4 Conclusion Zack Barnes University of Washington UW Quantum Machine Learning Introduction Quantum Algorithms Current Research Conclusion What is Quantum Computing? \Quantum computing focuses on studying the problem of storing, processing and transferring information encoded in quantum mechanical systems.\ [Ciliberto, Carlo et al., 2018] Unit of quantum information is the qubit, or quantum binary integer. Zack Barnes University of Washington UW Quantum Machine Learning Supervised Uses labeled examples to predict future events Unsupervised Not classified or labeled Introduction Quantum Algorithms Current Research Conclusion What is Machine Learning? \Machine learning is the scientific study of algorithms and statistical models that computer systems use to progressively improve their performance on a specific task.\ (Wikipedia) Zack Barnes University of Washington UW Quantum Machine Learning Uses labeled examples to predict future events Unsupervised Not classified or labeled Introduction Quantum
    [Show full text]
  • Interactive Proofs for Quantum Computations
    Innovations in Computer Science 2010 Interactive Proofs For Quantum Computations Dorit Aharonov Michael Ben-Or Elad Eban School of Computer Science, The Hebrew University of Jerusalem, Israel [email protected] [email protected] [email protected] Abstract: The widely held belief that BQP strictly contains BPP raises fundamental questions: Upcoming generations of quantum computers might already be too large to be simulated classically. Is it possible to experimentally test that these systems perform as they should, if we cannot efficiently compute predictions for their behavior? Vazirani has asked [21]: If computing predictions for Quantum Mechanics requires exponential resources, is Quantum Mechanics a falsifiable theory? In cryptographic settings, an untrusted future company wants to sell a quantum computer or perform a delegated quantum computation. Can the customer be convinced of correctness without the ability to compare results to predictions? To provide answers to these questions, we define Quantum Prover Interactive Proofs (QPIP). Whereas in standard Interactive Proofs [13] the prover is computationally unbounded, here our prover is in BQP, representing a quantum computer. The verifier models our current computational capabilities: it is a BPP machine, with access to few qubits. Our main theorem can be roughly stated as: ”Any language in BQP has a QPIP, and moreover, a fault tolerant one” (providing a partial answer to a challenge posted in [1]). We provide two proofs. The simpler one uses a new (possibly of independent interest) quantum authentication scheme (QAS) based on random Clifford elements. This QPIP however, is not fault tolerant. Our second protocol uses polynomial codes QAS due to Ben-Or, Cr´epeau, Gottesman, Hassidim, and Smith [8], combined with quantum fault tolerance and secure multiparty quantum computation techniques.
    [Show full text]
  • Quantum Supremacy
    Quantum Supremacy Practical QS: perform some computational task on a well-controlled quantum device, which cannot be simulated in a reasonable time by the best-known classical algorithms and hardware. Theoretical QS: perform a computational task efficiently on a quantum device, and prove that task cannot be efficiently classically simulated. Since proving seems to be beyond the capabilities of our current civilization, we lower the standards for theoretical QS. One seeks to provide formal evidence that classical simulation is unlikely. For example: 3-SAT is NP-complete, so it cannot be efficiently classical solved unless P = NP. Theoretical QS: perform a computational task efficiently on a quantum device, and prove that task cannot be efficiently classically simulated unless “the polynomial Heierarchy collapses to the 3nd level.” Quantum Supremacy A common feature of QS arguments is that they consider sampling problems, rather than decision problems. They allow us to characterize the complexity of sampling measurements of quantum states. Which is more difficult: Task A: deciding if a circuit outputs 1 with probability at least 2/3s, or at most 1/3s Task B: sampling from the output of an n-qubit circuit in the computational basis Sampling from distributions is generically more difficult than approximating observables, since we can use samples to estimate observables, but not the other way around. One can imagine quantum systems whose local observables are easy to classically compute, but for which sampling the full state is computationally complex. By moving from decision problems to sampling problems, we make the task of classical simulation much more difficult.
    [Show full text]
  • Quantum Algorithms for Classical Lattice Models
    Home Search Collections Journals About Contact us My IOPscience Quantum algorithms for classical lattice models This content has been downloaded from IOPscience. Please scroll down to see the full text. 2011 New J. Phys. 13 093021 (http://iopscience.iop.org/1367-2630/13/9/093021) View the table of contents for this issue, or go to the journal homepage for more Download details: IP Address: 147.96.14.15 This content was downloaded on 16/12/2014 at 15:54 Please note that terms and conditions apply. New Journal of Physics The open–access journal for physics Quantum algorithms for classical lattice models G De las Cuevas1,2,5, W Dür1, M Van den Nest3 and M A Martin-Delgado4 1 Institut für Theoretische Physik, Universität Innsbruck, Technikerstraße 25, A-6020 Innsbruck, Austria 2 Institut für Quantenoptik und Quanteninformation der Österreichischen Akademie der Wissenschaften, Innsbruck, Austria 3 Max-Planck-Institut für Quantenoptik, Hans-Kopfermann-Strasse 1, D-85748 Garching, Germany 4 Departamento de Física Teórica I, Universidad Complutense, 28040 Madrid, Spain E-mail: [email protected] New Journal of Physics 13 (2011) 093021 (35pp) Received 15 April 2011 Published 9 September 2011 Online at http://www.njp.org/ doi:10.1088/1367-2630/13/9/093021 Abstract. We give efficient quantum algorithms to estimate the partition function of (i) the six-vertex model on a two-dimensional (2D) square lattice, (ii) the Ising model with magnetic fields on a planar graph, (iii) the Potts model on a quasi-2D square lattice and (iv) the Z2 lattice gauge theory on a 3D square lattice.
    [Show full text]
  • Explorations in Quantum Neural Networks with Intermediate Measurements
    ESANN 2020 proceedings, European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning. Online event, 2-4 October 2020, i6doc.com publ., ISBN 978-2-87587-074-2. Available from http://www.i6doc.com/en/. Explorations in Quantum Neural Networks with Intermediate Measurements Lukas Franken and Bogdan Georgiev ∗Fraunhofer IAIS - Research Center for ML and ML2R Schloss Birlinghoven - 53757 Sankt Augustin Abstract. In this short note we explore a few quantum circuits with the particular goal of basic image recognition. The models we study are inspired by recent progress in Quantum Convolution Neural Networks (QCNN) [12]. We present a few experimental results, where we attempt to learn basic image patterns motivated by scaling down the MNIST dataset. 1 Introduction The recent demonstration of Quantum Supremacy [1] heralds the advent of the Noisy Intermediate-Scale Quantum (NISQ) [2] technology, where signs of supe- riority of quantum over classical machines in particular tasks may be expected. However, one should keep in mind the limitations of NISQ-devices when study- ing and developing quantum-algorithmic solutions - among other things, these include limits on the number of gates and qubits. At the same time the interaction of quantum computing and machine learn- ing is growing, with a vast amount of literature and new results. To name a few applications, the well-known HHL algorithm [3], quantum phase estimation [5] and inner products speed-up techniques lead to further advances in Support Vector Machines [4] and Principal Component Analysis [6, 7]. Intensive progress and ongoing research has also been made towards quantum analogues of Neural Networks (QNN) [8, 9, 10].
    [Show full text]
  • Readout Rebalancing for Near Term Quantum Computers
    Readout Rebalancing for Near Term Quantum Computers Rebecca Hicks,1, ∗ Christian W. Bauer,2, † and Benjamin Nachman2, ‡ 1Physics Department, University of California, Berkeley, Berkeley, CA 94720, USA 2Physics Division, Lawrence Berkeley National Laboratory, Berkeley, CA 94720, USA (Dated: October 16, 2020) Readout errors are a significant source of noise for near term intermediate scale quantum computers. Mismeasuring a qubit as a |1i when it should be |0i occurs much less often than mismeasuring a qubit as a |0i when it should have been |1i. We make the simple observation that one can improve the readout fidelity of quantum computers by applying targeted X gates prior to performing a measurement. These X gates are placed so that the expected number of qubits in the |1i state is minimized. Classical post processing can undo the effect of the X gates so that the expectation value of any observable is unchanged. We show that the statistical uncertainty following readout error corrections is smaller when using readout rebalancing. The statistical advantage is circuit- and computer-dependent, and is demonstrated for the W state, a Grover search, and for a Gaussian state. The benefit in statistical precision is most pronounced (and nearly a factor of two in some cases) when states with many qubits in the excited state have high probability. I. INTRODUCTION the simple observation that one can improve the readout fidelity of quantum computers by applying targeted X Quantum computers hold great promise for a variety of gates prior to performing a measurement. These X gates scientific and industrial applications. However, existing are placed so that the expected number of qubits in the noisy intermediate-scale quantum (NISQ) computers [1] |1i state is minimized.
    [Show full text]
  • QIP 2010 Tutorial and Scientific Programmes
    QIP 2010 15th – 22nd January, Zürich, Switzerland Tutorial and Scientific Programmes asymptotically large number of channel uses. Such “regularized” formulas tell us Friday, 15th January very little. The purpose of this talk is to give an overview of what we know about 10:00 – 17:10 Jiannis Pachos (Univ. Leeds) this need for regularization, when and why it happens, and what it means. I will Why should anyone care about computing with anyons? focus on the quantum capacity of a quantum channel, which is the case we understand best. This is a short course in topological quantum computation. The topics to be covered include: 1. Introduction to anyons and topological models. 15:00 – 16:55 Daniel Nagaj (Slovak Academy of Sciences) 2. Quantum Double Models. These are stabilizer codes, that can be described Local Hamiltonians in quantum computation very much like quantum error correcting codes. They include the toric code This talk is about two Hamiltonian Complexity questions. First, how hard is it to and various extensions. compute the ground state properties of quantum systems with local Hamiltonians? 3. The Jones polynomials, their relation to anyons and their approximation by Second, which spin systems with time-independent (and perhaps, translationally- quantum algorithms. invariant) local interactions could be used for universal computation? 4. Overview of current state of topological quantum computation and open Aiming at a participant without previous understanding of complexity theory, we will discuss two locally-constrained quantum problems: k-local Hamiltonian and questions. quantum k-SAT. Learning the techniques of Kitaev and others along the way, our first goal is the understanding of QMA-completeness of these problems.
    [Show full text]
  • Computational Complexity: a Modern Approach
    i Computational Complexity: A Modern Approach Sanjeev Arora and Boaz Barak Princeton University http://www.cs.princeton.edu/theory/complexity/ [email protected] Not to be reproduced or distributed without the authors’ permission ii Chapter 10 Quantum Computation “Turning to quantum mechanics.... secret, secret, close the doors! we always have had a great deal of difficulty in understanding the world view that quantum mechanics represents ... It has not yet become obvious to me that there’s no real problem. I cannot define the real problem, therefore I suspect there’s no real problem, but I’m not sure there’s no real problem. So that’s why I like to investigate things.” Richard Feynman, 1964 “The only difference between a probabilistic classical world and the equations of the quantum world is that somehow or other it appears as if the probabilities would have to go negative..” Richard Feynman, in “Simulating physics with computers,” 1982 Quantum computing is a new computational model that may be physically realizable and may provide an exponential advantage over “classical” computational models such as prob- abilistic and deterministic Turing machines. In this chapter we survey the basic principles of quantum computation and some of the important algorithms in this model. One important reason to study quantum computers is that they pose a serious challenge to the strong Church-Turing thesis (see Section 1.6.3), which stipulates that every physi- cally reasonable computation device can be simulated by a Turing machine with at most polynomial slowdown. As we will see in Section 10.6, there is a polynomial-time algorithm for quantum computers to factor integers, whereas despite much effort, no such algorithm is known for deterministic or probabilistic Turing machines.
    [Show full text]
  • Quantum Computation
    Quantum Computation Lecture 27 And that’s all we got time for! 1 State 2 State State of a classical computer labeled by (say) bit strings 2 State State of a classical computer labeled by (say) bit strings e.g. 2-bit states: 00, 01, 10 and 11 2 State State of a classical computer labeled by (say) bit strings e.g. 2-bit states: 00, 01, 10 and 11 Probabilistic computation: state is a probability distribution over the basis states 2 State State of a classical computer labeled by (say) bit strings e.g. 2-bit states: 00, 01, 10 and 11 Probabilistic computation: state is a probability distribution over the basis states p = (p00,p01,p10,p11) s.t. pij non-negative and ||p||1 = 1 2 State State of a classical computer labeled by (say) bit strings e.g. 2-bit states: 00, 01, 10 and 11 Probabilistic computation: state is a probability distribution over the basis states p = (p00,p01,p10,p11) s.t. pij non-negative and ||p||1 = 1 Quantum computation/Quantum mechanics: state is a real (or even complex) vector 2 State State of a classical computer labeled by (say) bit strings e.g. 2-bit states: 00, 01, 10 and 11 Probabilistic computation: state is a probability distribution over the basis states p = (p00,p01,p10,p11) s.t. pij non-negative and ||p||1 = 1 Quantum computation/Quantum mechanics: state is a real (or even complex) vector q = (q00,q01,q10,q11) s.t. ||q||2 = 1 2 State State of a classical computer labeled by (say) bit strings e.g.
    [Show full text]