Information quantique, calcul quantique :

Size: px
Start display at page:

Download "Information quantique, calcul quantique :"

Transcription

1 Séminaire LARIS, 8 juillet Information quantique, calcul quantique : des rudiments à la recherche (en 45min!). François Chapeau-Blondeau LARIS, Université d Angers, France. 1/25

2 Motivations pour le quantique pour le traitement de l information : 1) Quand on utilise des systèmes élémentaires (photons, électrons, atomes, nanodevices,...). 2) Pour bénéficier d effets purement quantiques (parallèlisme, intrication,...). 3) It s fun! 2/25

3 Quantum system Represented by a state vector ψ in a complex Hilbert space H, with unit norm ψ ψ = ψ 2 = 1. In dimension 2 : the qubit (photon, electron, atom,...) State ψ = α 0 +β 1 in some orthonormal basis { 0, 1 } of H 2, with α 2 + β 2 = 1. [ ] α ψ =, ψ = ψ = [α,β ] = ψ ψ = ψ 2 = α 2 + β 2 scalar. β [ ] [ α αα ψ ψ = [α,β αβ ] ] = β α β ββ = Π ψ orthogonal projector on ψ. 3/25

4 Measurement of the qubit When a qubit in state ψ = α 0 +β 1 is measured in the orthonormal basis { 0, 1 }, = only 2 possible outcomes (Born rule) : state 0 with probability α 2 = 0 ψ 2, or state 1 with probability β 2 = 1 ψ 2. Measurement : a probabilistic process, as a projection of the state ψ in an orthonormal basis, with statistics evaluable over repeated experiments with same preparation ψ. 4/25

5 Bloch sphere representation of the qubit Qubit in state ψ = α 0 +β 1 with α 2 + β 2 = 1. ψ = cos(θ/2) 0 +e iϕ sin(θ/2) 1. As a quantum object the qubit has infinitely many degrees of freedom (θ, ϕ), yet when it is measured it can only be found in one of two states (just like a classical bit). 5/25

6 Multiple qubits A system (a word) of N qubits has a state in H N 2, a tensor-product vector space with dimension 2 N, and orthonormal basis { x 1 x 2 x N } x {0,1} N. Example N = 2 : Generally ψ = α α α α Or, as( a special separable ) ( state ) φ = α 1 0 +β 1 1 α 2 0 +β 2 1 = α 1 α α 1 β β 1 α β 1 β A multipartite state which is not separable is entangled. 6/25

