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

Exact identification of unknown unitary processes

Santiago Llorens, Arnau Diebra, Michal Sedlák, Ramon Muñoz-Tapia

quant-phSubmitted May 6, 2026• Announced May 7, 2026• 0 citations
arXivHTMLPDF

Abstract

The accurate identification of faulty hardware is a fundamental requirement for reliable quantum information processing. We address this problem in a quantum setting, where a series of $n$ devices is intended to apply the same unitary operation, but $k$ malfunctioning devices among them apply a different, unknown unitary action. Under the assumption of complete ignorance regarding the specific unitary transformation applied, we model our hypotheses using representation-theoretic tools and study the zero-error protocol for identifying these faulty devices. We derive the optimal success probability for the single- and two-anomaly scenarios, demonstrating that it is independent of the total number of devices in the series. Furthermore, we present a simple protocol that makes use of ancillary systems that achieves this optimal limit. Notably, this protocol offers significant operational advantages, such as allowing us to test each device independently. Finally, we extend our analysis to the general scenario in which both the number of anomalies and the local dimension of the systems are arbitrary, evaluating our protocol's performance and conjecturing its global optimality in the general case.

Comments
9+6 pages. Comments are welcome

Related papers

Identification of malfunctioning quantum devices

Michalis Skotiniotis, Santiago Llorens, Ronja Hotz +2 more

We consider the problem of correctly identifying a malfunctioning quantum device that forms part of a network of N such devices, which can be considered as the quantum analog of classical anomaly detection. In the case where the devices in question are sources assumed to prepare identical quantum pure states, with the faulty source producing a different anomalous pure state, we show that the optimal probability of successful identification requires a global quantum measurement. We also put forth several local measurement strategies—both adaptive and nonadaptive—that achieve the same optimal probability of success in the limit where the number of devices to be checked is large. In the case where the faulty device performs a known unitary operation, we show that the use of entangled probes provides an improvement that even allows perfect identification for values of the unitary parameter that surpass a certain threshold. Finally, if the faulty device implements a known qubit channel, we find that the optimal probability for detecting the position of rank-one and rank-two Pauli channels can be achieved by product state inputs and separable measurements for any size of network, whereas for rank-three and general amplitude damping channels, optimal identification requires entanglement with N qubit ancillas. Published by the American Physical Society 2024

arXiv:1808.02729•Physical Review Research•Sep 23, 2024•15 citations

Locality and nonlocality in quantum pure-state identification problems

Yuki Ishida, T. Hashimoto, M. Horibe +1 more

Suppose we want to identify an input state with one of two unknown reference states, where the input state is guaranteed to be equal to one of the reference states. We assume that no classical knowledge of the reference states is given, but a certain number of copies of them are available instead. Two reference states are independently and randomly chosen from the state space in a unitary invariant way. This is called the quantum state identification problem, and the task is to optimize the mean identification success probability. In this paper, we consider the case where each reference state is pure and bipartite, and generally entangled. The question is whether the maximum mean identification success probability can be attained by means of a local operations and classical communication (LOCC) measurement scheme. Two types of identification problem are considered when a single copy of each reference state is available. We show that a LOCC scheme attains the globally achievable identification probability in the minimum-error identification problem. In the unambiguous identification problem, however, the maximal success probability by means of LOCC is shown to be less than the globally achievable identification probability.

arXiv:0807.1364•Physical Review A•Jul 8, 2008•13 citations

How to use arbitrary measuring devices to perform almost-perfect measurements

Noah Linden, Paul Skrzypczyk

