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

Quantum comparison machines with one-sided error

Chiu Fan Lee, Neil F. Johnson

Published Jul 10, 2002• 1 citation
OpenAlex

Abstract

It is always possible to decide, with one-sided error, whether two quantum states are the same under a specific unitary transformation. However we show here that it is impossible to do so if the transformation is anti-linear and non-singular. This result implies that unitary and anti-unitary operations exist on an unequal footing in quantum information theory.

Related papers

Comparison of unitary transforms

Erika Andersson, Igor Jex, Stephen Mark Barnett

We analyse the problem of comparing unitary transformations. The task is to decide, with minimal resources and maximal reliability, whether two given unitary transformations are identical or different. It is possible to make such comparisons without obtaining any information about the individual transformations. Different comparison strategies are presented and compared with respect to their efficiency. With an interferometric setup, it is possible to compare two unitary transforms using only one test particle. Another strategy makes use of a two-particle singlet state. This strategy is more efficient than using a non-entangled two-particle test state, thus demonstrating the benefit of entanglement. Generalizations to higher-dimensional transforms and to more than two transformations are made.

arXiv:quant-ph/0208153•Journal of Physics A Mathematical and General•Feb 19, 2003•12 citations

Comparing the states of many quantum systems

Igor Jex, Erika Andersson, Anthony Chefles

We investigate how to determine whether the states of a set of quantum systems are identical or not. This paper treats both error-free comparison, and comparison where errors in the result are allowed. Error-free comparison means that we aim to obtain definite answers, which are known to be correct, as often as possible. In general, we will also have to accept inconclusive results, giving no information. To obtain a definite answer that the states of the systems are not identical is always possible, whereas in the situation considered here, a definite answer that they are identical will not be possible. The optimal universal error-free comparison strategy is a projection onto the totally symmetric and the different non-symmetric subspaces, invariant under permutations and unitary transformations. We also show how to construct optimal comparison strategies when allowing for some errors in the result, minimizing either the error probability, or the average cost of making an error. We point out that it is possible to realize universal error-free comparison strategies using only linear elements and particle detectors, albeit with less than ideal efficiency. Also minimum-error and minimum-cost strategies may sometimes be realized in this way. This is of great significance for practical applications of quantum comparison.

arXiv:quant-ph/0305120•Journal of Modern Optics•Jan 26, 2004•36 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

Decision problems with quantum black boxes

Mark S. Hillery, Erika Andersson, Stephen Mark Barnett +1 more

We examine how to distinguish between unitary operators, when the exact form of the possible operators is not known. Instead we are supplied with ‘programs’ in the form of unitary transforms, which can be used as references for identifying the unknown unitary transform. All unitary transforms should be used as few times as possible. This situation is analogous to programmable state discrimination. One difference, however, is that the quantum state to which we apply the unitary transforms may be entangled, leading to a richer variety of possible strategies. By suitable selection of an input state and generalized measurement of the output state, both unambiguous and minimum-error discrimination can be achieved. Pairwise comparison of operators, comparing each transform to be identified with a program transform, is often a useful strategy. There are, however, situations in which more complicated strategies perform better. This is the case especially when the number of allowed applications of program operations is different from the number of the transforms to be identified.

arXiv:1109.4823•Journal of Modern Optics•Aug 26, 2009•6 citations

Impossibility of comparing and sorting quantum states

Arul, A. John

Is there any point of principle that prohibits us from doing one or more forms of quantum information processing? It is now well known that an unknown quantum state can neither be copied nor deleted perfectly. Given a set of states which are not necessarily orthogonal, is it possible to compare any two states from the set, given some reasonable ordering of such states? Is it possible to sort them in some specific order? In the context of quantum computation, it is shown here that there is no quantum circuit implementing a unitary transformation, for comparing and sorting an unrestricted set of quantum states.

arXiv:quant-ph/0107085•Jul 17, 2001•11 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•51 citations
It is always possible to decide, with one-sided error, whether two quantum states are the same under a specific unitary transformation. However we show here that it is impossible to do so if the transformation is anti-linear and non-singular. This result implies that unitary and anti-unitary operations exist on an unequal footing in quantum information theory.
We analyse the problem of comparing unitary transformations. The task is to decide, with minimal resources and maximal reliability, whether two given unitary transformations are identical or different. It is possible to make such comparisons without obtaining any information about the individual transformations. Different comparison strategies are presented and compared with respect to their efficiency. With an interferometric setup, it is possible to compare two unitary transforms using only one test particle. Another strategy makes use of a two-particle singlet state. This strategy is more efficient than using a non-entangled two-particle test state, thus demonstrating the benefit of entanglement. Generalizations to higher-dimensional transforms and to more than two transformations are made.
We investigate how to determine whether the states of a set of quantum systems are identical or not. This paper treats both error-free comparison, and comparison where errors in the result are allowed. Error-free comparison means that we aim to obtain definite answers, which are known to be correct, as often as possible. In general, we will also have to accept inconclusive results, giving no information. To obtain a definite answer that the states of the systems are not identical is always possible, whereas in the situation considered here, a definite answer that they are identical will not be possible. The optimal universal error-free comparison strategy is a projection onto the totally symmetric and the different non-symmetric subspaces, invariant under permutations and unitary transformations. We also show how to construct optimal comparison strategies when allowing for some errors in the result, minimizing either the error probability, or the average cost of making an error. We point out that it is possible to realize universal error-free comparison strategies using only linear elements and particle detectors, albeit with less than ideal efficiency. Also minimum-error and minimum-cost strategies may sometimes be realized in this way. This is of great significance for practical applications of quantum comparison.
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 examine how to distinguish between unitary operators, when the exact form of the possible operators is not known. Instead we are supplied with ‘programs’ in the form of unitary transforms, which can be used as references for identifying the unknown unitary transform. All unitary transforms should be used as few times as possible. This situation is analogous to programmable state discrimination. One difference, however, is that the quantum state to which we apply the unitary transforms may be entangled, leading to a richer variety of possible strategies. By suitable selection of an input state and generalized measurement of the output state, both unambiguous and minimum-error discrimination can be achieved. Pairwise comparison of operators, comparing each transform to be identified with a program transform, is often a useful strategy. There are, however, situations in which more complicated strategies perform better. This is the case especially when the number of allowed applications of program operations is different from the number of the transforms to be identified.
Is there any point of principle that prohibits us from doing one or more forms of quantum information processing? It is now well known that an unknown quantum state can neither be copied nor deleted perfectly. Given a set of states which are not necessarily orthogonal, is it possible to compare any two states from the set, given some reasonable ordering of such states? Is it possible to sort them in some specific order? In the context of quantum computation, it is shown here that there is no quantum circuit implementing a unitary transformation, for comparing and sorting an unrestricted set of quantum states.
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