Lecture 1: Introduction to Quantum Computing
|
|
- Duane Gerald Logan
- 6 years ago
- Views:
Transcription
1 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 then there are confused looks and sometimes questions about the feasibility. In the first lecture, we will look at quantum computing from a computer scientist s perspective. Hopefully, we will answer most of the questions people ask after hearing the term Quantum Computing in this process. 1 What is quantum computing? This course is about the theory of quantum computation, i.e., to do computation using quantum systems. These quantum systems follow the rules of quantum mechanics. We want to use the properties of quantum mechanics to solve our problems. Hence, the task is to encode computation (problems+solutions) in a quantum mechanical systems. Before we explain the meaning of the previous paragraph, let us ask a more basic question. Exercise 1. What is computation? In a very informal way, computation is a calculation done by a physical device (computer) in an automated manner. The main idea is: instead of doing calculations on our own, we can use some physical device to do the calculations for us. The physical device (computer) is able to compute because of the laws of nature. In other words, because of the properties of current and voltage, we can implement AND, OR and NOT gates which provide the basic building blocks of a computer. The fundamental idea, any physical law/process can potentially be used to do computation, led to the the origin of quantum computation. An example will help in understanding this deep idea. Suppose there is an insect named Multa which has rings on its body. The number of rings on a Multa depends on the number of rings on its parents. Specifically, if the mother has m rings and the father has n rings then the baby Multa has mn rings. Following the deep idea in the preceding paragraph, we can use Multa to create a computer which can multiply. If we need to multiply m with n. Find two Multas with m and n rings. Whenever Multa mates with the other Multa, the offspring has the required number of rings. So just count the number of rings on the offspring and we will get our answer. We are now ready to answer our original question, Exercise. What is quantum computing? When computation is done using the principles of quantum mechanics, it is called quantum computing. In other words if the computation can be done on a physical device obeying quantum mechanical laws then it is called quantum computing. We will be looking at the potential and limits of this quantum model of computation. Exercise 3. Everything in the world obeys quantum mechanics, then any computation is a quantum computation? We know that classical and quantum laws behave similarly in a large scale systems. It is only in the very small systems where peculiarities of quantum mechanics are visible. So it is understood that quantum computers are useful only when these peculiarities can be exploited to do computation. So we will call a system quantum computer, if it uses these weird properties of quantum mechanics (like superposition and entanglement).
2 Why do we need quantum computing? Church Turing hypothesis is one of the most fundamental assertion in computability theory. It says that any function calculable by a machine can also be computed by a Turing machine. In other words, if a machine can run an algorithm to do a task then there exist another algorithm to do the same task on a Turing machine. Since anything which can be done on a quantum computer can be simulated on a classical computer, this hypothesis is not violated by a quantum computer. This means that anything we can do on a quantum computer can also be done/simulated by a classical computer. Then why do we need quantum computer? Succinctly, because quantum computers might be much faster. The Church-Turing hypothesis was strengthened into Strong Church Turing hypothesis which states that any algorithm, which can be performed on any machine, can be efficiently simulated using a Turing machine. Strong Church-Turing hypothesis has worked for a long time. Still, this hypothesis might face challenges from different models of computation. In other words, it is possible that some weird physical law might compute things much faster than a classical Turing machine. Since we believe that quantum mechanics is the theory of everything around us, it makes sense to have a quantum Turing machine instead of a classical Turing machine. David Deutsch gave the concept of a quantum Turing machine. We don t have any algorithm/task on a quantum computer which violates the Strong Church-Turing hypothesis, but there are examples where the quantum algorithm works much more efficiently than the best known classical algorithm. There is a possibility that we can find an efficient classical algorithm for there problems in future. Exercise 4. Why do we believe that quantum computers can be faster than the normal classical computer? Quantum mechanics has strange properties of superposition and entanglement. Superposition basically says that a quantum system can not only have classical states, but it can also exist in a mixed state (superposition) of these classical states. Because of superposition, we get the property of entanglement. Informally, the state of two systems cannot be described as the product of the state of one system times the state of other system. It is natural to study these properties and their impact on computation. We are now ready to answer the question, what will we be doing in this course? The first part of this course will cover the basics required to understand quantum computing. We will mostly be covering linear algebra and specifically, properties of some special class of matrices. The next part will be focussed on introducing the model of quantum computation. We will talk about postulates of quantum mechanics, thankfully that is all we will need from physics. We will finish by looking at algorithms which have shown that quantum computers can potentially be better than a classical computer. If time permits, the later part of the course will cover the theory of error correction. Unfortunately, we will not be able to cover quantum information theory and quantum cryptography, which are deep and very interesting topics in itself. Though, this course will create the background to learn these topics. We strongly encourage you to read and discuss these topics. Before finishing the introduction, let us talk about the feasibility of a quantum computer. Various doubts have been expressed in building a quantum computer, and some researchers believe that it is not possible to construct one. Till this point, there is no fundamental barrier in making a quantum computer. There are obstacles, stability and scalability being very important, but intensive research has been going on to overcome these barriers. Scientists have been trying to build quantum computers from a long time, to realize quantum computation on a physical device using various techniques. We do not have a desktop quantum computer but there are quantum computers on few qubits and many protocols have been experimentally realized. We will not be covering these areas. Again, students are encouraged to learn more about these topics on their own. As a side note, we will mostly be concerned with the theory of quantum computation and information. It is important on its own, without worrying about a practical quantum computer. Various results have been derived in classical computing using the intuition from quantum computing.
3 3 Deutsch s algorithm We have mentioned that a quantum computer can potentially be faster than a classical computer. Let us start with a very small example, where a quantum computer can perform better than a classical computer. To understand this example, we need to introduce few basic concepts of quantum computing. This will only be a preliminary and superficial introduction just to understand this example. A much more rigorous and formal study of these concepts will be done in this course later. 3.1 Qubits The fundamental unit of computation is a bit on a classical computer. A bit can be in two states, either in 0 or in 1. The analog of a bit on a quantum computer is called a qubit. A qubit can be in the state 0 or 1 (corresponding to the classical states) or even in a superposition of these states. Specifically, the state of a qubit is ψ = α 0 + β 1. Where α, β are complex numbers such that α + β = 1. The symbol is used to represent a state. This particular form of the qubit is motivated from the postulates of quantum mechanics. We will see further justification of it in future. Exercise 5. Why do we have a mathematical equation for a qubit. Shouldn t it be described by a physical object? The states 0 and 1 are called the basis states and the above equation states: any linear combination of the basis states with length 1 is a valid state. While talking about the length of a state, we view it as a vector. Importantly, it is not possible to figure out α, β given a physical qubit in state ψ = α 0 + β 1. We are only allowed to measure the qubit. Let us take an example of a measurement. If we measure in the standard basis, with basis states 0 and 1, then with α probability we will observe state 0 and with β probability we will get state 1. This provides more justification as to why the norm of a state should be 1. Like in the case of classical computing, we use multiple qubits to store the data in a quantum computer. What are the possible states of two qubits? The basis states should be 0 0, 0 1, 1 0 and 1 1. We will identify the state 0 0 with the state 00 and similarly for other basis states. As before, we will say that any linear combination of these states will be a valid state. ψ = α α 01 + α α The length of this state should be 1, so i α i = Operations We have defined states of different parts of the quantum computer. The next step would be, what kind of operations can we perform on this computer? In other words, we are searching for the analog of NOT/AND/NAND/OR gates on a quantum computer. For simplicity, we will only talk about single qubit gates, gates which act on only one qubit. We can define the quantum NOT gate which takes 0 to 1 and 1 to 0. Exercise 6. Is this description sufficient? Since our state space is big, any linear combination of 0 and 1, we need to define the action on the complete state space. Using the postulates of quantum mechanics, this is done linearly. So for a quantum NOT gate, α 0 + β 1 goes to α 1 + β 0. 3
4 Note 1. This means that to specify a quantum gate, we only need to mention its action on the basis elements. Exercise 7. What are the other bases for the state of a quantum bit? Linearity implies that any quantum gate on a single qubit can be written as a matrix (if there are n qubits, then n n matrix). Since any state has unit norm, these matrices should be unitary. This implies that there are infinite possible single qubit gates as compared to finitely many classical gates. Can we realize each of them on a quantum computer? Should we build a quantum computer which has all these gates? Thankfully, It turns out that there are elementary gates which can be composed to perform any possible quantum gate approximately (even for the case of multiple qubit gates). Whether this can be done efficiently, that is a question of great interest. Another interesting single qubit gate is known as Hadamard gate. This is the gate which takes 0 to 1 ( ) and 1 to 1 ( 0 1 ). Exercise 8. Check that this gate is unitary and write the matrix representation of this gate. Linearity in the circuit allows us to apply an operation/function on many inputs simultaneously. Notice that we said apply and not compute. This distinction will be clear after the explanation below, but you should be very careful in drawing conclusions from the next paragraph. Suppose there is a circuit which evaluates f(x) given an input x. The theory of quantum mechanics forces any operation to be reversible. Hence a gate which outputs f(x) on the input x is not a valid quantum gate (Why?). The same objective of computing f(x) can be achieved in multiple ways, one of the possible implementations is given in the diagram below. Fig. 1. Quantum implementation of computing a function To compute the function value on a bit b, we set the control qubit to 0 and the data qubit to b (take a look at the diagram). Exercise 9. What will happen if we feed the state 1 ( ) as the data qubit and 0 as the control qubit to the gate given above? 4
5 The output, by linearity, should be, 1 ( 0, f(0) + 1, f(1) ). It seems that just by calling the gate once, the value of f(0) and f(1) can be computed. Though this does not mean that we can get f(0) and f(1) simultaneously. As mentioned before, the only way to extract information from a quantum state is through a measurement. These measurements will not allow us to compute f(0) and f(1) together. Exercise 10. Read about superposition on internet. It might seem that the principle of superposition (allowing linear combinations of states) is not of much use, we can apply the function on multiple inputs but can only get the answer on one input. As promised, let us finally see the example where superposition can help us perform better than a classical computer. 3.3 The algorithm We will describe Deutsch s algorithm in this section, which will show that a quantum computer can do interesting tasks not possible on a classical computer. Suppose there is a function f from {0, 1} to {0, 1}. We are given a gate (blackbox) which can give us f(b), given an input b. Deutsch s problem is to find whether f(0) = f(1) using minimum number of applications to this gate which computes f. For a classical computer, clearly we need two applications of the gate. In other words, it has to compute both f(0) as well as f(1) to answer Deutsch s question. Exercise 11. Should we give the classical implementation of the function f to the quantum computer or the quantum implementation? We should give the quantum implementation, the reason will be clear later in this course. Let us take the quantum implementation of the function discussed in the previous section. We will set the control qubit to 1 ( ) and data qubit to 1 ( 0 1 ). To ease the notation, we will use subscripts, data qubit by D and control by C. The initial state can be written as, 1 ( 0 D + 1 D ) 1 ( 0 C 1 C ) = 1 ( 0 D( 0 C 1 C ) + 1 D ( 0 C 1 C )). After applying the function, 1 ( 0 D( f(0) C 1 f(0) C ) + 1 D ( f(1) C 1 f(1) C )). If f(0) = f(1) then the first qubit (data) will be in the state 1 ( ), otherwise it will be in state 1 ( 0 1 ). Observe that these states are the output of the Hadamard gate. Exercise 1. What can be done now? Remember that a quantum gate is always reversible. Hence there exists an inverse of Hadamard gate. So we will apply the inverse of Hadamard gate, which is actually Hadamard gate itself, to the first qubit. we get 0 if f(0) = f(1) and 1 otherwise. Hence by measuring the first register, we have solved the problem using just one query to the function. This shows that a quantum computer is faster than a classical computer for the Deutsch s problem. The output of the function f has four possible values, (00, 01, 10, 11). Classically, it was easy to distinguish whether f is (00, 01) or (01, 10). Using quantum mechanics, we were able to distinguish between (00, 11) and (01, 10). The amount of information gathered using one query to the blackbox is only 1 bit. Surprisingly, that information (property of f) is not accessible by a classical computer. You might complain that the problem seems very simple and the speed-up of is not that impressive. This was just a toy example to illustrate how quantum property of superposition can be helpful. Throughout the course, there will be much more interesting problems and more impressive solutions. 5
6 4 Assignment Exercise 13. Read about randomized computing. Is it different from quantum computing? Exercise 14. Read about DNA computing. Exercise 15. Show that a unitary matrix preserves the norm. Exercise 16. Read about Solovay-Kitaev theorem. 6
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
More informationLecture 4: Postulates of quantum mechanics
Lecture 4: Postulates of quantum mechanics Rajat Mittal IIT Kanpur The postulates of quantum mechanics provide us the mathematical formalism over which the physical theory is developed. For people studying
More informationCompute the Fourier transform on the first register to get x {0,1} n x 0.
CS 94 Recursive Fourier Sampling, Simon s Algorithm /5/009 Spring 009 Lecture 3 1 Review Recall that we can write any classical circuit x f(x) as a reversible circuit R f. We can view R f as a unitary
More informationLecture 22: Quantum computational complexity
CPSC 519/619: Quantum Computation John Watrous, University of Calgary Lecture 22: Quantum computational complexity April 11, 2006 This will be the last lecture of the course I hope you have enjoyed the
More informationQuantum Computing: Foundations to Frontier Fall Lecture 3
Quantum Computing: Foundations to Frontier Fall 018 Lecturer: Henry Yuen Lecture 3 Scribes: Seyed Sajjad Nezhadi, Angad Kalra Nora Hahn, David Wandler 1 Overview In Lecture 3, we started off talking about
More informationChapter 1 Review of Equations and Inequalities
Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve
More informationLecture 3: Superdense coding, quantum circuits, and partial measurements
CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 3: Superdense coding, quantum circuits, and partial measurements Superdense Coding January 4, 006 Imagine a situation where two
More informationLecture 3: Constructing a Quantum Model
CS 880: Quantum Information Processing 9/9/010 Lecture 3: Constructing a Quantum Model Instructor: Dieter van Melkebeek Scribe: Brian Nixon This lecture focuses on quantum computation by contrasting it
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 1: Quantum circuits and the abelian QFT
Quantum algorithms (CO 78, Winter 008) Prof. Andrew Childs, University of Waterloo LECTURE : Quantum circuits and the abelian QFT This is a course on quantum algorithms. It is intended for graduate students
More informationModern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur
Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Lecture 02 Groups: Subgroups and homomorphism (Refer Slide Time: 00:13) We looked
More informationIntroduction to Quantum Algorithms Part I: Quantum Gates and Simon s Algorithm
Part I: Quantum Gates and Simon s Algorithm Martin Rötteler NEC Laboratories America, Inc. 4 Independence Way, Suite 00 Princeton, NJ 08540, U.S.A. International Summer School on Quantum Information, Max-Planck-Institut
More information6.896 Quantum Complexity Theory September 18, Lecture 5
6.896 Quantum Complexity Theory September 18, 008 Lecturer: Scott Aaronson Lecture 5 Last time we looked at what s known about quantum computation as it relates to classical complexity classes. Today we
More informationQuantum Computing. Thorsten Altenkirch
Quantum Computing Thorsten Altenkirch Is Computation universal? Alonzo Church - calculus Alan Turing Turing machines computable functions The Church-Turing thesis All computational formalisms define the
More informationQuantum Algorithms. Andreas Klappenecker Texas A&M University. Lecture notes of a course given in Spring Preliminary draft.
Quantum Algorithms Andreas Klappenecker Texas A&M University Lecture notes of a course given in Spring 003. Preliminary draft. c 003 by Andreas Klappenecker. All rights reserved. Preface Quantum computing
More informationLecture 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
More informationLecture 2: From Classical to Quantum Model of Computation
CS 880: Quantum Information Processing 9/7/10 Lecture : From Classical to Quantum Model of Computation Instructor: Dieter van Melkebeek Scribe: Tyson Williams Last class we introduced two models for deterministic
More informationChapter 2. Basic Principles of Quantum mechanics
Chapter 2. Basic Principles of Quantum mechanics In this chapter we introduce basic principles of the quantum mechanics. Quantum computers are based on the principles of the quantum mechanics. In the classical
More informationQuantum Gates, Circuits & Teleportation
Chapter 3 Quantum Gates, Circuits & Teleportation Unitary Operators The third postulate of quantum physics states that the evolution of a quantum system is necessarily unitary. Geometrically, a unitary
More informationsimulations of the Polarization dependence of the light Potential equation in quantum ComPUting
simulations of the Polarization dependence of the light Potential equation in quantum ComPUting bert david Copsey, student author dr. Katharina gillen, research advisor abstract Many methods of quantum
More informationErrata list, Nielsen & Chuang. rrata/errata.html
Errata list, Nielsen & Chuang http://www.michaelnielsen.org/qcqi/errata/e rrata/errata.html Part II, Nielsen & Chuang Quantum circuits (Ch 4) SK Quantum algorithms (Ch 5 & 6) Göran Johansson Physical realisation
More informationLecture 2: Introduction to Quantum Mechanics
CMSC 49: Introduction to Quantum Computation Fall 5, Virginia Commonwealth University Sevag Gharibian Lecture : Introduction to Quantum Mechanics...the paradox is only a conflict between reality and your
More information6.896 Quantum Complexity Theory September 9, Lecture 2
6.96 Quantum Complexity Theory September 9, 00 Lecturer: Scott Aaronson Lecture Quick Recap The central object of study in our class is BQP, which stands for Bounded error, Quantum, Polynomial time. Informally
More informationQuantum Circuits and Algorithms
Quantum Circuits and Algorithms Modular Arithmetic, XOR Reversible Computation revisited Quantum Gates revisited A taste of quantum algorithms: Deutsch algorithm Other algorithms, general overviews Measurements
More informationSeminar 1. Introduction to Quantum Computing
Seminar 1 Introduction to Quantum Computing Before going in I am also a beginner in this field If you are interested, you can search more using: Quantum Computing since Democritus (Scott Aaronson) Quantum
More informationQuantum 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
More informationarxiv:quant-ph/ v1 28 May 1998
Is There a Universal Quantum Computer? Yu Shi Cavendish Laboratory, Madingley Road, Cambridge CB3 0HE, UK (submitted on 25 May 1998) arxiv:quant-ph/9805083v1 28 May 1998 Abstract There is a fatal mistake
More informationLinear Algebra, Summer 2011, pt. 2
Linear Algebra, Summer 2, pt. 2 June 8, 2 Contents Inverses. 2 Vector Spaces. 3 2. Examples of vector spaces..................... 3 2.2 The column space......................... 6 2.3 The null space...........................
More informationTuring Machines and the Church-Turing Thesis
CSE2001, Fall 2006 1 Turing Machines and the Church-Turing Thesis Today our goal is to show that Turing Machines are powerful enough to model digital computers, and to see discuss some evidence for the
More informationSolving with Absolute Value
Solving with Absolute Value Who knew two little lines could cause so much trouble? Ask someone to solve the equation 3x 2 = 7 and they ll say No problem! Add just two little lines, and ask them to solve
More informationGreat Ideas in Theoretical Computer Science. Lecture 28: A Gentle Introduction to Quantum Computation
5-25 Great Ideas in Theoretical Computer Science Lecture 28: A Gentle Introduction to Quantum Computation May st, 208 Announcements Please fill out the Faculty Course Evaluations (FCEs). https://cmu.smartevals.com
More informationIs Quantum Search Practical?
DARPA Is Quantum Search Practical? George F. Viamontes Igor L. Markov John P. Hayes University of Michigan, EECS Outline Motivation Background Quantum search Practical Requirements Quantum search versus
More informationQuantum Computation 650 Spring 2009 Lectures The World of Quantum Information. Quantum Information: fundamental principles
Quantum Computation 650 Spring 2009 Lectures 1-21 The World of Quantum Information Marianna Safronova Department of Physics and Astronomy February 10, 2009 Outline Quantum Information: fundamental principles
More information6.896 Quantum Complexity Theory Oct. 28, Lecture 16
6.896 Quantum Complexity Theory Oct. 28, 2008 Lecturer: Scott Aaronson Lecture 16 1 Recap Last time we introduced the complexity class QMA (quantum Merlin-Arthur), which is a quantum version for NP. In
More informationQuantum Computing. Vraj Parikh B.E.-G.H.Patel College of Engineering & Technology, Anand (Affiliated with GTU) Abstract HISTORY OF QUANTUM COMPUTING-
Quantum Computing Vraj Parikh B.E.-G.H.Patel College of Engineering & Technology, Anand (Affiliated with GTU) Abstract Formerly, Turing Machines were the exemplar by which computability and efficiency
More informationAlgorithms for quantum computers. Andrew Childs Department of Combinatorics & Optimization and Institute for Quantum Computing University of Waterloo
Algorithms for quantum computers Andrew Childs Department of Combinatorics & Optimization and Institute for Quantum Computing University of Waterloo What is a computer? A means for performing calculations
More informationFourier Sampling & Simon s Algorithm
Chapter 4 Fourier Sampling & Simon s Algorithm 4.1 Reversible Computation A quantum circuit acting on n qubits is described by an n n unitary operator U. Since U is unitary, UU = U U = I. This implies
More informationLecture 3: Hilbert spaces, tensor products
CS903: Quantum computation and Information theory (Special Topics In TCS) Lecture 3: Hilbert spaces, tensor products This lecture will formalize many of the notions introduced informally in the second
More informationQuantum Information & Quantum Computation
CS9A, Spring 5: Quantum Information & Quantum Computation Wim van Dam Engineering, Room 59 vandam@cs http://www.cs.ucsb.edu/~vandam/teaching/cs9/ Administrivia Who has the book already? Office hours: Wednesday
More informationLecture 4: Elementary Quantum Algorithms
CS 880: Quantum Information Processing 9/13/010 Lecture 4: Elementary Quantum Algorithms Instructor: Dieter van Melkebeek Scribe: Kenneth Rudinger This lecture introduces several simple quantum algorithms.
More informationPattern Recognition Prof. P. S. Sastry Department of Electronics and Communication Engineering Indian Institute of Science, Bangalore
Pattern Recognition Prof. P. S. Sastry Department of Electronics and Communication Engineering Indian Institute of Science, Bangalore Lecture - 27 Multilayer Feedforward Neural networks with Sigmoidal
More informationMath (P)Review Part I:
Lecture 1: Math (P)Review Part I: Linear Algebra Computer Graphics CMU 15-462/15-662, Fall 2017 Homework 0.0 (Due Monday!) Exercises will be a bit harder / more rigorous than what you will do for the rest
More informationPh 219b/CS 219b. Exercises Due: Wednesday 4 December 2013
1 Ph 219b/CS 219b Exercises Due: Wednesday 4 December 2013 4.1 The peak in the Fourier transform In the period finding algorithm we prepared the periodic state A 1 1 x 0 + jr, (1) A j=0 where A is the
More information6.080/6.089 GITCS May 13, Lecture 24
6.080/6.089 GITCS May 13, 2008 Lecturer: Scott Aaronson Lecture 24 Scribe: Chris Granade 1 Quantum Algorithms Of course the real question is: can quantum computers actually do something more efficiently
More informationIntroductory Quantum Chemistry Prof. K. L. Sebastian Department of Inorganic and Physical Chemistry Indian Institute of Science, Bangalore
Introductory Quantum Chemistry Prof. K. L. Sebastian Department of Inorganic and Physical Chemistry Indian Institute of Science, Bangalore Lecture - 4 Postulates Part 1 (Refer Slide Time: 00:59) So, I
More informationAn Introduction to Quantum Computation and Quantum Information
An to and Graduate Group in Applied Math University of California, Davis March 13, 009 A bit of history Benioff 198 : First paper published mentioning quantum computing Feynman 198 : Use a quantum computer
More informationMetric spaces and metrizability
1 Motivation Metric spaces and metrizability By this point in the course, this section should not need much in the way of motivation. From the very beginning, we have talked about R n usual and how relatively
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Part I Emma Strubell http://cs.umaine.edu/~ema/quantum_tutorial.pdf April 12, 2011 Overview Outline What is quantum computing? Background Caveats Fundamental differences
More informationMAA509: Quantum Computing and Information Introduction
MAA509: Quantum Computing and Information Introduction November 7, 2016 November 7, 2016 1 / 19 Why make computers? Computation by hand is difficult and not very stimulating. Why not make a machine do
More informationIntroduction to Quantum Computation
Chapter 1 Introduction to Quantum Computation 1.1 Motivations The main task in this course is to discuss application of quantum mechanics to information processing (or computation). Why? Education:Asingleq-bitisthesmallestpossiblequantummechanical
More informationStochastic Quantum Dynamics I. Born Rule
Stochastic Quantum Dynamics I. Born Rule Robert B. Griffiths Version of 25 January 2010 Contents 1 Introduction 1 2 Born Rule 1 2.1 Statement of the Born Rule................................ 1 2.2 Incompatible
More informationChapter 10. Quantum algorithms
Chapter 10. Quantum algorithms Complex numbers: a quick review Definition: C = { a + b i : a, b R } where i = 1. Polar form of z = a + b i is z = re iθ, where r = z = a 2 + b 2 and θ = tan 1 y x Alternatively,
More information15 Skepticism of quantum computing
15 Skepticism of quantum computing Last chapter, we talked about whether quantum states should be thought of as exponentially long vectors, and I brought up class BQP/qpoly and concepts like quantum advice.
More informationQuantum Computing. Hans De Raedt Zernike Institute for Advanced Materials University of Groningen, NL
Quantum Computing Hans De Raedt Zernike Institute for Advanced Materials University of Groningen, NL http://www.compphys.org *80. Geburtsdag Prof.Dr. F. Hossfeld und 30 Jarhe HLRZ/NIC This talk Content
More informationSeries, Parallel, and other Resistance
EELE 2310 Analysis Lecture 3 Equivalent s Series, Parallel, Delta-to-Wye, Voltage Divider and Current Divider Rules Dr Hala El-Khozondar Series, Parallel, and other Resistance Equivalent s ١ Overview Series,
More informationSelect/Special Topics in Atomic Physics Prof. P. C. Deshmukh Department of Physics Indian Institute of Technology, Madras
Select/Special Topics in Atomic Physics Prof. P. C. Deshmukh Department of Physics Indian Institute of Technology, Madras Lecture - 9 Angular Momentum in Quantum Mechanics Dimensionality of the Direct-Product
More informationConcepts and Algorithms of Scientific and Visual Computing Advanced Computation Models. CS448J, Autumn 2015, Stanford University Dominik L.
Concepts and Algorithms of Scientific and Visual Computing Advanced Computation Models CS448J, Autumn 2015, Stanford University Dominik L. Michels Advanced Computation Models There is a variety of advanced
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Petros Wallden Lecture 7: Complexity & Algorithms I 13th October 016 School of Informatics, University of Edinburgh Complexity - Computational Complexity: Classification
More information6.080/6.089 GITCS May 6-8, Lecture 22/23. α 0 + β 1. α 2 + β 2 = 1
6.080/6.089 GITCS May 6-8, 2008 Lecturer: Scott Aaronson Lecture 22/23 Scribe: Chris Granade 1 Quantum Mechanics 1.1 Quantum states of n qubits If you have an object that can be in two perfectly distinguishable
More informationLecture 2: Linear operators
Lecture 2: Linear operators Rajat Mittal IIT Kanpur The mathematical formulation of Quantum computing requires vector spaces and linear operators So, we need to be comfortable with linear algebra to study
More information- Why aren t there more quantum algorithms? - Quantum Programming Languages. By : Amanda Cieslak and Ahmana Tarin
- Why aren t there more quantum algorithms? - Quantum Programming Languages By : Amanda Cieslak and Ahmana Tarin Why aren t there more quantum algorithms? there are only a few problems for which quantum
More informationClassical Verification of Quantum Computations
Classical Verification of Quantum Computations Urmila Mahadev UC Berkeley September 12, 2018 Classical versus Quantum Computers Can a classical computer verify a quantum computation? Classical output (decision
More informationReal Analysis Prof. S.H. Kulkarni Department of Mathematics Indian Institute of Technology, Madras. Lecture - 13 Conditional Convergence
Real Analysis Prof. S.H. Kulkarni Department of Mathematics Indian Institute of Technology, Madras Lecture - 13 Conditional Convergence Now, there are a few things that are remaining in the discussion
More informationQuantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras
Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras Lecture - 6 Postulates of Quantum Mechanics II (Refer Slide Time: 00:07) In my last lecture,
More informationCircuit Theory Prof. S.C. Dutta Roy Department of Electrical Engineering Indian Institute of Technology, Delhi
Circuit Theory Prof. S.C. Dutta Roy Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 43 RC and RL Driving Point Synthesis People will also have to be told I will tell,
More information. Here we are using the standard inner-product over C k to define orthogonality. Recall that the inner-product of two vectors φ = i α i.
CS 94- Hilbert Spaces, Tensor Products, Quantum Gates, Bell States 1//07 Spring 007 Lecture 01 Hilbert Spaces Consider a discrete quantum system that has k distinguishable states (eg k distinct energy
More informationQLang: Qubit Language
QLang: Qubit Language Christopher Campbell Clément Canonne Sankalpa Khadka Winnie Narang Jonathan Wong September 24, 24 Introduction In 965, Gordon Moore predicted that the number of transistors in integrated
More informationQuantum Noise. Michael A. Nielsen. University of Queensland
Quantum Noise Michael A. Nielsen University of Queensland Goals: 1. To introduce a tool the density matrix that is used to describe noise in quantum systems, and to give some examples. Density matrices
More informationRichard Cleve David R. Cheriton School of Computer Science Institute for Quantum Computing University of Waterloo
CS 497 Frontiers of Computer Science Introduction to Quantum Computing Lecture of http://www.cs.uwaterloo.ca/~cleve/cs497-f7 Richard Cleve David R. Cheriton School of Computer Science Institute for Quantum
More informationCommunication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi
Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 41 Pulse Code Modulation (PCM) So, if you remember we have been talking
More informationAn Intuitive Introduction to Motivic Homotopy Theory Vladimir Voevodsky
What follows is Vladimir Voevodsky s snapshot of his Fields Medal work on motivic homotopy, plus a little philosophy and from my point of view the main fun of doing mathematics Voevodsky (2002). Voevodsky
More information6.896 Quantum Complexity Theory 30 October Lecture 17
6.896 Quantum Complexity Theory 30 October 2008 Lecturer: Scott Aaronson Lecture 17 Last time, on America s Most Wanted Complexity Classes: 1. QMA vs. QCMA; QMA(2). 2. IP: Class of languages L {0, 1} for
More informationMechanics, Heat, Oscillations and Waves Prof. V. Balakrishnan Department of Physics Indian Institute of Technology, Madras
Mechanics, Heat, Oscillations and Waves Prof. V. Balakrishnan Department of Physics Indian Institute of Technology, Madras Lecture - 21 Central Potential and Central Force Ready now to take up the idea
More informationComplex numbers: a quick review. Chapter 10. Quantum algorithms. Definition: where i = 1. Polar form of z = a + b i is z = re iθ, where
Chapter 0 Quantum algorithms Complex numbers: a quick review / 4 / 4 Definition: C = { a + b i : a, b R } where i = Polar form of z = a + b i is z = re iθ, where r = z = a + b and θ = tan y x Alternatively,
More information1 Continuity and Limits of Functions
Week 4 Summary This week, we will move on from our discussion of sequences and series to functions. Even though sequences and functions seem to be very different things, they very similar. In fact, we
More information1 Computational problems
80240233: Computational Complexity Lecture 1 ITCS, Tsinghua Univesity, Fall 2007 9 October 2007 Instructor: Andrej Bogdanov Notes by: Andrej Bogdanov The aim of computational complexity theory is to study
More informationOpen quantum systems
Chapter 4 Open quantum systems 4. Quantum operations Let s go back for a second to the basic postulates of quantum mechanics. Recall that when we first establish the theory, we begin by postulating that
More informationQuadratic Equations Part I
Quadratic Equations Part I Before proceeding with this section we should note that the topic of solving quadratic equations will be covered in two sections. This is done for the benefit of those viewing
More informationHilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding.
CS 94- Bell States Bell Inequalities 9//04 Fall 004 Lecture Hilbert Space Entanglement Quantum Gates Bell States Superdense Coding 1 One qubit: Recall that the state of a single qubit can be written as
More information6.896 Quantum Complexity Theory November 11, Lecture 20
6.896 Quantum Complexity Theory November, 2008 Lecturer: Scott Aaronson Lecture 20 Last Time In the previous lecture, we saw the result of Aaronson and Watrous that showed that in the presence of closed
More informationQuantum Computation. Michael A. Nielsen. University of Queensland
Quantum Computation Michael A. Nielsen University of Queensland Goals: 1. To eplain the quantum circuit model of computation. 2. To eplain Deutsch s algorithm. 3. To eplain an alternate model of quantum
More informationNothing Here. Fast Quantum Algorithms
Nothing Here Fast Quantum Algorithms or How we learned to put our pants on two legs at a time. Dave Bacon Institute for Quantum Information California Institute of Technology ? A prudent question is one-half
More informationRoberto s Notes on Linear Algebra Chapter 11: Vector spaces Section 1. Vector space axioms
Roberto s Notes on Linear Algebra Chapter 11: Vector spaces Section 1 Vector space axioms What you need to know already: How Euclidean vectors work. What linear combinations are and why they are important.
More informationSemiconductors: Applications in spintronics and quantum computation. Tatiana G. Rappoport Advanced Summer School Cinvestav 2005
Semiconductors: Applications in spintronics and quantum computation Advanced Summer School 1 I. Background II. Spintronics Spin generation (magnetic semiconductors) Spin detection III. Spintronics - electron
More informationComputational Tasks and Models
1 Computational Tasks and Models Overview: We assume that the reader is familiar with computing devices but may associate the notion of computation with specific incarnations of it. Our first goal is to
More informationQuantum Information Processing and Diagrams of States
Quantum Information and Diagrams of States September 17th 2009, AFSecurity Sara Felloni sara@unik.no / sara.felloni@iet.ntnu.no Quantum Hacking Group: http://www.iet.ntnu.no/groups/optics/qcr/ UNIK University
More informationQuantum computing! quantum gates! Fisica dell Energia!
Quantum computing! quantum gates! Fisica dell Energia! What is Quantum Computing?! Calculation based on the laws of Quantum Mechanics.! Uses Quantum Mechanical Phenomena to perform operations on data.!
More informationLecture 21: Quantum communication complexity
CPSC 519/619: Quantum Computation John Watrous, University of Calgary Lecture 21: Quantum communication complexity April 6, 2006 In this lecture we will discuss how quantum information can allow for a
More informationQuantum Communication Complexity
Quantum Communication Complexity Ronald de Wolf Communication complexity has been studied extensively in the area of theoretical computer science and has deep connections with seemingly unrelated areas,
More informationSUPERDENSE CODING AND QUANTUM TELEPORTATION
SUPERDENSE CODING AND QUANTUM TELEPORTATION YAQIAO LI This note tries to rephrase mathematically superdense coding and quantum teleportation explained in [] Section.3 and.3.7, respectively (as if I understood
More informationb) (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
More informationSection 2.7 Solving Linear Inequalities
Section.7 Solving Linear Inequalities Objectives In this section, you will learn to: To successfully complete this section, you need to understand: Add and multiply an inequality. Solving equations (.1,.,
More informationLinear Programming and its Extensions Prof. Prabha Shrama Department of Mathematics and Statistics Indian Institute of Technology, Kanpur
Linear Programming and its Extensions Prof. Prabha Shrama Department of Mathematics and Statistics Indian Institute of Technology, Kanpur Lecture No. # 03 Moving from one basic feasible solution to another,
More information[Refer Slide Time: 00:45]
Differential Calculus of Several Variables Professor: Sudipta Dutta Department of Mathematics and Statistics Indian Institute of Technology, Kanpur Module 1 Lecture No 2 Continuity and Compactness. Welcome
More informationMatrices, Row Reduction of Matrices
Matrices, Row Reduction of Matrices October 9, 014 1 Row Reduction and Echelon Forms In the previous section, we saw a procedure for solving systems of equations It is simple in that it consists of only
More informationDeutsch s Algorithm. Dimitrios I. Myrisiotis. MPLA CoReLab. April 26, / 70
Deutsch s Algorithm Dimitrios I. Myrisiotis MPLA CoReLab April 6, 017 1 / 70 Contents Introduction Preliminaries The Algorithm Misc. / 70 Introduction 3 / 70 Introduction Figure : David Deutsch (1953 ).
More informationTheory of Computation
Theory of Computation Lecture #2 Sarmad Abbasi Virtual University Sarmad Abbasi (Virtual University) Theory of Computation 1 / 1 Lecture 2: Overview Recall some basic definitions from Automata Theory.
More information300-Level Math Courses
300-Level Math Courses Math 250: Elementary Differential Equations A differential equation is an equation relating an unknown function to one or more of its derivatives; for instance, f = f is a differential
More informationMechanics, Heat, Oscillations and Waves Prof. V. Balakrishnan Department of Physics Indian Institute of Technology, Madras
Mechanics, Heat, Oscillations and Waves Prof. V. Balakrishnan Department of Physics Indian Institute of Technology, Madras Lecture 08 Vectors in a Plane, Scalars & Pseudoscalers Let us continue today with
More informationChapter 3 Representations of a Linear Relation
Chapter 3 Representations of a Linear Relation The purpose of this chapter is to develop fluency in the ways of representing a linear relation, and in extracting information from these representations.
More informationVerification of quantum computation
Verification of quantum computation THOMAS VIDICK, CALIFORNIA INSTITUTE OF TECHNOLOGY Presentation based on the paper: Classical verification of quantum computation by U. Mahadev (IEEE symp. on Foundations
More information