Adiabatic quantum computation a tutorial for computer scientists

Save this PDF as:

Size: px
Start display at page:

Transcription

1 Adiabatic quantum computation a tutorial for computer scientists Itay Hen Dept. of Physics, UCSC Advanced Machine Learning class UCSC June 6 th 2012

2 Outline introduction I: what is a quantum computer? introduction II: motivation for adiabatic quantum computing adiabatic quantum computing simulating adiabatic quantum computers future of adiabatic computing [AQC and machine learning(?)]

3 What is a Quantum Computer?

4 What is a quantum computer? computer input state computation output state both classical and quantum computers may be viewed as machines that perform computations on given inputs and produce outputs. Both inputs and outputs are strings of bits (0 s and 1 s). classical computers are based on manipulations of bits. at any given time the system is in a unique classical configuration (i.e., in a state that is a sequence of 0 s and 1 s).

5 What is a quantum computer? computer input state computation a classical algorithm (circuit) looks like this: output state input state computation output state at any given time the system is in a unique classical configuration (i.e., in a state that is a sequence of 0 s and 1 s).

6 What is a quantum computer? computer input state computation output state quantum computers on the other hand manipulate objects called quantum bits or qubits for short.

7 What is a quantum computer? computer input state computation output state quantum computers on the other hand manipulate objects called quantum bits or qubits for short. what are qubits?

8 What are qubits? a qubit is a generalization on the concept of bit. motivation / idea behind it: small particles, say electrons, obey different laws than big objects (such as, say, billiard balls). small particles obey the laws of Quantum Physics. big objects are classical entities they obey the laws of Classical Physics. (however, big objects are collections of small particles!) most notably: a quantum particle can be in a superposition of several classical configurations. classical world I m here or I m there quantum world I m here and I m there

9 What are qubits? while a bit can be either in the a 0 state or a 1 state (this is Dirac s ket notation). a qubit can be in a superposition of these two states, e.g., φ = imagine 0 and a 1 as being two orthogonal basis vectors. while a classical bit is either of the two, a qubit can be an arbitrary (yet normalized) linear combination of the two. in order to access the information stored in a qubit one must perform a measurement that collapses the qubit. extremely nonintuitive. important: only 1 bit of information is stored in a qubit.

10 What are qubits? take for example a system of 3 bits. Classically, we have 2 3 = 8 possible classical configurations : 000, 001, 010, 011, 100, 101, 110, 111, the corresponding quantum state of a 3-qubit system would be: 7 φ = i=0 this is a (normalized) 8-component vector over the complex numbers (8 complex coefficients). i enumerates the 8 classical configurations listed above. c i i

11 Encoding optimization problems suppose that we are given a function and are asked to find its minimum and the corresponding minimizing configuration. this is the same as having the diagonal matrix: f: {0,1} 3 R F = and asking which is the smallest eigenvalue (minimum of f ) and corresponding eigenvector (minimizing configuration). here, the basis vectors e i correspond to i and the elements on the diagonal are the evaluation of f on them.

12 Encoding optimization problems in matrix-form we can generalize classical optimization problems to quantum optimization problems by adding off-diagonal elements to the matrix. we still look for the smallest eigen-pair, i.e., min φ φ F φ = min φ φ t Fφ but problem now is much harder. (this is Dirac s bra notation). in quantum mechanics, the minimal (eigen)vector is called the ground state of the system and the corresponding minimal (eigen)value is called the ground state energy. also, the matrix F is called the Hamiltonian (usually denoted by H). quantum mechanics is just linear algebra in disguise.

13 What is a quantum computer? computer input state computation output state quantum computers manipulate quantum bits or qubits for short. a quantum algorithm (circuit) may look like this: input state computation output state

14 What is a quantum computer? computer input state computation space of possible quantum states is huge. output state range of operations on qubits is huge. capabilities are greater (name dropping: superposition, entanglement, tunneling, interference ). can solve problems faster. only problem with quantum computers: they do not exist! theory is very advanced but many technological unresolved challenges.

15 Motivation for adiabatic quantum computing

16 Motivation clearly, a quantum computer is a generalization of a classical computer in what ways quantum computers are more efficient than classical computers? what problems could be solved more efficiently on a quantum computer? these are two of the most basic and important questions in the field of quantum information/computation.

17 Motivation in what ways quantum computers are more efficient than classical computers? what problems could be solved more efficiently on a quantum computer? best-known examples are: Shor s algorithm for integer factorization. Solves the problem in polynomial time (exponential speedup). current quantum computers can factor all integers up to 21. Grover's algorithm is a quantum algorithm for searching an unsorted database with N entries in O N 1/2 time (quadratic speedup). importance is huge (cryptanalysis, etc.).

18 Motivation what other problems can quantum computers solve? people are considering hard satisfiability (SAT) and other optimization problems which are at least NP-complete. these are hard to solve classically; time needed is exponential in the input (exponential complexity). could a quantum computer solve these problems in an efficient manner? perhaps even in polynomial time? Adiabatic Quantum Computing is a general approach to solve a broad range of hard optimization problems using a quantum computer [Farhi et al.,2001]

