Introduction to Quantum Computation
|
|
- Beverley Hodge
- 5 years ago
- Views:
Transcription
1 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 system. Just a few q-bits are enough to describe (almost) everything that is known. Science:Acollectionofeven0q-bitsiswelldefined,butpoorly understood. Analysis of such systems can bring you to frontiers of (theoretical and experimental) physics. Engineering: Quantum computer is not science fiction, but a technological challenge History (1930 s s) Development of classical computers hypothetical computer (universal Turing machine) foundation of computer science (Church-Turing thesis) modeling of a computer (von Neumann) information theory (Shannon) development of transistors (Bardeen, Brattain, Shockley) 1
2 CHAPTER 1. INTRODUCTION TO QUANTUM COMPUTATION (1950 s s) Production of classical computers commercial computers (IBM) high level programming language (Fortran) internet (ARPAnet), etc. (1970 s) Development of experimental techniques single atom trapping (trapping of small quantum systems) scanning tunneling microscope (moving around small quantum systems) electronic devices to transfer single electrons, etc. (1980 s s) Development of theoretical basis for quantum computes hard to simulate quantum systems (Feynman) non-cloning theorem (Wooters, Zurek) quantum cryptography (Bennett, Bassard) universal quantum computer (Deutsch) factoring algorithm (Shor) search algorithm (Grover) 1.1. Big picture Crisis of the 19th century classical physics gave birth to three types of 0th century physics QuantumPhysics:usuallythestudyofnatureofsmallscales. (last, this and next semester) (000 s-010 s) Production of small noncommercial quantum computers StatisticalMechanics:usuallythestudyofnatureonintermediate scales. (last semester) GeneralRelativity:usuallythestudyofnatureonlargescales. (next semester)
3 CHAPTER 1. INTRODUCTION TO QUANTUM COMPUTATION 3 For the past century quantum mechanics was applied to almost everything with enormous success, but QuantumFieldTheory:givesasatisfactorydescriptionofonly perturbative physics on small scales. QuantumStatisticalMechanics:givesasatisfactorydescription of only equilibrium physics on intermediate scales. QuantumGravity: gives a satisfactory description of physics on large scales. Crisis of the 0th century quantum physics is likely to give birth to some new theories, but it remain unclear what these theories will be. StringTheory/StringFluids? Supersymmetry/Supergravity? QuantumComputation/Information? Whatever it is one should expect it to include all of the 19th and 0th century physics (i.e. perturbative, equilibrium) and perhaps more (e.g. non-perturbative, non-equilibrium) Q-bit High-EnergyPhysics(e.g. quantum chromodynamics) Cosmology(e.g. eternal inflation) GeneralRelativity(e.g. black holes) CondensedMatter(e.g. superfluids) Biophysics(e.g. polymers) Classical bit can be in one of two states which can be parametrized (or labeled) by 0 or 1. In contrast quantum bit (or qubit, or q-bit) can be in (uncountably) many states which can be parametrized by complex numbers α and β such that α + β = α α + β β = Re(α) + Im(α) + Re(β) + Im(β) =1. (1.1) The reason for the above constraint will become clear shortly. For now note that this implies that the configuration space (or Hilbert space) or a single q-bit is isomorphic to S 3.
4 CHAPTER 1. INTRODUCTION TO QUANTUM COMPUTATION 4 The construction of quantum systems usually (but not always) starts with defining a Hilbert space with vectors (also known as ket vectors) are denoted by Greek letters (e.g. ψ, φ, etc.)andareoftenwrittenusing Dirac notations (e.g. ψ, φ, etc.). The smallest possible quantum system (or a single q-bit) consists of only two basis vectors denoted by 0 and 1 (known as computational basis) and all other vectors are constructed from linear combinations of these vectors (or superposition state) ψ = α 0 + β 1 (1.) where α and β are complex numbers. Furthermore, one defines inner product ( ψ, φ ) =(α 0 + β 1,γ 0 + δ 1 ) α γ + β δ (1.3) and demands that all physical states correspond to vectors with unit norm ψ ( ψ, ψ ) =α α + β β =1. (1.4) (compare with Eq. (1.1)). Note that the inner product can be used to define bra-vectors ψ, as amapfromket-vectorstocomplexnumbers, ψ ( φ ) ( ψ, φ ) (1.5) and the bra-vectors together with ket-vectors can be used to define outer product ψ φ, asamapfromket-vectorstoket-vectors, ψ φ ( χ ) =( φ, χ ) ψ (1.6) Upon measurement of the ket-vector ψ = α 0 + β 1 one can only get classical values of bits (i.e. 0 or 1) withprobabilities p(0) = α α (1.7) p(1) = β β (1.8) so that probabilities add up to one. Clearly most of the (infinite) information about the state is lost after measurement, but by constructing a clever state and designing a clever measurement one can learn relevant information. This is what quantum computation is all about.
5 CHAPTER 1. INTRODUCTION TO QUANTUM COMPUTATION 5 Consider the following parametrization of the state of a single q-bit ( ψ = e iγ cos θ 0 + eiϕ sin θ ) 1 (1.9) with γ [0, π),ϕ [0, π) and θ (0,π]. Itturnsoutthatthe overall phase γ is unobservable which reduces the configuration space of S 3 to only S parametrized by spherical coordinates (θ, φ). This is the so-called Bloch sphere which is nothing but a Hopf fibration of S 3 into S with fiber S 1.NogeneralizationoftheBlochsphereexistformany q-bits, but it turns out that Hopf fibration play an important role for the system of two and three q-bits. Consider a system with two classical bits with only four possible states {00, 01, 10, 11}. Then the Hilbert space of two q-bits has four basis vectors (denotes by 00, 01, 10 and 11 ) and arbitrary ket-vector is represented by superposition with normalization ψ = α α α α (1.10) ψ x {0,1} α x = x {0,1} α x α x =1. (1.11) An important example of a state of two q-bits is the Bell state or EPR state (1.1) Upon measurement of only a single bit (let s say the first bit) the system with end up in either state ψ = α α α00 + α 01 (1.13) with probability or state p(0) = α 00 + α 01 (1.14) ψ = α α α10 + α 11 (1.15) with probability p(1) = α 10 + α 11. (1.16) (Note, that if we measured the state but did not look at the result of the measurement, then the system is not in a pure state, but in a mixed state described by density matrix ρ = p(0) ψ ψ + p(1) ψ ψ.)
6 CHAPTER 1. INTRODUCTION TO QUANTUM COMPUTATION 6 1. Quantum Computation 1..1 Single q-bit gate Classical information carried by classical bits are manipulated using classical logic gates and quantum information is manipulated using quantum gates. For a single classical bit the only non-trivial gate is the NOT gate given by the following truth table a NOT a (1.17) and the quantum NOT gate is given by or as an operator X X : α 0 + β 1 β 0 + α 1. (1.18) X(α 0 + β 1 ) =( )(α 0 + β 1 ) =β 0 + α 1. (1.19) In the matrix representation the ket-vectors are given by column vectors ( ) α α 0 + β 1 (1.0) β bra-vectors are given by row vectors α 0 + β 1 ( α β ) (1.1) and quantum gates are given by square matrices ( U00 U U U U U U 10 U 11 ) (1.) For example quantum NOT gate is given by ( 0 1 X = ). (1.3) The only constraint on the quantum gates is that they must be unitary U U = I. (1.4)
7 CHAPTER 1. INTRODUCTION TO QUANTUM COMPUTATION 7 Clearly the quantum NOT gate satisfies the unitarity condition ( )( ) ( ) X X = = = I (1.5) but (in contrast to classical case) there are many others. Some important gates are the Z gate ( ) 1 0 Z (1.6) 0 1 and the Hadamard gate H 1 ( ). (1.7) These quantum gates act on a general state as described in the table below X : α 0 + β 1 β 0 + α 1 (1.8) Z : α 0 + β 1 α 0 β 1 (1.9) H : α 0 + β 1 (α + β) (α β) (1.30) 1.. Multiple q-bits gates Classical gates are summarized as follows:
8 CHAPTER 1. INTRODUCTION TO QUANTUM COMPUTATION 8 Truth tables are given by. NOT: AND: OR a NOT a a b aandb a b aorb (1.31) (1.3) (1.33)
9 CHAPTER 1. INTRODUCTION TO QUANTUM COMPUTATION 9 XOR NAND a b axorb a b anandb (1.34) (1.35) NOR XNOR a b anorb a b axorb (1.36) (1.37) It can be shown by direct construction that NAND and NOR gates are universal (i.e. arbitrary gate can be constructed out of only NAND gates or out of only NOR gates). For example, NOT(a) = ananda aandb = (anandb) NAND(aNANDb) aorb = (ananda) NAND(bNANDb) anorb = ((ananda) NAND(bNANDb)) NAND((aNANDa) NAND(bNANDb)) axorb = ((anand(anandb)) NAND(bNAND(aNANDb)) anorb = ((anand(anandb)) NAND(bNAND(aNANDb)) NAND ((anand(anandb)) NAND(bNAND(aNANDb))
10 CHAPTER 1. INTRODUCTION TO QUANTUM COMPUTATION 10 Hilbert space of multiple q-bit is formed by tensor product. For example a ket vector of two q-bits can be represented by a four component column vector ψ = α α α α α 00 α 01 α 10 α 11 (1.38) Quantum gates for two q-bits are unitary four-by-four matrices. For example, CNOT (or controlled NOT)gate is given by U CNOT = (1.39) such that a, b a, a b (1.40) where is sum module two. It can be shown that the CNOT gate and single q-bit gates form a universal set of quantum gates in quantum computing similar to how NAND and NOR gates are universal in classical computing. The CNOT gate can be generalized to create a controlled U gate from arbitrary U gate. Quantum circuit is built from a collection of quantum gates. For example, a, b a, a b (1.41) a (a b),a b = b, a b b, (a b) b = b, a
11 CHAPTER 1. INTRODUCTION TO QUANTUM COMPUTATION 11 Note that unitarity of quantum mechanics puts restrictions onquantum circuits. In particular the two q-bits cannot be looped nor copied. Suppose we try to copy first q-bit ψ = α 0 + β 1 (1.4) into second q-bit (whose initial state without loss of generality may be 0 ) sothatthecombinedstateis ψ 0 = α 00 + β 10. (1.43) After applying the CNOT gate we seem to have copied the classical bit but not the q-bit ψ which would have given us α 00 + β 11 (1.44) ψ ψ = (α 0 + β 1 )(α 0 + β 1 ) (1.45) = α 00 + αβ 01 + αβ 10 + β 11. Unless αβ =0the q-bit was not copied which is in agreement with the so-called non-cloning theorem (proved only in early 80 s). An important class of Bell states can be formed by applying thehadamard gate to the first q-bits which is then used as a control but for the second q-bit a, b β ab 0,b +( 1)a 1,b 1 (1.46)
12 CHAPTER 1. INTRODUCTION TO QUANTUM COMPUTATION Quantum Teleportation Let us assume that Alice and Bob have q-bits a and b that are in state β 00. Now let say Alice want to send to Bob an arbitrary q-bit c which can be written as ψ = α 0 + β 1 (1.47) which can be teleported using the following quantum circuit. Then the overall initial state is ψ 0 =(α 0 + β 1 ) 1 ( ) (1.48) after CNOT gate ψ 1 = 1 (α 0 ( )+β 1 ( )) (1.49) after Hadamard gate ψ = 1 (α ( )( )+β ( 0 1 )( ))(1.50) = 1 ( 00 (α 0 + β 1 )+ 01 (α 1 + β 0 )) + 1 ( 10 (α 0 β 1 )+ 11 (α 1 β 0 )). Then Alice can measure both q-bits (c and a) andsendtheresultofmeasurements M 1 and M to Bob. What Bob must do to recover the original unknown state ψ is to pass his own bit through M of X gates and M 1 of Z gates.
13 CHAPTER 1. INTRODUCTION TO QUANTUM COMPUTATION Superdense coding Let us assume that Alice and Bob have q-bits a and b that are in the same state β 00,butnowAlicewantstosendBobtwobitsofclassicalinformation. Depending of what the two bits are she can perform a certain transformation on her bit I if x =00 Z if x =01 U(x) = X if x =10 iy if x =11 then the final state is ( where ) ( ) U(x)β 00 = ( ) ( ) 0 i i i = = β 00 if x = = = β 10 if x = = = β 01 if x = = = β 11 if x =11 β ab 0,b +( 1)a 1,b 1 (1.51) are the Bell states. Then the Alice can send her q-bit and Bob should be able to recover both classical bits since all of Bell states are orthogonal. Indeed CNOT (with the first q-bit being control bit)followed by Hadamard gate on the first q-bit gives us HU CNOT ( ) = H ( ) = 00 ( ) ( ) HU CNOT = H = 10 ( ) ( ) HU CNOT = H = 01 ( ) ( ) HU CNOT = H = 11
14 CHAPTER 1. INTRODUCTION TO QUANTUM COMPUTATION Quantum Algorithms Classical computation To show that one can preform classical computations on quantum computer it is sufficient to show that one can simulate NAND and FANOUT gates using unitary transformations. This can be accomplished using Toffoli gate with truth table Then NAND is given by a b c a b c ab (1.5) and FANOUT is given by
15 CHAPTER 1. INTRODUCTION TO QUANTUM COMPUTATION Quantum parallelism. The main advantage of quantum computation is that superposition states (of computational basis) can be used to simultaneously evaluate the same function at different values. For example, consider a binary function f : {0, 1} {0, 1}. (1.53) Let say we built a circuit which evaluates with function, i.e. U f : x, y x, y f(x) (1.54) then ( ) ,f(0) + 1,f(1) U f 0 =. (1.55) Deutsch s algorithm We now implement a simple algorithm to demonstrate how quantum circuits can outperform classical ones.
16 CHAPTER 1. INTRODUCTION TO QUANTUM COMPUTATION 16 Then the initial state ψ 0 = 01 (1.56) after passing through Hadamard gates ψ 1 = 1 ( )( 0 1 ) (1.57) after U f ψ = 1 ( ( 1) f(0) 0 ( 0 1 )+( 1) f(1) 1 ( 0 1 ) ) (1.58) or ψ = 1 ( ) 1 ( 0 1 ) if f(0) = f(1) = 0 1 ( ) 1 ( 0 1 ) if f(0) = f(1) = 1 1 ( 0 1 ) 1 ( 0 1 ) if f(0) f(1) = 1 1 ( 0 1 ) 1 ( 0 1 ) if f(0) f(1) = 0 (1.59) and after running the first bit through Hadamard gate 0 1 ( 0 1 ) if f(0) = f(1) = ψ 3 = ( 0 1 ) if f(0) = f(1) = ( 0 1 ) if f(0) f(1) = ( 0 1 ) if f(0) f(1) = 0 (1.60) However and we can rewrite f(0) f(1) = 0 f(0) = f(1) (1.61) ψ 3 = ± f(0) f(1) 1 ( 0 1 ). (1.6)
17 CHAPTER 1. INTRODUCTION TO QUANTUM COMPUTATION 17 Thus by measuring the first q-bit we can find out a global property of our function (i.e. f(0) f(1)) withonlyasingleevaluationoff(x). Aclassical computer would require at least two evaluations Deutsch-Jozsa Algorithm Using quantum parallelism even functions of many bits f : {0, 1} n {0, 1} (1.63) can be evaluated using essentially the same quantum gate (1.54) where x is now a multicomponent (or multi-bit) vector. In general the transformation of Hadamard gates is described by H n y = n ( 1) x y x (1.64) x {0,1} n and thus the superposition state can be prepared from 0 n by passing through Hadamard gates, H n 0 = n x. (1.65) x {0,1} n Then we can generalize the Deutsch circuit to multiple input gates ψ 0 = (1.66) ( ) ψ 1 = n 0 1 (1.67) x {0,1} n x ψ = n ( 1) f(x) x x {0,1} n ψ 3 = n z {0,1} n ( ) 0 1 x {0,1} n ( 1) x z+f(x) z (1.68) ( ) 0 1. (1.69) Now let us suppose that we know for sure that f is either constant f(x) =constant (1.70) or balanced x {0,1} n f(x) = n 1. (1.71)
18 CHAPTER 1. INTRODUCTION TO QUANTUM COMPUTATION 18 Then, assuming f(x) is constant, if we measure the query bits and if, we would get zero for the first n bits (the last bit is in state 0 1 and need not be measured) with amplitude { 0 n ( 1) x 0+f(x) +1 if f(x) =0 0 = (1.7) 1 if f(x) =1 x {0,1} n and thus due to normalization n x {0,1} n ( 1) x 0+f(x) 0 = { +1 if f(x) =0 1 if f(x) =1. (1.73) On the other hand if f(x) is balanced, we would get zero for all bits with amplitude 0 n x {0,1} n ( 1) x 0+f(x) 0 = =0 (1.74) Thus if we get zero for all n bits the function must be constant and if we get at least one bit nonzero the function must be balance. To run the same test on the function using classical computers would require not one, but (in the worst case scenario) n 1 +1evaluations of the function.
Seminar 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 informationSingle qubit + CNOT gates
Lecture 6 Universal quantum gates Single qubit + CNOT gates Single qubit and CNOT gates together can be used to implement an arbitrary twolevel unitary operation on the state space of n qubits. Suppose
More informationQuantum information and quantum computing
Middle East Technical University, Department of Physics January 7, 009 Outline Measurement 1 Measurement 3 Single qubit gates Multiple qubit gates 4 Distinguishability 5 What s measurement? Quantum measurement
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 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 information2.0 Basic Elements of a Quantum Information Processor. 2.1 Classical information processing The carrier of information
QSIT09.L03 Page 1 2.0 Basic Elements of a Quantum Information Processor 2.1 Classical information processing 2.1.1 The carrier of information - binary representation of information as bits (Binary digits).
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 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 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 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 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 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 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 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 information10.2 Introduction to quantum information processing
AS-Chap. 10-1 10. Introduction to quantum information processing AS-Chap. 10-10. Introduction to Information Processing Information General concept (similar to energy) Many forms: Mechanical, thermal,
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 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: 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 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 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 information6.2 Introduction to quantum information processing
AS-Chap. 6. - 1 6. Introduction to quantum information processing 6. Introduction to information processing AS-Chap. 6. - Information General concept (similar to energy) Many forms: Mechanical, thermal,
More informationCS/Ph120 Homework 1 Solutions
CS/Ph0 Homework Solutions October, 06 Problem : State discrimination Suppose you are given two distinct states of a single qubit, ψ and ψ. a) Argue that if there is a ϕ such that ψ = e iϕ ψ then no measurement
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 information10.2 Introduction to quantum information processing
AS-Chap. 10-1 10. Introduction to quantum information processing 10. Introduction to information processing AS-Chap. 10 - Information General concept (similar to energy) Many forms: Mechanical, thermal,
More informationChapter 10. Superconducting Quantum Circuits
Chapter 10 Superconducting Quantum Circuits 10.1 Motivation AS-Chap. 10-2 Repetition: current-phase and voltage-phase relation are classical, but have quantum origin (macroscopic quantum model) primary
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 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 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 informationIntroduction to Quantum Computing. Lecture 1
Introduction to Quantum Computing Lecture 1 1 OUTLINE Why Quantum Computing? What is Quantum Computing? History Quantum Weirdness Quantum Properties Quantum Computation 2 Why Quantum Computing? 3 Transistors
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 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 informationUnitary 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 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 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 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 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 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 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 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. 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 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 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 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 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 information4th year Project demo presentation
4th year Project demo presentation Colm Ó héigeartaigh CASE4-99387212 coheig-case4@computing.dcu.ie 4th year Project demo presentation p. 1/23 Table of Contents An Introduction to Quantum Computing The
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 informationQuantum Computation: From Quantum Teleportation to the Shor s Algorithm
Quantum Computation: From Quantum Teleportation to the Shor s Algorithm J. J. Ruiz-Lorenzo Dep. Física, Universidad de Extremadura Instituto de Computación Científica Avanzada de Extremadura (ICCAEx) http://www.eweb.unex.es/eweb/fisteor/juan
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 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 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 Information Processing
Quantum Information Processing Jonathan Jones http://nmr.physics.ox.ac.uk/teaching The Information Age Communication Shannon Computation Turing Current approaches are essentially classical which is wrong
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 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
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 informationAn Introduction to Quantum Information and Applications
An Introduction to Quantum Information and Applications Iordanis Kerenidis CNRS LIAFA-Univ Paris-Diderot Quantum information and computation Quantum information and computation How is information encoded
More informationTeleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters)
Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters) Rahul Jain U. Waterloo and Institute for Quantum Computing, rjain@cs.uwaterloo.ca entry editor: Andris Ambainis
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 informationArchitecture. Chapter 5. Noson S. Yanofsky c March 24, 2007
Chapter 5 Architecture Noson S. Yanofsky c March 4, 007 noson@sci.brooklyn.cuny.edu From the intrinsic evidence of his creation, the Great Architect of the Universe now begins to appear as a pure mathematician.
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 informationAdvanced Cryptography Quantum Algorithms Christophe Petit
The threat of quantum computers Advanced Cryptography Quantum Algorithms Christophe Petit University of Oxford Christophe Petit -Advanced Cryptography 1 Christophe Petit -Advanced Cryptography 2 The threat
More informationIntroduction to Quantum Information Hermann Kampermann
Introduction to Quantum Information Hermann Kampermann Heinrich-Heine-Universität Düsseldorf Theoretische Physik III Summer school Bleubeuren July 014 Contents 1 Quantum Mechanics...........................
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 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 informationInstantaneous Nonlocal Measurements
Instantaneous Nonlocal Measurements Li Yu Department of Physics, Carnegie-Mellon University, Pittsburgh, PA July 22, 2010 References Entanglement consumption of instantaneous nonlocal quantum 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 2016 Mika Hirvensalo Basics on quantum information 1 of 52 Brief
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 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 informationChapter 13: Photons for quantum information. Quantum only tasks. Teleportation. Superdense coding. Quantum key distribution
Chapter 13: Photons for quantum information Quantum only tasks Teleportation Superdense coding Quantum key distribution Quantum teleportation (Theory: Bennett et al. 1993; Experiments: many, by now) Teleportation
More informationQuantum Computer. Jaewan Kim School of Computational Sciences Korea Institute for Advanced Study
Quantum Computer Jaewan Kim jaewan@kias.re.kr School of Computational Sciences Korea Institute for Advanced Study KIAS (Korea Institute for Advanced Study) Established in 1996 Located in Seoul, Korea Pure
More informationPhysics ; CS 4812 Problem Set 4
Physics 4481-7681; CS 4812 Problem Set 4 Six problems (six pages), all short, covers lectures 11 15, due in class 25 Oct 2018 Problem 1: 1-qubit state tomography Consider a 1-qubit state ψ cos θ 2 0 +
More informationC/CS/Phys 191 Quantum Gates and Universality 9/22/05 Fall 2005 Lecture 8. a b b d. w. Therefore, U preserves norms and angles (up to sign).
C/CS/Phys 191 Quantum Gates and Universality 9//05 Fall 005 Lecture 8 1 Readings Benenti, Casati, and Strini: Classical circuits and computation Ch.1.,.6 Quantum Gates Ch. 3.-3.4 Universality Ch. 3.5-3.6
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 informationLecture: Quantum Information
Lecture: Quantum Information Transcribed by: Crystal Noel and Da An (Chi Chi) November 10, 016 1 Final Proect Information Find an issue related to class you are interested in and either: read some papers
More informationLecture 6: Quantum error correction and quantum capacity
Lecture 6: Quantum error correction and quantum capacity Mark M. Wilde The quantum capacity theorem is one of the most important theorems in quantum hannon theory. It is a fundamentally quantum theorem
More informationQuantum Computing Lecture 3. Principles of Quantum Mechanics. Anuj Dawar
Quantum Computing Lecture 3 Principles of Quantum Mechanics Anuj Dawar What is Quantum Mechanics? Quantum Mechanics is a framework for the development of physical theories. It is not itself a physical
More informationC/CS/Phys C191 Quantum Gates, Universality and Solovay-Kitaev 9/25/07 Fall 2007 Lecture 9
C/CS/Phys C191 Quantum Gates, Universality and Solovay-Kitaev 9/25/07 Fall 2007 Lecture 9 1 Readings Benenti, Casati, and Strini: Quantum Gates Ch. 3.2-3.4 Universality Ch. 3.5-3.6 2 Quantum Gates Continuing
More informationIntroduction to Quantum Error Correction
Introduction to Quantum Error Correction Nielsen & Chuang Quantum Information and Quantum Computation, CUP 2000, Ch. 10 Gottesman quant-ph/0004072 Steane quant-ph/0304016 Gottesman quant-ph/9903099 Errors
More informationAn introduction to Quantum Computing using Trapped cold Ions
An introduction to Quantum Computing using Trapped cold Ions March 10, 011 Contents 1 Introduction 1 Qubits 3 Operations in Quantum Computing 3.1 Quantum Operators.........................................
More informationA Gentle Introduction to Quantum Computing
A Gentle Introduction to Quantum Computing Abdullah Khalid 01-10-0168 School of Science and Engineering Lahore University of Management Sciences Friday 3 rd June, 011 Contents 1 Introduction to Quantum
More informationQuantum Teleportation Pt. 1
Quantum Teleportation Pt. 1 PHYS 500 - Southern Illinois University April 17, 2018 PHYS 500 - Southern Illinois University Quantum Teleportation Pt. 1 April 17, 2018 1 / 13 Types of Communication In the
More informationIntroduction to Quantum Information Processing
Introdction to Qantm Information Processing Lectre 5 Richard Cleve Overview of Lectre 5 Review of some introdctory material: qantm states, operations, and simple qantm circits Commnication tasks: one qbit
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 cryptography. Quantum cryptography has a potential to be cryptography of 21 st century. Part XIII
Quantum cryptography Part XIII Quantum cryptography Quantum cryptography has a potential to be cryptography of st century. An important new feature of quantum cryptography is that security of quantum cryptographic
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 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 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 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 informationQUANTUM INFORMATION -THE NO-HIDING THEOREM p.1/36
QUANTUM INFORMATION - THE NO-HIDING THEOREM Arun K Pati akpati@iopb.res.in Instititute of Physics, Bhubaneswar-751005, Orissa, INDIA and Th. P. D, BARC, Mumbai-400085, India QUANTUM INFORMATION -THE NO-HIDING
More informationQuantum Computation. Alessandra Di Pierro Computational models (Circuits, QTM) Algorithms (QFT, Quantum search)
Quantum Computation Alessandra Di Pierro alessandra.dipierro@univr.it 21 Info + Programme Info: http://profs.sci.univr.it/~dipierro/infquant/ InfQuant1.html Preliminary Programme: Introduction and Background
More informationUnitary Dynamics and Quantum Circuits
qitd323 Unitary Dynamics and Quantum Circuits Robert B. Griffiths Version of 20 January 2014 Contents 1 Unitary Dynamics 1 1.1 Time development operator T.................................... 1 1.2 Particular
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 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 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 informationQuantum Computing. 6. Quantum Computer Architecture 7. Quantum Computers and Complexity
Quantum Computing 1. Quantum States and Quantum Gates 2. Multiple Qubits and Entangled States 3. Quantum Gate Arrays 4. Quantum Parallelism 5. Examples of Quantum Algorithms 1. Grover s Unstructured Search
More informationHow quantum computation gates can be realized in terms of scattering theory approach to quantum tunneling of charge transport
ISSN: 2347-3215 Volume 3 Number 3 (March-2015) pp. 62-66 www.ijcrar.com How quantum computation gates can be realized in terms of scattering theory approach to quantum tunneling of charge transport Anita
More informationFactoring on a Quantum Computer
Factoring on a Quantum Computer The Essence Shor s Algorithm Wolfgang Polak wp@pocs.com Thanks to: Eleanor Rieffel Fuji Xerox Palo Alto Laboratory Wolfgang Polak San Jose State University, 4-14-010 - p.
More informationThe information content of a quantum
The information content of a quantum A few words about quantum computing Bell-state measurement Quantum dense coding Teleportation (polarisation states) Quantum error correction Teleportation (continuous
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 informationIntroduction to Quantum Computing
Introduction to Quantum Computing The lecture notes were prepared according to Peter Shor s papers Quantum Computing and Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a
More informationINTRODUCTION TO QUANTUM ALGORITHMS, POROTOCOLS AND COMPUTING
INTRODUCTION TO QUANTUM ALGORITHMS, POROTOCOLS AND COMPUTING Jozef Gruska Faculty of Informatics Brno Czech Republic September 7, 23 Quantum computing - Fall 23, I. Introduction 1. INTRODUCTION In the
More information