Entropic uncertainty relations for anti-commuting observables

Slides:



Advertisements
Similar presentations
Quantum t-designs: t-wise independence in the quantum world Andris Ambainis, Joseph Emerson IQC, University of Waterloo.
Advertisements

Tony Short University of Cambridge (with Sabri Al-Safi – PRA 84, (2011))
Random non-local games Andris Ambainis, Artūrs Bačkurs, Kaspars Balodis, Dmitry Kravchenko, Juris Smotrovs, Madars Virza University of Latvia.
Random non-local games Andris Ambainis, Artūrs Bačkurs, Kaspars Balodis, Dmitry Kravchenko, Juris Smotrovs, Madars Virza University of Latvia.
Quantum Computing MAS 725 Hartmut Klauck NTU
I NFORMATION CAUSALITY AND ITS TESTS FOR QUANTUM COMMUNICATIONS I- Ching Yu Host : Prof. Chi-Yee Cheung Collaborators: Prof. Feng-Li Lin (NTNU) Prof. Li-Yi.
Fixing the lower limit of uncertainty in the presence of quantum memory Archan S. Majumdar S. N. Bose National Centre for Basic Sciences, Kolkata Collaborators:
Postulates of Quantum Mechanics. The Fundamental Rules of Our Game Any measurement we can make with an experiment corresponds to a mathematical “operator”
Quantum Information Stephen M. Barnett University of Strathclyde The Wolfson Foundation.
Quantum information as high-dimensional geometry Patrick Hayden McGill University Perspectives in High Dimensions, Cleveland, August 2010.
Short course on quantum computing Andris Ambainis University of Latvia.
Universal Uncertainty Relations Gilad Gour University of Calgary Department of Mathematics and Statistics Gilad Gour University of Calgary Department of.
Quantum Computing MAS 725 Hartmut Klauck NTU
X y z z′ R (  1,  2,  3 ) = 11 y′ 11 =x′ 22 22 22 x′′ z′′ =y′′ 33 y′′′ z′′′ = x′′′ 33 33.
Avraham Ben-Aroya (Tel Aviv University) Oded Regev (Tel Aviv University) Ronald de Wolf (CWI, Amsterdam) A Hypercontractive Inequality for Matrix-Valued.
Oded Regev (Tel Aviv University) Ben Toner (CWI, Amsterdam) Simulating Quantum Correlations with Finite Communication.
CSEP 590tv: Quantum Computing
Quantum Algorithms II Andrew C. Yao Tsinghua University & Chinese U. of Hong Kong.
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
4. The Postulates of Quantum Mechanics 4A. Revisiting Representations
EECS 598 Fall ’01 Quantum Cryptography Presentation By George Mathew.
Paraty, Quantum Information School, August 2007 Antonio Acín ICFO-Institut de Ciències Fotòniques (Barcelona) Quantum Cryptography.
Modern Navigation Thomas Herring
Presented by: Erik Cox, Shannon Hintzman, Mike Miller, Jacquie Otto, Adam Serdar, Lacie Zimmerman.
Quantum Computing MAS 725 Hartmut Klauck NTU
Alice and Bob’s Excellent Adventure
Signal Processing and Representation Theory Lecture 1.
A Few Simple Applications to Cryptography Louis Salvail BRICS, Aarhus University.
Christian Schaffner CWI Amsterdam, Netherlands Quantum Cryptography beyond Key Distribution Workshop on Post-Quantum Security Models Paris, France Tuesday,
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Deterministic vs. Random Maximum A Posteriori Maximum Likelihood Minimum.
Too Many to Count.
Cryptography In the Bounded Quantum-Storage Model Christian Schaffner, BRICS University of Århus, Denmark ECRYPT Autumn School, Bertinoro Wednesday, October.
Cryptography In the Bounded Quantum-Storage Model Christian Schaffner, BRICS University of Århus, Denmark 9 th workshop on QIP 2006, Paris Tuesday, January.
Entanglement sampling and applications Omar Fawzi (ETH Zürich) Joint work with Frédéric Dupuis (Aarhus University) and Stephanie Wehner (CQT, Singapore)
Quantum correlations with no causal order OgnyanOreshkov, Fabio Costa, ČaslavBrukner Bhubaneswar arXiv: December2011 Conference on Quantum.
Cryptography In the Bounded Quantum-Storage Model
5. Quantum Theory 5.0. Wave Mechanics
Page 1 COMPSCI 290.2: Computer Security “Quantum Cryptography” including Quantum Communication Quantum Computing.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
5. The Harmonic Oscillator Consider a general problem in 1D Particles tend to be near their minimum Taylor expand V(x) near its minimum Recall V’(x 0 )
Part 3: Estimation of Parameters. Estimation of Parameters Most of the time, we have random samples but not the densities given. If the parametric form.
PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 1: INTRODUCTION.
Quantum Two 1. 2 Angular Momentum and Rotations 3.
Random Access Codes and a Hypercontractive Inequality for
Q. M. Particle Superposition of Momentum Eigenstates Partially localized Wave Packet Photon – Electron Photon wave packet description of light same.
Richard Cleve DC 2117 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Lecture 16 (2009) Richard.
12. Principles of Parameter Estimation
Jean Christian Boileau (University of Toronto)
Matrices and vector spaces
COMPSCI 290.2: Computer Security
Postulates of Quantum Mechanics
Quantum Cryptography Quantum Computing
Systems of First Order Linear Equations
Quantum One.
Quantum One.
4. The Postulates of Quantum Mechanics 4A. Revisiting Representations
Quantum Foundations Lecture 15
Quantum Two.
Quantum Information Theory Introduction
Numerical Ranges in Modern Times 14th WONRA at Man-Duen Choi
Uncertain Compression
Quantum One.
Quantum Two.
Linear Vector Space and Matrix Mechanics
12. Principles of Parameter Estimation
Quantum Cryptography Quantum Computing
Richard Cleve DC 2117 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Lecture 16 (2009) Richard.
Linear Vector Space and Matrix Mechanics
Quantum Cryptography Quantum Computing
Error Correction Coding
Presentation transcript:

