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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.