20 The nature of physical systems adiabatic quantum computation is different that circuit-based computation (there are still other models of computation). adiabatic quantum computation is analog in nature (as opposed to 0/1 digital circuits). it is based on the fact that the state of a system will tend to reach a minimum configuration. this is the principle of least action.

21 Analog classical optimization we are given a landscape f(x) for which we need to find the minimum configuration, i.e., the stable state of the ball. if energy landscape is simple : the ball will eventually end up at the bottom of the hill. f x

22 Analog classical optimization we are given a landscape f(x) for which we need to find the minimum configuration, i.e., the stable state of the ball. if energy landscape is jagged : ball will eventually end up in a minimum but is likely to end up in a local minimum. this is no good. f x

23 Analog classical optimization we are given a landscape f(x) for which we need to find the minimum configuration, i.e., the stable state of the ball. if energy landscape is jagged : ball will eventually end up in a minimum but is likely to end up in a local minimum. this is no good. f probability of jumping over the barrier is exponentially small in the height of the barrier. x ball is unlikely to end up in the true minimum.

24 Analog quantum optimization we are given a landscape f(x) for which we need to find the minimum configuration, i.e., the stable state of the ball. if energy landscape is jagged : ball will eventually end up in a minimum but is likely to end up in a local minimum. this is no good. f quantum mechanically, the ball can tunnel through thin but high barriers! x sometimes more likely to end up in the true minimum. tunneling is a key feature of quantum mechanics.

25 The adiabatic theorem of QM the adiabatic theorem of QM tells us that a physical system remains in its instantaneous eigenstate if a given perturbation is acting on it slowly enough and if there is a gap between the eigenvalue and the rest of the Hamiltonian's spectrum.

26 The adiabatic theorem of QM the adiabatic theorem of QM tells us that a physical system remains in its instantaneous eigenstate if a given perturbation is acting on it slowly enough and if there is a gap between the eigenvalue and the rest of the Hamiltonian's spectrum.??

27 The adiabatic theorem of QM the adiabatic theorem of QM tells us that a physical system remains in its instantaneous eigenstate if a given perturbation is acting on it slowly enough and if there is a gap between the eigenvalue and the rest of the Hamiltonian's spectrum. rephrasing: if the ball is at the minimum (ground state) of some function (Hamiltonian), and the function is changes slowly enough, ball will stay close to the instantaneous global minimum throughout the evolution. here, initial function is easy to find the minimum of. final function is much harder. take advantage of adiabatic evolution to solve the problem!

28 The adiabatic theorem of QM the adiabatic theorem of QM tells us that a physical system remains in its instantaneous eigenstate if a given perturbation is acting on it slowly enough and if there is a gap between the eigenvalue and the rest of the Hamiltonian's spectrum. real QM example: change the strength of a harmonic potential of a system in the ground state: harmonic potential ψ(x, t) 2

29 The adiabatic theorem of QM the adiabatic theorem of QM tells us that a physical system remains in its instantaneous eigenstate if a given perturbation is acting on it slowly enough and if there is a gap between the eigenvalue and the rest of the Hamiltonian's spectrum. real QM example: change the strength of a harmonic potential of a system in the ground state: an abrupt change (a diabatic process): harmonic potential ψ(x, t) 2

30 The adiabatic theorem of QM the adiabatic theorem of QM tells us that a physical system remains in its instantaneous eigenstate if a given perturbation is acting on it slowly enough and if there is a gap between the eigenvalue and the rest of the Hamiltonian's spectrum. real QM example: change the strength of a harmonic potential of a system in the ground state: a gradual slow change (an adiabatic process): wave function can keep up with the change. harmonic potential ψ(x, t) 2

31 The quantum adiabatic algorithm (QAA) the mechanism proposed by Farhi et al., the QAA: 1. take a difficult (classical) optimization problem. 2. encode its solution in the ground state of a quantum problem Hamiltonian H p. 3. prepare the system in the ground state of another easily solvable driver Hamiltonian H d. H p, H d vary the Hamiltonian slowly and smoothly from H d to H p until ground state of H p is reached.

32 The quantum adiabatic algorithm (QAA) the interpolating Hamiltonian is this: H(t) = s(t)h p + 1 s(t) H d H p is the problem Hamiltonian whose ground state encodes the solution of the optimization problem H d is an easily solvable driver Hamiltonian, which does not commute with H p the parameter s obeys 0 s t 1, with s 0 = 0 and s T = 1. also: H 0 = H d and H T = H p. here, t stands for time and T is the running time, or complexity, of the algorithm.

33 The quantum adiabatic algorithm (QAA) the interpolating Hamiltonian is this: H(t) = s(t)h p + 1 s(t) H d the adiabatic theorem ensures that if the change in s t is made slowly enough, the system will stay close to the ground state of the instantaneous Hamiltonian throughout the evolution. one finally obtains a state close to the ground state of H p. measuring the state will give the solution of the original problem with high probability. how fast can the process be?

