Abstract
We reformulate the notion of uncertainty of pairs of unitary operators within the context of guessing games and derive an entropic uncertainty relation for a pair of such operators. We show how distinguishable operators are compatible while maximal incompatibility of unitary operators can be connected to bases for some subspace of operators which are mutually unbiased.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