7 Entangled states Example of a separable state of two qubits AB : AB = 1 ( ) 1 ) ( = 1 ( ) When measured in the basis { 0, 1 }, each qubit A and B can be found in state 0 or 1 independently with probability 1/2. Example of an entangled state of two qubits AB : AB = 1 ) ( When measured in the basis { 0, 1 }, each qubit A and B can be found in state 0 or 1 with probability 1/2 (randomly, no predetermination before measure). But if A is found in 0 necessarily B is found in 0, and if A is found in 1 necessarily B is found in 1, no matter how distant the two qubits are before measurement. 7/25

8 Computation on a qubit Through a unitary operator U on H 2 (a 2 2 matrix) : normalized vector ψ H 2 U ψ normalized vector H 2. quantum gate input ψ U output U ψ Hadamard gate H = 1 [ ] 1 1. Identity gate 1 = [ ] [ ] 0 1 [ ] 0 i [ 1 0 ] Pauli gates X = 1 0, Y = i 0, Z = 0 1. {1,X,Y,Z} a basis for operators on H 2. 8/25

9 Computation on a pair of qubits Through a unitary operator U on H 2 2 (a 4 4 matrix) : normalized vector ψ H 2 2 U ψ normalized vector H 2 2. quantum gate input output (always reversible) ψ U U ψ Controlled-Not gate : CT C,C T T CT C C T C,C T C U = /25

10 Computation on a system of N qubits Through a unitary operator U on H N 2 (a 2 N 2 N matrix) : normalized vector ψ H N 2 U ψ normalized vector H N 2. quantum gate : N input qubits U N output qubits. Any N-qubit quantum gate may be composed from C-Not gates and single-qubit gates (universatility). This forms the grounding of quantum computation. 10/25

11 Deutsch-Jozsa algo. (1992) : Parallel evaluation of a function A classical function f( ) {0,1} N {0,1} 2 N values 2 values, can be constant or balanced (equal numbers of 0,1 in output). Classically : Between 2 and 2N 2 +1 evaluations of f( ) to decide. Quantumly : One evaluation of f( ) is enough. ( ) 1/2 1 ( ) ( ) N 1/2 1 ψ = = x 2 N 2 N 1 x 2 x N x {0,1} N ψ N qubits Quantum circuit f( ) 1 qubit N qubits Decoder 1 cbit 11/25

12 Deutsch-Jozsa algorithm (Desurvire 2009, Cambridge Univ. Press) 12/25

13 Superdense coding (Bennett 1992) : exploiting entanglement Alice and Bob share a qubit pair in the entangled state φ = 1 ) ( Alice chooses two classical bits, pack them into a single qubit. Bob receives this qubit, from which he recovers the two classical bits. Alice 2 cbits 1 X Y Z 1 qbit Bob Decoder 2 cbits φ 2 entangled qubits Teleportation (1993) is the opposite : a shared pair of entangled qubits and two classical bits transmitted from Alice to Bob enable the transfer of an arbitrary quantum state ψ of a qubit. 13/25

14 Other quantum algorithms Grover quantum search algorithm (1996) : Quantum search in an unsorted database. Finds one item among N in O( N) steps (instead of O(N) classically). Shor factoring algorithm (1997) : Factors any integer in polynomial complexity (instead of exponential classically). 15 = 3 5, with spin-1/2 nuclei (Vandersypen et al., Nature 2001). 21 = 3 7, with photons (Martín-López et al., Nature Photonics 2012). 14/25

15 Density operator Quantum system in (pure) state ψ j, measured in an orthonormal basis { k } : = probability Pr{ k ψ j } = k ψ j 2 = k ψ j ψ j k. Several possible states ψ j with probabilities p j (with j p j = 1) : = Pr{ k } = ) j p j Pr{ k ψ j } = k ( j p j ψ j ψ j k = k ρ k, with density operator ρ = j p j ψ j ψ j. and Pr{ k } = k ρ k = tr(ρ k k ) = tr(ρπ k ). The quantum system is in a mixed state, corresponding to the statistical ensemble {p j, ψ j }, described by the density operator ρ. Lemma : For any operator A with trace tr(a) = k k A k, one has tr(a ψ ψ ) = k k A ψ ψ k = ( k ψ k k A ψ = ψ k )A ψ k k = ψ A ψ 15/25

16 Generalized measurement In a Hilbert space H N with dimension N, the state of a quantum system is specified by a Hermitian positive unit-trace density operator ρ. Projective measurement : Defined by a set of N orthogonal projectors k k = Π k, verifying k k k = k Π k = 1, and Pr{ k } = tr(ρπ k ). Moreover k Pr{ k } = 1, ρ k Π k = 1. Generalized measurement : Defined by a set of an arbitrary number of positive operators M m, verifying m M m = 1, and Pr{M m } = tr(ρm m ). Moreover m Pr{M m} = 1, ρ m M m = 1. 16/25

17 Quantum state discrimination A quantum system can be in one of two alternative states ρ 0 or ρ 1 with prior probabilities P 0 and P 1 = 1 P 0. Question : What is the best measurement {M 0,M 1 } to decide with a maximal probability of success P suc? Answer : One has P suc = P 0 tr(ρ 0 M 0 )+P 1 tr(ρ 1 M 1 ) = P 0 +tr(tm 1 ), with the test operator T = P 1 ρ 1 P 0 ρ 0. Then P suc is maximized by M opt 1 = λ n λ n, λ n >0 the projector on the eigensubspace of T with positive eigenvalues λ n. The optimal measurement {M opt achieves the maximum P max suc = 1 2 1,M opt 0 = 1 M opt 1 } N ) λ n. (Helstrom 1976) ( 1+ n=1 17/25

18 Discrimination from noisy qubits Quantum noise on a qubit in state ρ can be represented by random applications of (one of) the 4 Pauli operators {1,X,Y,Z} on the qubit, e.g. Bit-flip noise : ρ N(ρ) = (1 p)ρ+pxρx, Depolarizing noise : ρ N(ρ) = (1 p)ρ+ p ) (XρX +YρY +ZρZ. 3 With a noisy qubit, discrimination from N(ρ 0 ) and N(ρ 1 ). Impact of the probability p of action of the quantum noise, on the performance P max suc of the optimal detector, in relation to stochastic resonance and enhancement by noise. (Chapeau-Blondeau, Physics Letters A 2014) 18/25

19 19/25

20 Discrimination among M > 2 quantum states A quantum system can be in one of M states ρ m, for m = 1 to M, with prior probabilities P m with M m=1 P m = 1. Problem : What is the best measurement {M m } with M outcomes to decide with a maximal probability of success P suc? = Maximize P suc = M m=1 subject to 0 M m 1 P m tr(ρ m M m ) according to the M operators M m, and M m=1 M m = 1. For M > 2 this problem is only partially solved, in some special cases. (Barnett et al., Adv. Opt. Photon. 2009). Try interval analysis, etc?... 20/25

21 Error-free discrimination between M = 2 states Two alternative states ρ 0 or ρ 1 of H N, with priors P 0 and P 1 = 1 P 0, are not full-rank in H N, e.g. supp(ρ 0 ) H N [supp(ρ 0 )] { 0}. If S 0 = supp(ρ 0 ) [supp(ρ 1 )] { 0}, error-free discrimination of ρ 0 is possible. If S 1 = supp(ρ 1 ) [supp(ρ 0 )] { 0}, error-free discrimination of ρ 1 is possible. Necessity to find a three-outcome measurement {M 0,M 1,M unc } : = Find M 0 such that 0 M 0 1 and { 0} supp(m 0 ) S 0, and M 1 such that 0 M [ 1 1 and { 0} supp(m 1 ) S 1, ] and M 0 +M 1 1 M 0 +M 1 +M unc = 1 with 0 M unc 1, maximizing P suc = P 0 tr(m 0 ρ 0 )+P 1 tr(m 1 ρ 1 ) ( min P unc = 1 P suc ) This problem is only partially solved, in some special cases, even more so for extension at M > 2. (Kleinmann et al., J. Math. Phys. 2010). 21/25

22 Quantum feedback control 22/25

23 System dynamics : Schrödinger equation (for closed systems) d dt ψ = i ( H ψ = ψ(t 2) = exp i ) H(t 2 t 1 ) ψ(t 1 ) = U(t 1,t 2 ) ψ(t 1 ) }{{} unitary U(t 1,t 2 ) Hermitian operator Hamiltonian H = H 0 + H u (control part H u ). d dt ρ = i [H,ρ] = ρ(t 2) = U(t 1,t 2 )ρ(t 1 )U (t 1,t 2 ). Lindblad equation (for open systems) d dt ρ = i [H,ρ] + j ( ) 2L j ρl j {L j L j,ρ}, Lindblad op. L j for interact. with environt. Measurement : Arbitrary operators {E m } such that m E m E m = 1, Pr{m} = tr(e m ρe m ) = tr(ρe m E m) = tr(ρm m ) with M m = E m E m positive, Post-measurement state ρ m = E mρe m tr(e m ρe m ). 23/25

24 Pour aller plus loin M. Nielsen & I. Chuang E. Desurvire M. Wilde 2000, 676 pages 2009, 691 pages 2013, 655 pages 24/25

25 Merci de votre attention. Si vous avez compris... c est que je me suis mal exprimé! Nobody really understands quantum mechanics. R. P. Feynman 25/25

Contents. Contents. 1 Quantum basics 2 Signal detection 3 Signal transmission 4 Signal estimation

Contents. Contents. 1 Quantum basics 2 Signal detection 3 Signal transmission 4 Signal estimation Séminaire de la SFR MathSTIC, Université d Angers, vendredi 6 juillet 2018. Information quantique : depuis des basiques jusqu à des problèmes ouverts, avec de l algèbre et des probabilités. A definition

More information

Quantum Computing Lecture 3. Principles of Quantum Mechanics. Anuj Dawar

Quantum 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 information

Introduction to Quantum Information Hermann Kampermann

Introduction 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 information

Lecture 4: Postulates of quantum mechanics

Lecture 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 information

Introduction 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 Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Lecture 9 (2017) Jon Yard QNC 3126 jyard@uwaterloo.ca http://math.uwaterloo.ca/~jyard/qic710 1 More state distinguishing

More information

Fidelity of Quantum Teleportation through Noisy Channels

Fidelity of Quantum Teleportation through Noisy Channels Fidelity of Quantum Teleportation through Noisy Channels Sangchul Oh, Soonchil Lee, and Hai-woong Lee Department of Physics, Korea Advanced Institute of Science and Technology, Daejon, 305-701, Korea (Dated:

More information

Quantum Information Types

Quantum Information Types qitd181 Quantum Information Types Robert B. Griffiths Version of 6 February 2012 References: R. B. Griffiths, Types of Quantum Information, Phys. Rev. A 76 (2007) 062320; arxiv:0707.3752 Contents 1 Introduction

More information

Ph 219/CS 219. Exercises Due: Friday 20 October 2006

Ph 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 information

Quantum Information Processing and Diagrams of States

Quantum 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 information

Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters)

Teleportation 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 information

Hilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding.

Hilbert 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 information

Unitary Dynamics and Quantum Circuits

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

More information

Introduction to Quantum Mechanics

Introduction 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 information

C/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/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 information

1 Readings. 2 Unitary Operators. C/CS/Phys C191 Unitaries and Quantum Gates 9/22/09 Fall 2009 Lecture 8

1 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 information

Introduction to Quantum Computing

Introduction 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 information

An Introduction to Quantum Computation and Quantum Information

An 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 information

Some Introductory Notes on Quantum Computing

Some 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 information

PHY305: Notes on Entanglement and the Density Matrix

PHY305: Notes on Entanglement and the Density Matrix PHY305: Notes on Entanglement and the Density Matrix Here follows a short summary of the definitions of qubits, EPR states, entanglement, the density matrix, pure states, mixed states, measurement, and

More information

Quantum Entanglement and Error Correction

Quantum Entanglement and Error Correction Quantum Entanglement and Error Correction Fall 2016 Bei Zeng University of Guelph Course Information Instructor: Bei Zeng, email: beizeng@icloud.com TA: Dr. Cheng Guo, email: cheng323232@163.com Wechat

More information

Quantum Nonlocality Pt. 4: More on the CHSH Inequality

Quantum 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 information

Seminar 1. Introduction to Quantum Computing

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 information

Introduction 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 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 information

DECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS

DECAY 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 information

Basics on quantum information

Basics 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 information

Semiconductors: Applications in spintronics and quantum computation. Tatiana G. Rappoport Advanced Summer School Cinvestav 2005

Semiconductors: 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 information

The Postulates of Quantum Mechanics

The Postulates of Quantum Mechanics p. 1/23 The Postulates of Quantum Mechanics We have reviewed the mathematics (complex linear algebra) necessary to understand quantum mechanics. We will now see how the physics of quantum mechanics fits

More information

2.0 Basic Elements of a Quantum Information Processor. 2.1 Classical information processing The carrier of information

2.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 information

Density Operators and Ensembles

Density Operators and Ensembles qitd422 Density Operators and Ensembles Robert B. Griffiths Version of 30 January 2014 Contents 1 Density Operators 1 1.1 Introduction.............................................. 1 1.2 Partial trace..............................................

More information

Quantum Gates, Circuits & Teleportation

Quantum 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 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.

. 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 information

S.K. Saikin May 22, Lecture 13

S.K. Saikin May 22, Lecture 13 S.K. Saikin May, 007 13 Decoherence I Lecture 13 A physical qubit is never isolated from its environment completely. As a trivial example, as in the case of a solid state qubit implementation, the physical

More information

SUPERDENSE CODING AND QUANTUM TELEPORTATION

SUPERDENSE 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 information

Quantum Computing. Quantum Computing. Sushain Cherivirala. Bits and Qubits

Quantum 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 information

Ensembles and incomplete information

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

More information

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

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

More information

Instantaneous Nonlocal Measurements

Instantaneous 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 information

Introduction to Quantum Computing

Introduction 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 information

example: e.g. electron spin in a field: on the Bloch sphere: this is a rotation around the equator with Larmor precession frequency ω

example: e.g. electron spin in a field: on the Bloch sphere: this is a rotation around the equator with Larmor precession frequency ω Dynamics of a Quantum System: QM postulate: The time evolution of a state ψ> of a closed quantum system is described by the Schrödinger equation where H is the hermitian operator known as the Hamiltonian

More information

Chapter 5. Density matrix formalism

Chapter 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 information

Quantum Computing 1. Multi-Qubit System. Goutam Biswas. Lect 2

Quantum Computing 1. Multi-Qubit System. Goutam Biswas. Lect 2 Quantum Computing 1 Multi-Qubit System 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.

More information

Single qubit + CNOT gates

Single 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 information

Basics on quantum information

Basics 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 information

Introduction to Quantum Computation

Introduction 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 information

2. Introduction to quantum mechanics

2. 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 information

Quantum Error Correction Codes-From Qubit to Qudit. Xiaoyi Tang, Paul McGuirk

Quantum Error Correction Codes-From Qubit to Qudit. Xiaoyi Tang, Paul McGuirk Quantum Error Correction Codes-From Qubit to Qudit Xiaoyi Tang, Paul McGuirk Outline Introduction to quantum error correction codes (QECC) Qudits and Qudit Gates Generalizing QECC to Qudit computing Need

More information

Introduction to quantum information processing

Introduction to quantum information processing Introduction to quantum information processing Measurements and quantum probability Brad Lackey 25 October 2016 MEASUREMENTS AND QUANTUM PROBABILITY 1 of 22 OUTLINE 1 Probability 2 Density Operators 3

More information

Lecture 6: Quantum error correction and quantum capacity

Lecture 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 information

Richard Cleve David R. Cheriton School of Computer Science Institute for Quantum Computing University of Waterloo

Richard 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 information

Unitary evolution: this axiom governs how the state of the quantum system evolves in time.

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 information

1. Basic rules of quantum mechanics

1. 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 information

MP 472 Quantum Information and Computation

MP 472 Quantum Information and Computation MP 472 Quantum Information and Computation http://www.thphys.may.ie/staff/jvala/mp472.htm Outline Open quantum systems The density operator ensemble of quantum states general properties the reduced density

More information

Errata list, Nielsen & Chuang. rrata/errata.html

Errata 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 information

CS286.2 Lecture 15: Tsirelson s characterization of XOR games

CS286.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 information

Is Entanglement Sufficient to Enable Quantum Speedup?

Is Entanglement Sufficient to Enable Quantum Speedup? arxiv:107.536v3 [quant-ph] 14 Sep 01 Is Entanglement Sufficient to Enable Quantum Speedup? 1 Introduction The mere fact that a quantum computer realises an entangled state is ususally concluded to be insufficient

More information

Chapter 2 The Density Matrix

Chapter 2 The Density Matrix Chapter 2 The Density Matrix We are going to require a more general description of a quantum state than that given by a state vector. The density matrix provides such a description. Its use is required

More information

Entanglement and Quantum Teleportation

Entanglement 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

Quantum computing. Jan Černý, FIT, Czech Technical University in Prague. České vysoké učení technické v Praze. Fakulta informačních technologií

Quantum 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 information

Physics 239/139 Spring 2018 Assignment 6

Physics 239/139 Spring 2018 Assignment 6 University of California at San Diego Department of Physics Prof. John McGreevy Physics 239/139 Spring 2018 Assignment 6 Due 12:30pm Monday, May 14, 2018 1. Brainwarmers on Kraus operators. (a) Check that

More information

The Principles of Quantum Mechanics: Pt. 1

The 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 information

Introduction to quantum information processing

Introduction to quantum information processing Introduction to quantum information processing Fidelity and other distance metrics Brad Lackey 3 November 2016 FIDELITY AND OTHER DISTANCE METRICS 1 of 17 OUTLINE 1 Noise channels 2 Fidelity 3 Trace distance

More information

Short introduction to Quantum Computing

Short 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 information

Quantum Statistics -First Steps

Quantum Statistics -First Steps Quantum Statistics -First Steps Michael Nussbaum 1 November 30, 2007 Abstract We will try an elementary introduction to quantum probability and statistics, bypassing the physics in a rapid first glance.

More information

Basic Notation and Background

Basic Notation and Background Department of Mathematics, The College of William and Mary, Williamsburg, Virginia, USA; Department of Mathematics, Taiyuan University of Technology, Taiyuan, Shanxi, P.R. of China. Hilbert spaces The

More information

Lecture 14: Quantum information revisited

Lecture 14: Quantum information revisited CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 4: Quantum information revisited March 4, 006 So far, this course has focused almost entirely on quantum algorithms The next

More information

Quantum Noise. Michael A. Nielsen. University of Queensland

Quantum Noise. Michael A. Nielsen. University of Queensland Quantum Noise Michael A. Nielsen University of Queensland Goals: 1. To introduce a tool the density matrix that is used to describe noise in quantum systems, and to give some examples. Density matrices

More information

Chapter 10. Quantum algorithms

Chapter 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 information

Quantum Computing: Foundations to Frontier Fall Lecture 3

Quantum 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 information

Introduction to Quantum Algorithms Part I: Quantum Gates and Simon s Algorithm

Introduction 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 information

Quantum Computation: From Quantum Teleportation to the Shor s Algorithm

Quantum 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 information

Lecture Notes on QUANTUM COMPUTING STEFANO OLIVARES. Dipartimento di Fisica - Università degli Studi di Milano. Ver. 2.0

Lecture Notes on QUANTUM COMPUTING STEFANO OLIVARES. Dipartimento di Fisica - Università degli Studi di Milano. Ver. 2.0 Lecture Notes on QUANTUM COMPUTING STEFANO OLIVARES Dipartimento di Fisica - Università degli Studi di Milano Ver..0 Lecture Notes on Quantum Computing 014, S. Olivares - University of Milan Italy) December,