34 Quantum phase transition bottleneck is likely to be something called a Quantum Phase Transition happens when the energy differenece between the ground state and the first excited state (i.e., the gap) is small. there, the probability to get off track is maximal. gap E 1 a schematic picture of the gap to the first excited state as a function of the adiabatic parameter s. 0 QPT 1 s H = H d H = H p

35 Quantum phase transition Landau-Zener theory tells us that to stay in the ground state the running time needed is: T 1 2 ΔE min exponentially closing gap (as a function of problem size N) exponentially long running time exponential complexity.

36 Quantum phase transition Landau-Zener theory tells us that to stay in the ground state the running time needed is: T 1 2 ΔE min exponentially closing gap (as a function of problem size N) exponentially long running time exponential complexity. a two-level avoided crossing system remains in its instantaneous ground state

37 The quantum adiabatic algorithm most interesting unknown about QAA to date: could the QAA solve in polynomial time hard (NP-complete) problems? or for which hard problems is T polynomial in N?

39 Exact diagonalization quantum computers are currently unavailable. how does one study quantum computers? quantum systems are huge matrices. sizes of matrices for n qubits: N = 2 n. one method: diagonalization of the matrices. however, takes a lot of time and resources to do so. can t go beyond ~25 qubits. another method: Quantum Monte Carlo.

40 Quantum Monte Carlo methods quantum Monte Carlo (QMC) is a generic name for classical algorithms designed to study quantum systems (in equilibrium) on a classical computer by simulating them. in quantum Monte Carlo, one only samples the exponential number of configurations, where configurations with less energy are given more weight and are sampled more often. this is usually a stochastic Markov process (a Markovian chain). there are statistical errors. not all quantum physical systems can be simulated (sign problem). quantum systems have an additional extra dimension (called imaginary time and is periodic). for example a 3D classical system is similar to 2D quantum systems (with notable exceptions).

41 Method main goal: determine the complexity of the QAA for the various optimization problems study the dependence of the typical minimum gap ΔE min = min ΔE s 0,1 on the size (number of bits) of the problem. this is because: T 1 2 ΔE min polynomial dependence polynomial complexity!

42 Future of adiabatic Quantum Computing

43 Future of adiabatic QC so far, there is no clear-cut example for a problem that is solved efficiently using adiabatic quantum computation (still looking though). the first quantum adiabatic computer (quantum annealer) has been built. ~128 qubits. built by D-Wave (Vancouver). one piece has been sold to USC / Lockheed-Martin (~1M\$). a strong candidate for future quantum computers. there are however a lot of technological challenges. people are looking for other possible uses for it.

44 Adiabatic QC and Machine Learning one of many possible avenues of research is Machine Learning. people are starting to look into it. supervised and unsupervised machine learning. could work if problem can be cast in the form of an optimization problem. Hartmut Neven s blog:

45 Adiabatic quantum computation a tutorial for computer scientists Itay Hen Dept. of Physics, UCSC Advanced Machine Learning class UCSC June 6 th 2012

Anatoli Polkovnikov Boston University

Anatoli Polkovnikov Boston University L. D Alessio BU M. Bukov BU C. De Grandi Yale V. Gritsev Amsterdam M. Kolodrubetz Berkeley C.-W. Liu BU P. Mehta BU M. Tomka BU D. Sels BU A. Sandvik BU T. Souza BU

Quantum Computing. Richard Jozsa Centre for Quantum Information and Foundations DAMTP University of Cambridge

Quantum Computing Richard Jozsa Centre for Quantum Information and Foundations DAMTP University of Cambridge Physics and Computation A key question: what is computation....fundamentally? What makes it

Lecture 1: Introduction to Quantum Computing

Lecture 1: Introduction to Quantum Computing Rajat Mittal IIT Kanpur Whenever the word Quantum Computing is uttered in public, there are many reactions. The first one is of surprise, mostly pleasant, and

Lecture 1: Introduction to Quantum Computing

Lecture : Introduction to Quantum Computing Rajat Mittal IIT Kanpur What is quantum computing? This course is about the theory of quantum computation, i.e., to do computation using quantum systems. These

Shor s Quantum Factorization Algorithm

Shor s Quantum Factorization Algorithm Tayeb Aïssiou Department of Mathematics and Statistics McGill University, Montreal, Quebec Canada H3A K6 e-mail: tayeb.aissiou@mail.mcgill.ca November, 5 Abstract

Likewise, any operator, including the most generic Hamiltonian, can be written in this basis as H11 H

Finite Dimensional systems/ilbert space Finite dimensional systems form an important sub-class of degrees of freedom in the physical world To begin with, they describe angular momenta with fixed modulus

AN INTRODUCTION TO QUANTUM COMPUTING

