Can error in quantum deletion machines be beneficial for deletion?

TL;DR

This paper introduces a probabilistic quantum deletion machine that can, under certain parameters, benefit from increased error to improve deletion fidelity, surpassing the Pati-Braunstein machine.

Contribution

It proposes a generalized input-dependent quantum deletion machine and demonstrates conditions where increased error enhances deletion fidelity.

Findings

Increased deletion error can improve fidelity under specific parameters.

The proposed machine can outperform the Pati-Braunstein deletion machine.

The Pati-Braunstein machine is a special case within the proposed framework.

Abstract

In this paper, a generalized input state dependent deletion machine called probabilistic quantum deletion machine is proposed. Considering the Pati-Braunstein deletion machine as a benchmark, the machine is characterized by its deletion probability and the probability of error in deletion. It is observed that there are parameters for which increase in error in deletion can increase the fidelity of deletion. It is also shown that the Pati-Braunstein deletion machine is easily derivable for a certain value of deletion probability. Further the deletion machine can offer better fidelity of deletion than the Pati-Braunstein deletion machine for any input state with the right parameters.