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:0803.3237 · Physical Review Letters

Memory Effects in Quantum Channel Discrimination

Giulio Chiribella, Giacomo Mauro D’Ariano, Paolo Perinotti

Published Oct 27, 2008• 183 citations
arXivHTMLPDF

Abstract

We consider quantum-memory assisted protocols for discriminating quantum channels. We show that for optimal discrimination of memory channels, memory assisted protocols are needed. This leads to a new notion of distance for channels with memory, based on the general theory of quantum testers. For discrimination and estimation of sets of independent unitary channels, we prove optimality of parallel protocols among all possible architectures.

DOI
10.1103/physrevlett.101.180501

Related papers

“Interaction-Free” Channel Discrimination

Markus Hasenöhrl, Michael M. Wolf

Abstract In this work, we investigate the question of which objects can be discriminated by totally “interaction-free” measurements. To this end, we interpret the Elitzur–Vaidman bomb-tester experiment as a quantum channel discrimination problem and generalize the notion of “interaction-free” measurement to arbitrary quantum channels. Our main result is a necessary and sufficient criterion for when it is possible or impossible to discriminate quantum channels in an “interaction-free” manner (i.e., such that the discrimination error probability and the “interaction” probability can be made arbitrarily small). For the case where our condition holds, we devise an explicit protocol with the property that both probabilities approach zero with an increasing number of channel uses, N. More specifically, the “interaction” probability in our protocol decays as $$\frac{1}{N}$$ 1 N and we show that this rate is the optimal achievable one. Furthermore, our protocol only needs at most one ancillary qubit and might thus be implementable in near-term experiments. For the case where our condition does not hold, we prove an inequality that quantifies the trade-off between the error probability and the “interaction” probability.

arXiv:2010.00623•Annales Henri Poincaré•Apr 1, 2022•6 citations

Characterising memory in quantum channel discrimination via constrained separability problems

Ties-A. Ohst, Shijun Zhang, H. Chau Nguyen +2 more

Quantum memories are a crucial precondition in many protocols for processing quantum information. A fundamental problem that illustrates this statement is given by the task of channel discrimination, in which an unknown channel drawn from a known random ensemble should be determined by applying it for a single time. In this paper, we characterise the quality of channel discrimination protocols when the quantum memory, quantified by the auxiliary dimension, is limited. This is achieved by formulating the problem in terms of separable quantum states with additional affine constraints that all of their factors in each separable decomposition obey. We discuss the computation of upper and lower bounds to the solutions of such problems which allow for new insights into the role of memory in channel discrimination. In addition to the single-copy scenario, this methodological insight allows to systematically characterise quantum and classical memories in adaptive channel discrimination protocols. Especially, our methods enabled us to identify channel discrimination scenarios where classical or quantum memory is required, and to identify the hierarchical and non-hierarchical relationships within adaptive channel discrimination protocols.

arXiv:2411.08110•Quantum•Jan 28, 2026•12 citations

Conditions for optimal input states for discrimination of quantum channels

Anna Jenčová, Martin Plávala

We find optimality conditions for testers in discrimination of quantum channels. These conditions are obtained using semidefinite programming and are similar to optimality conditions for discrimination of quantum states. We get a simple condition for existence of an optimal tester with any given input state with maximal Schmidt rank, in particular with a maximally entangled input state. In the case when maximally entangled state is not optimal, an upper bound on the optimal success probability is obtained. The results for discrimination of two channels are applied to covariant channels, qubit channels, unitary channels, and simple projective measurements.

arXiv:1603.01437•Journal of Mathematical Physics•Dec 1, 2016•24 citations

Query complexities of quantum channel discrimination and estimation: A unified approach

Zixin Huang, Johannes Jakob Meyer, Theshani Nuradha +1 more

The goal of quantum channel discrimination and estimation is to determine the identity of an unknown channel from a discrete or continuous set, respectively. The query complexity of these tasks is equal to the minimum number of times one must call an unknown channel to identify it within a desired threshold on the error probability. In this paper, we establish lower bounds on the query complexities of channel discrimination and estimation, in both the parallel and adaptive access models. We do so by establishing new or applying known upper bounds on the squared Bures distance and symmetric logarithmic derivative Fisher information of channels. Phrasing our statements and proofs in terms of isometric extensions of quantum channels allows us to give conceptually simple proofs for both novel and known bounds. We also provide alternative proofs for several established results in an effort to present a consistent and unified framework for quantum channel discrimination and estimation, which we believe will be helpful in addressing future questions in the field.