AN INTRODUCTION TO QUANTUM COMPUTING NOSON S YANOFSKY Abstract Quantum Computing is a new and exciting field at the intersection of mathematics, computer science and physics It concerns a utilization of

PLEASE LET ME KNOW IF YOU FIND TYPOS (send to

Teoretisk Fysik KTH Advanced QM (SI2380), Lecture 2 (Summary of concepts) 1 PLEASE LET ME KNOW IF YOU FIND TYPOS (send email to langmann@kth.se) The laws of QM 1. I now discuss the laws of QM and their

Non Adiabatic Transitions in a Simple Born Oppenheimer Scattering System

1 Non Adiabatic Transitions in a Simple Born Oppenheimer Scattering System George A. Hagedorn Department of Mathematics and Center for Statistical Mechanics, Mathematical Physics, and Theoretical Chemistry

Quantum Information & Quantum Computation

CS290A, Spring 2005: Quantum Information & Quantum Computation Wim van Dam Engineering 1, Room 5109 vandam@cs http://www.cs.ucsb.edu/~vandam/teaching/cs290/ Administrivia Required book: M.A. Nielsen and

Reflections in Hilbert Space III: Eigen-decomposition of Szegedy s operator

Reflections in Hilbert Space III: Eigen-decomposition of Szegedy s operator James Daniel Whitfield March 30, 01 By three methods we may learn wisdom: First, by reflection, which is the noblest; second,

b) (5 points) Give a simple quantum circuit that transforms the state

C/CS/Phy191 Midterm Quiz Solutions October 0, 009 1 (5 points) Short answer questions: a) (5 points) Let f be a function from n bits to 1 bit You have a quantum circuit U f for computing f If you wish

OPERATORS AND MEASUREMENT

Chapter OPERATORS AND MEASUREMENT In Chapter we used the results of experiments to deduce a mathematical description of the spin-/ system. The Stern-Gerlach experiments demonstrated that spin component

Magnetic semiconductors. (Dilute) Magnetic semiconductors

Magnetic semiconductors We saw last time that: We d like to do spintronics in semiconductors, because semiconductors have many nice properties (gateability, controllable spin-orbit effects, long spin lifetimes).

Lecture 1: Overview of quantum information

CPSC 59/69: Quantum Computation John Watrous, University of Calgary References Lecture : Overview of quantum information January 0, 006 Most of the material in these lecture notes is discussed in greater

Course Description for Real Analysis, Math 156

Course Description for Real Analysis, Math 156 In this class, we will study elliptic PDE, Fourier analysis, and dispersive PDE. Here is a quick summary of the topics will study study. They re described

Topological insulator part II: Berry Phase and Topological index

Phys60.nb 11 3 Topological insulator part II: Berry Phase and Topological index 3.1. Last chapter Topological insulator: an insulator in the bulk and a metal near the boundary (surface or edge) Quantum

1 Reductions and Expressiveness

15-451/651: Design & Analysis of Algorithms November 3, 2015 Lecture #17 last changed: October 30, 2015 In the past few lectures we have looked at increasingly more expressive problems solvable using efficient

Computer Science 385 Analysis of Algorithms Siena College Spring Topic Notes: Limitations of Algorithms

Computer Science 385 Analysis of Algorithms Siena College Spring 2011 Topic Notes: Limitations of Algorithms We conclude with a discussion of the limitations of the power of algorithms. That is, what kinds

Unitary Dynamics and Quantum Circuits

qitd323 Unitary Dynamics and Quantum Circuits Robert B. Griffiths Version of 20 January 2014 Contents 1 Unitary Dynamics 1 1.1 Time development operator T.................................... 1 1.2 Particular

Group representation theory and quantum physics

Group representation theory and quantum physics Olivier Pfister April 29, 2003 Abstract This is a basic tutorial on the use of group representation theory in quantum physics, in particular for such systems

The Schrodinger Equation and Postulates Common operators in QM: Potential Energy. Often depends on position operator: Kinetic Energy 1-D case:

The Schrodinger Equation and Postulates Common operators in QM: Potential Energy Often depends on position operator: Kinetic Energy 1-D case: 3-D case Time Total energy = Hamiltonian To find out about

On The Complexity of Quantum Circuit Manipulation

On The Complexity of Quantum Circuit Manipulation Vincent Liew 1 Introduction The stabilizer class of circuits, introduced by Daniel Gottesman, consists of quantum circuits in which every gate is a controlled-not

APPLYING QUANTUM SEARCH TO A KNOWN- PLAINTEXT ATTACK ON TWO-KEY TRIPLE ENCRYPTION

APPLYING QUANTUM SEARCH TO A KNOWN- PLAINTEXT ATTACK ON TWO-KEY TRIPLE ENCRYPTION Phaneendra HD, Vidya Raj C, Dr MS Shivakumar Assistant Professor, Department of Computer Science and Engineering, The National

Quantum Mechanics Solutions

