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/9911090 · Nature

Impossibility of deleting an unknown quantum state

Arun Kumar Pati, Samuel L. Braunstein

Published Mar 9, 2000• 369 citations
arXivHTMLPDF
DOI
10.1038/35004532

Related papers

Strategies for state-dependent quantum deleting

Wei Song, Ming Yang, Zhuo‐Liang Cao

Physics Letters A•Jun 1, 2004•1 citation

No-deleting principle for two unitary copies

Dafa Li

Pati and Braunstein defined a deleting machine and showed the impossibility of deleting one of two identical copies of an unknown quantum state. So far, no one has defined two non-identical copies of a quantum state, of course no one has discussed the impossibility of deleting one of two non-identical copies of an unknown quantum state. In this paper, we define $u|ψ>$ and $U|ψ>$, where $u$ and $U$ are any unitary operators, as two unitary copies of a quantum state $|ψ>$, and show that it is impossible to delete one of two unitary copies of an unknown state.

quant-pharXiv:2606.24522•Jun 24, 2026•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

Comparison of two unknown pure quantum states

Stephen M. Barnett, Anthony Chefles, Igor Jex

arXiv:quant-ph/0202087•Physics Letters A•Jan 21, 2003•80 citations

Impossibility of Quantum Cloning

Nicolas Gisin

Springer eBooks•Jan 1, 2014•0 citations

Impossible to conjugate or reflect an unknown quantum state via a unitary evolution

Dafa Li

The no-cloning theorem, the no-deleting theorem, and other no-go theorems play a crucial role in quantum mechanics and quantum information. In this paper, we show that it is impossible to conjugate or reflect an unknown quantum state or conjugate or reflect the bit-flip (the phase-flip) of an unknown state via a universally unitary evolution. We also indicate that the partial conjugating operations are not anti-unitary and it is impossible to universally partially conjugate an unknown state via a unitary evolution. We compute the fidelities of the optimal physical approximations to conjugating and conjugating the bit-flip and phase-flip operations.

quant-pharXiv:2609.11536•Sep 11, 2026•0 citations
Pati and Braunstein defined a deleting machine and showed the impossibility of deleting one of two identical copies of an unknown quantum state. So far, no one has defined two non-identical copies of a quantum state, of course no one has discussed the impossibility of deleting one of two non-identical copies of an unknown quantum state. In this paper, we define u∣ψ>u|ψ>u∣ψ> and U∣ψ>U|ψ>U∣ψ>, where uuu and UUU are any unitary operators, as two unitary copies of a quantum state ∣ψ>|ψ>∣ψ>, and show that it is impossible to delete one of two unitary copies of an unknown state.
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.
The no-cloning theorem, the no-deleting theorem, and other no-go theorems play a crucial role in quantum mechanics and quantum information. In this paper, we show that it is impossible to conjugate or reflect an unknown quantum state or conjugate or reflect the bit-flip (the phase-flip) of an unknown state via a universally unitary evolution. We also indicate that the partial conjugating operations are not anti-unitary and it is impossible to universally partially conjugate an unknown state via a unitary evolution. We compute the fidelities of the optimal physical approximations to conjugating and conjugating the bit-flip and phase-flip operations.