quant-pharXiv:2511.10832•Nov 17, 2025•4 citations

Sequential Quantum Channel Discrimination

Yonglong Li, Christoph Hirche, Marco Tomamichel

We consider the sequential quantum channel discrimination problem using adaptive and non-adaptive strategies. In this setting the number of uses of the underlying quantum channel is not fixed but a random variable that is either bounded in expectation or with high probability. We show that, by using adaptive strategies for the discrimination problem, both types of error probabilities decrease to zero exponentially fast and the rates are characterized by the measured relative entropy between two quantum channels. Allowing for quantum memory, we see that the optimal rates are given by the regularized channel relative entropy. We also characterize the error exponents in the discrimination problem if non-adaptive strategies are used.

arXiv:2210.11079•IEEE International Symposium on Information Theory (ISIT)•Jun 26, 2022•10 citations

Quantum memory advantage for quantum process tomography

Carlos Bravo-Prieto, Weiyuan Gong, Antonio Anna Mele

Quantum process tomography, the task of learning an unknown quantum channel from black-box access, is a central problem in quantum information. In this setting, protocols with quantum memory can coherently store and jointly process quantum information obtained from multiple channel uses, whereas protocols without quantum memory must measure after each use and retain only a classical transcript of the measurement outcomes. A fundamental open question is whether quantum memory provides a query-complexity advantage even when protocols without quantum memory may adapt their experiments based on all previous outcomes with unbounded classical computational power. In this work, we show that it does. We determine the optimal query complexity of quantum process tomography without quantum memory up to a constant factor to be $Θ(d_{\mathrm{in}}^3 d_{\mathrm{out}}^3/\varepsilon^2)$, where $d_{\mathrm{in}}$ and $d_{\mathrm{out}}$ are the channel input and output dimensions, respectively, and $\varepsilon$ is the target diamond-norm accuracy. More precisely, we prove that any incoherent protocol for this task, including adaptive protocols, requires $Ω(d_{\mathrm{in}}^3 d_{\mathrm{out}}^3/\varepsilon^2)$ queries, even when each channel use may be assisted by arbitrary fresh ancilla, and we present a non-adaptive, ancilla-free incoherent protocol achieving the matching upper bound $O(d_{\mathrm{in}}^3 d_{\mathrm{out}}^3/\varepsilon^2)$. Our results thereby generalize the optimal sample-complexity bounds for single-copy state tomography, recovered as the special case $d_{\mathrm{in}}=1$. By contrast, coherent protocols with quantum memory achieve query complexity $Θ(d_{\mathrm{in}}^2 d_{\mathrm{out}}^2/\varepsilon^2)$. Hence, our results establish a rigorous learning separation between quantum process tomography with and without quantum memory.