Quantum Mechanics Solutions (a (i f A and B are Hermitian, since (AB = B A = BA, operator AB is Hermitian if and only if A and B commute So, we know that [A,B] = 0, which means that the Hilbert space H

A New Integer/Number Sequence Generator

A New Integer/Number Sequence Generator Dann Passoja Winter 016 Background and Interest:... The Basis... 3 In a Broad Perspective (Philosophy)... 3 My Discovery... 4 Number Series... 4 Series of Partial

Quantum Computation and Communication

Tom Lake tswsl1989@sucs.org 16/02/2012 quan tum me chan ics: The branch of mechanics that deals with the mathematical description of the motion and interaction of subatomic particles - OED quan tum me

arxiv:quant-ph/ v1 29 Mar 2003

Finite-Dimensional PT -Symmetric Hamiltonians arxiv:quant-ph/0303174v1 29 Mar 2003 Carl M. Bender, Peter N. Meisinger, and Qinghai Wang Department of Physics, Washington University, St. Louis, MO 63130,

arxiv: v1 [quant-ph] 3 Dec 2009

Anderson localization casts clouds over adiabatic quantum optimization Boris Altshuler, 1, 2, Hari Krovi, 2, and Jeremie Roland 2, 1 Columbia University 2 NEC Laboratories America Inc. arxiv:0912.0746v1

Section 10: Many Particle Quantum Mechanics Solutions

Physics 143a: Quantum Mechanics I Section 10: Many Particle Quantum Mechanics Solutions Spring 015, Harvard Here is a summary of the most important points from this week (with a few of my own tidbits),

From bits to qubits: a quantum leap for computers

From bits to qubits: a quantum leap for computers Susan Coppersmith University of Wisconsin-Madison Department of Physics Susan Coppersmith career path: it felt like I was muddling along. B.S. from MIT

Tutorial for PhET Sim Quantum Bound States

Tutorial for PhET Sim Quantum Bound States J. Mathias Weber * JILA and Department of Chemistry & Biochemistry, University of Colorado at Boulder With this PhET Sim, we will explore the properties of some

Quantum Computing and the Possible Effects on Modern Security Practices

Quantum Computing and the Possible Effects on Modern Security Practices SE 4C03 Winter 2005 Kartik Sivaramakrishnan Researched by: Jeffery Lindner, 9904294 Due: April 04, 2005 Table of Contents Introduction...

Exploring the energy landscape

Exploring the energy landscape ChE210D Today's lecture: what are general features of the potential energy surface and how can we locate and characterize minima on it Derivatives of the potential energy

What happens when things change. Transient current and voltage relationships in a simple resistive circuit.

Module 4 AC Theory What happens when things change. What you'll learn in Module 4. 4.1 Resistors in DC Circuits Transient events in DC circuits. The difference between Ideal and Practical circuits Transient

Information Theoretic Properties of Quantum Automata

Information Theoretic Properties of Quantum Automata D. Gier Department of Physics and Astronomy, The University of Kansas, Lawrence, KS 66045 and Complexity Sciences Center and Physics Department, University

Eigenvalues and Eigenvectors

Chapter 6 Eigenvalues and Eigenvectors 6. Introduction to Eigenvalues Eigenvalues are the key to a system of n differential equations : dy=dt ay becomes dy=dt Ay. Now A is a matrix and y is a vector.y.t/;

ROM-BASED COMPUTATION: QUANTUM VERSUS CLASSICAL

arxiv:quant-ph/0109016v2 2 Jul 2002 ROM-BASED COMPUTATION: QUANTUM VERSUS CLASSICAL B. C. Travaglione, M. A. Nielsen Centre for Quantum Computer Technology, University of Queensland St Lucia, Queensland,

Quantum Computation via Sparse Distributed Representation

1 Quantum Computation via Sparse Distributed Representation Gerard J. Rinkus* ABSTRACT Quantum superposition states that any physical system simultaneously exists in all of its possible states, the number

Quantum Computation. Nicholas T. Ouellette. March 18, 2002

Quantum Computation Nicholas T. Ouellette March 18, 00 Abstract The theory of quantum computation, a new and promising field, is discussed. The mathematical background to the field is presented, drawing

Quantum spin systems - models and computational methods

Summer School on Computational Statistical Physics August 4-11, 2010, NCCU, Taipei, Taiwan Quantum spin systems - models and computational methods Anders W. Sandvik, Boston University Lecture outline Introduction

Linear Algebra in Hilbert Space

Physics 342 Lecture 16 Linear Algebra in Hilbert Space Lecture 16 Physics 342 Quantum Mechanics I Monday, March 1st, 2010 We have seen the importance of the plane wave solutions to the potentialfree Schrödinger

MITOCW watch?v=poho4pztw78

MITOCW watch?v=poho4pztw78 GILBERT STRANG: OK. So this is a video in which we go for second-order equations, constant coefficients. We look for the impulse response, the key function in this whole business,

Topic 2 Quiz 2. choice C implies B and B implies C. correct-choice C implies B, but B does not imply C

Topic 1 Quiz 1 text A reduced row-echelon form of a 3 by 4 matrix can have how many leading one s? choice must have 3 choice may have 1, 2, or 3 correct-choice may have 0, 1, 2, or 3 choice may have 0,

Space Complexity. The space complexity of a program is how much memory it uses.

Space Complexity The space complexity of a program is how much memory it uses. Measuring Space When we compute the space used by a TM, we do not count the input (think of input as readonly). We say that

Matrix product states for the fractional quantum Hall effect

Matrix product states for the fractional quantum Hall effect Roger Mong (California Institute of Technology) University of Virginia Feb 24, 2014 Collaborators Michael Zaletel UC Berkeley (Stanford/Station

21. Factoring Numbers I

21. Factoring Numbers I 1. Introduction The RSA type encoding can be broken if an intruder can factor the number N of its public key. We here describe some of the methods that people have devised for factoring

Integer Linear Programs

Lecture 2: Review, Linear Programming Relaxations Today we will talk about expressing combinatorial problems as mathematical programs, specifically Integer Linear Programs (ILPs). We then see what happens

1 Position Representation of Quantum State Function

C/CS/Phys C191 Quantum Mechanics in a Nutshell II 10/09/07 Fall 2007 Lecture 13 1 Position Representation of Quantum State Function We will motivate this using the framework of measurements. Consider first

HOMEWORK PROBLEMS FROM STRANG S LINEAR ALGEBRA AND ITS APPLICATIONS (4TH EDITION)

HOMEWORK PROBLEMS FROM STRANG S LINEAR ALGEBRA AND ITS APPLICATIONS (4TH EDITION) PROFESSOR STEVEN MILLER: BROWN UNIVERSITY: SPRING 2007 1. CHAPTER 1: MATRICES AND GAUSSIAN ELIMINATION Page 9, # 3: Describe

Quantum Field Theory

Quantum Field Theory PHYS-P 621 Radovan Dermisek, Indiana University Notes based on: M. Srednicki, Quantum Field Theory 1 Attempts at relativistic QM based on S-1 A proper description of particle physics

A Complete Characterization of Unitary Quantum Space

A Complete Characterization of Unitary Quantum Space Bill Fefferman (QuICS, University of Maryland/NIST) Joint with Cedric Lin (QuICS) Based on arxiv:1604.01384 1. Basics Quantum space complexity Main

CSE 599d - Quantum Computing Stabilizer Quantum Error Correcting Codes

CSE 599d - Quantum Computing Stabilizer Quantum Error Correcting Codes Dave Bacon Department of Computer Science & Engineering, University of Washington In the last lecture we learned of the quantum error

Electric Dipole Paradox: Question, Answer, and Interpretation Frank Wilczek January 16, 2014 Abstract Non-vanishing electric dipole moments for the electron, neutron, or other entities are classic signals

22.02 Intro to Applied Nuclear Physics

22.02 Intro to Applied Nuclear Physics Mid-Term Exam Solution Problem 1: Short Questions 24 points These short questions require only short answers (but even for yes/no questions give a brief explanation)

P, NP, NP-Complete, and NPhard

P, NP, NP-Complete, and NPhard Problems Zhenjiang Li 21/09/2011 Outline Algorithm time complicity P and NP problems NP-Complete and NP-Hard problems Algorithm time complicity Outline What is this course

Quantum Computing. Winter Quarter, 2011 and Spring Quarter, 2013

Quantum Computing Instructor: Alexander Razborov, University of Chicago. razborov@cs.uchicago.edu Course Homepage: http://people.cs.uchicago.edu/~razborov/teaching/winter11.html Winter Quarter, 2011 and

Everything Old Is New Again: Connecting Calculus To Algebra Andrew Freda

Everything Old Is New Again: Connecting Calculus To Algebra Andrew Freda (afreda@deerfield.edu) ) Limits a) Newton s Idea of a Limit Perhaps it may be objected, that there is no ultimate proportion of

Quantum information processing. Two become one

Quantum information processing Two become one Scientists experimentally demonstrate a scheme for quantum joining, which allow the number of qubits encoded per photon to be varied while keeping the overall

Operational modal analysis using forced excitation and input-output autoregressive coefficients

Operational modal analysis using forced excitation and input-output autoregressive coefficients *Kyeong-Taek Park 1) and Marco Torbol 2) 1), 2) School of Urban and Environment Engineering, UNIST, Ulsan,

