The Perfect Distinguishability of Quantum Operations
pith:3PFLLFW3 Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{3PFLLFW3}
Prints a linked pith:3PFLLFW3 badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
We provide a feasible necessary and sufficient condition for when an unknown quantum operation (quantum device) secretely selected from a set of known quantum operations can be identified perfectly within a finite number of queries, and thus complete the characterization of the perfect distinguishability of quantum operations. We further design an optimal protocol which can achieve the perfect discrimination between two quantum operations by a minimal number of queries. Interestingly, employing the techniques from the theory of $q$-numerical range we find that an optimal perfect discrimination between two isometries is always achievable without using auxiliary systems or entanglement.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.