More information

Entanglement Measures and Monotones

Entanglement Measures and Monotones Entanglement Measures and Monotones PHYS 500 - Southern Illinois University March 30, 2017 PHYS 500 - Southern Illinois University Entanglement Measures and Monotones March 30, 2017 1 / 11 Quantifying

More information

Quantum cryptography. Quantum cryptography has a potential to be cryptography of 21 st century. Part XIII

Quantum 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 information

Logical error rate in the Pauli twirling approximation

Logical error rate in the Pauli twirling approximation Logical error rate in the Pauli twirling approximation Amara Katabarwa and Michael R. Geller Department of Physics and Astronomy, University of Georgia, Athens, Georgia 30602, USA (Dated: April 10, 2015)

More information

Short Course in Quantum Information Lecture 2

Short 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 information

Tutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction

Tutorial 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

Quantum Computation. Alessandra Di Pierro Computational models (Circuits, QTM) Algorithms (QFT, Quantum search)

Quantum 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 information

1 The postulates of quantum mechanics

1 The postulates of quantum mechanics 1 The postulates of quantum mechanics The postulates of quantum mechanics were derived after a long process of trial and error. These postulates provide a connection between the physical world and the

More information

Lecture 1: Overview of quantum information

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

More information

What is possible to do with noisy quantum computers?