Chaos, Quantum Mechanics, and Computers

Chaos, Quantum Mechanics, and Computers Computer simulation of the world around us is one of the most important ingredients for progress... QuickTime and a XviD 1.1 decompressor are needed to see this

Determine the size of an instance of the minimum spanning tree problem.

3.1 Algorithm complexity Consider two alternative algorithms A and B for solving a given problem. Suppose A is O(n 2 ) and B is O(2 n ), where n is the size of the instance. Let n A 0 be the size of the

18.303: Introduction to Green s functions and operator inverses

8.33: Introduction to Green s functions and operator inverses S. G. Johnson October 9, 2 Abstract In analogy with the inverse A of a matri A, we try to construct an analogous inverse Â of differential

Project: Vibration of Diatomic Molecules

Project: Vibration of Diatomic Molecules Objective: Find the vibration energies and the corresponding vibrational wavefunctions of diatomic molecules H 2 and I 2 using the Morse potential. equired Numerical

and let s calculate the image of some vectors under the transformation T.

Chapter 5 Eigenvalues and Eigenvectors 5. Eigenvalues and Eigenvectors Let T : R n R n be a linear transformation. Then T can be represented by a matrix (the standard matrix), and we can write T ( v) =

Preface. Preface to the Third Edition. Preface to the Second Edition. Preface to the First Edition. 1 Introduction 1