We consider the problem of reproducing one quantum measurement given the ability to perform another. We give a general framework and specific protocols for this problem. For example, we show how to use available “imperfect” devices a small number of times to implement a target measurement with average error that drops off exponentially with the number of imperfect measurements used. We hope that could be useful in near-term applications as a type of lightweight error mitigation of the measuring devices. As well as the view to practical applications, we consider the question from a general theoretical perspective in the most general setting where both the available and target measurements are arbitrary generalized quantum measurements. We show that this general problem in fact reduces to the ability to reproduce the statistics of (complete) von Neumann measurements, and that in the asymptotic limit of infinitely many uses of the available measurement, a simple protocol based upon “classical cloning” can perfectly achieve this task. We show that asymptotically any nontrivial quantum measurement can reproduce any other. We also study optimal protocols for a fixed number of uses of the available measurement. This includes, but is not limited to, improving both noisy and lossy quantum measurements. Furthermore, we show that, in a setting where we perform multiple measurements in parallel, we can achieve finite-rate measurement reproduction, by using block-coding techniques from classical information theory. Finally, we show that advantages can also be gained by making use of probabilistic protocols.

arXiv:2203.02593•Physical Review A•Jul 14, 2025•12 citations

Single-shot comparison of random quantum channels and measurements

Marcin Markiewicz, Łukasz Pawela, Zbigniew Puchała

We analyze the task of deciding whether two unknown quantum devices are identical or independent, for arbitrary quantum channels and generalized measurements (POVMs) drawn at random from Haar-Stinespring ensembles, in the single-shot regime in which each device is used exactly once. Our contribution is twofold. First, in the symmetric setting, in which both types of error are treated on an equal footing, we derive a closed-form expression for the optimal success probability and show that it is achieved by a universal, parameter-free strategy: an antisymmetric two-copy input state followed by a projection onto the symmetric and antisymmetric subspaces of the outputs, with no additional ancillary systems required. Second, in the asymmetric (hypothesis-testing) setting we reduce the problem to a simple linear program and derive explicit type-I/type-II error trade-off curves for deterministic fixed-input protocols, for which the optimal input depends on the allowed type-I error; remarkably, classical randomization—equivalently, an untouched side register correlated with the input choice—can strictly improve the asymmetric performance by convexifying the deterministic trade-off, in sharp contrast to the symmetric setting. Finally, we show that the type-I error can be made to vanish without trivializing the test only in the environment-free case, corresponding to isometric channels, and for von Neumann measurements; for any genuinely noisy dynamics both types of error remain strictly positive in every nontrivial comparison scheme.

arXiv:2501.17317•Scientific Reports•Sep 14, 2026•1 citation

Universal adjointation of isometry operations using conversion of quantum supermaps

Satoshi Yoshida, Akihito Soeda, Mio Murao

Identification of possible transformations of quantum objects including quantum states and quantum operations is indispensable in developing quantum algorithms. Universal transformations, defined as input-independent transformations, appear in various quantum applications. Such is the case for universal transformations of unitary operations. However, extending these transformations to non-unitary operations is nontrivial and largely unresolved. Addressing this, we introduce isometry adjointation protocols that transform an input isometry operation into its adjoint operation, which include both unitary operation and quantum state transformations. The paper details the construction of parallel and sequential isometry adjointation protocols, derived from unitary inversion protocols using quantum combs and the (dual) Clebsch-Gordan transforms, and achieving optimal approximation error. This error is shown to be independent of the output dimension of the isometry operation. In particular, we explicitly obtain an asymptotically optimal parallel protocol achieving an approximation error ϵ=Θ(d2/n) , where d is the input dimension of the isometry operation and n is the number of calls of the isometry operation. The research also extends to isometry inversion and universal error detection, employing semidefinite programming to assess optimal performances. The findings suggest that the optimal performance of general protocols in isometry adjointation and universal error detection is not dependent on the output dimension, and that indefinite causal order protocols offer advantages over sequential ones in isometry inversion and universal error detection.

arXiv:2401.10137•Quantum•May 20, 2025•12 citations

Reversing Unknown Quantum Transformations: Universal Quantum Circuit for Inverting General Unitary Operations

Marco Túlio Quintino, Qingxiuxiong Dong, Atsushi Shimbo +2 more

