Qubits vs. bits: a naive account A bit: admits two values 0 and 1, admits arbitrary transformations. is freely readable,

Similar documents
Decay of the Singlet Conversion Probability in One Dimensional Quantum Networks

Introduction to Quantum Information Hermann Kampermann

1. Basic rules of quantum mechanics

Lecture 4: Postulates of quantum mechanics

Quantum decoherence. Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, Quantum decoherence p. 1/2

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

Quantum Gates, Circuits & Teleportation

Lecture 3: Hilbert spaces, tensor products

Some Introductory Notes on Quantum Computing

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

Ensembles and incomplete information

DECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS

Quantum Entanglement- Fundamental Aspects

In the beginning God created tensor... as a picture

Quantum Computing Lecture 2. Review of Linear Algebra

2. Introduction to quantum mechanics

Quantum information processing: a new light on the Q-formalism and Q-foundations

Introduction to Quantum Mechanics

Chapter 5. Density matrix formalism

INTRODUCTORY NOTES ON QUANTUM COMPUTATION

Basics on quantum information

Categories and Quantum Informatics: Hilbert spaces

1 Measurements, Tensor Products, and Entanglement

Entanglement: concept, measures and open problems

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

Quantum Entanglement and the Bell Matrix

Lecture 11 September 30, 2015

Quantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139

Basics on quantum information

5. Communication resources

1 More on the Bloch Sphere (10 points)

MP 472 Quantum Information and Computation

SUPERDENSE CODING AND QUANTUM TELEPORTATION

Lecture: Quantum Information

Quantum Entanglement and Error Correction

Stochastic Quantum Dynamics I. Born Rule

A Course in Quantum Information Theory

Compression and entanglement, entanglement transformations

The query register and working memory together form the accessible memory, denoted H A. Thus the state of the algorithm is described by a vector

arxiv: v2 [quant-ph] 26 Mar 2012

Quantum Information Types

. Here we are using the standard inner-product over C k to define orthogonality. Recall that the inner-product of two vectors φ = i α i.

An Introduction to Quantum Computation and Quantum Information

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

Quantum Entanglement and Measurement

Introduction to Quantum Computing

A review on quantum teleportation based on: Teleporting an unknown quantum state via dual classical and Einstein- Podolsky-Rosen channels

Consistent Histories. Chapter Chain Operators and Weights

Quantum Mechanics and Quantum Computing: an Introduction. Des Johnston, Notes by Bernd J. Schroers Heriot-Watt University

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

An Introduction to Quantum Information. By Aditya Jain. Under the Guidance of Dr. Guruprasad Kar PAMU, ISI Kolkata

9. Distance measures. 9.1 Classical information measures. Head Tail. How similar/close are two probability distributions? Trace distance.

Quantum Measurements: some technical background

Probabilistic exact cloning and probabilistic no-signalling. Abstract

PHY305: Notes on Entanglement and the Density Matrix

CSCI 2570 Introduction to Nanocomputing. Discrete Quantum Computation

Structure of Unital Maps and the Asymptotic Quantum Birkhoff Conjecture. Peter Shor MIT Cambridge, MA Joint work with Anand Oza and Dimiter Ostrev

Categorical Models for Quantum Computing

Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras

INSTITUT FOURIER. Quantum correlations and Geometry. Dominique Spehner

MP463 QUANTUM MECHANICS

Quantum Noise. Michael A. Nielsen. University of Queensland

Entanglement Manipulation

Private quantum subsystems and error correction

Distinguishing different classes of entanglement for three qubit pure states

ENTANGLEMENT OF N DISTINGUISHABLE PARTICLES

Lectures 1 and 2: Axioms for Quantum Theory

6.896 Quantum Complexity Theory September 9, Lecture 2

Entanglement and Quantum Teleportation

The Postulates of Quantum Mechanics

Ph 219/CS 219. Exercises Due: Friday 3 November 2006

Quantum state discrimination with post-measurement information!

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

arxiv:quant-ph/ v5 5 Mar 2007

Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras

Algebraic Theory of Entanglement

Chapter 2. Basic Principles of Quantum mechanics

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

Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871

Picturing Quantum Processes,

Linear Algebra and Dirac Notation, Pt. 1

Estimation of Optimal Singlet Fraction (OSF) and Entanglement Negativity (EN)

The Framework of Quantum Mechanics

Density Operators and Ensembles

Stochastic Histories. Chapter Introduction

Quantum information and quantum computing

Seminar 1. Introduction to Quantum Computing

Lecture 13B: Supplementary Notes on Advanced Topics. 1 Inner Products and Outer Products for Single Particle States