xi Contents Preface Preface to the Third Edition Preface to the Second Edition Preface to the First Edition v vii viii ix 1 Introduction 1 I GENERAL THEORY OF OPEN QUANTUM SYSTEMS 5 Diverse limited approaches:

18.06 Problem Set 8 - Solutions Due Wednesday, 14 November 2007 at 4 pm in

806 Problem Set 8 - Solutions Due Wednesday, 4 November 2007 at 4 pm in 2-06 08 03 Problem : 205+5+5+5 Consider the matrix A 02 07 a Check that A is a positive Markov matrix, and find its steady state

Two-level systems coupled to oscillators

Two-level systems coupled to oscillators RLE Group Energy Production and Conversion Group Project Staff Peter L. Hagelstein and Irfan Chaudhary Introduction Basic physical mechanisms that are complicated

Introduction - Motivation. Many phenomena (physical, chemical, biological, etc.) are model by differential equations. f f(x + h) f(x) (x) = lim

Introduction - Motivation Many phenomena (physical, chemical, biological, etc.) are model by differential equations. Recall the definition of the derivative of f(x) f f(x + h) f(x) (x) = lim. h 0 h Its

The Integers. Math 3040: Spring Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers Multiplying integers 12

Math 3040: Spring 2011 The Integers Contents 1. The Basic Construction 1 2. Adding integers 4 3. Ordering integers 11 4. Multiplying integers 12 Before we begin the mathematics of this section, it is worth

Basics of Quantum Mechanics. James Binney Oxford University

Basics of Quantum Mechanics James Binney Oxford University The book Available at Clarendon Reception for 20 Also for free download at http://www-thphys.physics.ox.ac.uk/ people/jamesbinney/qbhome.htm The

CHEM3023: Spins, Atoms and Molecules

CHEM3023: Spins, Atoms and Molecules Lecture 3 The Born-Oppenheimer approximation C.-K. Skylaris Learning outcomes Separate molecular Hamiltonians to electronic and nuclear parts according to the Born-Oppenheimer

Lecture 17. In this lecture, we will continue our discussion on randomization.

ITCS:CCT09 : Computational Complexity Theory May 11, 2009 Lecturer: Jayalal Sarma M.N. Lecture 17 Scribe: Hao Song In this lecture, we will continue our discussion on randomization. 1 BPP and the Polynomial

A New Lower Bound Technique for Quantum Circuits without Ancillæ

A New Lower Bound Technique for Quantum Circuits without Ancillæ Debajyoti Bera Abstract We present a technique to derive depth lower bounds for quantum circuits. The technique is based on the observation

Algebra I Calculator Activities

First Nine Weeks SOL Objectives Calculating Measures of Central Tendency SOL A.17 Organize a set of data Calculate the mean, median, mode, and range of a set of data Describe the relationships between

1.7 Digital Logic Inverters

11/5/2004 section 1_7 Digital nverters blank 1/2 1.7 Digital Logic nverters Reading Assignment: pp. 40-48 Consider the ideal digital logic inverter. Q: A: H: The deal nverter Q: A: H: Noise Margins H:

Introduction to Quantum Computing

Introduction to Quantum Computing Stephen Casey NASA Slide template creator Krysta Svore Bloch Sphere Hadamard basis θ φ Quantum Hardware Technologies Quantum dots Superconductors Ion traps Nitrogen

DRAFT. Algebraic computation models. Chapter 14

Chapter 14 Algebraic computation models Somewhat rough We think of numerical algorithms root-finding, gaussian elimination etc. as operating over R or C, even though the underlying representation of the

Stochastic Gradient Descent: The Workhorse of Machine Learning. CS6787 Lecture 1 Fall 2017

Stochastic Gradient Descent: The Workhorse of Machine Learning CS6787 Lecture 1 Fall 2017 Fundamentals of Machine Learning? Machine Learning in Practice this course What s missing in the basic stuff? Efficiency!

4 Matrix product states

Physics 3b Lecture 5 Caltech, 05//7 4 Matrix product states Matrix product state (MPS) is a highly useful tool in the study of interacting quantum systems in one dimension, both analytically and numerically.

