Related papers: Random quantum channels I: graphical calculus and …
We consider the scenario of classical communication over a finite-dimensional quantum channel with memory using a separable-state input ensemble and local output measurements. We propose algorithms for estimating the information rate of…
The random matrix ensembles are applied to the quantum statistical two-dimensional systems of electrons. The quantum systems are studied using the finite dimensional real, complex and quaternion Hilbert spaces of the eigenfunctions. The…
One of the major achievements of the recently emerged quantum information theory is the introduction and thorough investigation of the notion of quantum channel which is a basic building block of any data-transmitting or data-processing…
With quantum computing devices increasing in scale and complexity, there is a growing need for tools that obtain precise diagnostic information about quantum operations. However, current quantum devices are only capable of short…
This thesis includes a survey of the results known for private and approximate private quantum channels. We develop the best known upper bound for $\epsilon$-randomizing maps, $n+2\log(1/\epsilon)+c$ bits required to $\epsilon$-randomize an…
In quantum information geometry, the curvature of von-Neumann entropy and relative entropy induce a natural metric on the space of mixed quantum states. Here we use this information metric to construct a random matrix ensemble for states…
We study quantum maps displaying spectral statistics intermediate between Poisson and Wigner-Dyson. It is shown that they can be simulated on a quantum computer with a small number of gates, and efficiently yield information about fidelity…
We determine the minimal experimental resources that ensure a unique solution in the estimation of trace-preserving quantum channels with both direct and convex optimization methods. A convenient parametrization of the constrained set is…
We make use of matrix representations of completely positive maps in order to study open quantum dynamics on graphs, with emphasis on quantum walks and the associated trajectories obtained via a monitoring of the position. We discuss the…
The group symmetries inherent in quantum channels often make them tractable and applicable to various problems in quantum information theory. In this paper, we introduce natural probability distributions for covariant quantum channels.…
Networks are often studied using the eigenvalues of their adjacency matrix, a powerful mathematical tool with a wide range of applications. Since in real systems the exact graph structure is not known, researchers resort to random graphs to…
One of the fundamental tasks in quantum information processing is to measure the quantum channels. Similar to measurements of quantum states, measurements of quantum channels are inherently stochastic, that is, quantum theory provides a…
The study of generic properties of quantum states has led to an abundance of insightful results. A meaningful set of states that can be efficiently prepared in experiments are ground states of gapped local Hamiltonians, which are well…
Quantum simulation is of great importance in quantum information science. Here, we report an experimental quantum channel simulator imbued with an algorithm for imitating the behavior of a general class of quantum systems. The reported…
Graphical models are useful tools for describing structured high-dimensional probability distributions. Development of efficient algorithms for generating unbiased and independent samples from graphical models remains an active research…
For a pair of quantum channels with the same input space, we show that the possibility of approximation of one channel by post-processings of the other channel can be characterized by comparing the success probabilities for the two…
For a pair of quantum channels with the same input space, we show that the possibility of approximation of one channel by post-processings of the other channel can be characterized by comparing the success probabilities for the two…
We consider arithmetic sequences, here defined as ordered lists of positive integers. Any such a sequence can be cast onto a quantum state, enabling the quantification of its `surprise' through von Neumann entropy. We identify typical…
As a hybrid of artificial intelligence and quantum computing, quantum neural networks (QNNs) have gained significant attention as a promising application on near-term, noisy intermediate-scale quantum (NISQ) devices. Conventional QNNs are…
We propose a general method to operationally quantify the resourcefulness of quantum channels via channel discrimination, an important information processing task. A main result is that the maximum success probability of distinguishing a…