Given a quantum gate implementing a d-dimensional unitary operation U_{d}, without any specific description but d, and permitted to use k times, we present a universal probabilistic heralded quantum circuit that implements the exact inverse U_{d}^{-1}, whose failure probability decays exponentially in k. The protocol employs an adaptive strategy, proven necessary for the exponential performance. It requires that k≥d-1, proven necessary for the exact implementation of U_{d}^{-1} with quantum circuits. Moreover, even when quantum circuits with indefinite causal order are allowed, k≥d-1 uses are required. We then present a finite set of linear and positive semidefinite constraints characterizing universal unitary inversion protocols and formulate a convex optimization problem whose solution is the maximum success probability for given k and d. The optimal values are computed using semidefinite programing solvers for k≤3 when d=2 and k≤2 for d=3. With this numerical approach we show for the first time that indefinite causal order circuits provide an advantage over causally ordered ones in a task involving multiple uses of the same unitary operation.

arXiv:1810.06944•Physical Review Letters•Nov 21, 2019•108 citations
The accurate identification of faulty hardware is a fundamental requirement for reliable quantum information processing. We address this problem in a quantum setting, where a series of nnn devices is intended to apply the same unitary operation, but kkk malfunctioning devices among them apply a different, unknown unitary action. Under the assumption of complete ignorance regarding the specific unitary transformation applied, we model our hypotheses using representation-theoretic tools and study the zero-error protocol for identifying these faulty devices. We derive the optimal success probability for the single- and two-anomaly scenarios, demonstrating that it is independent of the total number of devices in the series. Furthermore, we present a simple protocol that makes use of ancillary systems that achieves this optimal limit. Notably, this protocol offers significant operational advantages, such as allowing us to test each device independently. Finally, we extend our analysis to the general scenario in which both the number of anomalies and the local dimension of the systems are arbitrary, evaluating our protocol's performance and conjecturing its global optimality in the general case.
We consider the problem of correctly identifying a malfunctioning quantum device that forms part of a network of N such devices, which can be considered as the quantum analog of classical anomaly detection. In the case where the devices in question are sources assumed to prepare identical quantum pure states, with the faulty source producing a different anomalous pure state, we show that the optimal probability of successful identification requires a global quantum measurement. We also put forth several local measurement strategies—both adaptive and nonadaptive—that achieve the same optimal probability of success in the limit where the number of devices to be checked is large. In the case where the faulty device performs a known unitary operation, we show that the use of entangled probes provides an improvement that even allows perfect identification for values of the unitary parameter that surpass a certain threshold. Finally, if the faulty device implements a known qubit channel, we find that the optimal probability for detecting the position of rank-one and rank-two Pauli channels can be achieved by product state inputs and separable measurements for any size of network, whereas for rank-three and general amplitude damping channels, optimal identification requires entanglement with N qubit ancillas. Published by the American Physical Society 2024
Suppose we want to identify an input state with one of two unknown reference states, where the input state is guaranteed to be equal to one of the reference states. We assume that no classical knowledge of the reference states is given, but a certain number of copies of them are available instead. Two reference states are independently and randomly chosen from the state space in a unitary invariant way. This is called the quantum state identification problem, and the task is to optimize the mean identification success probability. In this paper, we consider the case where each reference state is pure and bipartite, and generally entangled. The question is whether the maximum mean identification success probability can be attained by means of a local operations and classical communication (LOCC) measurement scheme. Two types of identification problem are considered when a single copy of each reference state is available. We show that a LOCC scheme attains the globally achievable identification probability in the minimum-error identification problem. In the unambiguous identification problem, however, the maximal success probability by means of LOCC is shown to be less than the globally achievable identification probability.
We consider the problem of reproducing one quantum measurement given the ability to perform another. We give a general framework and specific protocols for this problem. For example, we show how to use available “imperfect” devices a small number of times to implement a target measurement with average error that drops off exponentially with the number of imperfect measurements used. We hope that could be useful in near-term applications as a type of lightweight error mitigation of the measuring devices. As well as the view to practical applications, we consider the question from a general theoretical perspective in the most general setting where both the available and target measurements are arbitrary generalized quantum measurements. We show that this general problem in fact reduces to the ability to reproduce the statistics of (complete) von Neumann measurements, and that in the asymptotic limit of infinitely many uses of the available measurement, a simple protocol based upon “classical cloning” can perfectly achieve this task. We show that asymptotically any nontrivial quantum measurement can reproduce any other. We also study optimal protocols for a fixed number of uses of the available measurement. This includes, but is not limited to, improving both noisy and lossy quantum measurements. Furthermore, we show that, in a setting where we perform multiple measurements in parallel, we can achieve finite-rate measurement reproduction, by using block-coding techniques from classical information theory. Finally, we show that advantages can also be gained by making use of probabilistic protocols.
We analyze the task of deciding whether two unknown quantum devices are identical or independent, for arbitrary quantum channels and generalized measurements (POVMs) drawn at random from Haar-Stinespring ensembles, in the single-shot regime in which each device is used exactly once. Our contribution is twofold. First, in the symmetric setting, in which both types of error are treated on an equal footing, we derive a closed-form expression for the optimal success probability and show that it is achieved by a universal, parameter-free strategy: an antisymmetric two-copy input state followed by a projection onto the symmetric and antisymmetric subspaces of the outputs, with no additional ancillary systems required. Second, in the asymmetric (hypothesis-testing) setting we reduce the problem to a simple linear program and derive explicit type-I/type-II error trade-off curves for deterministic fixed-input protocols, for which the optimal input depends on the allowed type-I error; remarkably, classical randomization—equivalently, an untouched side register correlated with the input choice—can strictly improve the asymmetric performance by convexifying the deterministic trade-off, in sharp contrast to the symmetric setting. Finally, we show that the type-I error can be made to vanish without trivializing the test only in the environment-free case, corresponding to isometric channels, and for von Neumann measurements; for any genuinely noisy dynamics both types of error remain strictly positive in every nontrivial comparison scheme.
Identification of possible transformations of quantum objects including quantum states and quantum operations is indispensable in developing quantum algorithms. Universal transformations, defined as input-independent transformations, appear in various quantum applications. Such is the case for universal transformations of unitary operations. However, extending these transformations to non-unitary operations is nontrivial and largely unresolved. Addressing this, we introduce isometry adjointation protocols that transform an input isometry operation into its adjoint operation, which include both unitary operation and quantum state transformations. The paper details the construction of parallel and sequential isometry adjointation protocols, derived from unitary inversion protocols using quantum combs and the (dual) Clebsch-Gordan transforms, and achieving optimal approximation error. This error is shown to be independent of the output dimension of the isometry operation. In particular, we explicitly obtain an asymptotically optimal parallel protocol achieving an approximation error ϵ=Θ(d2/n) , where d is the input dimension of the isometry operation and n is the number of calls of the isometry operation. The research also extends to isometry inversion and universal error detection, employing semidefinite programming to assess optimal performances. The findings suggest that the optimal performance of general protocols in isometry adjointation and universal error detection is not dependent on the output dimension, and that indefinite causal order protocols offer advantages over sequential ones in isometry inversion and universal error detection.
Given a quantum gate implementing a d-dimensional unitary operation U_{d}, without any specific description but d, and permitted to use k times, we present a universal probabilistic heralded quantum circuit that implements the exact inverse U_{d}^{-1}, whose failure probability decays exponentially in k. The protocol employs an adaptive strategy, proven necessary for the exponential performance. It requires that k≥d-1, proven necessary for the exact implementation of U_{d}^{-1} with quantum circuits. Moreover, even when quantum circuits with indefinite causal order are allowed, k≥d-1 uses are required. We then present a finite set of linear and positive semidefinite constraints characterizing universal unitary inversion protocols and formulate a convex optimization problem whose solution is the maximum success probability for given k and d. The optimal values are computed using semidefinite programing solvers for k≤3 when d=2 and k≤2 for d=3. With this numerical approach we show for the first time that indefinite causal order circuits provide an advantage over causally ordered ones in a task involving multiple uses of the same unitary operation.