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. For optimal discrimination and estimation of sets of unitary channels memory-assisted protocols are not required.
We quantify the usefulness of a bipartite quantum state in the ancilla-assisted channel discrimination of arbitrary quantum channels, formally defining a worst-case-scenario channel discrimination power for bipartite quantum states. We show that such a quantifier is deeply connected with the operator Schmidt decomposition of the state. We compute the channel discrimination power exactly for pure states, and provide upper and lower bounds for general mixed states. We show that highly entangled states can outperform any state that passes the realignment criterion for separability. Furthermore, w…
We prove that every entangled state is useful as a resource for the problem of minimum-error channel discrimination. More specifically, given a single copy of an arbitrary bipartite entangled state, it holds that there is an instance of a quantum channel discrimination task for which this state allows for a correct discrimination with strictly higher probability than every separable state.
We provide a simple example that illustrates the advantage of adaptive over non-adaptive strategies for quantum channel discrimination. In particular, we give a pair of entanglement-breaking channels that can be perfectly discriminated by means of an adaptive strategy that requires just two channel evaluations, but for which no non-adaptive strategy can give a perfect discrimination using any finite number of channel evaluations.
We show that every entangled state provides an advantage in bi- and multi-channel discrimination that singles out its degree of entanglement, quantified in terms of its Schmidt number and of the corresponding robustness measures.
We solve the problem of discriminating with minimum error probability two given Pauli channels. We show that, differently from the case of discrimination between unitary transformations, the use of entanglement with an ancillary system can strictly improve the discrimination, and any maximally entangled state allows to achieve the optimal discrimination. We also provide a simple necessary and sufficient condition in terms of the structure of the channels for which the ultimate minimum error probability can be achieved without entanglement assistance. When such a condition is satisfied, the opt…
A collection of quantum channels is called incompatible if they cannot be obtained as marginals from a single channel. No-cloning theorem is the most prominent instance of incompatibility of quantum channels. We show that every collection of incompatible channels can be more useful than compatible ones as preprocessings in a state discrimination task with multiple ensembles of states. This is done by showing that the robustness of channel incompatibility which is a measure for incompatibility of channels exactly quantifies the maximum advantage in the state discrimination. We also show that in…
We study the power of measurements implementable with local quantum operations and classical communication (or LOCC measurements for short) in the setting of quantum channel discrimination. More precisely, we consider discrimination procedures that attempt to identify an unknown channel, chosen uniformly from two known alternatives, that take the following form: (i) the input to the unknown channel is prepared in a possibly entangled state with an ancillary system, (ii) the unknown channel is applied to the input system, and (iii) an LOCC measurement is performed on the output and ancillary sy…
We introduce and study norms in the space of hermitian operators, obtained from base norms in positively generated subspaces. These norms are closely related to discrimination of so-called generalized quantum channels, including quantum states, channels and networks. We further introduce generalized quantum decision problems and show that the maximal average payoff of decision procedures is again given by these norms. We also study optimality of decision procedures, in particular, we obtain a necessary and sufficient condition under which an optimal 1-tester for discrimination of quantum chann…
For minimum-error channel discrimination tasks that involve only unitary channels, we show that sequential strategies may outperform the parallel ones. Additionally, we show that general strategies that involve indefinite causal order are also advantageous for this task. However, for the task of discriminating a uniformly distributed set of unitary channels that forms a group, we show that parallel strategies are, indeed, optimal, even when compared to general strategies. We also show that strategies based on the quantum switch cannot outperform sequential strategies in the discrimination of u…
We consider the problem of optimally discriminating two Pauli channels in the minimax strategy, maximizing the smallest of the probabilities of correct identification of the channel. We find the optimal input state at the channel and show the conditions under which using entanglement strictly enhances distinguishability. We finally compare the minimax strategy with the Bayesian one.
A no-signalling channel transforming quantum systems in Alice's and Bob's laboratories is compatible with two different causal structures: (A < B) Alice's output causally precedes Bob's input and (B< A) Bob's output causally precedes Alice's input. I show that a quantum superposition of circuits operating within these two causal structures enables the perfect discrimination between no-signalling channels that can not be perfectly distinguished by any ordinary circuit.
In this work, we consider optimal state discrimination for a quantum system that interacts with an environment, i.e., states evolve under a quantum channel. We show the conditions on a quantum channel and an ensemble of states such that a measurement for optimal state discrimination is preserved. In particular, we show that when an ensemble of states with equal {\it a priori} probabilities is given, an optimal measurement can be preserved over any quantum channel by applying local operations and classical communication, that is, by manipulating the quantum states before and after the channel a…
We present an instance of a task of minimum-error discrimination of two qubit-qubit quantum channels for which a sequential strategy outperforms any parallel strategy. We then establish two new classes of strategies for channel discrimination that involve indefinite causal order and show that there exists a strict hierarchy among the performance of all four strategies. Our proof technique employs a general method of computer-assisted proofs. We also provide a systematic method for finding pairs of channels that showcase this phenomenon, demonstrating that the hierarchy between the strategies i…
Dynamics of many-qubit systems, that may correspond to computational processing with quantum systems, can be efficiently and generally approximated by a sequence of two- and single-qubit gates. In practical applications, however, a quantum gate prepared as a unitary transformation may appear as a noisy channel and consequently may inhibit quantum advantages. In this work, we apply the scheme of channel discrimination to detect if a quantum gate that is actually realized is unitary or noisy. We show that a two-qubit unitary transformation and its noisy counterpart can be optimally discriminated…
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 POVMs obtained by Holevo for ensembles 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 and we show the pitfalls of using input states with not maximal Schmidt rank. In case when maximally entangled state is not the optimal input state an error estimate is obtained. The resu…
Quantum hypothesis testing is an important tool for quantum information processing. Two main strategies have been widely adopted: in a minimum error discrimination strategy, the average error probability is minimized; while in an unambiguous discrimination strategy, an inconclusive decision (abstention) is allowed to vanish any possibility of errors when a conclusive result is obtained. In both scenarios, the testing between quantum states are relatively well-understood, for example, the ultimate limits of the performance are established decades ago; however, the testing between quantum channe…
We determine a fundamental upper bound on the performance of any adaptive protocol for discrimination or estimation of a channel which has an unknown parameter encoded in the state of its environment. Since our approach relies on the principle of data processing, the bound applies to a variety of discrimination measures, including quantum relative entropy, hypothesis testing relative entropy, Rényi relative entropy, fidelity, and quantum Fisher information. We apply the upper bound to thermal (amplifier) channels with a known transmissivity (gain) but unknown excess noise. In these cases, we f…
The accurate and reliable characterization of quantum dynamical processes underlies efforts to validate quantum technologies, where discrimination between competing models of observed behaviors inform efforts to fabricate and operate qubit devices. We present a novel protocol for quantum channel discrimination that leverages advances in direct characterization of quantum dynamics (DCQD) codes. We demonstrate that DCQD codes enable selective process tomography to improve discrimination between entangling and correlated quantum dynamics. Numerical simulations show selective process tomography re…
Single-shot quantum channel discrimination is a fundamental task in quantum information theory. It is well known that entanglement with an ancillary system can help in this task, and furthermore that an ancilla with the same dimension as the input of the channels is always sufficient for optimal discrimination of two channels. A natural question to ask is whether the same holds true for the output dimension. That is, in cases when the output dimension of the channels is (possibly much) smaller than the input dimension, is an ancilla with dimension equal to the output dimension always sufficien…
The class of quantum states known as Werner states have several interesting properties, which often serve to illuminate unusual properties of quantum information. Closely related to these states are the Holevo-Werner channels whose Choi matrices are Werner states. Exploiting the fact that these channels are teleportation covariant, and therefore simulable by teleportation, we compute the ultimate precision in the adaptive estimation of their channel-defining parameter. Similarly, we bound the minimum error probability affecting the adaptive discrimination of any two of these channels. In this …
We propose a scheme by using the feed-forward control (FFC) to realize a better effect of discrimination of two nonorthogonal states after passing a noise channel based on the minimum- error (ME) discrimination. We show that the application of our scheme can highly improve the effect of discrimination compared with the ME discrimination without the FFC for any pair of nonorthogonal states and any degree of amplitude damping (AD). Especially, the effect of our optimal discrimination can reach that of the two initial nonorthogonal pure states in the presence of the noise channel in a determinist…
A quantum analogue of the famous Blackwell Theorem in classical statistics has recently been proposed. Given two quantum channels A and B, a set of payoff functions have been proven to have values for B at least as high as they are for A if and only if there exists a quantum garbling channel E such that A=EB. When such a channel E exists, we can globally compare A and B in terms of their `noisiness'. We show that this method of channel noise comparison is equivalent to one obtained by considering the degradation of the distinguishability of states. Here, the channel A is said to be at least as…
Boosting State Discrimination in Quantum Brownian Motion Channel via Memory-Induced Coherence Preservation
Federal University of Piauí(皮奥伊联邦大学);Federal University of Paraná(巴拉那联邦大学);Universidade Federal do ABC(ABC联邦大学);Southern University of Science and Technology(南方科技大学);University of Coimbra(科英布拉大学)
We show how to optimally discriminate between K distinct quantum states, of which N copies are available, using one-at-a-time interactions with each of the N copies. While this task (famously) requires joint measurements on all N copies, we show that it can be solved with one-at-a-time "coherent measurements" performed by an apparatus with log(K) qubits of quantum memory. We apply the same technique to optimal discrimination between K distinct N-particle matrix product states of bond dimension D, using a coherent measurement apparatus with log(K) + log(D) qubits of memory.
Efficiently Computable Strategies and Limits for Bosonic Channel Discrimination
School of Science, STEM College, RMIT University(斯威本科技大学理学院STEM学院);Scuola Normale Superiore(比萨高等师范学院);Korteweg–de Vries Institute for Mathematics, University of Amsterdam(阿姆斯特丹大学科特韦格-德弗里斯数学研究所);Mathematical Quantum Information RIKEN Hakubi Research Team, RIKEN Pioneering Research Institute (PRI) and RIKEN Center for Quantum Computing (RQC)(理科院系量子信息RIKEN Hakubi研究团队,理化学研究所前沿研究院(PRI)和理化学研究所量子计算中心(RQC));School of Electrical and Computer Engineering, Cornell University(康奈尔大学电气与计算机工程学院)
We formulate minimum-error and unambiguous discrimination problems for quantum processes in the language of process positive operator valued measures (PPOVM). In this framework we present the known solution for minimum-error discrimination of unitary channels. We derive a "fidelity-like" lower bound on the failure probability of the unambiguous discrimination of arbitrary quantum processes. This bound is saturated (in a certain range of apriori probabilities) in the case of unambiguous discrimination of unitary channels. Surprisingly, the optimal solution for both tasks is based on the optimiz…
The characterisation of Quantum Channel Discrimination (QCD) offers critical insight for future quantum technologies in quantum metrology, sensing and communications. The task of multi-channel discrimination creates a scenario in which the discrimination of multiple quantum channels can be equated to the idea of pattern recognition, highly relevant to the tasks of quantum reading, illumination and more. Whilst the optimal quantum strategy for many scenarios is an entangled idler-assisted protocol, the extension to a multi-hypothesis setting invites the exploration of discrimination strategies …
Many quantum mechanical experiments can be viewed as multi-round interactive protocols between known quantum circuits and an unknown quantum process. Fully quantum "coherent" access to the unknown process is known to provide an advantage in many discrimination tasks compared to when only incoherent access is permitted, but it is unclear if this advantage persists when the process is noisy. Here, we show that a quantum advantage can be maintained when distinguishing between two noisy single qubit rotation channels. Numerical and analytical calculations reveal a distinct transition between optim…
We address binary phase-shift-keyed communication channels based on Gaussian states and prove that squeezing improves state discrimination at fixed energy of the channel, also in the presence of phase diffusion. We then assess performances of homodyne detection against the ultimate quantum limits to discrimination, and show that homodyning achieves optimality in large noise regime. Finally, we consider noise in the preparation of the seed signal (before phase encoding) and show that also in this case squeezing may improve state discrimination in realistic conditions.
In this work we study the problem of single-shot discrimination of von Neumann measurements, which we associate with measure-and-prepare channels. There are two possible approaches to this problem. The first one is simple and does not utilize entanglement. We focus only on the discrimination of classical probability distributions, which are outputs of the channels. We find necessary and sufficient criterion for perfect discrimination in this case. A more advanced approach requires the usage of entanglement. We quantify the distance between two measurements in terms of the diamond norm (called …
In this paper, we address the problem of discriminating two given quantum operations. Firstly, based on the Bloch representation of single qubit systems, we give the exact minimum error probability of discriminating two single qubit quantum operations by unentangled input states. In particular, for the Pauli channels discussed in [Phys. Rev. A {\bf 71}, 062340 (2005)], we use a more intuitional and visual method to deal with their discrimination problem. Secondly, we consider the condition for perfect discrimination of two quantum operations. Specially, we get that two generalized Pauli channe…
Limits for molecular spectroscopy from quantum channel discrimination
School of Science, STEM College, RMIT University(斯威本科技大学理学院STEM学院);Quantum Systems, Technology, CSIRO(澳大利亚联邦科学与工业研究组织量子系统与技术部);School of Mathematics and Physical Sciences, the University of Sheffield(谢菲尔德大学数学与物理科学学院);School of Electrical and Computer Engineering, Cornell University(康奈尔大学电气与计算机工程学院)
It is well known that for the discrimination of classical and quantum channels in the finite, non-asymptotic regime, adaptive strategies can give an advantage over non-adaptive strategies. However, Hayashi [IEEE Trans. Inf. Theory 55(8), 3807 (2009)] showed that in the asymptotic regime, the exponential error rate for the discrimination of classical channels is not improved in the adaptive setting. We extend this result in several ways. First, we establish the strong Stein's lemma for classical-quantum channels by showing that asymptotically the exponential error rate for classical-quantum cha…
This paper introduces coherent quantum channel discrimination as a coherent version of conventional quantum channel discrimination. Coherent channel discrimination is phrased here as a quantum interactive proof system between a verifier and a prover, wherein the goal of the prover is to distinguish two channels called in superposition in order to distill a Bell state at the end. The key measure considered here is the success probability of distilling a Bell state, and I prove that this success probability does not increase under the action of a quantum superchannel, thus establishing this meas…
This expository article gives an overview of the theory of hypothesis testing of quantum states in finite dimensional Hilbert spaces. Optimal measurement strategy for testing binary quantum hypotheses, which result in minimum error probability, is discussed. Collective and individual adaptive measurement strategies in testing hypotheses in the multiple copy scenario, with various upper and lower bounds on error probability, are outlined. A brief account on quantum channel discrimination and the role of entangled states in achieving enhanced precision in the task of channel discrimination is gi…
We address the problem of discriminating with minimal error probability two given quantum operations. We show that the use of entangled input states generally improves the discrimination. For Pauli channels we provide a complete comparison of the optimal strategies where either entangled or unentangled input states are used.
The optimal exponential error rate for adaptive discrimination of two channels is discussed. In this problem, adaptive choice of input signal is allowed. This problem is discussed in various settings. It is proved that adaptive choice does not improve the exponential error rate in these settings. These results are applied to quantum state discrimination.