Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0508083 · Journal of Physics A Mathematical and General

Deletion of imperfect cloned copies

Satyabrata Adhikari, Binayak Samadder Choudhury

Published Nov 25, 2004• 7 citations
arXivHTMLPDF

Abstract

In this work, we design a deleting machine and show that, for some given condition on machine parameters, it gives a slightly better result than the Pati–Braunstein (PB) deleting machine (2000 Nature 404 164, 2001 Preprint quant-ph/0007121). Also it is shown that for some particular values of the machine parameters it acts like the PB deleting machine. We also study the combined effect of a cloning and deleting machine, where first the cloning is done by some standard cloning machines such as Wootters–Zurek (1982 Nature 299 802) and Buzek–Hillery (1996 Phys. Rev. A 54 1844) cloning machines and then the copy mode is deleted by the PB deleting machine or our prescribed deleting machine. We then examine the distortion of the input state and the fidelity of deletion.

DOI
10.1088/0305-4470/37/49/007

Related papers

Quantum Cloning and Deletion in Quantum Information Theory

Satyabrata Adhikari

Quantum mechanics put restriction on performing some task which we can do classically. One such restriction is that we cannot copy an arbitrary quantum state. This is known as No-cloning theorem. Although quantum mechanics forbid us to construct a perfect cloner, there is no restriction to construct an imperfect cloner. Therefore, we have constructed and studied a special kind of quantum cloning machine named as Hybrid quantum cloning machine which is nothing but a different combination of pre-existing quantum cloning machines. We showed that this hybrid quantum cloning machine sometime gives better quality copy than the pre-existing quantum cloners. Quantum entanglement is a very astonishing property in a multi-partite system and it is a very useful ingredient of quantum information theory. Therefore broadcasting (cloning) of entanglement is a very important subject to study. In this regard we have studied the broadcasting of entanglement using state dependent quantum cloning machine. Further, we have investigated the problem of secretly broadcasting of three-qubit entangled state between two distant partners. Linearity of quantum mechanics put another restriction on deletion of an arbitrary quantum state i.e. an arbitrary quantum state against a copy cannot be perfectly deleted. Like cloning machine one can construct an approximate deletion machine also. Therefore, we have constructed an universal deletion machine in the sense that the fidelity of deletion does not depend on the input state and showed that the fidelity of deletion is 3/4 . Further we showed that the fidelity of deletion depends on the blank state at the output and it can be improved from the value 3/4 for certain blank state. Moreover, we have studied the case where two cloned copies are given at the input of the deletion machine.

arXiv:0902.1622•Feb 10, 2009•2 citations

Quantum deletion: Beyond the no-deletion principle

Satyabrata Adhikari

Suppose we are given two identical copies of an unknown quantum state and we wish to delete one copy from among the given two copies. The quantum no-deletion principle restricts us from perfectly deleting a copy but it does not prohibit us from deleting a copy approximately. Here we construct two types of a ``universal quantum deletion machine'' which approximately deletes a copy such that the fidelity of deletion does not depend on the input state. The two types of universal quantum deletion machines are (1) a conventional deletion machine described by one unitary operator and (2) a modified deletion machine described by two unitary operators. Here it is shown that the modified deletion machine deletes a qubit with fidelity $3∕4$, which is the maximum limit for deleting an unknown quantum state. In addition to this we also show that the modified deletion machine retains the qubit in the first mode with average fidelity 0.77 (approx.) which is slightly greater than the fidelity of measurement for two given identical states, showing how precisely one can determine its state [S. Massar and S. Popescu, Phys. Rev. Lett. 74, 1259 (1995)]. We also show that the deletion machine itself is input state independent, i.e., the information is not hidden in the deleting machine, and hence we can delete the information completely from the deletion machine.

arXiv:quant-ph/0510182•Physical Review A•Nov 18, 2005•14 citations

Can error in quantum deletion machines be beneficial for deletion?

Vijayaraj, Sujan, S. Balakrishnan

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.

arXiv:2006.01517•Jun 2, 2020•0 citations

Some analogies between quantum cloning and quantum deleting

Daowen Qiu

We further verify the impossibility of deleting an arbitrary unknown quantum state, and also show it is impossible to delete two nonorthogonal quantum states as a consequence of unitarity of quantum mechanics. A quantum approximate (deterministic) deleting machine and a probabilistic (exact) deleting machine are constructed. The estimation for the global fidelity characterizing the efficiency of the quantum approximate deleting is given. We then demonstrate that unknown nonorthogonal states chosen from a set with their multiple copies can evolve into a linear superposition of multiple deletions and failure branches by a unitary process if and only if the states are linearly independent. It is notable that the proof for necessity is somewhat different from Pati's [Phys. Rev. Lett. 83, 2849 (1999)]. Another deleting machine for the input states that are unnecessarily linearly independent is also presented. The bounds on the success probabilities of these deleting machines are derived. So we expound some preliminary analogies between quantum cloning and deleting.

Physical Review A•Apr 15, 2002•15 citations

Probabilistic cloning and deleting of quantum states

Yuan Feng, Shengyu Zhang, Mingsheng Ying

We construct a probabilistic cloning and deleting machine which, taking several copies of an input quantum state, can output a linear superposition of multiple cloning and deleting states. Since the machine can perform cloning and deleting in a single unitary evolution, the probabilistic cloning and other cloning machines proposed in the previous literature can be thought of as special cases of our machine. A sufficient and necessary condition for successful cloning and deleting is presented, and it requires that the copies of an arbitrarily presumed number of the input states are linearly independent. This simply generalizes some results for cloning. We also derive an upper bound for the success probability of the cloning and deleting machine.