Entropic uncertainty relations for anti-commuting observables Stephanie Wehner Joint work with Andreas Winter

Outline Uncertainty Relations A meta-uncertainty relation What are they? What is known? A meta-uncertainty relation Clifford algebra Characterizing quantum states Strong uncertainty relations .. for the collision entropy …for the Shannon entropy Relation to BB84 Open questions

The setting ½ X=[k] Y=[k] 1 PX(1) 2 ½ PX(2) : X=[k] PX(k) k Y=[k] In quantum physics, the outcome of even an ideal measurement of a system is not deterministic, but instead is characterized by a probability distribution, and the larger the associated standard deviation is, the more "uncertain" we might say that that characteristic is for the system. The Heisenberg uncertainty principle gives a lower bound on the product of the standard deviations of position and momentum for a system, implying that it is impossible to have a particle that has an arbitrarily well-defined position and momentum simultaneously. More precisely, the product of the standard deviations , where is the reduced Planck constant. The principle generalizes to many other pairs of quantities besides position and momentum (for example, angular momentum about two different axes), and can be derived directly from the axioms of quantum mechanics. It has often been regarded as the most distinctive feature in which quantum mechanics differs from classical theories of the physical world. Roughly speaking, the uncertainty principle (for position and momentum) states that one cannot assign exact simultaneous values to the position and momentum of a physical system. Rather, these quantities can only be determined with some characteristic ‘uncertainties’ that cannot become arbitrarily small simultaneously. But what is the exact meaning of this principle, and indeed, is it really a principle of quantum mechanics Shannon entropy H(PX) = - j2 X PX(j) log PX(j) Collision entropy H2 (PX) = - log  j2 X PX (j)2

