Related papers: Interaction in Quantum Communication
The long-standing problem of quantum information processing is to remove the classical channel from quantum communication. Introducing a new information processing technique, it is discussed that both insecure and secure quantum…
This paper considers a problem of quantum communication between parties that are connected through a network of quantum channels. The model in this paper assumes that there is no prior entanglement shared among any of the parties, but that…
Quantum networking allows the transmission of information in ways unavailable in the classical world. Single packets of information can now be split and transmitted in a coherent way over different routes. This aggregation allows…
This thesis establishes a number of connections between foundational issues in quantum theory, and some quantum information applications. It starts with a review of quantum contextuality and non-locality, multipartite entanglement…
Quantum Counterfactual Communication is the recently-proposed idea of using quantum physics to send messages between two parties, without any matter/energy transfer associated with the bits sent. While this has excited massive interest,…
Quantum mechanics has led not only to new physical theories, but also a new understanding of information and computation. Quantum information began by yielding new methods for achieving classical tasks such as factoring and key distribution…
Quantum channels are known to provide qualitatively better information transfer capacities over their classical counterparts. Examples include quantum cryptography, quantum dense coding, and quantum teleportation. This is a short review on…
We study space-bounded communication complexity for unitary implementation in distributed quantum processors, where we restrict the number of qubits per processor to ensure practical relevance and technical non-triviality. We model…
Quantum communication networks (QCNs) utilize quantum mechanics for secure information transmission, but the reliance on fragile and expensive photonic quantum resources renders QCN resource optimization challenging. Unlike prior QCN works…
The investigation of quantum-classical correspondence may lead to gain a deeper understanding of the classical limit of quantum theory. We develop a quantum formalism on the basis of a linear-invariant theorem, which gives an exact…
Communication in a network generally takes place through a sequence of intermediate nodes connected by communication channels. In the standard theory of communication, it is assumed that the communication network is embedded in a classical…
Quantum resources can be more powerful than classical resources - a quantum computer can solve certain problems exponentially faster than a classical computer, and computing a function of two people's inputs can be done with exponentially…
Quantum network is a set of nodes connected with channels, through which the nodes communicate photons and classical information. Classical structural complexity of a quantum network may be defined through its physical structure, i.e.…
We study semidefinite relaxations of $\Pi_1$ combinatorial statements. By relaxing the pigeonhole principle, we obtain a new "quantum" pigeonhole principle which is a stronger statement. By relaxing statements of the form "the communication…
By considering quantum computation as a communication process, we relate its efficiency to a communication capacity. This formalism allows us to rederive lower bounds on the complexity of search algorithms. It also enables us to link the…
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…
We study the problem of simulating protocols in a quantum communication setting over noisy channels. This problem falls at the intersection of quantum information theory and quantum communication complexity, and it will be of importance for…
Classical fingerprinting associates with each string a shorter string (its fingerprint), such that, with high probability, any two distinct strings can be distinguished by comparing their fingerprints alone. The fingerprints can be…
We propose and simulate a protocol to evolve a quantum particle forward in time such that its trajectory closely matches that of the particle's Newtonian counterpart. Using short bursts of Schr\"odinger time-evolution interleaved with…
We show that the entropy of a message can be tested in a device-independent way. Specifically, we consider a prepare-and-measure scenario with classical or quantum communication, and develop two different methods for placing lower bounds on…