Related papers: Quantum channels from association schemes
This work deals with the scattering entropy of quantum graphs in many different circumstances. We first consider the case of the Shannon entropy and then the R\'enyi and Tsallis entropies, which are more adequate to study distinct…
Mixing (or quasirandom) properties of the natural transition matrix associated to a graph can be quantified by its distance to the complete graph. Different mixing properties correspond to different norms to measure this distance. For dense…
We introduce a new approach to evaluating entangled quantum networks using information geometry. Quantum computing is powerful because of the enhanced correlations from quantum entanglement. For example, larger entangled networks can…
The capacity of accelerated channel is investigated for different classes of initial states. It is shown that, the capacities of the travelling channels depend on the frame in which the accelerated channels are observed in and the initial…
We investigate the quantum privacy properties of an important class of quantum chan-nels, by making use of a connection with Schur product matrix operations and associated correlationmatrix structures. For channels implemented by mutually…
This paper is essentially a lecture from the author's course on quantum information theory, which is devoted to the result of C. H. Bennett, P. W. Shor, J. A. Smolin and A. V. Thapliyal (quant-ph/0106052) concerning entanglement-assisted…
Motivated by the gate set tomography we study quantum channels from the perspective of information which is invariant with respect to the gauge realized through similarity of matrices representing channel superoperators. We thus use the…
We derive a general criterion to detect entangled states in multi-partite systems based on the symmetric logarithmic derivative quantum Fisher information. This criterion is a direct consequence of the fact that separable states do not…
The distribution of entanglement in quantum networks is typically approached under idealized assumptions such as perfect synchronization and centralized control, while classical communication is often neglected. However, these assumptions…
Families of expander graphs were first constructed by Margulis from discrete groups with property (T). Within the framework of quantum information theory, several authors have generalised the notion of an expander graph to the setting of…
The more than thirty years old issue of the information capacity of quantum communication channels was dramatically clarified during the last period, when a number of direct quantum coding theorems was discovered. To considerable extent…
Quantum channels can represent dynamic resources, which are indispensable elements in many physical scenarios. To describe certain facets of nonclassicality of the channels, it is necessary to quantify their properties. In the framework of…
The Quantum Approximate Optimization Algorithm can naturally be applied to combinatorial search problems on graphs. The quantum circuit has p applications of a unitary operator that respects the locality of the graph. On a graph with…
We study extensions of a quantum channel whose one-way capacities are described by a single-letter formula. This provides a simple technique for generating powerful upper bounds on the capacities of a general quantum channel. We apply this…
In this work we improve the quantum communication rates of various quantum channels of interest using permutation-invariant quantum codes. We focus in particular on parametrized families of quantum channels and aim to improve bounds on…
Characterizing the minimal communication needed for the quantum channel simulation is a fundamental task in the quantum information theory. In this paper, we show that, in fidelity, the quantum channel simulation can be directly achieved…
Quantum channel capacities play a central role in quantum Shannon theory, a formalism built upon rigorous coding theorems for noisy channels. Evaluating exact capacity values for general quantum channels remains intractable due to…
The development of techniques that reduce experimental complexity and minimize errors is an utmost importance for modeling quantum channels. In general, quantum simulators are focused on universal algorithms, whose practical implementation…
In this thesis, we are interested in the limits of quantum communication with and without entanglement, and with and without noise assumptions on the communication setup. When a sender and a receiver are connected by a communication line…
Transmission of classical information using quantum objects such as polarized photons is studied. The classical (Shannon) channel capacity and its relation to quantum (von Neumann) channel capacity is investigated for various receiver…