Related papers: Quantum source-channel coding and non-commutative …
We consider the fundamental protocol of dense coding of classical information assuming that noise affects both the forward and backward communication lines between Alice and Bob. Assuming that this noise is described by the same quantum…
We consider compound as well as arbitrarily varying classical-quantum channel models. For classical-quantum compound channels, we give an elementary proof of the direct part of the coding theorem. A weak converse under average error…
We consider entanglement-assisted (EA) private communication over a quantum broadcast channel, in which there is a single sender and multiple receivers. We divide the receivers into two sets: the decoding set and the malicious set. The…
The problem of secure multiterminal source coding with side information at the eavesdropper is investigated. This scenario consists of a main encoder (referred to as Alice) that wishes to compress a single source but simultaneously…
We study quantum versions of the Shannon capacity of graphs and non-commutative graphs. We introduce the asymptotic spectrum of graphs with respect to quantum and entanglement-assisted homomorphisms, and we introduce the asymptotic spectrum…
The entanglement-assisted classical capacity of a noisy quantum channel is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have…
In analogy with its classical counterpart, a noisy quantum channel is characterized by a loss, a quantity that depends on the channel input and the quantum operation performed by the channel. The loss reflects the transmission quality: if…
We undertake a study of the notion of a quantum graph over arbitrary finite-dimensional $C^*$-algebras $B$ equipped with arbitrary faithful states. Quantum graphs are realised principally as either certain operators on $L^2(B)$, the quantum…
The present paper is concerned with the concept of the one-way quantum computer, beyond binary-systems, and its relation to the concept of stabilizer quantum codes. This relation is exploited to analyze a particular class of quantum…
In quantum information theory there is a construction for quantum channels, appropriately called a quantum graph, that generalizes the confusability graph construction for classical channels in classical information theory. In this paper,…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
Quantum transport on structured networks is strongly influenced by interference effects, which can dramatically modify how information propagates through a system. We develop a quantum-information-theoretic framework for scattering on…
Coded source compression, also known as source compression with helpers, has been a major variant of distributed source compression, but has hitherto received little attention in the quantum regime. This work treats and solves the…
We investigate a graph-theoretic approach to the problem of distinguishing quantum product states in the fundamental quantum communication framework called local operations and classical communication (LOCC). We identify chordality as the…
We propose a quantum teleportation scheme for transmitting a single qutrit state by adopting a 2-qudit entangled state as the quantum channel. The measurement basis for Alice has been carefully and systematically constructed, which is…
Quantum graphs are defined by having a Laplacian defined on the edges of a metric graph with boundary conditions on each vertex such that the resulting operator, $\mathbf{L}$, is self-adjoint. We use Neumann boundary conditions although we…
Graph states provide a powerful framework for describing multipartite entanglement in quantum information science. In their standard formulation, graph states are generated by controlled-$Z$ interactions and naturally encode symmetric…
We investigate the quantum networks that their nodes are considered as quantum harmonic oscillators. The entanglement of the ground state can be used to quantify the amount of information one part of a network shares with the other part of…
We define several new types of quantum chromatic numbers of a graph and characterise them in terms of operator system tensor products. We establish inequalities between these chromatic numbers and other parameters of graphs studied in the…
Discrete-time quantum walks provide a natural framework for quantum transport on complex networks. On regular structures, coin-walker entanglement has been widely used to characterize quantum transport and to support quantum algorithmic…