The optimal bound of quantum erasure with limited means
Filippo M. Miatto, Kevin Pich\'e, Thomas Brougham, and Robert W. Boyd

TL;DR
This paper investigates the maximum achievable quantum coherence through erasure when only limited environmental information is accessible, deriving bounds and analytical solutions for specific cases, and analyzing the typical visibility outcomes.
Contribution
It introduces the concept of bounds on quantum erasure with limited environment access, linking sub-fidelity to the maximum coherence recoverable, and provides analytical solutions for 2D and 3D environments.
Findings
For 2D environment, the bound is given by sub-fidelity of inaccessible states.
Analytical solution provided for 3D environment case.
Random pure states can achieve up to 90% visibility after optimal erasure.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