Quantum Information & Quantum Computation

CS90A, Spring 005: Quantum Information & Quantum Computation Wim van Dam Engineering, Room 509 vandam@cs http://www.cs.ucsb.edu/~vandam/teaching/cs90/ Administrative The Final Examination will be: Monday

Today: eigenvalue sensitivity, eigenvalue algorithms Reminder: midterm starts today

AM 205: lecture 22 Today: eigenvalue sensitivity, eigenvalue algorithms Reminder: midterm starts today Posted online at 5 PM on Thursday 13th Deadline at 5 PM on Friday 14th Covers material up to and including

(Feed-Forward) Neural Networks Dr. Hajira Jabeen, Prof. Jens Lehmann

(Feed-Forward) Neural Networks 2016-12-06 Dr. Hajira Jabeen, Prof. Jens Lehmann Outline In the previous lectures we have learned about tensors and factorization methods. RESCAL is a bilinear model for

1 Imaginary Time Path Integral

1 Imaginary Time Path Integral For the so-called imaginary time path integral, the object of interest is exp( τh h There are two reasons for using imaginary time path integrals. One is that the application

Quantum Images and the Measurement Process

EJTP 4, No. 14 (2007) 121 128 Electronic Journal of Theoretical Physics Quantum Images and the Measurement Process Fariel Shafee Department of Physics Princeton University Princeton, NJ 08540 USA Received

Waves in a Shock Tube

Waves in a Shock Tube Ivan Christov c February 5, 005 Abstract. This paper discusses linear-wave solutions and simple-wave solutions to the Navier Stokes equations for an inviscid and compressible fluid

Lecture 4: Training a Classifier

Lecture 4: Training a Classifier Roger Grosse 1 Introduction Now that we ve defined what binary classification is, let s actually train a classifier. We ll approach this problem in much the same way as

Lecture 08 Born Oppenheimer Approximation

Chemistry II: Introduction to Molecular Spectroscopy Prof. Mangala Sunder Department of Chemistry and Biochemistry Indian Institute of Technology, Madras Lecture 08 Born Oppenheimer Approximation Welcome

Ensembles and incomplete information

p. 1/32 Ensembles and incomplete information So far in this course, we have described quantum systems by states that are normalized vectors in a complex Hilbert space. This works so long as (a) the system

Information Theory. Week 4 Compressing streams. Iain Murray,

Information Theory http://www.inf.ed.ac.uk/teaching/courses/it/ Week 4 Compressing streams Iain Murray, 2014 School of Informatics, University of Edinburgh Jensen s inequality For convex functions: E[f(x)]

MATH 319, WEEK 2: Initial Value Problems, Existence/Uniqueness, First-Order Linear DEs

MATH 319, WEEK 2: Initial Value Problems, Existence/Uniqueness, First-Order Linear DEs 1 Initial-Value Problems We have seen that differential equations can, in general, given rise to multiple solutions.

Chancellor Phyllis Wise invites you to a birthday party!

Chancellor Phyllis Wise invites you to a birthday party! 50 years ago, Illinois alumnus Nick Holonyak Jr. demonstrated the first visible light-emitting diode (LED) while working at GE. Holonyak returned

The University of British Columbia Computer Science 405 Practice Midterm Solutions

The University of British Columbia Computer Science 405 Practice Midterm Solutions Instructor: Kees van den Doel Time: 45 mins Total marks: 100 The solutions provided here are much more verbose than what

Collapse and the Tritium Endpoint Pileup

Collapse and the Tritium Endpoint Pileup arxiv:nucl-th/9901092v2 4 Feb 1999 Richard Shurtleff January 23, 1999 Abstract The beta-decay of a tritium nucleus produces an entangled quantum system, a beta

Chem 467 Supplement to Lecture 19 Hydrogen Atom, Atomic Orbitals

Chem 467 Supplement to Lecture 19 Hydrogen Atom, Atomic Orbitals Pre-Quantum Atomic Structure The existence of atoms and molecules had long been theorized, but never rigorously proven until the late 19

Quantum Computing. Bob Senser CSC 4034 Fall Version

Quantum Computing Bob Senser CSC 4034 Fall 2014 Version 2014.1 Quantum Computing Overview of Presentation Topics Terms: Measurement Qubit Superposition etc. Init_state(2) H(1) m=[1 0; 0-1] U(m,1) cnot(1,2)..

Equivalence Checking of Sequential Circuits

Equivalence Checking of Sequential Circuits Sanjit Seshia EECS UC Berkeley With thanks to K. Keutzer, R. Rutenbar 1 Today s Lecture What we know: How to check two combinational circuits for equivalence

Geometric and algebraic structures in pattern recognition

Geometric and algebraic structures in pattern recognition Luke Oeding Department of Mathematics, University of California, Berkeley April 30, 2012 Multimedia Pattern Recognition Rolf Bardeli mmprec.iais.fraunhofer.de/