Exemple of Hilbert spaces with dimension equal to two. *Spin1/2particle
|
|
- Alberta Hawkins
- 6 years ago
- Views:
Transcription
1 University Paris-Saclay - IQUPS Optical Quantum Engineering: From fundamentals to applications Philippe Grangier, Institut d Optique, CNRS, Ecole Polytechnique. Eemple of Hilbert spaces with dimension equal to two. *Spin/particle *Polarizedphoton:states with linear or circular polarisation; mathematical structure very close to a spin / (factor on angles, see below). 7 Lecture (7 March, 9:5-0:45) : Qubits, entanglement and Bell s inequalities. Lecture (4 March,:00-:30) : From QND measurements to quantum gates and quantum information. Lecture 3 ( March, 9:5-0:45) : Quantum optics with discrete and continuous variables. Lecture 4 (8 March, :0-:30) : Quantum cryptography and optical quantum networks. * Two-levelatom (attention! spontaneous emission). + z z y Spin / Photon Atom *Superconductingcircuit:anharmonic quantum oscillator due to a Josephson junction, allows one to isolate two energy levels These systems are various implementations of a quantum bit (qubit). e f Bloch s sphere. 9 A few considerations on entangled systems. + z θ ϕ u y Bloch's sphere (spin /) Denote the eigenstate along the direction u(θ, ϕ) Normalized vector ~u u cos( )sin( ), u y sin( )sin( ), u z cos( ). ~.~u ~S.~u h ~.~u cos( ) sin( )e i Eigenvalues of ~.~u : ±, eigenstatesof ~ S.~u eigenstatesof~.~u : + ~u i cos( /)e i / + z i +sin( /)e i / zi ~ui sin( /)e i / + z i +cos( /)e i / zi sin( )e i cos( )! * Within classical physics, correlations between measurements carried out on separated subsystems are eplained by attributing to each subsystems some properties which are correlated to properties of the other subsystem. * If one tries to reproduce quantum correlations using such a model, Bell s inequalities show that these properties must be non-local, i.e. must contradict relativistic causality! inacceptable. * Quantum mechanics remains in perfect agreement with relativistic causality, but there is a price : it is impossible to attribute a local physical reality to the state of each subsystem. EPR Parado (Einstein Podolsky Rosen, 935) Quantum non-separability * We will see now that entanglement plays an essential role in quantum mechanics in general, and especially in quantum information...
2 Lecture : Entanglement in a Quantum Measurement Process : from QND measurements to quantum gates. Direct and indirect measurements in Quantum Mechanics How can we measure the state of a qubit? (spin /, photon, atom...). Direct and indirect measurements in Quantum Mechanics. Analysis of a quantum measurement process, no-cloning theorem 3. From quantum measurement to quantum gates. 4. From Shannon to quantum cryptography. *Directmeasurementprocess: Spin / : Stern-Gerlach magnet! spatial splitting as a function of the value of the spin component parallel to the gradient of magnetic field. Photon : Polarizer! spatial splitting as a function of the polarization... The measurement process demolishes the qubit, which is no more available after the measurement. *Indirectmeasurementprocess: One reads the state of the qubit by coupling it to another qubit. One can thus realize an ideal measurement, including the state preparation stage. This is called a Quantum Non Demolition (QND) measurement. Attention : QNDdoes not mean that there is noe ect on the system s state! AQNDmeasurementis aquantummeasurement,sothesystem sstateis changed, unless it is already in an eigenstate of the measured observable. QND measurement of a spin component. 3 QND measurement of a spin component : conclusion. 7 One wants to perform a QND measurement of ˆz on a qubit a : if the qubit is a spin / particle, one gets the spin a to interact with another spin b during a time, andreadouttheresultonspin b. An appropriate interaction Hamiltonian is : H m hg ˆaz ˆb / B eff if az+ z Final state of qubit b if az + B eff if az- y Initial state of qubit b Final state of qubit b if az - Everything happens as if qubit acreatesonqubitbane ective magnetic field, aligned along O, with a sign depending on the state ±i az (see eercise!). +i az +i by! +i az +i bz i az +i by! i i az i bz In the general case the initial state is and from the superposition principle : (0)i ( +i az + i az ) +i by ( )i ( +i az +i bz + i i az i bz ) This is an entangled state like the EPR state seen before : a measurement on qubit b gives + with probability and with probability. For each result, the state of qubit a is perfectly known after the measurement ( reduction of the wave packet ). The quantum measurement of az is done by an indirect measurement, called a QND measurement : qubit a is still there for further action! Attention : the final state is not aduplicationofanarbitraryinitialstate, which would be ( +i az + i az ) ( +i bz + i bz ) : no-cloning!
3 8 9 The no-cloning theorem (). Quantum cloning means to duplicate an arbitrary and unknown initial quantum state onto another system with an initial state 0 i ( white sheet ), keeping the original intact in order to have two identical copies. Considering two di erent initial states to be copied i et i one wants : i 0 i! i i i 0 i! i i The copies are denoted as i et i because they may be made on di erent physical systems : e.g. cloning a polarized photon onto a spin / particle. Theorem : Perfect cloning of an arbitrary unknown quantum state is forbidden both by linearity and by unitarity of quantum mechanics. The no-cloning theorem ().. Demonstration based on linearity : let us consider 3i p ( i+ i) i 0 i! i i i 0 i! i i 3i 0 i! p ( i i + i i) 6 3i 3 i The sum of the copies is not the copy of the sum!. Demonstration based on unitarity : conservation of the scalar product. h i h 0 0 i h ih i h i ( h i)0 h i 0:orthogonalstates h i :identicalcopies. Conclusion : one can clone within a known set of orthogonal states, but it is not possible to clone (perfectly) within a set of non-orthogonal states. Generalization : CNOT quantum gate The interaction between two qubits seen previously implements a logical operation between the qubits : 0, 0i! 0, 0i, et, 0i! i, i. Generalizing, one defines a C-NOT (Controlled-NOT) gate, which does the following (denoting ii a ji b i, ji): 0, 0i! 0, 0i 0, i! 0, i, 0i!, i, i!, 0i The first qubit (control qubit) is unchanged. The second qubit (target qubit) is inverted if the first qubit value is one. This logical gate (applied to many qubits...) is a building block to implement quantum computation. 0 Simple application : preparation and measurement of Bell s states The control qubit is driven in a superposition of the computational states 0i et i ( / rotation of Bloch s vector), then the CNOT gate is applied: 0, 0i! p ( 0i +? i) 0i! p ( 0, 0i +, i) 0, i! p ( 0i + i) i! p ( 0, i +, 0i), 0i! p ( 0i i) 0i! p ( 0, 0i, i), i! p ( 0i i) i! p ( 0, i, 0i) One gets 4 orthogonal entangled states forming a basis of the Hilbert space of the two qubits (with dimension 4) : Bell s states. This transformation is reversible : starting from Bell s states, on can get the four factorized basis states, which are easy to identify from a direct measurement of the two qubits : Bell s states measurement.
4 Simple application : preparation and measurement of Bell s states The control qubit is driven in a superposition of the computational states 0i et i ( / rotation of Bloch s vector), then the CNOT gate is applied: 0, 0i! p ( 0i + i) 0i! p ( 0, 0i +, i) 0, i! p ( 0i + i) i! p ( 0, i +, 0i), 0i! p ( 0i i) 0i! p ( 0, 0i, i), i! p ( 0i i) i! p ( 0, i, 0i) One gets 4 orthogonal entangled states forming a basis of the Hilbert space of the two qubits (with dimension 4) : Bell s states. This transformation is reversible : starting from Bell s states, on can get the four factorized basis states, which are easy to identify from a direct measurement of the two qubits : Bell s states measurement. A few elementary notions about the classical theory of information. Shannon entropy 3 Fundamental results published by Claude Shannon, 948. () By how much is it possible to compress the data of a message, assuming that there is no transmission noise? Answer : the maimum compression rate is the Shannon entropy of the message () What is the maimum transmission rate through a noisy channel? Answer : the maimum transmission rate of information is equal to the channel capacity, tobedefinedbelow Message : (long) string of n letters chosen within an alphabet of k letters : {a,a,...a k } Each letter a is given a probability p(a ),with P k p(a ). Simple eemple : binary alphabet {0, } with p(0) p, p() p. If n>>, themessagewillcontainaboutnp bits and n( p) bits 0. The number of such typical messages is Cn np n! (np)!(n np)!
5 Using Stirling s formula log(n!) n log n n + O(log n) one gets : log (Cnp) n n log (n) np log (np) (n np)log (n np) nh(p) where we define the (binary) Shannon entropy H(p) p log p ( p)log ( p). 4 Remarks : *ShapeofthebinaryentropyH(p) p log p ( p)log ( p): The number of typical messages is then nh(p). 0.6 Main point : When n is very large, it is su cient to assign a codeword to each of these typical messages, because the atypical messages will almost never appear (more rigorously : the error rate due to the atypical messages will be asymptotically negligible). In order to identify these codewords one needs nh(p) bits instead of n, the compression factor is thus H(p) apple *Forp / one gets H(p) : a completely random message (no redundancy) cannot be compressed. 6 This reasoning can be generalized for k letters, by defining H(X) X p()log p() hlog p()i. where H(X) is the Shannon entropy of the message X {, p()} (alphabet and associated probabilities). Amessagewithn letters can then be compressed in nh(x) bits; on says also that each letter carries on average H(X) bits of information. Remarks : *Ifthe6lettersoftheusualalphabetwereperfectlyrandom,eachletter would carry log (6) 4.7 bits. However the probabilities are not equally distributed (esainturlo...) and the letters are strongly correlated, so a letter carries about. bit (see crypto/java/entropy/). *Thereforeitisenoughtousen(H(p) + ) bits to encode a message with n bits, without errors asymptotically. On the other hand, one shows that with n(h(p) ) bits there will necessarily be errors, because there will not be enough codewords to represent all typical sequences.
6 Mutual information. 7 Mutual information. 8 In a message is transmitted through a noisy channel, the received message will be in general di erent from the sent message. So one should answer the question : what do we know about a message drawn in the ensemble X n,if one knows a message drawn in the ensemble Y n? Let us define the conditional probability p(y ) to receive y if was sent. The ensemble of p(y ) caracterizes the channel, and using Bayes formula one can calculate p( y) : p( y) p(, y)/p(y) p(y )p()/ X p(y )p() From the p( y) one defines the conditional entropy H(X Y ) : H(X Y )h log p( y)i h log p(, y)i + hlog p(y)i. One has thus : and also H(X Y )H(X, Y ) H(Y ) H(Y X) H(X, Y ) H(X) One defines then the mutual information I(X; Y ) : I(X; Y )H(X) H(X Y ) H(X)+ H(Y ) H(X, Y ) H(Y ) H(Y X) The mutual information I(X; Y ) is symmetrical with respect to X and Y, and is zero if X and Y are uncorrelated. It is the fundamental quantity measuring the information echanged through the channel. The unit of I(X; Y ) ( bit per symbol ) is the same as the one used for the entropies H(X). Shannon theorem for the transmission through a noisy channel : The maimum number of bits per symbol that can be transmitted through anoisychannelisitscapacityc, definedby: C Ma {p()} I(X; Y ) Taking the maimum over {p()} eliminates the role of the message, and therefore C is a property of the channel itself (in fact, of the p(y )). 3 The density matri () One can (re)formulate quantum mechanics by replacing the state vector (t)i by the projector onto (t)i : (t)i! ˆ (t) (t)ih (t) Then a statistical distribution of states i i with a probability i (classical statistics) willbedescribedbythedensity matri : ˆ X i i i ih i As a result the double average (classical and quantum) of an observable  can be written: hâi stat X i i h i  ii X i i Tr( i ih i Â) Tr(ˆ Â) H(X,Y)
7 4 9 The density matri () It is postulated that any quantum state can be described by a density operator ˆ such that : ˆ is hermitian with trace (but ˆ is not always a projector) All its eigenvalues are positive or zero. The hamiltonian evolution and measurement probabilities are given by : P(a )Tr(ˆ ˆP ) hai Tr(ˆ Â). i h dˆ dt hĥ(t), ˆ (t) i. Remark : One can always diagonalize ˆ and write : ˆ P i i i ih i. One recovers a pure state if there is only one non-zero i,then ˆ (t) (t)ih (t), ˆ ˆ and Tr( ˆ ) Simple eemples of density matrices () Depolarized spin / (silver atom straight from the oven) : ˆ nonpol. +ih+ + ih 0 0 ˆ. to be compared to a pure state ( +i + i)/ p : ˆ pol.selon. Qubit : two-state system { ei, gi} ou { +i, ee ˆ eg ( + nz )/ (n in y )/ ge gg (n + in y )/ ( n z )/ i}: ˆ+~n.~ where we define ~n (n,n y,n z ) with n i real numbers, and where we used the Pauli matrices ~ : 0 0 i 0 y z 0 i 0 0 The eigenvalues of ˆ ˆ+~n.~ are equal to ( ± ~n ) Generalisation of Bloch sphere ( Bloch ball ) z θ n ϕ u y ˆ ( + nz )/ (n in y )/ (n + in y )/ ( n z )/ ˆ+~n.~ with eigenvalues ( ± ~n ). Using Tr( i )0, one gets : 0 i ˆ (i, y, z), h~ i Tr(ˆ ~)~n if ~n one can write ~n ~u and one retrieves a pure state. The operator ˆ is then a projector on the state + ~u i,andonehash~ i ~u if ~n < then ~n is inside the Bloch ball, and one has again h~ i ~n if ~n 0then the spin is depolarized and h~ i ~0. Entangled pair of spin / particles (qubits). In a singlet state for pour spins / : ss i p ( +, i, +i) ˆ ss B A with the ordering of the basis vectors: { +, +i, +, i,, +i,, i} Justify the above epression of ˆ ss. Show that the reduced density operators are given by : ˆ A 0 ˆ 0 B 0 ˆ 0 A ˆ B 4 ˆ 4 Conclude that the two sub-systems are completely depolarized. Show by using the reduced density operators that the reduction of the wave packet does not allow any transfer of information between Alice and Bob when doing an EPR correlation eperiment. 5
8 Von Neumann entropy. 9 Mathematical properties of Von Neumann entropy (). 0 In quantum information the symbols may become quantum states, described by a density matri,andthealphabetisthenanensemble{,p }. The density matri seen by an observer is then X p. One can choose an orthonormal basis { ai} where is diagonal X p a aiha. a The set { aiha,p a } is then équivalent to a classical alphabet, and one has: H(A) X p a log (p a ) Trace( log )S( ) a where S( ) is the Von Neumann entropy of the density matri. In general the symbols are not mutually eclusive (non orthogonal states), and the Shannon and Von Neumann entropies have di erent properties.. The entropy S( ih ) of a pure state is equal to zero.. The entropy S( ) is not modified by a change of basis (isometry). 3. If has D non-zero eignevalues, then S( ) apple log D. 4. For p i 0 and P i p i,onehass( P i p P i i ) i p i S( i ) (S increases when ignoring of the way by which the state was prepared). 5. Measurement : For an observable B with eigenvalues b y one defines Y {b y,p(b y )} and then H(Y ) S( ) (equality if [B, ] 0). 6. Preparation : For a density matri P p ih with X { i, p } then H(X) S( ) (equality if the { } are orthogonal). Mathematical properties of Von Neumann entropy (). Quantum data compression. 7. For a bipartite system AB one has whereas S( A ) S( B ) apple S( AB ) apple S( A )+S( B ) H(X),H(Y ) apple H(X, Y ) apple H(X)+H(Y ). Fundamental di erence between Shannon and Von Neumann! On can get S( A )S( B ) 6 0whereas S( AB )0 (entanglement! impossible classically). 8. Strong subaddidivity : For a tripartite system ABC one has S( ABC )+S( B ) apple S( AB )+S( BC ) (important, not easy to demonstrate!). One considers P p ih,andonedefinesx { i, p }. A message with n symbols is then associated to the density matri n.... What is the minimum number of qubits needed to encode this message? (Reminder : the dimension of the Hilbert space E for N qubits is N ). It can be shown (Schumacher) that log (dime) N ns( ). The entropy S( ) corresponds to the number of qubits per symbol of the message. Principle of the demonstration : For very long messages, the support of the density matri n is included within a subspace of dimension ns( ).ThiscanbeobtainedfromShannon s theorem, by considering a basis where is diagonal.
9 3 Quantum data compression: a few remarks.. Bob received qubits which are e ciently packaged, but in general he cannot simply retrieve the classical information sent by Alice.. In the general case, the symbols are themselves statistical mitures (density matrices), and not pure states. An important question is then to evaluate the maimum amount of classical information, that can be etracted from a quantum message. The answer is given by using the Holevo information : X ({,p })S( ) p S( ). Holevo theorem then states that the maimum accessible classical information (over all possible measurements) is bounded by ({,p }) : Ma Mesures I(X; Y ) apple ({,p }). Quantum cryptography: the characters Eve Alice Bob Demonstration : Not obvious, one has to use strong subadditivity Secret key cryptosystem : one-time pad (G. Vernam, 97) 0 secret channel! 000 " " 000! Eve classical channel ( Demonstrably secure if the key is : random as long as the message used only once (Shannon) 0! Quantum Secret Key Cryptosystem : Bennett-Brassard (984) " 0! # " ÿ quantum channel [ classical channel ( " ! Demonstrably secure if the key is : random as long as the message used only once (Shannon) unknown by Eve : Quantum laws! 0 00
to mere bit flips) may affect the transmission.
5 VII. QUANTUM INFORMATION THEORY to mere bit flips) may affect the transmission. A. Introduction B. A few bits of classical information theory Information theory has developed over the past five or six
More informationQuantum Information Theory
Chapter 5 Quantum Information Theory Quantum information theory is a rich subject that could easily have occupied us all term. But because we are short of time (I m anxious to move on to quantum computation),
More informationLecture 11: Quantum Information III - Source Coding
CSCI5370 Quantum Computing November 25, 203 Lecture : Quantum Information III - Source Coding Lecturer: Shengyu Zhang Scribe: Hing Yin Tsang. Holevo s bound Suppose Alice has an information source X that
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 informationQuantum 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 informationLecture 3 (21 March, 9:15-10:45) : Quantum optics with discrete and continuous variables.
1 University Paris-Saclay - IQUPS Optical Quantum Engineering: From fundamentals to applications Philippe Grangier, Institut d Optique, CNRS, Ecole Polytechnique. Lecture 1 (7 March, 9:15-10:45) : Qubits,
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 informationEntropy 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 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 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 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 Information Chapter 10. Quantum Shannon Theory
Quantum Information Chapter 10. Quantum Shannon Theory John Preskill Institute for Quantum Information and Matter California Institute of Technology Updated January 2018 For further updates and additional
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 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 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 Information Theory and Cryptography
Quantum Information Theory and Cryptography John Smolin, IBM Research IPAM Information Theory A Mathematical Theory of Communication, C.E. Shannon, 1948 Lies at the intersection of Electrical Engineering,
More information3F1: Signals and Systems INFORMATION THEORY Examples Paper Solutions
Engineering Tripos Part IIA THIRD YEAR 3F: Signals and Systems INFORMATION THEORY Examples Paper Solutions. Let the joint probability mass function of two binary random variables X and Y be given in the
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 informationPhysics is becoming too difficult for physicists. David Hilbert (mathematician)
Physics is becoming too difficult for physicists. David Hilbert (mathematician) Simple Harmonic Oscillator Credit: R. Nave (HyperPhysics) Particle 2 X 2-Particle wave functions 2 Particles, each moving
More 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 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 informationQuantum Data Compression
PHYS 476Q: An Introduction to Entanglement Theory (Spring 2018) Eric Chitambar Quantum Data Compression With the basic foundation of quantum mechanics in hand, we can now explore different applications.
More informationEntropies & Information Theory
Entropies & Information Theory LECTURE I Nilanjana Datta University of Cambridge,U.K. See lecture notes on: http://www.qi.damtp.cam.ac.uk/node/223 Quantum Information Theory Born out of Classical Information
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 informationPHY305: 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 informationSeminar 1. Introduction to Quantum Computing
Seminar 1 Introduction to Quantum Computing Before going in I am also a beginner in this field If you are interested, you can search more using: Quantum Computing since Democritus (Scott Aaronson) Quantum
More informationLecture 18: Quantum Information Theory and Holevo s Bound
Quantum Computation (CMU 1-59BB, Fall 2015) Lecture 1: Quantum Information Theory and Holevo s Bound November 10, 2015 Lecturer: John Wright Scribe: Nicolas Resch 1 Question In today s lecture, we will
More informationLecture 6: Quantum error correction and quantum capacity
Lecture 6: Quantum error correction and quantum capacity Mark M. Wilde The quantum capacity theorem is one of the most important theorems in quantum hannon theory. It is a fundamentally quantum theorem
More 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 informationInformation-theoretic treatment of tripartite systems and quantum channels. Patrick Coles Carnegie Mellon University Pittsburgh, PA USA
Information-theoretic treatment of tripartite systems and quantum channels Patrick Coles Carnegie Mellon University Pittsburgh, PA USA ArXiv: 1006.4859 a c b Co-authors Li Yu Vlad Gheorghiu Robert Griffiths
More informationSupplementary Material I. BEAMSPLITTER ATTACK The beamsplitter attack has been discussed [C. H. Bennett, F. Bessette, G. Brassard, L. Salvail, J. Smol
Unconditional Security Of Quantum Key Distribution Over Arbitrarily Long Distances Hoi-Kwong Lo 1 and H. F. Chau, 2y 1 Hewlett-Packard Labs, Filton Road, Stoke Giord, Bristol BS34 8QZ, U. K. 2 Department
More informationChapter 14: Quantum Information Theory and Photonic Communications
Chapter 14: Quantum Information Theory and Photonic Communications Farhan Rana (MIT) March, 2002 Abstract The fundamental physical limits of optical communications are discussed in the light of the recent
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 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 information1 1D Schrödinger equation: Particle in an infinite box
1 OF 5 1 1D Schrödinger equation: Particle in an infinite box Consider a particle of mass m confined to an infinite one-dimensional well of width L. The potential is given by V (x) = V 0 x L/2, V (x) =
More informationFRAMES IN QUANTUM AND CLASSICAL INFORMATION THEORY
FRAMES IN QUANTUM AND CLASSICAL INFORMATION THEORY Emina Soljanin Mathematical Sciences Research Center, Bell Labs April 16, 23 A FRAME 1 A sequence {x i } of vectors in a Hilbert space with the property
More informationEntanglement and information
Ph95a lecture notes for 0/29/0 Entanglement and information Lately we ve spent a lot of time examining properties of entangled states such as ab è 2 0 a b è Ý a 0 b è. We have learned that they exhibit
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 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 informationEntanglement-Assisted Capacity of a Quantum Channel and the Reverse Shannon Theorem
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 10, OCTOBER 2002 2637 Entanglement-Assisted Capacity of a Quantum Channel the Reverse Shannon Theorem Charles H. Bennett, Peter W. Shor, Member, IEEE,
More information10 Interpreting Quantum Mechanics
10 Interpreting Quantum Mechanics In this final chapter, I want to explore the process of measurement in quantum mechanics. 10.1 The Density Operator To get started, we must first come clean about an unrealistic
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 informationEnsembles 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 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 Coding. Benjamin Schumacher. Department of Physics. Kenyon College. Gambier, OH
Quantum Coding Benjamin Schumacher Department of Physics Kenyon College Gambier, OH 43022 e-mail: schumacb@kenyon.edu Abstract A theorem is proven for quantum information theory that is analogous to the
More informationIntroduction to Quantum Key Distribution
Fakultät für Physik Ludwig-Maximilians-Universität München January 2010 Overview Introduction Security Proof Introduction What is information? A mathematical concept describing knowledge. Basic unit is
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 information1 1D Schrödinger equation: Particle in an infinite box
1 OF 5 NOTE: This problem set is to be handed in to my mail slot (SMITH) located in the Clarendon Laboratory by 5:00 PM (noon) Tuesday, 24 May. 1 1D Schrödinger equation: Particle in an infinite box Consider
More informationQuantum Computation: From Quantum Teleportation to the Shor s Algorithm
Quantum Computation: From Quantum Teleportation to the Shor s Algorithm J. J. Ruiz-Lorenzo Dep. Física, Universidad de Extremadura Instituto de Computación Científica Avanzada de Extremadura (ICCAEx) http://www.eweb.unex.es/eweb/fisteor/juan
More 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 informationEPR paradox, Bell inequality, etc.
EPR paradox, Bell inequality, etc. Compatible and incompatible observables AA, BB = 0, then compatible, can measure simultaneously, can diagonalize in one basis commutator, AA, BB AAAA BBBB If we project
More information*WILEY- Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co.
Joachim Stolze and Dieter Suter Quantum Computing A Short Course from Theory to Experiment Second, Updated and Enlarged Edition *WILEY- VCH WILEY-VCH Verlag GmbH & Co. KGaA Contents Preface XIII 1 Introduction
More 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 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 informationMP 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 informationExample: sending one bit of information across noisy channel. Effects of the noise: flip the bit with probability p.
Lecture 20 Page 1 Lecture 20 Quantum error correction Classical error correction Modern computers: failure rate is below one error in 10 17 operations Data transmission and storage (file transfers, cell
More informationGilles Brassard. Université de Montréal
Gilles Brassard Université de Montréal Gilles Brassard Université de Montréal VOLUME 76, NUMBER 5 P H Y S I C A L R E V I E W L E T T E R S 29 JANUARY 1996 Purification of Noisy Entanglement and Faithful
More informationContextuality and the Kochen-Specker Theorem. Interpretations of Quantum Mechanics
Contextuality and the Kochen-Specker Theorem Interpretations of Quantum Mechanics by Christoph Saulder 19. 12. 2007 Interpretations of quantum mechanics Copenhagen interpretation the wavefunction has no
More informationThe Adaptive Classical Capacity of a Quantum Channel,
The Adaptive Classical Capacity of a Quantum Channel, or Information Capacities of Three Symmetric Pure States in Three Dimensions Peter W. Shor 1 AT&T Labs Research Florham Park, NJ 07932 02139 1 Current
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 informationChapter 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 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 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 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 informationLecture 21: Quantum Communication
CS 880: Quantum Information Processing 0/6/00 Lecture : Quantum Communication Instructor: Dieter van Melkebeek Scribe: Mark Wellons Last lecture, we introduced the EPR airs which we will use in this lecture
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 informationA review on quantum teleportation based on: Teleporting an unknown quantum state via dual classical and Einstein- Podolsky-Rosen channels
JOURNAL OF CHEMISTRY 57 VOLUME NUMBER DECEMBER 8 005 A review on quantum teleportation based on: Teleporting an unknown quantum state via dual classical and Einstein- Podolsky-Rosen channels Miri Shlomi
More informationLECTURE NOTES ON Quantum Cryptography
Department of Software The University of Babylon LECTURE NOTES ON Quantum Cryptography By Dr. Samaher Hussein Ali College of Information Technology, University of Babylon, Iraq Samaher@itnet.uobabylon.edu.iq
More informationQuantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co. KGaA
Joachim Stolze and Dieter Suter Quantum Computing A Short Course from Theory to Experiment Second, Updated and Enlarged Edition WILEY- VCH WILEY-VCH Verlag GmbH & Co. KGaA Preface XIII 1 Introduction and
More informationConcentration of Measure Effects in Quantum Information. Patrick Hayden (McGill University)
Concentration of Measure Effects in Quantum Information Patrick Hayden (McGill University) Overview Superdense coding Random states and random subspaces Superdense coding of quantum states Quantum mechanical
More informationTopics in Quantum Information Theory
Topics in Quantum Information Theory Lent Term 006 Sebastian Ahnert Lecture notes on: http://www.tcm.phy.cam.ac.uk/ sea31/ Corrections and comments welcome under: sea31@cam.ac.uk Warning: These notes are
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 informationPing Pong Protocol & Auto-compensation
Ping Pong Protocol & Auto-compensation Adam de la Zerda For QIP seminar Spring 2004 02.06.04 Outline Introduction to QKD protocols + motivation Ping-Pong protocol Security Analysis for Ping-Pong Protocol
More informationi = cos 2 0i + ei sin 2 1i
Chapter 10 Spin 10.1 Spin 1 as a Qubit In this chapter we will explore quantum spin, which exhibits behavior that is intrinsically quantum mechanical. For our purposes the most important particles are
More informationChapter 1. Quantum interference 1.1 Single photon interference
Chapter. Quantum interference. Single photon interference b a Classical picture Quantum picture Two real physical waves consisting of independent energy quanta (photons) are mutually coherent and so they
More informationOn the Relation between Quantum Discord and Purified Entanglement
On the Relation between Quantum Discord and Purified Entanglement by Eric Webster A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics
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 informationStop Conditions Of BB84 Protocol Via A Depolarizing Channel (Quantum Cryptography)
Journal of Computer Science 3 (6): 44-49, 7 ISSN 549-3636 7 Science Publications Stop Conditions Of BB84 Protocol Via A Depolarizing Channel (Quantum Cryptography) Iyed Ben Slimen, Olfa Trabelsi, Houria
More informationQUANTUM CRYPTOGRAPHY QUANTUM COMPUTING. Philippe Grangier, Institut d'optique, Orsay. from basic principles to practical realizations.
QUANTUM CRYPTOGRAPHY QUANTUM COMPUTING Philippe Grangier, Institut d'optique, Orsay 1. Quantum cryptography : from basic principles to practical realizations. 2. Quantum computing : a conceptual revolution
More informationThe quantum way to diagonalize hermitean matrices
Fortschr. Phys. 51, No. 2 3, 249 254 (2003) / DOI 10.1002/prop.200310035 The quantum way to diagonalize hermitean matrices Stefan Weigert HuMP Hull Mathematical Physics, Department of Mathematics University
More informationThe 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 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 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 informationA Survey on Quantum Channel Capacities
1 A Survey on Quantum Channel Capacities Laszlo Gyongyosi, 1,2,3, Member, IEEE, Sandor Imre, 2 Senior Member, IEEE, and Hung Viet Nguyen, 1 Member, IEEE 1 School of Electronics and Computer Science, University
More informationUniversal quantum computers
F. UNIVERSAL QUANTUM COMPUTERS 169 F Universal quantum computers Hitherto we have used a practical definition of universality: since conventional digital computers are implemented in terms of binary digital
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 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(Classical) Information Theory III: Noisy channel coding
(Classical) Information Theory III: Noisy channel coding Sibasish Ghosh The Institute of Mathematical Sciences CIT Campus, Taramani, Chennai 600 113, India. p. 1 Abstract What is the best possible way
More informationPhysics ; CS 4812 Problem Set 4
Physics 4481-7681; CS 4812 Problem Set 4 Six problems (six pages), all short, covers lectures 11 15, due in class 25 Oct 2018 Problem 1: 1-qubit state tomography Consider a 1-qubit state ψ cos θ 2 0 +
More informationQuantum cryptography. Quantum cryptography has a potential to be cryptography of 21 st century. Part XIII
Quantum cryptography Part XIII Quantum cryptography Quantum cryptography has a potential to be cryptography of st century. An important new feature of quantum cryptography is that security of quantum cryptographic
More informationQuantum Cryptography
Quantum Cryptography (Notes for Course on Quantum Computation and Information Theory. Sec. 13) Robert B. Griffiths Version of 26 March 2003 References: Gisin = N. Gisin et al., Rev. Mod. Phys. 74, 145
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 informationIs 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 informationPrivate quantum subsystems and error correction
Private quantum subsystems and error correction Sarah Plosker Department of Mathematics and Computer Science Brandon University September 26, 2014 Outline 1 Classical Versus Quantum Setting Classical Setting
More informationNoisy channel communication
Information Theory http://www.inf.ed.ac.uk/teaching/courses/it/ Week 6 Communication channels and Information Some notes on the noisy channel setup: Iain Murray, 2012 School of Informatics, University
More informationPH 425 Quantum Measurement and Spin Winter SPINS Lab 2
PH 425 Quantum Measurement and Spin Winter 23 SPINS Lab 2 1. Start the SPINS program and choose Unknown #1 under the Initialize menu. This causes the atoms to leave the oven in a definite quantum state,
More informationAn introduction to basic information theory. Hampus Wessman
An introduction to basic information theory Hampus Wessman Abstract We give a short and simple introduction to basic information theory, by stripping away all the non-essentials. Theoretical bounds on
More informationQuantum Optics and Quantum Informatics FKA173
Quantum Optics and Quantum Informatics FKA173 Date and time: Tuesday, 7 October 015, 08:30-1:30. Examiners: Jonas Bylander (070-53 44 39) and Thilo Bauch (0733-66 13 79). Visits around 09:30 and 11:30.
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 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 information