Linear Algebra and Dirac Notation, Pt. 3

Chapter 2. Mathematical formalism of quantum mechanics. 2.1 Linear algebra in Dirac s notation

Linear Algebra using Dirac Notation: Pt. 2

Short Course in Quantum Information Lecture 2

Quantum Computing: Foundations to Frontier Fall Lecture 3

Quantum Wireless Sensor Networks

Basic concepts from quantum theory

Transmitting and Hiding Quantum Information

Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871

Borromean Entanglement Revisited

Discrete Quantum Theories

CS/Ph120 Homework 1 Solutions

Transcription:

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 states 0 and 1. only admits special transformations which preserve the angles, and hence opposites on the sphere; hence these transformations are reversible. only admits reading through so-called quantum measurements M( +, ) which only have two possible outcomes + and, change the initial state ψ to either + or, so in a sense a measurement M( +, ) does not tell us ψ but destroys ψ!

+ θ + θ ψ The two transitions P + :: ψ + P :: ψ have respective chance prob(θ + ) and prob(θ ) with prob(θ + ) + prob(θ ) = 1 with prob(θ) = cos 2θ 2. Due to impossible transitions (prob(180 o ) = 0), we obtain two partial constant maps on the sphere Q P + : Q \ { } Q :: ψ +. P : Q \ { + } Q :: ψ capturing the dynamics of measurement. This can be used as a dynamic resource when designing algorithms and protocols.

The state( of a ) qubit is described by a pair of complex z1 numbers up to a non-zero complex multiple. z 2 Hence for any z C ( ) 0 ( ) ( ) z1 z1 z z1 and z := z 2 z 2 z z 2 both define the same state. Typically one writes ψ := z 0 + z 1 to emphasise a connection with bits. Measurements are special families of projectors e.g. ( ) ( ) 1 0 0 0 P 0 := and P 0 0 1 := 0 1 They induce a change of state ( ) ( 1 0 z1 ψ P 0 ( ψ ) = 0 0 z 2 ( ) ( 0 0 z1 ψ P 1 ( ψ ) = 0 1 z 2 ) ) = = ( z1 0 ( 0 z 2 ) ) ( ) 1 0 ( ) 0 1

What can we do with multiple qubits? 1. Quantum teleportation theory: 1993; 1st experimental realisation: 1997 Ui P i Transmit continuous data by finite means

What can we do with multiple qubits? 2. Entanglement swapping theory: 1993; 1st experimental realisation: 2007 Ui Ui P i Entangle without touching

What can we do with multiple qubits? 3. Public key exchange theory: 1984, 91; you can buy one online Can t be cracked 4. Fast algorithms theory: 1992, 94, 96; science fiction Brings in research money and jobs!

Why this sudden new activity? A bug became a feature,... after experimental confirmation of violation of the Bell inequalities by aspect and Gragnier in 1982. Note in particular the time it took to discover quantum teleportation! (people weren t looking for it) Exposing quantum phenomena is a balancing act : Exploit enlarged state space Avoid destruction of data by measurement Most interesting are things which can t be done: No faster than light communication No hyper-entanglement (e.g. non-local boxes)

von Neumann s pure state formalism What we won t talk about: Continuous time Schrödinger evolution. Continuous observable quantities. Spaces of observable values pure state closed system Definition. A finite-dimensional Hilbert space is a fd vector space H over the complex number field C with a sesquilinear inner-product i.e. a map which satisfies : H H C ψ c 1 ψ 1 + c 2 ψ 2 = c 1 ψ ψ 1 + c 2 ψ ψ 2 c 1 ψ 1 + c 2 ψ 2 ψ = c 1 ψ 1 ψ + c 2 ψ 2 ψ ψ φ = φ ψ ψ ψ R + ψ ψ = 0 ψ = 0 for all c 1, c 2 C and all ψ, ψ 1, ψ 2 H.

The condition ψ H 1, φ H 2 : f (φ) ψ = φ f(ψ) defines the (always existing and unique) adjoint f : H 2 H 1 of f : H 1 H 2. We have (g f) = f g i.e. ( ) is contravariant. A linear operator is unitary if, equivalently, its inverse exist and is equal to its adjoint, it preserves the inner-product. Rays are subspaces spanned by a single vector i.e. span(ψ) = {c ψ c C}. Postulate 1. [states and transformations] The state of a quantum system S is described by a ray in a Hilbert space H. Deterministic transformations of S are described by unitary operators acting on H.