quant-pharXiv:2607.13476•Jul 16, 2026•7 citations
We consider quantum-memory assisted protocols for discriminating quantum channels. We show that for optimal discrimination of memory channels, memory assisted protocols are needed. This leads to a new notion of distance for channels with memory, based on the general theory of quantum testers. For discrimination and estimation of sets of independent unitary channels, we prove optimality of parallel protocols among all possible architectures.
Abstract In this work, we investigate the question of which objects can be discriminated by totally “interaction-free” measurements. To this end, we interpret the Elitzur–Vaidman bomb-tester experiment as a quantum channel discrimination problem and generalize the notion of “interaction-free” measurement to arbitrary quantum channels. Our main result is a necessary and sufficient criterion for when it is possible or impossible to discriminate quantum channels in an “interaction-free” manner (i.e., such that the discrimination error probability and the “interaction” probability can be made arbitrarily small). For the case where our condition holds, we devise an explicit protocol with the property that both probabilities approach zero with an increasing number of channel uses, N. More specifically, the “interaction” probability in our protocol decays as 1N\frac{1}{N}N1​ 1 N and we show that this rate is the optimal achievable one. Furthermore, our protocol only needs at most one ancillary qubit and might thus be implementable in near-term experiments. For the case where our condition does not hold, we prove an inequality that quantifies the trade-off between the error probability and the “interaction” probability.
Quantum memories are a crucial precondition in many protocols for processing quantum information. A fundamental problem that illustrates this statement is given by the task of channel discrimination, in which an unknown channel drawn from a known random ensemble should be determined by applying it for a single time. In this paper, we characterise the quality of channel discrimination protocols when the quantum memory, quantified by the auxiliary dimension, is limited. This is achieved by formulating the problem in terms of separable quantum states with additional affine constraints that all of their factors in each separable decomposition obey. We discuss the computation of upper and lower bounds to the solutions of such problems which allow for new insights into the role of memory in channel discrimination. In addition to the single-copy scenario, this methodological insight allows to systematically characterise quantum and classical memories in adaptive channel discrimination protocols. Especially, our methods enabled us to identify channel discrimination scenarios where classical or quantum memory is required, and to identify the hierarchical and non-hierarchical relationships within adaptive channel discrimination protocols.
We find optimality conditions for testers in discrimination of quantum channels. These conditions are obtained using semidefinite programming and are similar to optimality conditions for discrimination of quantum states. We get a simple condition for existence of an optimal tester with any given input state with maximal Schmidt rank, in particular with a maximally entangled input state. In the case when maximally entangled state is not optimal, an upper bound on the optimal success probability is obtained. The results for discrimination of two channels are applied to covariant channels, qubit channels, unitary channels, and simple projective measurements.
The goal of quantum channel discrimination and estimation is to determine the identity of an unknown channel from a discrete or continuous set, respectively. The query complexity of these tasks is equal to the minimum number of times one must call an unknown channel to identify it within a desired threshold on the error probability. In this paper, we establish lower bounds on the query complexities of channel discrimination and estimation, in both the parallel and adaptive access models. We do so by establishing new or applying known upper bounds on the squared Bures distance and symmetric logarithmic derivative Fisher information of channels. Phrasing our statements and proofs in terms of isometric extensions of quantum channels allows us to give conceptually simple proofs for both novel and known bounds. We also provide alternative proofs for several established results in an effort to present a consistent and unified framework for quantum channel discrimination and estimation, which we believe will be helpful in addressing future questions in the field.
We consider the sequential quantum channel discrimination problem using adaptive and non-adaptive strategies. In this setting the number of uses of the underlying quantum channel is not fixed but a random variable that is either bounded in expectation or with high probability. We show that, by using adaptive strategies for the discrimination problem, both types of error probabilities decrease to zero exponentially fast and the rates are characterized by the measured relative entropy between two quantum channels. Allowing for quantum memory, we see that the optimal rates are given by the regularized channel relative entropy. We also characterize the error exponents in the discrimination problem if non-adaptive strategies are used.
Quantum process tomography, the task of learning an unknown quantum channel from black-box access, is a central problem in quantum information. In this setting, protocols with quantum memory can coherently store and jointly process quantum information obtained from multiple channel uses, whereas protocols without quantum memory must measure after each use and retain only a classical transcript of the measurement outcomes. A fundamental open question is whether quantum memory provides a query-complexity advantage even when protocols without quantum memory may adapt their experiments based on all previous outcomes with unbounded classical computational power. In this work, we show that it does. We determine the optimal query complexity of quantum process tomography without quantum memory up to a constant factor to be Θ(din3dout3/ε2)Θ(d_{\mathrm{in}}^3 d_{\mathrm{out}}^3/\varepsilon^2)Θ(din3​dout3​/ε2), where dind_{\mathrm{in}}din​ and doutd_{\mathrm{out}}dout​ are the channel input and output dimensions, respectively, and ε\varepsilonε is the target diamond-norm accuracy. More precisely, we prove that any incoherent protocol for this task, including adaptive protocols, requires Ω(din3dout3/ε2)Ω(d_{\mathrm{in}}^3 d_{\mathrm{out}}^3/\varepsilon^2)Ω(din3​dout3​/ε2) queries, even when each channel use may be assisted by arbitrary fresh ancilla, and we present a non-adaptive, ancilla-free incoherent protocol achieving the matching upper bound O(din3dout3/ε2)O(d_{\mathrm{in}}^3 d_{\mathrm{out}}^3/\varepsilon^2)O(din3​dout3​/ε2). Our results thereby generalize the optimal sample-complexity bounds for single-copy state tomography, recovered as the special case din=1d_{\mathrm{in}}=1din​=1. By contrast, coherent protocols with quantum memory achieve query complexity Θ(din2dout2/ε2)Θ(d_{\mathrm{in}}^2 d_{\mathrm{out}}^2/\varepsilon^2)Θ(din2​dout2​/ε2). Hence, our results establish a rigorous learning separation between quantum process tomography with and without quantum memory.