21 February 2023 in Scientific Reports
The topic of causality has recently gained traction quantum information research. This work examines the problem of single-shot discrimination between process matrices which are an universal method defining a causal structure. We provide an exact expression for the optimal probability of correct distinction. In addition, we present an alternative way to achieve this expression by using the convex cone structure theory. We also express the discrimination task as semidefinite programming. Due to that, we have created the SDP calculating the distance between process matrices and we quantify it in terms of the trace norm. As a valuable by-product, the program finds an optimal realization of the discrimination task. We also find two classes of process matrices which can be distinguished perfectly. Our main result, however, is a consideration of the discrimination task for process matrices corresponding to quantum combs. We study which strategy, adaptive or non-signalling, should be used during the discrimination task. We proved that no matter which strategy you choose, the probability of distinguishing two process matrices being a quantum comb is the same.
18 November 2022 in Physical Review A
This work examines the problem of learning an unknown von Neumann measurement of dimension from a finite number of copies. To obtain a faithful approximation of the given measurement, we are allowed to use it times. Our main goal is to estimate the asymptotic behavior of the maximum value of the average fidelity function for a general learning scheme. We show that for arbitrary but fixed dimension . In addition to that, we compared various learning schemes for . We observed that the learning scheme based on deterministic port-based teleportation is asymptotically optimal but performs poorly for low . In particular, we discovered a parallel learning scheme, which despite its lack of asymptotic optimality, provides a high value of the fidelity for low values of and uses only two-qubit entangled memory states.
8 February 2026 in Scientific Reports
Tasks involving black boxes appear frequently in the theory of quantum information, with quantum channel discrimination as a central example that has been deeply studied. In this work, we experimentally study the discrimination between two unitary quantum channels in the multiple-shot scenario. We challenge the theoretical results concerning the probability of correct discrimination with the results collected from experiments performed on the IBM Brisbane. Our analysis shows that neither too deep quantum circuits nor circuits that create too much entanglement are suitable for the discrimination task. We conclude that circuit architectures which minimize entanglement overhead while preserving discrimination power are significantly more resilient to hardware noise if their depth does not exceed a threshold value. Consequently, our findings necessitate a paradigm shift: for execution on noisy hardware, the theoretically suboptimal circuit is, counterintuitively, often the superior choice.
18 October 2024 in Physical Review A