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/0208153 · Journal of Physics A Mathematical and General

Comparison of unitary transforms

Erika Andersson, Igor Jex, Stephen Mark Barnett

Published Feb 19, 2003• 12 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/0305-4470/36/9/310

Related papers

Comparison of unitary transforms using Franson interferometry

Erika Andersson, János A. Bergou, Igor Jex

Unknown unitary transforms may be compared to each other in a way which makes it possible to obtain an unambiguous answer, indicating that the transforms are different, already after a single application of each transform. Quantum comparison strategies may be useful for example if we want to test the performance of individual gates in a quantum information or quantum computing network. It is then possible to check for errors by comparing the elements to a master copy of the gate, instead of performing a complete tomography of the gate. In this paper we propose a versatile linear optical implementation based on the Franson interferometer with short and long arms. A click in the wrong output port unambiguously determines that the tested gate is faulty. This set-up can also be used for a variety of other tasks, such as confirming that the two transforms do not commute or do not anticommute.

Journal of Modern Optics•Jul 10, 2005•8 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

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

Strategies for Discriminating and Comparing Unknown Unitary Transformations

Guy F. Okoko

How to discriminate or compare two unitary transformations that are completely unknown? We first examine the unambiguous discrimination of two unknown unitary transformations; we show that the results are the same as those found for the programmable discrimination of two unknown quantum states. Next we consider the minimum-error comparison of two unknown unitary transformations; the results are obtained in the general case where the prior probabilities are different. Last we study the unambiguous discrimination of two unknown unitary transformations in the case where multiple copies of data are available.

•Jan 1, 2014•0 citations

Quantum comparison machines with one-sided error

Chiu Fan Lee, Neil F. Johnson

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.

•Jul 10, 2002•1 citation

Decidabilities of local unitary equivalence for entanglement witnesses and states

Yi Shen, Lin Chen

The problem of determining whether two states are equivalent by local unitary (LU) operations is important for quantum information processing. In this paper, we propose an alternative perspective to study this problem by comparing the decidabilities of LU equivalence (also known as LU decidabilities for short) between entanglement witnesses and states. We introduce a relation between sets of Hermitian operators in terms of the LU decidability. Then, we compare the LU decidability for the set of entanglement witnesses to the LU decidabilities for several sets of states. By comparison, we establish a hierarchy of these sets in terms of LU decidabilities. Moreover, we realize that the simultaneous LU (SLU) equivalence between tuples of mutually orthogonal projectors is crucial to LU equivalent operators. We reveal by examples that for two tuples of projectors, the partial SLU equivalence cannot ensure the overall SLU equivalence. Generally, we present a necessary and sufficient condition such that two tuples of states are SLU equivalent.

arXiv:2504.02212•Physical Review Research•Aug 29, 2025•0 citations
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.
Unknown unitary transforms may be compared to each other in a way which makes it possible to obtain an unambiguous answer, indicating that the transforms are different, already after a single application of each transform. Quantum comparison strategies may be useful for example if we want to test the performance of individual gates in a quantum information or quantum computing network. It is then possible to check for errors by comparing the elements to a master copy of the gate, instead of performing a complete tomography of the gate. In this paper we propose a versatile linear optical implementation based on the Franson interferometer with short and long arms. A click in the wrong output port unambiguously determines that the tested gate is faulty. This set-up can also be used for a variety of other tasks, such as confirming that the two transforms do not commute or do not anticommute.
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.
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.
How to discriminate or compare two unitary transformations that are completely unknown? We first examine the unambiguous discrimination of two unknown unitary transformations; we show that the results are the same as those found for the programmable discrimination of two unknown quantum states. Next we consider the minimum-error comparison of two unknown unitary transformations; the results are obtained in the general case where the prior probabilities are different. Last we study the unambiguous discrimination of two unknown unitary transformations in the case where multiple copies of data are available.
The problem of determining whether two states are equivalent by local unitary (LU) operations is important for quantum information processing. In this paper, we propose an alternative perspective to study this problem by comparing the decidabilities of LU equivalence (also known as LU decidabilities for short) between entanglement witnesses and states. We introduce a relation between sets of Hermitian operators in terms of the LU decidability. Then, we compare the LU decidability for the set of entanglement witnesses to the LU decidabilities for several sets of states. By comparison, we establish a hierarchy of these sets in terms of LU decidabilities. Moreover, we realize that the simultaneous LU (SLU) equivalence between tuples of mutually orthogonal projectors is crucial to LU equivalent operators. We reveal by examples that for two tuples of projectors, the partial SLU equivalence cannot ensure the overall SLU equivalence. Generally, we present a necessary and sufficient condition such that two tuples of states are SLU equivalent.