1 June 2021 in Journal of Mathematical Physics
Several techniques of generating random quantum channels, which act on the set of d-dimensional quantum states, are investigated. We present three approaches to the problem of sampling of quantum channels and show that they are mathematically equivalent. We discuss under which conditions they give the uniform Lebesgue measure on the convex set of quantum operations and compare their advantages and computational complexity and demonstrate which of them is particularly suitable for numerical investigations. Additional results focus on the spectral gap and other spectral properties of random quantum channels and their invariant states. We compute the mean values of several quantities characterizing a given quantum channel, including its unitarity, the average output purity, and the 2-norm coherence of a channel, averaged over the entire set of the quantum channels with respect to the uniform measure. An ensemble of classical stochastic matrices obtained due to super-decoherence of random quantum stochastic maps is analyzed, and their spectral properties are studied using the Bloch representation of a classical probability vector.
22 February 2018 in Quantum Information Processing
In this paper, we show that all nodes can be found optimally for almost all random Erdős–Rényi \(\mathcal G(n,p)\) graphs using continuous-time quantum spatial search procedure. This works for both adjacency and Laplacian matrices, though under different conditions. The first one requires \(p=\omega (\log ^8(n)/n)\), while the second requires \(p\ge (1+\varepsilon )\log (n)/n\), where \(\varepsilon >0\). The proof was made by analyzing the convergence of eigenvectors corresponding to outlying eigenvalues in the \(\Vert \cdot \Vert _\infty \) norm. At the same time for \(p<(1-\varepsilon )\log (n)/n\), the property does not hold for any matrix, due to the connectivity issues. Hence, our derivation concerning Laplacian matrix is tight.
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 March 2023 in IEEE Transactions on Information Theory
Probabilistic quantum error correction is an error-correcting procedure which uses postselection to determine if the encoded information was successfully restored. In this work, we analyze the probabilistic version of the error-correcting procedure for general noise. We generalize the Knill-Laflamme conditions for probabilistically correctable errors. We show that for some noise channels, the initial information has to be encoded into a mixed state to maximize the probability of successful error correction. Finally, the probabilistic error-correcting procedure offers an advantage over the deterministic procedure. Reducing the probability of successful error correction allows for correcting errors generated by a broader class of noise channels. Significantly, if the errors are caused by a unitary interaction with an auxiliary qubit system, we can probabilistically restore a qubit state by using only one additional physical qubit.
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.