Related papers: Exponential quantum enhancement for distributed ad…
This thesis will be focused on the classical capacity of quantum channels, one of the first areas treated by quantum information theorists. The problem is fairly solved since some years. Nevertheless, this work will give me a reason to…
Coordination in distributed systems is often hampered by communication latency, which degrades performance. Quantum entanglement offers fundamentally stronger correlations than classically achievable without communication. Crucially, these…
Entanglement shared between the two ends of a quantum communication channel has been shown to be a useful resource in increasing both the quantum and classical capacities for these channels. The entanglement-assisted capacities were derived…
Dense coding is the seminal example of how entanglement can boost qubit communication, from sending one bit to sending two bits. This is made possible by projecting separate particles onto a maximally entangled basis. We investigate more…
Quantum algorithms for Hamiltonian simulation and linear differential equations more generally have provided promising exponential speed-ups over classical computers on a set of problems with high real-world interest. However, extending…
We give a capacity formula for the classical communication over a noisy quantum channel, when local operations and global permutations allowed in the encoding and bipartite states preshared between the sender and the receiver. The two…
Entanglement shared between two seperated parties could not be increased without transmitting quantum system. We suggest the project to gain entanglement shared between Alice and Bob by transmitting quantum system and a nem scheme to…
We present and experimentally demonstrate a communication protocol that employs shared entanglement to reduce errors when sending a bit over a particular noisy classical channel. Specifically, it is shown that, given a single use of this…
We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In…
In this paper we fill the gap in previous works by proving the formula for entanglement-assisted capacity of quantum channel with additive constraint (such as bosonic Gaussian channel). The main tools are the coding theorem for…
We investigate the quantum advantage that can arise in typical two-party communication scenarios, where the sender and the receiver are allowed to share prior correlations. Focusing on communication tasks constrained by the…
Recently, several claims have been made that certain fundamental problems of distributed computing, including Leader Election and Distributed Consensus, begin to admit feasible and efficient solutions when the model of distributed…
Shared entanglement can significantly amplify classical correlations between systems interacting over a limited quantum channel. A natural avenue is to use entanglement of the same dimension as the channel because this allows for unitary…
Understanding the role that quantum entanglement plays as a resource in various information processing tasks is one of the crucial goals of quantum information theory. Here we propose a new perspective for studying quantum entanglement:…
We present an experiment demonstrating entanglement-enhanced classical communication capacity of a quantum channel with correlated noise. The channel is modelled by a fiber optic link exhibiting random birefringence that fluctuates on a…
Entanglement-assisted classical communication (EACC) aims to enhance communication systems using entanglement as an additional resource. However, there is a scarcity of explicit protocols designed for finite transmission scenarios, which…
We present a scheme to efficiently simulate, with a classical computer, the dynamics of multipartite quantum systems on which the amount of entanglement (or of correlations in the case of mixed-state dynamics) is conveniently restricted.…
In this work we revisit the Boolean Hidden Matching communication problem, which was the first communication problem in the one-way model to demonstrate an exponential classical-quantum communication separation. In this problem, Alice's…
We study the effects of quantum entanglement on the performance of two classical zero-error communication tasks among multiple parties. Both tasks are generalizations of the two-party zero-error channel-coding problem, where a sender and a…
The additivity problem asks if the use of entanglement can boost the information-carrying capacity of a given channel beyond what is achievable by coding with simple product states only. This has recently been shown not to be the case for…