Quantum Computing: Foundations to Frontier
|
|
- Reynard Johns
- 5 years ago
- Views:
Transcription
1 Quantum Computing: Foundations to Frontier CSC2451HF/MAT1751HF Lecture 1
2 Welcome! Bird s eye view Administrivia 10 minute break Quantum information basics
3 Welcome! Bird s eye view Administrivia 10 minute break Quantum information basics
4 What you ll get out of this class: Learn the basic principles of quantum information and computation See the principles in action in the most exciting areas of quantum computing Do an in-depth research project into a quantum computing topic you re interested in
5 Target audience Who this class is for: Computer scientists, physicists, mathematicians, chemists, This is a theory-based course People with a solid linear algebra and probability background Who this class is NOT for: People who want to learn how to build a quantum computer People who want to learn quantum physics
6 What is quantum computing? It is computation (and more generally, information processing) based on the principles of quantum mechanics, rather than classical physics. Quantum mechanics is a description of nature at its most fundamental level. Formulated in the early 20 th century to explain the behaviour of subatomic particles. QM, and its specializations (quantum field theory, quantum chromodynamics, etc), have been spectacularly successful in explaining microscopic physical phenomena.
7 The exponentiality of QM After nearly a century of study, the best (classical) methods for predicting the behaviour of general quantum systems require exponential time. The state of N particles requires at least 2 " numbers to describe., = For #~300 (the number of particles in a single uranium atom), 2 " # of atoms in observable universe 10 *+. /. + 1 C +1 Nature seems to be doing extravagant amounts of computation behind the scenes!
8 The exponentiality of QM So how do physicists actually do (quantum) physics? Answer #1: 100+ years of extremely clever approximations and shortcuts for calculations. Bethe ansatz, Feynman diagrams, perturbation theory, mean field approximations, Answer #2: computer simulations Density functional theory, Quantum Markov Chain Monte Carlo,.. Answer #3: studying systems that allow for Answers #1 and #2 above Systems that are mostly classical Systems with non-strongly interacting particles Lucky that most things we ve studied so far fall in this category! But simulating general quantum physics still seems like a hard task
9 The exponentiality of QM In 1981, in his talk titled Simulating Physics with Computers, Richard Feynman asked the following question: Can probabilistic computers simulate quantum mechanics? His conclusion, after a lengthy exploration:..quantum mechanics [doesn t] seem to be imitable by a local classical computer. Instead we need a computer built of quantum mechanical elements which obey quantum mechanical laws. Feynman, along with David Deutsch, Paul Benioff and Yuri Manin, are credited with the idea of computing based on quantum mechanical principles.
10 The early days Feynman s motivation for quantum computers is the most obvious one: simulating quantum systems. (almost tautological!) To physicists in the '80s, this idea might have seemed obvious. To a computer scientist in the 80s, QCs would have seemed like a wild crackpot idea. Also in the 80s, David Deutsch contemplated other applications of quantum computers. Gave an example of a (classical) problem where the parallel universes of QM seem to speed up (by a constant factor) 1992: Dan Simons (UofT PhD!) came up with an example of a problem that could be solved exponentially faster on a QC.
11 Shor s breakthrough 1993: Peter Shor, inspired by Simons algorithm, realized that the same idea could be extended to give an efficient quantum algorithm for the following problem: (Factorization) Given integer N > 0, find integer M > 1 such that M divides N. The security of the RSA cryptosystem (the most widely deployed public-key encryption on the internet) crucially relies on the assumption that factoring integers is hard!
12 Crossroads Since Shor s algorithm, physicists and computer scientists have been faced with three options: 1. Quantum mechanics is wrong. 2. There is a fast classical algorithm for factoring. 3. Quantum computers are more powerful than classical computers. At least one of these must be true!
13 Crossroads Option #1: QM is wrong Perhaps the most successful theory of nature to date. In all its domains of applicability, we have never found experimental disagreement. Option #2: Polynomial-time classical factoring algorithm. RSA has been out for nearly 50 years. There is enormous economic pressure to discover weaknesses, if it exists. The Gauss argument : if the Prince of Mathematics couldn t find it, then it probably doesn t exist.
14 Crossroads Option #3: Quantum computers are more powerful than classical computers. This would refute the Extended Church-Turing Thesis. Church-Turing Thesis: A Turing machine can simulate any effective computation process. Extended Church-Turing Thesis: A probabilistic Turing machine can efficiently simulate any effective computation process. Option #3 would violate the ECT (assuming factoring is classically hard)!
15 Crossroads Since Shor s algorithm, physicists and computer scientists have been faced with three options: 1. Quantum mechanics is wrong. 2. There is a fast classical algorithm for factoring. 3. Quantum computers are more powerful than classical computers. At least one of these must be true!
16 Present day Major advances on many fronts: Experimental/hardware side Quantum algorithms Connections with fundamental physics and pure mathematics Quantum information theory Quantum complexity theory Quantum cryptography and more!
17 Emerging quantum computers IBM, Google, Microsoft are big players racing to build (scalable) quantum computers. Also, startups and academic labs are getting into the game Rigetti Computing, Xanadu.ai, IonQ, Dwave, Harvard/U. Maryland/U. Waterloo/U. Bristol/. Different labs/companies are betting on different horses Superconducting qubits, ion traps, photonic systems, topological qubits, Currently in vogue: superconducting qubits
18 Emerging quantum computers IBM (superconducting qubits) Two 5 qubit and one 16 qubit quantum computers are available on the cloud. Look up IBM Q Experience. You can run programs on their quantum computers using a drag-n-drop interface:
19 Emerging quantum computers Google (superconducting qubits) Built 9 qubit quantum computer in 2016 Announced a 72 qubit quantum computer (called Bristlecone), but has yet to publish results. Microsoft (topological qubits) Topological quantum computing promises a natural way to implement fault-tolerant qubits and gates. Depends on the existence of non-abelian anyons, which are quasiparticles with exotic topological properties.
20 Emerging quantum computers Summary There s a qubit race going on, but qubit count is not everything! Current devices are incredibly noisy. Scaling up (i.e. adding qubits) is a tough engineering challenge, but no fundamental obstacles to building a QC with 106 noiseless qubits. Still, large-scale fault-tolerant QCs look like they re many years away. John Preskill: We are in the NISQ era: Noisy Intermediate-Scale Quantum Noisy devices with ~100 qubits. Not capable of running Shor s algorithm, but should still be capable of solving interesting, hard problems. What interesting problems can we solve on near-term quantum computers?
21 Quantum algorithms Exponential speedups for structured, algebraic problems Factoring (Shor s algorithm) Hidden subgroup problem N = pq Polynomial speedups for unstructured search problems Grover search Exponential speedups for quantum simulation Simulating quantum physics and chemistry (Feynman s dream) Probably the most important application of quantum computers so far!
22 Quantum algorithms Algorithms to be run on near-term QCs: Variational eigensolvers Classical-quantum hybrid algorithms Quantum Machine Learning Linear system solvers/sdps/convex Optimization Quantum neural nets Recommendation systems more What types of problems admit a quantum advantage?
23 Connections with fundamental physics The key to a theory of Quantum Gravity could be quantum entanglement, and quantum error correcting codes. The Blackhole Firewall Paradox is an issue about quantum information, and possible resolutions involve quantum cryptography. What can Quantum Computing tell us about Nature?
24 Uncharted territory
25 Welcome! Bird s eye view Administrivia 10 minute break Quantum information basics
26 This class Foundations Basics of quantum information (today, after the break) Quantum circuit model Essential algorithms (Shor, Grover, ) Entanglement Frontier Applications to physics Quantum machine learning Complexity theory Near-term quantum computing Cryptography
27 Grading 50% Project 40% Problem Sets (~4 psets) I highly suggest partnering up! (no more than groups of 3 please) 10% Participation Lecture scribing (2-3 scribers/lecture) Asking good questions in class Participating in Piazza discussions
28 Class project Frontier topic of your choosing Project proposal is due October 17 Typical format: read a few research papers, synthesize them into a coherent page report and 15 minute presentation Original research encouraged! Other formats: e.g., numerical experiments on IBM s cloud quantum computer Integrate your own research expertise Partner up!
29 Sign up for Piazza Can get to Piazza through course homepage: Use it to find problem set/project partners Class announcements will be on it Use it to ask questions, or post cool stuff you ve found, or ideas you have!
30 Resources Textbook: No official textbook, but here are two very good ones: Links to other courses and notes at:
31 Welcome! Bird s eye view Administrivia 10 minute break Quantum information basics
32 Welcome! Bird s eye view Administrivia 10 minute break Quantum information basics
33 Bits and qubits Simplest classical system: a bit Two distinguishable states: 0 or 1 Representable as a binary switch, electron spin, photon polarization, transistor voltage level, ON OFF
34 Bits and qubits Simplest quantum system: a quantum bit (qubit) Mathematically represented as a complex unit vector in C " : # = * + & " + ( " = 1 &, ( C A qubit can represent classical 0 and 1 states: 0 =. / 1 = /. These are orthogonal states Thus, every qubit # is a superposition of the classical 0 and 1 states: # = & 0 + ( 1 &, ( are called amplitudes. They re like probabilities that can be negative! Intuitively: # is in the 0 and 1 state at the same time!
35 Dirac notation The! notation is called Dirac notation, used to represent quantum states. Mathematically,! ( ket vector ) is a column vector. The dual/hermitian conjugate of column vectors (i.e. row vectors), are called bra vectors :! = -.! = #, & = # 0 + & 1 ket psi bra psi #, & are complex conjugates of #, &. The inner product between two ket vectors! = # 0 + & 1, ( = ) 0 + * 1 is! ( = # ) + & * Notation is helpful for quickly identifying scalars, row and column vectors in complicated expressions. Naming: bra + ket = bracket
36 Measuring a qubit QM Postulate #1: Quantum states are not directly accessible. They must be measured. If you measure (i.e. look at ) a qubit! = # 0 + & 1, you obtain a classical outcome * {0,1} probabilistically: Outcome 0 with probability # / Outcome 1 with probability & / This is called the Born Rule. If you measure the qubit again, you will obtain * with certainty. In other words, the qubit has collapsed to a classical state; the superposition has been destroyed. Quantum information is fragile!
37 Measuring a qubit After, w/ prob. * + = +, 1 1 % = 0 % = After, w/ prob. - + =., % = 1 Before 0
38 Evolution of a qubit i.e. not measured. QM Postulate #2: Quantum states in isolation evolve via unitary operations. A unitary operator acting on a qubit is a square matrix! = # $ that takes unit % & vectors to unit vectors: If ' = 0 1 Equivalent properties: is a unit vector, then! ' = is a unit vector. Preserves inner products: Let ' ( =! ', and ) =! ). Then ' ( ) ( = ' ). The inverse of a unitary! = # $ % & is its conjugate transpose!. = # % $ &.
39 Evolution of a qubit 1 % = 1 1 ' % = Before After ' = 1/ 2 1/ 2 1/ 2 1/ 2
40 A demonstration of quantum weirdness How is a quantum bit different from a probabilistic bit? Experiment A: Let! = 0 and & = ' ( First, apply & to the qubit. Measure the qubit. Apply & again. Measure the qubit What is the distribution of outcomes?
41 A demonstration of quantum weirdness Experiment A 1. Apply! to the qubit.! 0 =! % ) = %/ & %/ & = % & 0 + % & 1. " = 0,! = % & Measure the qubit: Outcome (a): With probability ½, qubit is 0. Outcome (b): With probability ½, qubit is Apply! to the qubit. (a): w.p. ½,! 0 = % 0 + % 1. & & (b): w.p. ½,! 1 = % & 0 + % & Measure the qubit: No matter what the outcome was in Step 2: Final qubit is 0 with probability ½ and 1 with probability ½. Experiment A behaves like a classical randomization operation.
42 A demonstration of quantum weirdness Experiment B: Let! = 0 and & = ' ( First, apply & to the qubit. Measure the qubit. Apply & again. Measure the qubit What is the distribution of outcomes?
43 A demonstration of quantum weirdness Experiment B 1. Apply! to the qubit.! 0 =! % ) = %/ & %/ & = % & 0 + % & 1. " = 0,! = % & Apply! to the qubit.!(! 0 ) =!( % & 0 + % & 1 ) = % & ( % & 0 + % & 1 ) + % & ( % & 0 + % & 1 ) = 1! is a linear operator The zero states cancel out! 4. Measure the qubit: Final qubit is 1 with probability 1! Final outcome is deterministic. This is an example of interference in QM.
44 A demonstration of quantum weirdness Takeaway: Minus signs in the amplitudes matter! Applying multiple unitary operations to a qubit gives rise to a tree of paths between states. 0 Experiment B Each path has an amplitude associated with it. Before measurement, the paths can constructively or destructively interfere with each other! In classical probability theory, paths have positive weight that can only add.
45 A demonstration of quantum weirdness Takeaway: Intermediate measurements destroy superpositions and prevent interference! Measurements make qubits become classical. 0 Experiment A Takeaway: to see quantum effects, delay measurements for as long as possible. This is why it is hard to see quantum effects in everyday life. Measurement is constantly happening Intermediate measurements prevent interference.
46 Composite quantum systems The state of a qubit lives in the vector space C ". Also called the Hilbert space of a qubit. For our (finite-dimensional) purposes, Hilbert space = complex vector space with inner product. The Hilbert space of 2 qubits is the tensor product space C " C " C " has orthonormal basis 0, 1. The tensor product space C " C " C * is 4-dimensional, with orthonormal basis 0 0 = = = = Shorthand: +, = +, = +,. This basis represents the classical states of the two qubits.
47 Composite quantum systems! ( Tensor product of vectors: if! = # 0 + & 1, and ( = ) 0 + * 1, then the state of the two qubits together is! ( = # 0 + & 1 ) 0 + * 1! ( = #) #* &) &* 1 1 = #) 00 + #* 01 + &) 10 + &* 11 shorthand = #) #* &) &* written explicitly as a vector in C -
48 Composite quantum systems A two qubit state! is a unit vector in C # C # :! = /,0 1 /0 2 4 /,0 1 /0 # = 1 In general, a two-qubit state cannot be written as a tensor product state! % ' for one-qubit states %, ' C #. States that cannot be written in product form are called entangled. Otherwise, they are unentangled. We will talk much more about entanglement in the next class. Taking inner products in C # C # : let ), *, +,, C # ) * ( +, ) = ) + *,
49 Composite quantum systems Measuring two-qubit states! = $ %& () C - C - : Obtain classical outcome (, ) 0,1 - - with probability $ %&. The post-measurement state of! is then () Partial measurements: what if we only want to measure the first qubit? - Obtain classical outcome ( 0,1 with probability 2 % = & $ %&. The post-measurement state conditioned on outcome ( is then! % = 1 3 $ 2 %& () = ( 1 3 $ % & 2 %& ) % & Exercise: doing a partial measurement on the first qubit, followed by a partial measurement on the second qubit, yields same distribution of outcomes as doing a full, one-shot measurement.
50 Composite quantum systems Two-qubit systems in isolation undergo evolution via unitary operators acting on C " C ". Reminder: unitary operators preserve the l " norm/preserve inner products/is inverse to its conjugate transpose. Tensor product of unitaries: Let % = ' (( ' (" ' "( ' "", * = + (( + (" + "( + "" be one-qubit unitaries. Applying % to the left qubit and * to the right qubit, from the perspective of the larger system, corresponds to the unitary (in block matrix form) % * = ' ((* ' (" * ' "( * ' "" * Again, most two-qubit unitaries are not product operators; they are entangling.
51 The No-Cloning Theorem Classical bits are easily copied. Quantum information is different. Statement: There is no quantum Xerox machine. Formally: there is no unitary! acting on two qubits such that for all one-qubit states ".!( " 0 ) = " " ancilla qubit A proof: Any quantum Xerox machine must also act as a classical Xerox machine. However, classical Xerox machines cannot copy general quantum states.
52 The No-Cloning Theorem Let! be the two-qubit classical copying unitary that acts as follows: for " 0,1. Equivalently:! " 0 = " "! " 1 = " " 1! = This unitary has a special name: it is called CNOT (for controlled-not )
53 The No-Cloning Theorem * -, 0 = -, - * -, 1 = -, - 1 Let s try to copy! = # $ using *: *! 0 = 1 2 * 00 + * 10 = !! This is a very important state known as the EPR pair (or Bell pair, or maximally entangled state). QED.
54 Composite quantum systems Tensor product spaces (more general) Let! ",! $,,! ' be an orthonormal basis for C ' and * ", * $,, * + be an orthonormal basis for C +. The tensor product space C ' C + is - / dimensional with orthonormal basis! 0 * 1 The inner product on C ' C + is defined as: Warning:! 3 * l (! 0 * 1 ) =! 3! 0 * l * 1 = 9 1 ; = <, l = = 0?. A. When multiplying tensor products of vectors, match up the slots. But not when adding! For example: ( B C ) + ( E F ) ( B + E ) ( C + F )
55 The exponentiality of QM, redux QM Postulate #3: if the states of systems A and B are! C $, ' C ), respectively, then the joint state of AB is! ' C $ C ). This means that the joint state of + qubits is represented as a vector in C, - C,/ : Each additional qubit doubles the dimensionality of the Hilbert space. Applying a unitary 0 to an +-qubit state! appears to be doing exponentially many computations in parallel:! = 2 3 4,5 / ! = 2 3 4,5 /
56 The exponentiality of QM, redux Nature is doing an incredible amount of work for us. However, this extravagance is hidden behind the veil of measurement. We can only access the exponential information stored in! in a limited way. This leads to a fundamental tension in quantum information: The exponentiality vs fragility of quantum states This tension makes quantum information and computation very subtle, mysterious, and extremely interesting.
57 Holevo s Theorem An important mathematical result that captures this tension. Informal statement: one cannot reliably store! bits of classical information in less than! qubits. Formally: Let " <!. Alice gets a uniformly random string $ 0,1 ), and sends an " qubit state * + to Bob, who applies a measurement to obtain a string, 0,1 ). For any encoding/decoding strategy of Alice and Bob, 0 $:, " * + C./ $ 0,1 ), 0,1 )
58 Next time Quantum entanglement Bell games Certifiable quantum random dice Teleportation Superdense coding Density matrices
Unitary evolution: this axiom governs how the state of the quantum system evolves in time.
CS 94- Introduction Axioms Bell Inequalities /7/7 Spring 7 Lecture Why Quantum Computation? Quantum computers are the only model of computation that escape the limitations on computation imposed by the
More informationIntroduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871
Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Lecture 1 (2017) Jon Yard QNC 3126 jyard@uwaterloo.ca TAs Nitica Sakharwade nsakharwade@perimeterinstitute.ca
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 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 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 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 informationLecture 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
More informationQuantum Computers. Peter Shor MIT
Quantum Computers Peter Shor MIT 1 What is the difference between a computer and a physics experiment? 2 One answer: A computer answers mathematical questions. A physics experiment answers physical questions.
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Petros Wallden Lecture 1: Introduction 18th September 2017 School of Informatics, University of Edinburgh Resources 1. Quantum Computation and Quantum Information by Michael
More informationIntroduction to Quantum Computing for Folks
Introduction to Quantum Computing for Folks Joint Advanced Student School 2009 Ing. Javier Enciso encisomo@in.tum.de Technische Universität München April 2, 2009 Table of Contents 1 Introduction 2 Quantum
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 informationTutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction
Tutorial on Quantum Computing Vwani P. Roychowdhury Lecture 1: Introduction 1 & ) &! # Fundamentals Qubits A single qubit is a two state system, such as a two level atom we denote two orthogonal states
More informationLecture 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 informationThe Future. Currently state of the art chips have gates of length 35 nanometers.
Quantum Computing Moore s Law The Future Currently state of the art chips have gates of length 35 nanometers. The Future Currently state of the art chips have gates of length 35 nanometers. When gate lengths
More informationQuantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139
Quantum Error Correcting Codes and Quantum Cryptography Peter Shor M.I.T. Cambridge, MA 02139 1 We start out with two processes which are fundamentally quantum: superdense coding and teleportation. Superdense
More informationChallenges in Quantum Information Science. Umesh V. Vazirani U. C. Berkeley
Challenges in Quantum Information Science Umesh V. Vazirani U. C. Berkeley 1 st quantum revolution - Understanding physical world: periodic table, chemical reactions electronic wavefunctions underlying
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 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 informationLogic gates. Quantum logic gates. α β 0 1 X = 1 0. Quantum NOT gate (X gate) Classical NOT gate NOT A. Matrix form representation
Quantum logic gates Logic gates Classical NOT gate Quantum NOT gate (X gate) A NOT A α 0 + β 1 X α 1 + β 0 A N O T A 0 1 1 0 Matrix form representation 0 1 X = 1 0 The only non-trivial single bit gate
More informationQuantum Computing. Quantum Computing. Sushain Cherivirala. Bits and Qubits
Quantum Computing Bits and Qubits Quantum Computing Sushain Cherivirala Quantum Gates Measurement of Qubits More Quantum Gates Universal Computation Entangled States Superdense Coding Measurement Revisited
More informationQuantum Computing 101. ( Everything you wanted to know about quantum computers but were afraid to ask. )
Quantum Computing 101 ( Everything you wanted to know about quantum computers but were afraid to ask. ) Copyright Chris Lomont, 2004 2 67 1 = 193707721 761838257287 Took American Mathematician Frank Nelson
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 informationSome Introductory Notes on Quantum Computing
Some Introductory Notes on Quantum Computing Markus G. Kuhn http://www.cl.cam.ac.uk/~mgk25/ Computer Laboratory University of Cambridge 2000-04-07 1 Quantum Computing Notation Quantum Computing is best
More information1 Measurements, Tensor Products, and Entanglement
Stanford University CS59Q: Quantum Computing Handout Luca Trevisan September 7, 0 Lecture In which we describe the quantum analogs of product distributions, independence, and conditional probability, and
More information1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation
QSIT09.V01 Page 1 1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation What is quantum mechanics good for? traditional historical perspective: beginning of 20th century: classical
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 informationShort Course in Quantum Information Lecture 2
Short Course in Quantum Information Lecture Formal Structure of Quantum Mechanics Course Info All materials downloadable @ website http://info.phys.unm.edu/~deutschgroup/deutschclasses.html Syllabus Lecture
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 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 informationquantum mechanics is a hugely successful theory... QSIT08.V01 Page 1
1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation What is quantum mechanics good for? traditional historical perspective: beginning of 20th century: classical physics fails
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 informationCS257 Discrete Quantum Computation
CS57 Discrete Quantum Computation John E Savage April 30, 007 Lect 11 Quantum Computing c John E Savage Classical Computation State is a vector of reals; e.g. Booleans, positions, velocities, or momenta.
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 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 informationQuantum Effect or HPC without FLOPS. Lugano March 23, 2016
Quantum Effect or HPC without FLOPS Lugano March 23, 2016 Electronics April 19, 1965 2016 D-Wave Systems Inc. All Rights Reserved 2 Moore s Law 2016 D-Wave Systems Inc. All Rights Reserved 3 www.economist.com/technology-quarterly/2016-03-12/aftermoores-law
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 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 informationQUANTUM COMPUTING & CRYPTO: HYPE VS. REALITY ABHISHEK PARAKH UNIVERSITY OF NEBRASKA AT OMAHA
QUANTUM COMPUTING & CRYPTO: HYPE VS. REALITY ABHISHEK PARAKH UNIVERSITY OF NEBRASKA AT OMAHA QUANTUM COMPUTING: I CAN SUM IT UP IN ONE SLIDE Pure Magic! 2 SERIOUSLY: HOW DOES IT WORK? That s simple: Even
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 informationAdiabatic quantum computation a tutorial for computer scientists
Adiabatic quantum computation a tutorial for computer scientists Itay Hen Dept. of Physics, UCSC Advanced Machine Learning class UCSC June 6 th 2012 Outline introduction I: what is a quantum computer?
More informationIntroduction to Quantum Information, Quantum Computation, and Its Application to Cryptography. D. J. Guan
Introduction to Quantum Information, Quantum Computation, and Its Application to Cryptography D. J. Guan Abstract The development of quantum algorithms and quantum information theory, as well as the design
More informationCSCI 2570 Introduction to Nanocomputing. Discrete Quantum Computation
CSCI 2570 Introduction to Nanocomputing Discrete Quantum Computation John E Savage November 27, 2007 Lect 22 Quantum Computing c John E Savage What is Quantum Computation It is very different kind of computation
More informationThe Reality of Quantum Computing
The Reality of Quantum Computing Now and in the Future @qant Christoph Lameter Jump Trading LLC Great Expectations But the current state: Wild West Funding: Governments see a chance to win
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 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 informationThe Relativistic Quantum World
The Relativistic Quantum World A lecture series on Relativity Theory and Quantum Mechanics Marcel Merk University of Maastricht, Sept 24 Oct 15, 2014 Relativity Quantum Mechanics The Relativistic Quantum
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 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 informationINTRODUCTION TO QUANTUM COMPUTING
INTRODUCTION TO QUANTUM COMPUTING Writen by: Eleanor Rieffel and Wolfgang Polak Presented by: Anthony Luaders OUTLINE: Introduction Notation Experiment Quantum Bit Quantum Key Distribution Multiple Qubits
More informationDiscrete Quantum Theories
Discrete Quantum Theories Andrew J. Hanson 1 Gerardo Ortiz 2 Amr Sabry 1 Yu-Tsung Tai 3 (1) School of Informatics and Computing (2) Department of Physics (3) Mathematics Department Indiana University July
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 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 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 informationIntroduction to Quantum Computing
Introduction to Quantum Computing Einar Pius University of Edinburgh Why this Course To raise interest in quantum computing To show how quantum computers could be useful To talk about concepts not found
More informationImplementing Competitive Learning in a Quantum System
Implementing Competitive Learning in a Quantum System Dan Ventura fonix corporation dventura@fonix.com http://axon.cs.byu.edu/dan Abstract Ideas from quantum computation are applied to the field of neural
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 informationINTRODUCTORY NOTES ON QUANTUM COMPUTATION
INTRODUCTORY NOTES ON QUANTUM COMPUTATION Keith Hannabuss Balliol College, Oxford Hilary Term 2009 Notation. In these notes we shall often use the physicists bra-ket notation, writing ψ for a vector ψ
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 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 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 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 information*WILEY- Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co.
Joachim Stolze and Dieter Suter Quantum Computing A Short Course from Theory to Experiment Second, Updated and Enlarged Edition *WILEY- VCH WILEY-VCH Verlag GmbH & Co. KGaA Contents Preface XIII 1 Introduction
More informationCryptography in a quantum world
T School of Informatics, University of Edinburgh 25th October 2016 E H U N I V E R S I T Y O H F R G E D I N B U Outline What is quantum computation Why should we care if quantum computers are constructed?
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 informationQuantum Computing. Part I. Thorsten Altenkirch
Quantum Computing Part I Thorsten Altenkirch Is Computation universal? Alonzo Church - calculus Alan Turing Turing machines computable functions The Church-Turing thesis All computational formalisms define
More informationQuantum Information Processing
Quantum Information Processing Harry Buhrman CWI & University of Amsterdam Physics and Computing Computing is physical Miniaturization quantum effects Quantum Computers 1) Enables continuing miniaturization
More informationQubits vs. bits: a naive account A bit: admits two values 0 and 1, admits arbitrary transformations. is freely readable,
Qubits vs. bits: a naive account A bit: admits two values 0 and 1, admits arbitrary transformations. is freely readable, A qubit: a sphere of values, which is spanned in projective sense by two quantum
More information1. Basic rules of quantum mechanics
1. Basic rules of quantum mechanics How to describe the states of an ideally controlled system? How to describe changes in an ideally controlled system? How to describe measurements on an ideally controlled
More informationLecture 11 September 30, 2015
PHYS 7895: Quantum Information Theory Fall 015 Lecture 11 September 30, 015 Prof. Mark M. Wilde Scribe: Mark M. Wilde This document is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike
More informationQuantum decoherence. Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, Quantum decoherence p. 1/2
Quantum decoherence p. 1/2 Quantum decoherence Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, 2007 Quantum decoherence p. 2/2 Outline Quantum decoherence: 1. Basics of quantum
More informationReversible and Quantum computing. Fisica dell Energia - a.a. 2015/2016
Reversible and Quantum computing Fisica dell Energia - a.a. 2015/2016 Reversible computing A process is said to be logically reversible if the transition function that maps old computational states to
More informationSecrets of Quantum Information Science
Secrets of Quantum Information Science Todd A. Brun Communication Sciences Institute USC Quantum computers are in the news Quantum computers represent a new paradigm for computing devices: computers whose
More informationQuantum 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
More informationQUANTUM COMPUTER SIMULATION
Chapter 2 QUANTUM COMPUTER SIMULATION Chapter 1 discussed quantum computing in non-technical terms and in reference to simple, idealized physical models. In this chapter we make the underlying mathematics
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 informationBasics on quantum information
Basics on quantum information Mika Hirvensalo Department of Mathematics and Statistics University of Turku mikhirve@utu.fi Thessaloniki, May 2014 Mika Hirvensalo Basics on quantum information 1 of 49 Brief
More informationPhysics is becoming too difficult for physicists. David Hilbert (mathematician)
Physics is becoming too difficult for physicists. David Hilbert (mathematician) Simple Harmonic Oscillator Credit: R. Nave (HyperPhysics) Particle 2 X 2-Particle wave functions 2 Particles, each moving
More informationSummary of Hyperion Research's First QC Expert Panel Survey Questions/Answers. Bob Sorensen, Earl Joseph, Steve Conway, and Alex Norton
Summary of Hyperion Research's First QC Expert Panel Survey Questions/Answers Bob Sorensen, Earl Joseph, Steve Conway, and Alex Norton Hyperion s Quantum Computing Program Global Coverage of R&D Efforts
More informationBasics on quantum information
Basics on quantum information Mika Hirvensalo Department of Mathematics and Statistics University of Turku mikhirve@utu.fi Thessaloniki, May 2016 Mika Hirvensalo Basics on quantum information 1 of 52 Brief
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 informationQuantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co. KGaA
Joachim Stolze and Dieter Suter Quantum Computing A Short Course from Theory to Experiment Second, Updated and Enlarged Edition WILEY- VCH WILEY-VCH Verlag GmbH & Co. KGaA Preface XIII 1 Introduction and
More informationEntanglement and Quantum Teleportation
Entanglement and Quantum Teleportation Stephen Bartlett Centre for Advanced Computing Algorithms and Cryptography Australian Centre of Excellence in Quantum Computer Technology Macquarie University, Sydney,
More information)j > Riley Tipton Perry University of New South Wales, Australia. World Scientific CHENNAI
Riley Tipton Perry University of New South Wales, Australia )j > World Scientific NEW JERSEY LONDON. SINGAPORE BEIJING SHANSHAI HONG K0N6 TAIPEI» CHENNAI Contents Acknowledgments xi 1. Introduction 1 1.1
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 informationQuantum Supremacy and its Applications
Quantum Supremacy and its Applications HELLO HILBERT SPACE Scott Aaronson (University of Texas at Austin) USC, October 11, 2018 Based on joint work with Lijie Chen (CCC 2017, arxiv:1612.05903) and on forthcoming
More informationShort introduction to Quantum Computing
November 7, 2017 Short introduction to Quantum Computing Joris Kattemölle QuSoft, CWI, Science Park 123, Amsterdam, The Netherlands Institute for Theoretical Physics, University of Amsterdam, Science Park
More informationQuantum Computers. Todd A. Brun Communication Sciences Institute USC
Quantum Computers Todd A. Brun Communication Sciences Institute USC Quantum computers are in the news Quantum computers represent a new paradigm for computing devices: computers whose components are individual
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 informationCryptography in the Quantum Era. Tomas Rosa and Jiri Pavlu Cryptology and Biometrics Competence Centre, Raiffeisen BANK International
Cryptography in the Quantum Era Tomas Rosa and Jiri Pavlu Cryptology and Biometrics Competence Centre, Raiffeisen BANK International Postulate #1: Qubit state belongs to Hilbert space of dimension 2 ψ
More informationQuantum Communication
Quantum Communication Harry Buhrman CWI & University of Amsterdam Physics and Computing Computing is physical Miniaturization quantum effects Quantum Computers ) Enables continuing miniaturization ) Fundamentally
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 informationA review on quantum teleportation based on: Teleporting an unknown quantum state via dual classical and Einstein- Podolsky-Rosen channels
JOURNAL OF CHEMISTRY 57 VOLUME NUMBER DECEMBER 8 005 A review on quantum teleportation based on: Teleporting an unknown quantum state via dual classical and Einstein- Podolsky-Rosen channels Miri Shlomi
More informationDEVELOPING A QUANTUM CIRCUIT SIMULATOR API
ACTA UNIVERSITATIS CIBINIENSIS TECHNICAL SERIES Vol. LXVII 2015 DOI: 10.1515/aucts-2015-0084 DEVELOPING A QUANTUM CIRCUIT SIMULATOR API MIHAI DORIAN Stancu Ph.D. student, Faculty of Economic Sciences/Cybernetics
More information2. Introduction to quantum mechanics
2. Introduction to quantum mechanics 2.1 Linear algebra Dirac notation Complex conjugate Vector/ket Dual vector/bra Inner product/bracket Tensor product Complex conj. matrix Transpose of matrix Hermitian
More informationQuantum computing. Jan Černý, FIT, Czech Technical University in Prague. České vysoké učení technické v Praze. Fakulta informačních technologií
České vysoké učení technické v Praze Fakulta informačních technologií Katedra teoretické informatiky Evropský sociální fond Praha & EU: Investujeme do vaší budoucnosti MI-MVI Methods of Computational Intelligence(2010/2011)
More informationQuantum 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
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 informationEntanglement. arnoldzwicky.org. Presented by: Joseph Chapman. Created by: Gina Lorenz with adapted PHYS403 content from Paul Kwiat, Brad Christensen
Entanglement arnoldzwicky.org Presented by: Joseph Chapman. Created by: Gina Lorenz with adapted PHYS403 content from Paul Kwiat, Brad Christensen PHYS403, July 26, 2017 Entanglement A quantum object can
More information6.080 / Great Ideas in Theoretical Computer Science Spring 2008
MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationAn Introduction to Quantum Information. By Aditya Jain. Under the Guidance of Dr. Guruprasad Kar PAMU, ISI Kolkata
An Introduction to Quantum Information By Aditya Jain Under the Guidance of Dr. Guruprasad Kar PAMU, ISI Kolkata 1. Introduction Quantum information is physical information that is held in the state of
More information