Self-adjoint operators satisfy H = H i.e. H(φ) ψ = φ H(ψ). Self-adjoint idempotent operators P : H H, i.e. P P = P = P, are called projectors. Special examples of projectors on H are the identity 1 H : H H :: ψ ψ and the zero-operator O H : H H :: ψ 0. Proposition. Each self-adjoint operator H : H H admits a so-called spectral decomposition H = i a i P i where all a i R and all P i : H H are projectors which are mutually orthogonal i.e. P i P j = O H for i j.

Postulate 2. [measurements] A measurement on a quantum system is described by a self-adjoint operator. The set {a i } in the operator s spectral decomposition are the measurement outcomes while the set of projectors {P i } describes the change of the state that takes place during a measurement. In particular, when a measurement takes place: 1. The initial state ψ undergoes one of the transitions P i :: ψ P i (ψ) and the probability of the possible transitions is prob(p i, ψ) = ψ P i (ψ) where ψ needs to be normalized. 2. The observer which performs the measurement receives the value a i as a token-witness of that fact. Remark. The measurements represented by a i P i and i P i i are equivalent, in particular, the latter is completely determined by the set {P i } i. i

The direct sum H 1 H 2 := {(ψ, φ) ψ H 1, φ H 2 } enables embedding of states of subsystems via ι 1 : H 1 H 1 H 2 :: ψ (ψ, 0) ι 2 : H 2 H 1 H 2 :: ψ (0, ψ). A base for H 1 H 2 arises canonically as {(e 1, 0),..., (e n, 0), (0, e 1 ),..., (0, e n)}. The tensor product { H 1 H 2 := i α i(ψ i, φ i ) ψ i H 1, φ i H 2 } i α i(( j β jψ ij ), φ i ) ij α iβ j (ψ ij, φ i ) enables embedding of subsystems (but not states!) via H 1 H 2 ξ (bilinear) H 1 H 2 ζ (bilinear)!h (bilinear) A base for H 1 H 2 arises canonically as {e 1,..., e n } {e 1,..., e n}. H

dim(h 1 H 2 ) = dim(h 1 ) + dim(h 2 ), dim(h 1 H 2 ) = dim(h 1 ) dim(h 2 ). Inner product for is: (ψ, ψ ) (φ, φ ) = ψ φ + ψ φ. On pure tensors ψ ψ = (ψ, ψ ) for it is: ψ ψ φ φ = ψ φ ψ φ. Map-state duality H1 H 2 H 1 H 2 shows that describes functions, not pairs! Postulate 3. [compound systems] The joint state of a compound quantum system consisting of two subsystems is described by the tensor product of the Hilbert spaces which describe the two subsystems.

Non-local correlations The Bell-state and EPR-state Bell := e 1 e 1 + e 2 e 2 EPR := e 1 e 2 e 2 e 1 respectively correspond to the matrices ( ) ( ) 1 0 0 1 and. 0 1 1 0 i.e. the Bell-state corresponds to the identity. Since there are no a 1, a 2, a 3, a 4 C such that either ( a1 a 2 ) ( b1 b 2 ) = ( 1 0 0 1 ) ( a1 a 2 ) ( b1 b 2 ) = ( 0 1 1 0 the Bell-state and the EPR-state are truly entangled. But if we measure the left system i.e. we apply {P 1 id, P 2 id} to the whole system we obtain (P 1 id)(bell) = e 1 e 1 (P 1 id)(epr) = e 1 e 2 (P 2 id)(bell) = e 2 e 2 (P 2 id)(epr) = e 2 e 1 that is, we get a certain answer if next we apply {id P 1, id P 2 }. Hence we witness here a non-local spatial effect. )

The no-cloning theorem For an initial state ψ φ 0 H, by means of some U : H H H H we wish to obtain ψ ψ, clone the state of the first quantum system to the second quantum system. Assume we can do this for ψ := ψ 1 and ψ := ψ 2 i.e. U(ψ 1 φ 0 ) = ψ 1 ψ 1 and U(ψ 2 φ 0 ) = ψ 2 ψ 2. Taking the inner-product of the above equalities yields U(ψ 1 φ 0 ) U(ψ 2 φ 0 ) = ψ 1 ψ 1 ψ 2 ψ 2, that is, by U = U 1, ψ 1 ψ 2 ψ 0 ψ 0 = ψ 1 ψ 2 ψ 1 ψ 2 and hence, assuming that all vectors are normalized, ψ 1 ψ 2 = ψ 1 ψ 2 2 which forces ψ 1 ψ 2 = 0 or ψ 1 ψ 2 = 1 i.e. ψ 1 and ψ 2 need to be either equal or orthogonal, so we cannot clone arbitrary states!