What is possible to do with noisy quantum computers? What is possible to do with noisy quantum computers? Decoherence, inaccuracy and errors in Quantum Information Processing Sara Felloni and Giuliano Strini sara.felloni@disco.unimib.it Dipartimento di Informatica

More information

Introduction 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 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 information

An Introduction to Quantum Information and Applications

An 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 information

Quantum Hadamard channels (I)

Quantum Hadamard channels (I) .... Quantum Hadamard channels (I) Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. July 8, 2010 Vlad Gheorghiu (CMU) Quantum Hadamard channels (I) July 8, 2010

More information

Quantum 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 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 information

Discrete Quantum Theories

Discrete 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

Quantum information and quantum computing

Quantum 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 information

Any pure quantum state ψ (qubit) of this system can be written, up to a phase, as a superposition (linear combination of the states)

Any pure quantum state ψ (qubit) of this system can be written, up to a phase, as a superposition (linear combination of the states) Chapter Qubits A single qubit is a two-state system, such as a two-level atom The states (kets) h and v of the horizontaland vertical polarization of a photon can also be considered as a two-state system

More information

Quantum state discrimination with post-measurement information!

Quantum state discrimination with post-measurement information! Quantum state discrimination with post-measurement information! DEEPTHI GOPAL, CALTECH! STEPHANIE WEHNER, NATIONAL UNIVERSITY OF SINGAPORE! Quantum states! A state is a mathematical object describing the