Physical Review A•Apr 10, 2002•13 citations

A Generalized Deletion Machine

Indranil Chakrabarty, Satyabrata Adhikari

In this work we prescribe a more generalized quantum-deleting machine (input state dependent). The fidelity of deletion is dependent on some machine parameters such that on alteration of machine parameters we get back to standard deleting machines. We also carried out a various comparative study of various kinds of quantum deleting machines. We also plotted graphs, making a comparative study of fidelity of deletion of the deletion machines, obtained as particular cases on changing the machine parameters of our machine.

arXiv:quant-ph/0511211•Nov 22, 2005•0 citations
In this work, we design a deleting machine and show that, for some given condition on machine parameters, it gives a slightly better result than the Pati–Braunstein (PB) deleting machine (2000 Nature 404 164, 2001 Preprint quant-ph/0007121). Also it is shown that for some particular values of the machine parameters it acts like the PB deleting machine. We also study the combined effect of a cloning and deleting machine, where first the cloning is done by some standard cloning machines such as Wootters–Zurek (1982 Nature 299 802) and Buzek–Hillery (1996 Phys. Rev. A 54 1844) cloning machines and then the copy mode is deleted by the PB deleting machine or our prescribed deleting machine. We then examine the distortion of the input state and the fidelity of deletion.
Quantum mechanics put restriction on performing some task which we can do classically. One such restriction is that we cannot copy an arbitrary quantum state. This is known as No-cloning theorem. Although quantum mechanics forbid us to construct a perfect cloner, there is no restriction to construct an imperfect cloner. Therefore, we have constructed and studied a special kind of quantum cloning machine named as Hybrid quantum cloning machine which is nothing but a different combination of pre-existing quantum cloning machines. We showed that this hybrid quantum cloning machine sometime gives better quality copy than the pre-existing quantum cloners. Quantum entanglement is a very astonishing property in a multi-partite system and it is a very useful ingredient of quantum information theory. Therefore broadcasting (cloning) of entanglement is a very important subject to study. In this regard we have studied the broadcasting of entanglement using state dependent quantum cloning machine. Further, we have investigated the problem of secretly broadcasting of three-qubit entangled state between two distant partners. Linearity of quantum mechanics put another restriction on deletion of an arbitrary quantum state i.e. an arbitrary quantum state against a copy cannot be perfectly deleted. Like cloning machine one can construct an approximate deletion machine also. Therefore, we have constructed an universal deletion machine in the sense that the fidelity of deletion does not depend on the input state and showed that the fidelity of deletion is 3/4 . Further we showed that the fidelity of deletion depends on the blank state at the output and it can be improved from the value 3/4 for certain blank state. Moreover, we have studied the case where two cloned copies are given at the input of the deletion machine.
Suppose we are given two identical copies of an unknown quantum state and we wish to delete one copy from among the given two copies. The quantum no-deletion principle restricts us from perfectly deleting a copy but it does not prohibit us from deleting a copy approximately. Here we construct two types of a ``universal quantum deletion machine'' which approximately deletes a copy such that the fidelity of deletion does not depend on the input state. The two types of universal quantum deletion machines are (1) a conventional deletion machine described by one unitary operator and (2) a modified deletion machine described by two unitary operators. Here it is shown that the modified deletion machine deletes a qubit with fidelity 3∕43∕43∕4, which is the maximum limit for deleting an unknown quantum state. In addition to this we also show that the modified deletion machine retains the qubit in the first mode with average fidelity 0.77 (approx.) which is slightly greater than the fidelity of measurement for two given identical states, showing how precisely one can determine its state [S. Massar and S. Popescu, Phys. Rev. Lett. 74, 1259 (1995)]. We also show that the deletion machine itself is input state independent, i.e., the information is not hidden in the deleting machine, and hence we can delete the information completely from the deletion machine.
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.
We further verify the impossibility of deleting an arbitrary unknown quantum state, and also show it is impossible to delete two nonorthogonal quantum states as a consequence of unitarity of quantum mechanics. A quantum approximate (deterministic) deleting machine and a probabilistic (exact) deleting machine are constructed. The estimation for the global fidelity characterizing the efficiency of the quantum approximate deleting is given. We then demonstrate that unknown nonorthogonal states chosen from a set with their multiple copies can evolve into a linear superposition of multiple deletions and failure branches by a unitary process if and only if the states are linearly independent. It is notable that the proof for necessity is somewhat different from Pati's [Phys. Rev. Lett. 83, 2849 (1999)]. Another deleting machine for the input states that are unnecessarily linearly independent is also presented. The bounds on the success probabilities of these deleting machines are derived. So we expound some preliminary analogies between quantum cloning and deleting.
We construct a probabilistic cloning and deleting machine which, taking several copies of an input quantum state, can output a linear superposition of multiple cloning and deleting states. Since the machine can perform cloning and deleting in a single unitary evolution, the probabilistic cloning and other cloning machines proposed in the previous literature can be thought of as special cases of our machine. A sufficient and necessary condition for successful cloning and deleting is presented, and it requires that the copies of an arbitrarily presumed number of the input states are linearly independent. This simply generalizes some results for cloning. We also derive an upper bound for the success probability of the cloning and deleting machine.
In this work we prescribe a more generalized quantum-deleting machine (input state dependent). The fidelity of deletion is dependent on some machine parameters such that on alteration of machine parameters we get back to standard deleting machines. We also carried out a various comparative study of various kinds of quantum deleting machines. We also plotted graphs, making a comparative study of fidelity of deletion of the deletion machines, obtained as particular cases on changing the machine parameters of our machine.