Quantum Computing 1. Multi-Qubit System. Goutam Biswas. Lect 2
|
|
- Annis Lane
- 5 years ago
- Views:
Transcription
1 Quantum Computing 1 Multi-Qubit System
2 Quantum Computing State Space of Bits The state space of a single bit is {0,1}. n-bit state space is {0,1} n. These are the vertices of the n-dimensional hypercube.
3 Quantum Computing 3 State Space of Qubits The state space of a single qubit is a -dimensional vector space over C. It is written as a 0 +b 1 where a,b C, such that a + b = 1 and { 0, 1 } are orthonormal base vectors. The state space of n-qubit system is a n -dimensional vector space over C. It is the tensor product of n copies of the single qubit spaces.
4 Quantum Computing 4 State Space Postulate A closed quantum mechanical system can be modelled as a vector space with inner product - it is a Hilbert Space. Each state of the system is a unit vector of the space.
5 Quantum Computing 5 Tensor Product R R 3 We start with an example. Consider -dimensional and 3-dimensional vector spaces over reals - R and R 3. The tensor product of these two spaces is a vector space of dimension 3 = 6. It is denoted by R R 3.
6 Quantum Computing 6 Tensor Product R R 3 The standard basis for R and R 3 are B = {(1,0),(0,1)} and B 3 = {(1,0,0),(0,1,0),(0,0,1)} respectively. Six elements of B B 3 forms a basis of R R 3. They are {(1,0) (1,0,0),(1,0) (0,1,0),(1,0) (0,0,1),(0,1) (1,0,0),(0,1) (0,1,0),(0,1) (0,0,1)}.
7 Quantum Computing 7 Tensor Product R R 3 Let (a,b) = a(1,0)+b(0,1) R and (p,q,r) = p(1,0,0)+q(0,1,0)+r(0,0,1) R 3. The tensor product (a,b) (p,q,r) = ap(1,0) (1,0,0)+aq(1,0) (0,1,0)+ar(1,0) (0,0,1)+bp(0,1) (1,0,0)+bq(0,1) (0,1,0)+br(0,1) (0,0,1).
8 Quantum Computing 8 We may view Tensor Product of R R 3 B B 3 = {(1,0),(0,1)} {(1,0,0),(0,1,0),(0,0,1)} {[ ] [ ] } 1 0 = [1,0,0],, [0,0,1] = = {[ 0 1[1,0,0] 0[1,0,0] {[ ] [,, ],, 1 0[0,0,1] 1[0,0,1] ]} [ ]} It may also be viewed as column vectors..
9 Quantum Computing 9 Tensor Product of R R 3 B B 3 = {(1,0,0,0,0,0),(0,1,0,0,0,0),(0,0,1,0,0,0), (0,0,0,1,0,0),(0,0,0,0,1,0),(0,0,0,0,0,1)}. So, (a,b) (p,q,r) = ap(1,0,0,0,0,0)+ aq(0,1,0,0,0,0)+ar(0,0,1,0,0,0)+ bp(0,0,0,1,0,0)+bq(0,0,0,0,1,0)+ br(0,0,0,0,0,1) = (ap,aq,ar,bp,bq,br).
10 Quantum Computing 10 Note 1. Every element of R R 3 is not a tensor product of the vectors of R and R 3 i.e. not of the the form (a,b) (p,q,r).. An example: (,4,6,8,10,1) R R 3, but there is no (a,b) R and (p,q,r) R 3 such that (a,b) (p,q,r) = (ap,aq,ar,bp,bq,br) = (,4,6,8,10,1).
11 Quantum Computing 11 Note 3. If possible, then ap aq = 4 p q = 1. But bp bq = 8 10 p q = a contradiction. 4. Every element of R R 3 is a linear combination of vectors of the form (a,b) (p,q,r).
12 Quantum Computing 1 Definition: Tensor Product Let A and B be two inner product spaces over a field F with base E a = { a 1,, a m } and E b = { b 1,, b n } respectively. The tensor product of A and B is an mn-dimensional inner product space with the base E a b = { a i b j : 1 i m,1 j n}.
13 Quantum Computing 13 Notation If a A and b B, then a b is also written as a b, a,b, or ab. A shorter notation for = 0110.
14 Quantum Computing 14 Notation Let E a = { a 1, a } and E b = { b 1, b }. Consider two vectors a = α 1 a 1 +α a A and b = β 1 b 1 +β b. Their tensor product a b = ab = (α 1 a 1 +α a ) (β 1 b 1 +β b ) = α 1 β 1 a 1 b 1 + α 1 β a 1 b +α β 1 a b 1 +α β a b.
15 Quantum Computing 15 Notation Consider the qubit space V = C with standard pair of base vectors 0, 1. The n-times tensor product of V, n {}}{ V V = V n = (C ) n has n standard base vectors, b 1 b n, where b 1,,b n {0,1}. Using the decimal notation the set of basis can be written as { 0, 1,, n 1 }.
16 Quantum Computing 16 Properties Let α F, a, a A and b, b B 1. α( a b ) = (α a ) b = a (α b ).. ( a + a ) b = ( a b )+( a b ). 3. a ( b + b ) = ( a b )+( a b ).
17 Quantum Computing 17 Inner product The inner product on A B (if both A and B are inner product spaces) is defined as follows: Inner product of a b with a b is defined as ( a b ) ( a b ) = ( a a )( b b ).
18 Quantum Computing 18 Orthonormal Basis We know that the set of basis { a 1,. a m } of an inner product space A is orthonormal if a i a j = δ ij.
19 Quantum Computing 19 Standard Basis We consider standard basis of a -qubit system - { 00, 01, 10, 11 }. Inner product of two of them b i b j and b k b l is b k b l b i b j = b k b i b l b j = 1 if b k = b i and b l = b j, 0 otherwise. So this is an orthonormal basis.
20 Quantum Computing 0 Hadamard Standard Basis We choose the Hadamard basis for the first first qubit and standard basis for the second qubit. So the basis of the -qubit system is B HS = { +, } { 0, 1 } = { +0, +1, 0, 1 }.
21 Quantum Computing 1 Hadamard Standard Basis +0 = 1 ( ) 0 = 1 ( ) +1 = 1 ( ) 1 = 1 ( ) Similarly other two base vectors can be constructed.
22 Quantum Computing Hadamard Standard Basis is Orthonormal Inner product of +0 with itself is 1 ( ) 1 ( ) = 1 ( ) = 1 ( ) = 1
23 Quantum Computing 3 Hadamard Standard Basis is Orthonormal Inner product of +0 with +1 is 1 ( ) 1 ( ) = 1 ( ) = 1 ( ) = 0 So B HS is orthonormal.
24 Quantum Computing 4 Bell Basis Φ + = 1 ( ), Φ = 1 ( ), Ψ + = 1 ( ), Ψ = 1 ( ).
25 Quantum Computing 5 Bell Basis is Orthonormal Inner product of Φ + with itself. = ( 1 ( )) ( 1 ( )) = 1 ( ) = 1 ( ) = 1.
26 Quantum Computing 6 Bell Basis is Orthonormal Inner product of Φ + with Φ. = ( 1 ( )) ( 1 ( )) = 1 ( ) = 1 ( ) = 0.
27 Quantum Computing 7 Phase Factor The concept of global phase is similar to the single qubit system with the only difference that the phase factor may be attached to any of the component vectors of the tensor product. So we have (e iφ a ) b = e iφ ( a b ) = a ) (e iφ b ), representing the same state.
28 Quantum Computing 8 Phase Factor The concept of relative phase is also similar to the single qubit system. Note that though e iφ a and a are equivalent states, e iφ a + b and a + b are not be equivalent.
29 Quantum Computing 9 Separable and Entangled States We have already shown that every vector of R R 3 cannot be expressed as a tensor product of vectors of R and R 3. This is true for tensor product of qubit spaces. We consider two -qubit states, ψ = 1 ( ) and Φ + = 1 ( ).
30 Quantum Computing 30 Separable and Entangled States The state ψ can be decomposed into the tensor product of two 1-qubit state - 1 ( ) 0. These types of states are known as separable.
31 Quantum Computing 31 Separable and Entangled States But Φ + cannot be decomposed in that way. If possible, let Φ + = (a 0 +b 1 ) (c 0 +d 1 ) = ac 00 +ad 01 +bc 10 +bd 11. But ad = 0 implies that a = 0 or d = 0. That makes either ac = 0 or bd = 0 - a contradiction. These types of states are known as entangled stater.
32 Quantum Computing 3 Separable and Entangled States If we perform a measurement in standard computational basis, on the second qubit of ψ = 1 ( ), we get a 0 with probability 1 and the state remains unchanged.
33 Quantum Computing 33 Separable and Entangled States If we perform a similar measurement on the second qubit of Φ + = 1 ( ), we get 0 or 1 with equal probability 1. But the outcome of this experiment also determines the first qubit with certainty - so the -qubit state changes. If two qubits in entangled state are separated out, taken far apart and one of them is measured, the outcome of the measurement on the other qubit is known.
34 Quantum Computing 34 Entanglement and Decomposition Consider the decomposition of 4-qubit state u = 1 ( ) to 4 i=1 (a i 0 +b i 1 ). Such a decomposition must satisfy, a 1 a a 3 a 4 = a 1 a b 3 b 4 = b 1 b 1 a 3 a 4 = b 1 b b 3 b 4 = 1/ and a 1 a a 3 b 4 = 0 - which is impossible. So u is an entangled state with respect to 1-qubit decomposition.
35 Quantum Computing 35 Entanglement and Decomposition But u = 1 ( ) is equal to Φ + Φ +. So u is separable in -qubit decomposition.
36 Quantum Computing 36 Direct Sum of Vector Spaces Consider the m and n-dimensional vector spaces A and B over a field F, with the corresponding bases E a and E b respectively. The direct sum of A and B is an (m + n)-dimensional vector space with the base E a E b. The space is written as A B. Any vector x A B can be written as x = a b, where a A and b B.
37 Quantum Computing 37 Direct Sum R R 3 The basis of R R 3 is B B 3 = {(1,0),(0,1),(1,0,0),(0,1,0),(0,0,1)}. Each of these base vectors is viewed as 5-dimensional vector i.e {(1,0,0,0,0),(0,1,0,0,0), (0,0,1,0,0),(0,0,0,1,0),(0,0,0,0,1)} where the first two components are for R and the last three components are for R 3. Addition and scalar multiplications are defined in a natural way.
38 Quantum Computing 38 Measurement Postulate Let B = { b i } i I is orthonormal basis for the state space V A of a system A. A von Neumann measurement on a state x = i I a i b i will output a real value v i with the the probability a i. The system will be in the state b i after the measurement.
39 Quantum Computing 39 Measurement Postulate Let the state space V A V C be a tensor product of V A with basis B = { b i } i I (orthonormal) and V C with basis D = { d j } j J (with unit norm). A von Neumann measurement of a state x = i,j a ij b i d j on the space V A will give a value v ij with the probability a ij. The system will be in the state b i d j after the measurement.
40 Quantum Computing 40 Multi-Qubit Measurement We have already stated that for a single-qubit system the every measuring device has an orthonormal basis B = { b 1, b } for the associated vector space V of 1-qubit states. Each element of B generates an 1-dimensional subspace, V 1 = a 1 b 1 and V = a b, where a 1,a C, such that V = V 1 V.
41 Quantum Computing 41 Multi-Qubit Measurement The n -dimensional vector space V corresponding to an n-qubit system is decomposed by a measuring device into k n orthogonal subspaces V 1,,V k so that V = V 1 V k.
42 Quantum Computing 4 Multi-Qubit Measurement Any n-qubit state x V on measurement on this device chooses a subspaces V i with a probability p i = a i, where a i is the amplitude of x in V i. So we have x = a 1 x 1 + +a k x k, where x i is the unit vector in the subspace V i.
43 Quantum Computing 43 Example 1 The device measures the first qubit state of a -qubit system in standard basis. Let V the state space of the -qubit system. We decompose V = V 1 V where V 1 is the space spanned by { 00, 01 } and V is the space spanned by { 10, 11 }. In other words V 1 = 0 W and V = 1 W, where W is 1-qubit state space.
44 Quantum Computing 44 Example 1 The state of a -qubit system is ψ = a a a 10 +a 3 11 where a 0 + a 1 + a + a 3 = 1. We rewrite the state as ψ = b 1 ψ 1 +b ψ, where ψ 1 V 1 and ψ V, b 1 = a 0 + a 1 and b = a + a 3.
45 Quantum Computing 45 Example 1 So, ψ 1 = 1 b 1 (a a 1 01 ) and ψ = 1 b (a 10 +a 3 11 ). When the first qubit is measured, the probability that the resulting state is ψ 1 is a 0 + a 1 = b 1, and the probability that the resulting state is ψ is a + a 3 = b
46 Quantum Computing 46 Example The device measures the first qubit state of a -qubit system in Hadamard basis. The state space V of the -qubit system is expressed as V = V 1 V where V 1 is the space spanned by { +0, +1 } and V is the space spanned by { 0, 1 }. In other words V 1 = + W and V = W, where W is 1-qubit state space.
47 Quantum Computing 47 Example The state of a -qubit system is ψ = a a a 10 +a 3 11 where a 0 + a 1 + a + a 3 = 1. We rewrite ψ as a 0 ( + + ) 0 + a 1 ( + + ) 1 + a ( + ) 0 + a 3 ( + ) 1
48 Quantum Computing 48 Example So ψ = a 0 +a +0 + a 1 +a a 0 a 0 + a 1 a 3 1 = c 1 ψ 1 +c ψ,
49 Quantum Computing 49 Example where ψ 1 = 1 ( a0 +a +0 + a ) 1 +a 3 +1 c 1 ψ = 1 ( a0 a 0 + a ) 1 a 3 1 c c 1 = 1 a0 +a + a 1 +a 3 c = 1 a0 a + a 1 a 3
50 Quantum Computing 50 Example If we consider the Bell Basis state Φ + = 1 ( ), then a 0 = 1 = a 3 and a 1 = 0 = a. So we have c 1 = 1 = c and ψ 1 = 1 ( ) ψ = 1 ( 0 1 ) Φ + = 1 ψ ψ
51 Quantum Computing 51 Example The result of the measurement on first qubit of the Bell basis Φ + is = 1 ( ) = 1 [ + ( + + )+ + ( + )+ ( + + ) ( + )] = 1 ( ++ + ). The state is still entangled.
52 Quantum Computing 5 Eckert 91 A symmetric key distribution protocol using entangled pair of qubits was proposed by A K Eckert in Quantum cryptography based on Bell s theorem, Physical Review Letters, vol. 67, no. 6, 5 August 1991, pp
53 Quantum Computing 53 e classical A quantum channel channel B pair of entangled qbits
54 Quantum Computing 54 Eckert A sequence of qubit pairs are generated. Each pair is at the state Φ + = 1 ( ).. The first qubit is sent to Alice and the second qubit is sent to Bob on quantum channels. 3. For each qubit they choose randomly either the standard basis or the Hadamard basis for measurement.
55 Quantum Computing 55 Eckert After the measurement, they compare the bases. If the bases are not identical, the bit is discarded.
56 Quantum Computing 56 Eckert 91 If they use the standard base and Alice gets 0 then the state of the entangled pair is 00. So Bob also gets 0 and both of them interpret this as bit 0. If they use the Hadamard base and Alice gets +, the state of the pair is ++. So Bob also gets + and both interpret it as bit 0.
57 Quantum Computing 57 Eckert 91 Alice and Bob need to ensure that the qubit pairs are indeed in the state Φ +. That test uses Bell s inequalities.
58 Quantum Computing 58 References [ERWP] Quantum Computing: A Gentle Introduction by Eleanor Rieffel & Wolfgang Polak, Pub. MIT Press, 011, ISBN [MNIC] Quantum Computation and Quantum Information by Michael A Nielsen & Isaac L Chuang, Pub. Cambridge University Press, 00, ISBN [SA] Quantum Computing Since Democritus by Scott Aaronson, Pub. Cambridge University Press, 013, ISBN [AAM] Classical and Quantum Computation by A Yu Kitaev, A H Shen & M N Vyalyi, Pub. American Mathematical Society (GSM vol 47) 00, ISBN
59 Quantum Computing 59 References [PRM] An Introduction to Quantum Computing by Phillip Kaye, Raymond Laflamme & Michele Mosca, Pub. Oxford University Press, 007, ISBN
Boolean State Transformation
Quantum Computing Boolean State Transformation Quantum Computing 2 Boolean Gates Boolean gates transform the state of a Boolean system. Conventionally a Boolean gate is a map f : {,} n {,}, where n is
More information{0,1} = B versus a 0 +b 1 C 2
Quantum Computing 1 Birth of a Qubit {0,1} = B versus a 0 +b 1 C 2 Quantum Computing 2 I believe Quantum Physics is not a prerequisite of quantum computing unless one wants to build a quantum computer.
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 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 informationIntroduction to Quantum Computing
Introduction to Quantum Computing Petros Wallden Lecture 3: Basic Quantum Mechanics 26th September 2016 School of Informatics, University of Edinburgh Resources 1. Quantum Computation and Quantum Information
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 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 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 informationDECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS
DECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS SCOTT HOTTOVY Abstract. Quantum networks are used to transmit and process information by using the phenomena of quantum mechanics.
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 informationPh 219/CS 219. Exercises Due: Friday 3 November 2006
Ph 9/CS 9 Exercises Due: Friday 3 November 006. Fidelity We saw in Exercise. that the trace norm ρ ρ tr provides a useful measure of the distinguishability of the states ρ and ρ. Another useful measure
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 informationDeutsch s Algorithm. Dimitrios I. Myrisiotis. MPLA CoReLab. April 26, / 70
Deutsch s Algorithm Dimitrios I. Myrisiotis MPLA CoReLab April 6, 017 1 / 70 Contents Introduction Preliminaries The Algorithm Misc. / 70 Introduction 3 / 70 Introduction Figure : David Deutsch (1953 ).
More informationAQI: Advanced Quantum Information Lecture 6 (Module 2): Distinguishing Quantum States January 28, 2013
AQI: Advanced Quantum Information Lecture 6 (Module 2): Distinguishing Quantum States January 28, 2013 Lecturer: Dr. Mark Tame Introduction With the emergence of new types of information, in this case
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 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 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 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 informationQuantum Mechanics II: Examples
Quantum Mechanics II: Examples Michael A. Nielsen University of Queensland Goals: 1. To apply the principles introduced in the last lecture to some illustrative examples: superdense coding, and quantum
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 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 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 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 informationProbabilistic exact cloning and probabilistic no-signalling. Abstract
Probabilistic exact cloning and probabilistic no-signalling Arun Kumar Pati Quantum Optics and Information Group, SEECS, Dean Street, University of Wales, Bangor LL 57 IUT, UK (August 5, 999) Abstract
More informationPrinciples of Quantum Mechanics Pt. 2
Principles of Quantum Mechanics Pt. 2 PHYS 500 - Southern Illinois University February 9, 2017 PHYS 500 - Southern Illinois University Principles of Quantum Mechanics Pt. 2 February 9, 2017 1 / 13 The
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 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 informationLinear Algebra and Dirac Notation, Pt. 3
Linear Algebra and Dirac Notation, Pt. 3 PHYS 500 - Southern Illinois University February 1, 2017 PHYS 500 - Southern Illinois University Linear Algebra and Dirac Notation, Pt. 3 February 1, 2017 1 / 16
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 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 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 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 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 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 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 information9. Distance measures. 9.1 Classical information measures. Head Tail. How similar/close are two probability distributions? Trace distance.
9. Distance measures 9.1 Classical information measures How similar/close are two probability distributions? Trace distance Fidelity Example: Flipping two coins, one fair one biased Head Tail Trace distance
More informationDecay of the Singlet Conversion Probability in One Dimensional Quantum Networks
Decay of the Singlet Conversion Probability in One Dimensional Quantum Networks Scott Hottovy shottovy@math.arizona.edu Advised by: Dr. Janek Wehr University of Arizona Applied Mathematics December 18,
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 informationIntroduction to Quantum Cryptography
Università degli Studi di Perugia September, 12th, 2011 BunnyTN 2011, Trento, Italy This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. Quantum Mechanics
More informationCompression and entanglement, entanglement transformations
PHYSICS 491: Symmetry and Quantum Information April 27, 2017 Compression and entanglement, entanglement transformations Lecture 8 Michael Walter, Stanford University These lecture notes are not proof-read
More informationPh 219/CS 219. Exercises Due: Friday 20 October 2006
1 Ph 219/CS 219 Exercises Due: Friday 20 October 2006 1.1 How far apart are two quantum states? Consider two quantum states described by density operators ρ and ρ in an N-dimensional Hilbert space, and
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 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 NP - Cont. Classical and Quantum Computation A.Yu Kitaev, A. Shen, M. N. Vyalyi 2002
Quantum NP - Cont. Classical and Quantum Computation A.Yu Kitaev, A. Shen, M. N. Vyalyi 2002 1 QMA - the quantum analog to MA (and NP). Definition 1 QMA. The complexity class QMA is the class of all languages
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 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 informationIntroduction into Quantum Computations Alexei Ashikhmin Bell Labs
Introduction into Quantum Computations Alexei Ashikhmin Bell Labs Workshop on Quantum Computing and its Application March 16, 2017 Qubits Unitary transformations Quantum Circuits Quantum Measurements Quantum
More information1 Readings. 2 Unitary Operators. C/CS/Phys C191 Unitaries and Quantum Gates 9/22/09 Fall 2009 Lecture 8
C/CS/Phys C191 Unitaries and Quantum Gates 9//09 Fall 009 Lecture 8 1 Readings Benenti, Casati, and Strini: Classical circuits and computation Ch.1.,.6 Quantum Gates Ch. 3.-3.4 Kaye et al: Ch. 1.1-1.5,
More informationChapter 5. Density matrix formalism
Chapter 5 Density matrix formalism In chap we formulated quantum mechanics for isolated systems. In practice systems interect with their environnement and we need a description that takes this feature
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 informationCHAPTER 0: A (VERY) BRIEF TOUR OF QUANTUM MECHANICS, COMPUTATION, AND CATEGORY THEORY.
CHPTER 0: (VERY) BRIEF TOUR OF QUNTUM MECHNICS, COMPUTTION, ND CTEGORY THEORY. This chapter is intended to be a brief treatment of the basic mechanics, framework, and concepts relevant to the study of
More informationMultilinear Singular Value Decomposition for Two Qubits
Malaysian Journal of Mathematical Sciences 10(S) August: 69 83 (2016) Special Issue: The 7 th International Conference on Research and Education in Mathematics (ICREM7) MALAYSIAN JOURNAL OF MATHEMATICAL
More informationBasic concepts from quantum theory
B. BASIC CONCEPTS FROM QUANTUM THEORY 77 B Basic concepts from quantum theory B.1 Introduction B.1.a Bases In quantum mechanics certain physical quantities are quantized, such as the energy of an electron
More informationLimits on the power of quantum statistical zero-knowledge
Limits on the power of quantum statistical zero-knowledge John Watrous Department of Computer Science University of Calgary Calgary, Alberta, Canada jwatrous@cpsc.ucalgary.ca January 16, 2003 Abstract
More informationInformation quantique, calcul quantique :
Séminaire LARIS, 8 juillet 2014. Information quantique, calcul quantique : des rudiments à la recherche (en 45min!). François Chapeau-Blondeau LARIS, Université d Angers, France. 1/25 Motivations pour
More informationB. BASIC CONCEPTS FROM QUANTUM THEORY 93
B. BASIC CONCEPTS FROM QUANTUM THEORY 93 B.5 Superposition B.5.a Bases 1. In QM certain physical quantities are quantized, such as the energy of an electron in an atom. Therefore an atom might be in certain
More informationQuantum Communication. Serge Massar Université Libre de Bruxelles
Quantum Communication Serge Massar Université Libre de Bruxelles Plan Why Quantum Communication? Prepare and Measure schemes QKD Using Entanglement Teleportation Communication Complexity And now what?
More informationQuantum Cryptography. Areas for Discussion. Quantum Cryptography. Photons. Photons. Photons. MSc Distributed Systems and Security
Areas for Discussion Joseph Spring Department of Computer Science MSc Distributed Systems and Security Introduction Photons Quantum Key Distribution Protocols BB84 A 4 state QKD Protocol B9 A state QKD
More informationThe Framework of Quantum Mechanics
The Framework of Quantum Mechanics We now use the mathematical formalism covered in the last lecture to describe the theory of quantum mechanics. In the first section we outline four axioms that lie at
More informationQuantum Entanglement, Quantum Cryptography, Beyond Quantum Mechanics, and Why Quantum Mechanics Brad Christensen Advisor: Paul G.
Quantum Entanglement, Quantum Cryptography, Beyond Quantum Mechanics, and Why Quantum Mechanics Brad Christensen Advisor: Paul G. Kwiat Physics 403 talk: December 2, 2014 Entanglement is a feature of compound
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 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 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 informationTransmitting and Hiding Quantum Information
2018/12/20 @ 4th KIAS WORKSHOP on Quantum Information and Thermodynamics Transmitting and Hiding Quantum Information Seung-Woo Lee Quantum Universe Center Korea Institute for Advanced Study (KIAS) Contents
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 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 informationAsymptotic Pure State Transformations
Asymptotic Pure State Transformations PHYS 500 - Southern Illinois University April 18, 2017 PHYS 500 - Southern Illinois University Asymptotic Pure State Transformations April 18, 2017 1 / 15 Entanglement
More informationLecture 20: Bell inequalities and nonlocality
CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 0: Bell inequalities and nonlocality April 4, 006 So far in the course we have considered uses for quantum information in the
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 Algorithms. Andreas Klappenecker Texas A&M University. Lecture notes of a course given in Spring Preliminary draft.
Quantum Algorithms Andreas Klappenecker Texas A&M University Lecture notes of a course given in Spring 003. Preliminary draft. c 003 by Andreas Klappenecker. All rights reserved. Preface Quantum computing
More informationProblem Set: TT Quantum Information
Problem Set: TT Quantum Information Basics of Information Theory 1. Alice can send four messages A, B, C, and D over a classical channel. She chooses A with probability 1/, B with probability 1/4 and C
More informationBasic concepts from quantum theory
B. BASIC CONCEPTS FROM QUANTUM THEORY 59 Figure III.1: Probability density of first six hydrogen orbitals. The main quantum number (n =1, 2, 3) and the angular momentum quantum number (` =0, 1, 2=s,p,d)areshown.
More informationCS/Ph120 Homework 8 Solutions
CS/Ph0 Homework 8 Solutions December, 06 Problem : Thinking adversarially. Solution: (Due to De Huang) Attack to portocol : Assume that Eve has a quantum machine that can store arbitrary amount of quantum
More informationQuantum Fourier Transforms
Quantum Fourier Transforms Burton Rosenberg November 10, 2003 Fundamental notions First, review and maybe introduce some notation. It s all about functions from G to C. A vector is consider a function
More informationQuantum Nonlocality Pt. 4: More on the CHSH Inequality
Quantum Nonlocality Pt. 4: More on the CHSH Inequality PHYS 500 - Southern Illinois University May 4, 2017 PHYS 500 - Southern Illinois University Quantum Nonlocality Pt. 4: More on the CHSH Inequality
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 informationBorromean Entanglement Revisited
Borromean Entanglement Revisited Ayumu SUGITA Abstract An interesting analogy between quantum entangled states and topological links was suggested by Aravind. In particular, he emphasized a connection
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 informationTensor product Take two tensors, get together enough inputs to feed into both, and take the product of their results.
1 Tensors Tensors are a representation of linear operators. Much like with bra-ket notation, we want a notation which will suggest correct operations. We can represent a tensor as a point with n legs radiating
More informationEntanglement Manipulation
Entanglement Manipulation Steven T. Flammia 1 1 Perimeter Institute for Theoretical Physics, Waterloo, Ontario, N2L 2Y5 Canada (Dated: 22 March 2010) These are notes for my RIT tutorial lecture at the
More informationBaby's First Diagrammatic Calculus for Quantum Information Processing
Baby's First Diagrammatic Calculus for Quantum Information Processing Vladimir Zamdzhiev Department of Computer Science Tulane University 30 May 2018 1 / 38 Quantum computing ˆ Quantum computing is usually
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 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 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 informationA Course in Quantum Information Theory
A Course in Quantum Information Theory Ofer Shayevitz Spring 2007 Based on lectures given at the Tel Aviv University Edited by Anatoly Khina Version compiled January 9, 2010 Contents 1 Preliminaries 3
More informationExplicit bounds on the entangled value of multiplayer XOR games. Joint work with Thomas Vidick (MIT)
Explicit bounds on the entangled value of multiplayer XOR games Jop Briët Joint work with Thomas Vidick (MIT) Waterloo, 2012 Entanglement and nonlocal correlations [Bell64] Measurements on entangled quantum
More informationCS286.2 Lecture 15: Tsirelson s characterization of XOR games
CS86. Lecture 5: Tsirelson s characterization of XOR games Scribe: Zeyu Guo We first recall the notion of quantum multi-player games: a quantum k-player game involves a verifier V and k players P,...,
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 information5. Communication resources
5. Communication resources Classical channel Quantum channel Entanglement How does the state evolve under LOCC? Properties of maximally entangled states Bell basis Quantum dense coding Quantum teleportation
More informationQuantum Entanglement and the Bell Matrix
Quantum Entanglement and the Bell Matrix Marco Pedicini (Roma Tre University) in collaboration with Anna Chiara Lai and Silvia Rognone (La Sapienza University of Rome) SIMAI2018 - MS27: Discrete Mathematics,
More informationHigh Fidelity to Low Weight. Daniel Gottesman Perimeter Institute
High Fidelity to Low Weight Daniel Gottesman Perimeter Institute A Word From Our Sponsor... Quant-ph/0212066, Security of quantum key distribution with imperfect devices, D.G., H.-K. Lo, N. Lutkenhaus,
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 informationIntroduction to Quantum Mechanics
Introduction to Quantum Mechanics R. J. Renka Department of Computer Science & Engineering University of North Texas 03/19/2018 Postulates of Quantum Mechanics The postulates (axioms) of quantum mechanics
More informationA Refinement of Quantum Mechanics by Algorithmic Randomness and Its Application to Quantum Cryptography
Copyright c 017 The Institute of Electronics, Information and Communication Engineers SCIS 017 017 Symposium on Cryptography and Information Security Naha, Japan, Jan. 4-7, 017 The Institute of Electronics,
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 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 informationMaximal vectors in Hilbert space and quantum entanglement
Maximal vectors in Hilbert space and quantum entanglement William Arveson arveson@math.berkeley.edu UC Berkeley Summer 2008 arxiv:0712.4163 arxiv:0801.2531 arxiv:0804.1140 Overview Quantum Information
More informationQuantum Computing Lecture 1. Bits and Qubits
Quantum Computing Lecture 1 Bits and Qubits Maris Ozols What is Quantum Computing? Aim: use quantum mechanical phenomena that have no counterpart in classical physics for computational purposes. (Classical
More informationThe Principles of Quantum Mechanics: Pt. 1
The Principles of Quantum Mechanics: Pt. 1 PHYS 476Q - Southern Illinois University February 15, 2018 PHYS 476Q - Southern Illinois University The Principles of Quantum Mechanics: Pt. 1 February 15, 2018
More informationQuantum Computing Lecture 2. Review of Linear Algebra
Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces
More information