In literature: Dirac notation merely a quite convenient notation, too informal and mathematically unsound. For us step-stone to high-level formalism, initiates purely graphical notation, When representing ψ H to be ψ : C H :: 1 ψ Dirac notation is formally justified by letting ψ := ψ and called KET, ψ := ψ and called BRA, concatenation be composition, so the inner-product is a BRA-KET: linear map matrix Dirac notation ψ φ ( c1... c m ) c 1. c m ψ φ

A projector on the ray spanned by ψ is a KET-BRA: linear map matrix Dirac ψ ψ c 1. c m ( c 1... c m ) Pψ := ψ ψ linear map matrix Dirac f ψ m 11...m 1m.. m n1...m nm c 1. c m f ψ φ f ( c1... c m ) m 11...m 1m.. m n1...m nm φ f φ f ψ... = i c i m ijc j C φ f ψ

For projectors on a ray P φ = φ φ probabilities are ψ P φ ψ = ψ φ φ ψ = φ ψ 2. Also, P ψ P φ = ψ ψ φ φ = O H if and only if ψ φ = 0 i.e. ψ and φ are orthogonal. Base for H H iss i j, i j or ij. Is ( ψ ψ )( φ φ ) either as a composition or a tensor i.e. ψ ψ φ φ or ψ φ ψ φ? Examples are: Bell := 00 + 11 EP R := 01 10 GHZ := 000 + 111 W := 100 + 010 + 001 Usually one introduces a normalization e.g. 1 1 ( 00 + 11 ) and ( 000 + 111 ) 2 2

Bell-base and Bell/ Pauli -matrices While a standard 2-qubit measurement { 00 00, 01 01, 10 10, 11 11 } is against the computational base 00 01 10 11 a Bell-base measurement is against the Bell-base 00 + 11 00 11 01 + 10 01 10. It can be obtained by respectively applying Bell-matrices ( ) ( ) ( ) ( ) 1 0 1 0 0 1 0 1 0 1 0 1 1 0 to the second qubit of the Bell-state. 1 0 The 1st qubit is in state Quantum teleportation ψ = c 0 0 + c 1 1, and the 2nd and 3rd one are in the Bell-state. Perform Bell-base measurement on 1st and 2nd qubit. When obtaining the i-th outcome perform the transposed to the i-th Bell-matrix on the 3rd qubit.

Trace For f : H H there exists a unique scalar Tr(f) = i i f i = i f ii which is independent of the choice of the base. tr(f) = Bell (1 H f) Bell. Bell (1 H (f g)) Bell = Bell (1 H (g f)) Bell. For f : H H 1 H H 2 we can now also define tr H H 1,H 2 (f) := ( Bell 1 H2 )(1 H f)( Bell 1 H1 ). tr H H 1,H 2 ( Ψ g Ψ f ) = g f.

von Neumann s mixed state formalism A more general notion is needed to describe: 1. Lack of complete knowledge on actual state. 2. Large statistical ensembles of systems. 3. Subsystems of a bigger entangled systems. 4. Non-isolated (=open) quantum systems. A density operator is a linear map which is: positive i.e. of form ρ = g g so self-adjoint; has trace equal to one. Postulate [extension to mixed states]. The state of a system is a density operator ρ : H H. Deterministic transformations correspond to ρ U ρ U where U : H H is unitary. Pure measurements are described by a set of projectors {P i : H H} i with i P i = 1 H and they cause a state transition ρ P i ρ P i Tr(P i ρ)

and this transition happens with probability Tr(P i ρ).

Probabilistic lack of knowledge. Consider a family of pure states {ψ i } i with probabilistic weights {ω i } i. The probability for a certain outcome in a measurement is the weighted sum of individual probabilities: ω j ψ j P i ψ j = ω j Tr ( P i ψ j ψ j ) j j =Tr(P i ( j =Tr(P i ρ). ω j ψ j ψ j )) j ω j ψ j ψ j is indeed a density matrix: Since φ ψ j ψ j φ = φ ψ j 2 0 hence ω j φ ψ j ψ j φ = φ ( ω j ψ j ψ j ) φ 0 j j Tr( j ω j ψ j ψ j ) = j ω jtr( ψ j ψ j ) = 1 Conversely, all mixed states clearly arise in this way.

Part of a larger system. We now have Φ K H. A measurement of H alone is realised by {1 K P i } i where {P i : H H} i a measurement of H. Hence the respective probabilities are Φ (1 K P i ) Φ = Bell (1 K (f P i f)) Bell =Tr(f P i f) =Tr(P i f f ) =Tr(P i ρ) It is positive. f f is indeed a density matrix: Tr(f f ) = Φ Φ = 1 for Φ is normalised. All mixed states arise in this way by setting f := ρ.