What are uncertainty relations? Each measurement Set of possible outcomes X Measuring a state: distribution PX over X Historic uncertainty relations bound variance And depend on state to be measured! Entropic uncertainty relations (Byalynicki-Birula, Mycielski CMP’75, Deutsch PRL’83) Only depend on chosen properties! Goal: for any state, give a lower bound for ?

Entropic uncertainty relations Example for two outcomes X = {0,1} and Y = {0,1} No entropy for one, means maximal entropy for the other! Maximally incompatible! But, what characterizes incompatible measurements? Find such measurements Minimize over states

So, why they are interesting? Physics Quantum cryptography Quantum key distribution Quantum cryptography in the bounded storage model: security based on uncertainty relations! Non-local games (interactive proof systems with entanglement)

Outline Uncertainty Relations A meta-uncertainty relation What are they? What is known? A meta-uncertainty relation Clifford algebra Characterizing quantum states Strong uncertainty relations .. for the collision entropy …for the Shannon entropy Relation to BB84 Open questions

Known results: 2 measurements Two measurements (Maassen&Uffink, PRL’89) A = {|a1>,…,|ad>} and B = {|b1>,…,|bd>} ½ (H(A|½) + H(B|½)) ¸ - log c(A,B) c(A,B) = max{|<a|b>| | |a> 2 A, |b> 2 B} H(A|½) = - Tr(|aj><aj|½) log Tr(|aj><aj|½) Maximal if overlaps are all equal and

Known results: 2 measurements Maximized if the two bases are mutually unbiased Intuition: If we measure any element of one basis in the other, all outcomes are equally likely.

Known results: many measurements All mutually unbiased bases (Sanchez,PLA ‘93) Random (Hayden,Leung,Shor,Winter,CMP’04) How about more than two measurements? Maybe chosing them to be mutually unbiased is good enough? NO! (Ballester, W, PRA’07) For d=2: … ¸ 2/3

Goal What characterizes maximally incompatible measurements? Find measurements for which we get strong uncertainty relations Here: for two outcome measurements Need anti-commutation!

Outline Uncertainty Relations A meta-uncertainty relation What are they? What is known? A meta-uncertainty relation Clifford algebra Characterizing quantum states Strong uncertainty relations .. for the collision entropy …for the Shannon entropy Relation to BB84 Open questions

What is Clifford algebra? Algebra generated by Generators ¡1,…,¡N For all pairs: {¡i,¡j} = ¡i ¡j + ¡j ¡i = 0 For each: ¡i 2 = I View ¡1,..,¡N as basis vectors for an N-dimensional real vector space. Vector a = (a1,…,aN) = j aj ¡j

Matrix representation For j = 1,…,n ¡2j = Y­ (j-1)­ Z ­ I­ (n-j) ¡2j-1 = Y­ (j-1) ­ X ­ I­ (n-j) For =2 (d=2) ¡1 = X, ¡2 = Z Represented N=2n basis vectors with 2n £ 2n matrices To recall: a 2 R2n is a vector: a =  aj ¡j a is also a 2n £ 2n matrix Two matrices anti-commute iff vectors are orthogonal!

Rotating the basis If the original vectors generated a Clifford algebra, so do the new ones: inner products are preserved ..and thus all anti-commutation relations!

Outline Uncertainty Relations A meta-uncertainty relation What are they? What is known? A meta-uncertainty relation Clifford algebra Characterizing quantum states Strong uncertainty relations .. for the collision entropy …for the Shannon entropy Relation to BB84 Open questions

Basis for dxd matrices Generators also give a basis for matrices with

Basis rotations on matrices Given a matrix .. then basis elements transform as vectors: Transform 1st grade as vector Can implement it as a unitary Sketch of argument Can extend this to include the final term! 2n+1 dimensional real vector space!

Tool 1: Rotation Given a matrix Can rotate  gj ¡j onto ¡1 R½Ry = (1/d)(I + √(i gi 2i) ¡1 + j < k g’jk ¡ j ¡k+….) Transform 1st grade as vector Can implement it as a unitary Sketch of argument

