Papers
Topics
Authors
Recent
Search
2000 character limit reached

Distinguishing classically indistinguishable states and channels

Published 21 Dec 2018 in quant-ph | (1812.09083v3)

Abstract: We investigate an original family of quantum distinguishability problems, where the goal is to perfectly distinguish between $M$ quantum states that become identical under a completely decohering map. Similarly, we study distinguishability of $M$ quantum channels that cannot be distinguished when one is restricted to decohered input and output states. The studied problems arise naturally in the presence of a superselection rule, allow one to quantify the amount of information that can be encoded in phase degrees of freedom (coherences), and are related to time-energy uncertainty relation. We present a collection of results on both necessary and sufficient conditions for the existence of $M$ perfectly distinguishable states (channels) that are classically indistinguishable.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.