Related papers: Quantum source-channel coding and non-commutative …
Recently, a coding technique called position-based coding has been used to establish achievability statements for various kinds of classical communication protocols that use quantum channels. In the present paper, we apply this technique in…
Quantum networks scale the advantages of quantum communication protocols to more than just two distant users. Here we present a fully connected quantum network architecture in which a single entangled photon source distributes quantum…
We present an infinite sequence of finite graphs with trivial automorphism group and non-trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are…
In this study, we consider a quantum version of multicast network coding as a multicast protocol for sending universal quantum clones (UQCs) from a source node to the target nodes on a quantum network. By extending Owari et al.'s previous…
We illustrate using a quantum system the principle of a cryptographic switch, in which a third party (Charlie) can control to a continuously varying degree the amount of information the receiver (Bob) receives, after the sender (Alice) has…
This thesis explores foundational aspects of quantum information theory and quantum cryptography. First, we investigate quantum correlations in interactive settings, including the CHSH and graph isomorphism games. We aim to distinguish…
As our main result we show that, in order to achieve the randomness assisted message - and entanglement transmission capacities of a finite arbitrarily varying quantum channel it is not necessary that sender and receiver share…
The problem of secure lossy source-channel wiretapping with arbitrarily correlated side informations at both receivers is investigated. This scenario consists of an encoder (referred to as Alice) that wishes to compress a source and send it…
Graph Isomorphism is such an important problem in computer science, that it has been widely studied over the last decades. It is well known that it belongs to NP class, but is not NP-complete. It is thought to be of comparable difficulty to…
We present a simple protocol where Alice and Bob only needs sending out a coherent state or not-sending out a coherent state to Charlie. There is no bases switching. We show that this protocol is both encoding-state-side-channel free to the…
Quantum networks illustrate the use of connected nodes of quantum systems as the backbone of distributed quantum information processing. When the network nodes are entangled in graph states, such a quantum platform is indispensable to…
A central question in classical information theory is that of source compression, which is the task where Alice receives a sample from a known probability distribution and needs to transmit it to the receiver Bob with small error. This…
We compute the independence number, zero-error capacity, and the values of the Lov\'asz function and the quantum Lov\'asz function for the quantum graph associated to the partial trace quantum channel…
The capacity of unifilar finite-state channels in the presence of feedback is investigated. We derive a new evaluation method to extract graph-based encoders with their achievable rates, and to compute upper bounds to examine their…
Quantum teleportation provides a way to transfer unknown quantum states from one system to another via an entangled state as a quantum channel without physical transmission of the object itself. The entangled channel, measurement performed…
We determine the optimal rates of universal quantum codes for entanglement transmission and generation under channel uncertainty. In the simplest scenario the sender and receiver are provided merely with the information that the channel…
We present a strong connection between quantum information and quantum permutation groups. Specifically, we define a notion of quantum isomorphisms of graphs based on quantum automorphisms from the theory of quantum groups, and then show…
Connectedness and bipartiteness are basic properties of classical graphs, and the purpose of this paper is to investigate the case of quantum graphs. We introduce the notion of connectedness and bipartiteness of quantum graphs in terms of…
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…
Quantum networks are important for quantum communication, enabling tasks such as quantum teleportation, quantum key distribution, quantum sensing, and quantum error correction, often utilizing graph states, a specific class of multipartite…