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:2609.11536

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

Dafa Li

quant-phSubmitted Sep 10, 2026• Announced Sep 11, 2026• 0 citations• Revised Oct 21, 2026 (v2)
v1 · Sep 10, 2026v2 · Oct 21, 2026
arXivHTMLPDF

Abstract

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.

Comments
9 pages, no figure

Related papers

No-cloning with unitary scaling

Dafa Li

It is known that the classical information like strings of bits can be copied. In 1982, Wootters and Zurek proposed the quantum no-cloning principle. No-cloning principle says that it is impossible to make an identical copy of an arbitrary unknown quantum pure state by using unitary evolution. In this paper, we call U $|ψ>$, where U is any unitary operator, a U-copy of the state $|ψ>$ and show it is impossible to make a U-copy of an arbitrary unknown quantum pure state by using unitary evolution.

quant-pharXiv:2604.22960•Apr 28, 2026•0 citations

Phase conjugation of continuous quantum variables

Nicolas J. Cerf, S. Iblisdir

The phase conjugation of an unknown Gaussian state cannot be realized perfectly by any physical process. A heuristic argument is used to derive a tight lower bound on the noise that must be introduced by an approximate phase conjugation operation. A universal transformation achieving the optimal imperfect phase conjugation is then presented, which is the continuous counterpart of the universal-NOT transformation for quantum bits. In addition, it is shown that more information can be encoded into a pair of conjugate Gaussian states than by using the same state twice.

arXiv:quant-ph/0012020•Physical Review A•Aug 17, 2001•43 citations

General impossible operations in quantum information

Arun Kumar Pati

We prove a general limitation in quantum information that unifies the impossibility principles such as no-cloning and no-anticloning. Further, we show that for an unknown qubit one cannot design a universal Hadamard gate for creating equal superposition of the original and its complement state. Surprisingly, we find that Hadamard transformations exist for an unknown qubit chosen either from the polar or equatorial great circles. Also, we show that for an unknown qubit one cannot design a universal unitary gate for creating unequal superpositions of the original and its complement state. We discuss why it is impossible to design a controlled-NOT gate for two unknown qubits and discuss the implications of these limitations. 03.67.Hk, 03.65.Ta

arXiv:quant-ph/0111153•Physical Review A•Dec 30, 2002•50 citations

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

Quantum circuits cannot control unknown operations

Mateus Araújo, Adrien Feix, Fabio Costa +1 more

One of the essential building blocks of classical computer programs is the ' if ' clause, which executes a subroutine depending on the value of a control variable. Similarly, several quantum algorithms rely on applying a unitary operation conditioned on the state of a control system. Here we show that this control cannot be performed by a quantum circuit if the unitary is completely unknown. The task remains impossible even if we allow the control to be done modulo a global phase. However, this no-go theorem does not prevent implementing quantum control of unknown unitaries in practice, as any physical implementation of an unknown unitary provides additional information that makes the control possible. We then argue that one should extend the quantum circuit formalism to capture this possibility in a straightforward way. This is done by allowing unknown unitaries to be applied to subspaces and not only to subsystems.

arXiv:1309.7976•New Journal of Physics•Sep 22, 2014•119 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
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.
It is known that the classical information like strings of bits can be copied. In 1982, Wootters and Zurek proposed the quantum no-cloning principle. No-cloning principle says that it is impossible to make an identical copy of an arbitrary unknown quantum pure state by using unitary evolution. In this paper, we call U ∣ψ>|ψ>∣ψ>, where U is any unitary operator, a U-copy of the state ∣ψ>|ψ>∣ψ> and show it is impossible to make a U-copy of an arbitrary unknown quantum pure state by using unitary evolution.
The phase conjugation of an unknown Gaussian state cannot be realized perfectly by any physical process. A heuristic argument is used to derive a tight lower bound on the noise that must be introduced by an approximate phase conjugation operation. A universal transformation achieving the optimal imperfect phase conjugation is then presented, which is the continuous counterpart of the universal-NOT transformation for quantum bits. In addition, it is shown that more information can be encoded into a pair of conjugate Gaussian states than by using the same state twice.
We prove a general limitation in quantum information that unifies the impossibility principles such as no-cloning and no-anticloning. Further, we show that for an unknown qubit one cannot design a universal Hadamard gate for creating equal superposition of the original and its complement state. Surprisingly, we find that Hadamard transformations exist for an unknown qubit chosen either from the polar or equatorial great circles. Also, we show that for an unknown qubit one cannot design a universal unitary gate for creating unequal superpositions of the original and its complement state. We discuss why it is impossible to design a controlled-NOT gate for two unknown qubits and discuss the implications of these limitations. 03.67.Hk, 03.65.Ta
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.
One of the essential building blocks of classical computer programs is the ' if ' clause, which executes a subroutine depending on the value of a control variable. Similarly, several quantum algorithms rely on applying a unitary operation conditioned on the state of a control system. Here we show that this control cannot be performed by a quantum circuit if the unitary is completely unknown. The task remains impossible even if we allow the control to be done modulo a global phase. However, this no-go theorem does not prevent implementing quantum control of unknown unitaries in practice, as any physical implementation of an unknown unitary provides additional information that makes the control possible. We then argue that one should extend the quantum circuit formalism to capture this possibility in a straightforward way. This is done by allowing unknown unitaries to be applied to subspaces and not only to subsystems.
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.