Papers
Topics
Authors
Recent
Search
2000 character limit reached

The optimal bound of quantum erasure with limited means

Published 8 Oct 2014 in quant-ph | (1410.2313v1)

Abstract: In practical applications of quantum information science, quantum systems can have non-negligible interactions with the environment, and this generally degrades the power of quantum protocols as it introduces noise. Counteracting this by appropriately measuring the environment (and therefore projecting its state) would require access all the necessary degrees of freedom, which in practice can be far too hard to achieve. To better understand one's limitations, we calculate the upper bound of optimal quantum erasure (i.e. the highest recoverable visibility, or "coherence"), when erasure is realistically limited to an accessible subspace of the whole environment. In the particular case of a two-dimensional accessible environment, the bound is given by the sub-fidelity of two particular states of the \emph{inaccessible} environment, which opens a new window into understanding the connection between correlated systems. We also provide an analytical solution for a three-dimensional accessible environment. This result provides also an interesting operational interpretation of sub-fidelity. We end with a statistical analysis of the expected visibility of an optimally erased random state and we find that 1) if one picks a random pure state of 2 qubits, there is an optimal measurement that allows one to distill a 1-qubit state with almost 90\% visibility and 2) if one picks a random pure state of 2 qubits in an inaccessible environment, there is an optimal measurement that allows one to distill a 1-qubit state with almost twice its initial visibility.

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.