More information

Complex numbers: a quick review. Chapter 10. Quantum algorithms. Definition: where i = 1. Polar form of z = a + b i is z = re iθ, where

Complex 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

INTRODUCTION TO NMR and NMR QIP

INTRODUCTION TO NMR and NMR QIP Books (NMR): Spin dynamics: basics of nuclear magnetic resonance, M. H. Levitt, Wiley, 2001. The principles of nuclear magnetism, A. Abragam, Oxford, 1961. Principles of magnetic resonance, C. P. Slichter,

More information

Homework 3 - Solutions

Homework 3 - Solutions Homework 3 - Solutions The Transpose an Partial Transpose. 1 Let { 1, 2,, } be an orthonormal basis for C. The transpose map efine with respect to this basis is a superoperator Γ that acts on an operator

More information

Lecture: Quantum Information

Lecture: 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 information

Probabilistic exact cloning and probabilistic no-signalling. Abstract

Probabilistic 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 information

Entropy in Classical and Quantum Information Theory

Entropy in Classical and Quantum Information Theory Entropy in Classical and Quantum Information Theory William Fedus Physics Department, University of California, San Diego. Entropy is a central concept in both classical and quantum information theory,

More information

Quantum Physics II (8.05) Fall 2002 Assignment 3

Quantum Physics II (8.05) Fall 2002 Assignment 3 Quantum Physics II (8.05) Fall 00 Assignment Readings The readings below will take you through the material for Problem Sets and 4. Cohen-Tannoudji Ch. II, III. Shankar Ch. 1 continues to be helpful. Sakurai

More information

QUANTUM INFORMATION -THE NO-HIDING THEOREM p.1/36

QUANTUM 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 information

Introduction to Quantum Computing for Folks

Introduction 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 information

QLang: Qubit Language

QLang: 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 information

Quantum Computers. Todd A. Brun Communication Sciences Institute USC

Quantum 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 information

Planck Constant and the Deutsch-Jozsa Algorithm

Planck Constant and the Deutsch-Jozsa Algorithm Adv. Studies Theor. Phys., Vol. 4, 010, no. 0, 97-990 Planck Constant and the Deutsch-Jozsa Algorithm Koji agata Future University Hakodate ko mi na@yahoo.co.jp Tadao akamura Keio University Science and

More information