Tool 2: Sign flips Given a matrix ½= (1/d)(I + √(i gi 2i) ¡1 + g’jk ¡ j ¡k+ ….) Can find unitary Fj which maps ¡j ! -¡j ¡k ! ¡k for k  j Fj ½ Fj y = (1/d)(I + √(i gi 2i) ¡1 - g’jk ¡ j ¡k+….) Transform 1st grade as vector Can implement it as a unitary Sketch of argument

When is a matrix ρ a valid state? To minimize over states ρ, we often want to parametrize them But what conditions do the coefficients need to satisfy such that ρ is a state? Minimize over states! So how do we parametrize them? ??? OK!

The Bloch sphere: d=2 Difficult for d > 2! When is ½ a quantum state? (½ ¸ 0) Difficult for d > 2!

Generalized Bloch sphere Given state ½ = (1/d) (I + i gi ¡i + i,k gik ¡i¡k + …) Rotate onto ¡1: R ½ Ry = (1/d) (I + √(i gi 2i) ¡1 + i,k g’ik ¡i ¡k + …) Dephase: Fj ¡j Fjy = -¡j and Fj ¡k Fjy = ¡k Dj = (1/2) (½ + Fj ½ Fjy) Iterate for all j 2 {2,…,N} Left with ½’= (1/d) (I + √(i gi 2) ¡1) Must have I ¸ (√i gi 2) ¡1 ¸ -I, hence i gi 2 · 1

Generalized Bloch sphere For any quantum state ½ in d=2n and K· 2n+1 observables ¡j

Outline Uncertainty Relations A meta-uncertainty relation What are they? What is known? A meta-uncertainty relation Clifford algebra Characterizing quantum states Strong uncertainty relations .. for the collision entropy …for the Shannon entropy Relation to BB84 Open questions

Matrix representation Measurements we will consider! Algebra generated by Generators ¡1,…,¡N For all pairs: {¡i,¡j} = ¡i ¡j + ¡j ¡i = 0 For each: ¡i 2 = I Two eigenvalues +/- 1: ¡j = ¡j 0 - ¡j 1

Why may this be a good choice? Similarly ‘’unbiased’’: Observing ‘’0’’ or ‘’1’’ has equal probability when measuring with a different observable.

Collision entropy For d=2n and K · 2n+1 observables ¡j:

Outline Uncertainty Relations A meta-uncertainty relation What are they? What is known? A meta-uncertainty relation Clifford algebra Characterizing quantum states Strong uncertainty relations .. for the collision entropy …for the Shannon entropy Relation to BB84 Open questions

Shannon entropy For d=2n and K· 2n+1 observables ¡j: Rewrite as before and use ‘’meta’’-uncertainty relation Maximally strong: Maximum uncertainty for all measurements except one!

Outline Uncertainty Relations A meta-uncertainty relation What are they? What is known? A meta-uncertainty relation Clifford algebra Characterizing quantum states Strong uncertainty relations .. for the collision entropy …for the Shannon entropy Relation to BB84 Open questions

Relation to BB84 Encode a bit into the positive or negative eigenspace of these operators. Choose operator at random Task: determine bit without knowing operator “BB84 scenario”: Alice picks x 2 R {0,1} and b 2 R {+,£} Sends |x>b to Bob Extension: Alice picks x 2 R {0,1}, and b 2 R {¡1,…¡N} Sends ¡b x to Bob Previous uncertainty relations for MUBs (BB84 states) in d=2 follow as a special case!

Applications Could implement 1-k oblivious transfer protocols in the bounded storage model. (Damgard, Fehr, Renner, Salvail, Schaffner, CRYPTO 07) Same for the noisy storage model (but no direct proof) Relatively easy to implement in practice.

Open questions For two-outcome measurements, anti-commutation is enough! Optimal uncertainty relations for Shannon entropy Near optimal uncertainty relations for collision entropy Strong uncertainty relations for more then two outcome measurements? Other applications? Small state within a large state! Non-local games: need the same operators to implement quantum XOR-games