Related papers: Two-party Models and the No-go Theorems
Given a classical channel---a stochastic map from inputs to outputs---the input can often be transformed to an intermediate variable that is informationally smaller than the input. The new channel accurately simulates the original but at a…
Information theory establishes the ultimate limits on performance for noisy communication systems [Shannon48]. An accurate model of a physical communication device must include quantum effects, but typically including these makes the theory…
We provide a simple and realistic model to study memory effects in a lossy bosonic quantum channel over arbitrary number of uses. The noise correlation among different uses is introduced by contiguous modes interactions which results in an…
We study quantum channels that vary on time in a deterministic way, that is, they change in an independent but not identical way from one to another use. We derive coding theorems for the classical entanglement assisted and unassisted…
There exist diverse no-go theorems, ranging from no-cloning to monogamies of quantum correlations and Bell inequality violations, which restrict the processing of information in the quantum world. In a multipartite scenario, monogamy of…
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…
We present a new quantum bit commitment (QBC) protocol based on counterfactual quantum cryptography. We analyze the security of this protocol, find that it can resist the attack presented by QBC's no-go theorem. Our protocol is simple, and…
Two of the fundamental no-go theorems of quantum information are the no-cloning theorem (that it is impossible to make copies of general quantum states) and the no-teleportation theorem (the prohibition on telegraphing, or sending quantum…
We consider the scenario where Alice wants to send a secret (classical) $n$-bit message to Bob using a classical key, and where only one-way transmission from Alice to Bob is possible. In this case, quantum communication cannot help to…
Coding theorems and (strong) converses for memoryless quantum communication channels and quantum sources are proved: for the quantum source the coding theorem is reviewed, and the strong converse proven. For classical information…
Quantum communication is an important branch of quantum information science, promising unconditional security to classical communication and providing the building block of a future large-scale quantum network. Noise in realistic quantum…
We present a simple and general simulation technique that transforms any black-box quantum algorithm (a la Grover's database search algorithm) to a quantum communication protocol for a related problem, in a way that fully exploits the…
Recently, Choi \emph{et al}. proposed an assumption on Mayers-Lo-Chau (MLC) no-go theorem that the state of the entire quantum system is invariable to both participants before the unveiling phase. This means that the theorem is only…
We prove a theorem which shows that a collection of experimental data of probabilistic weights related to decisions with respect to situations and their disjunction cannot be modeled within a classical probabilistic weight structure in case…
We prove a no-go theorem for storing quantum information in equilibrium systems. Namely, quantum information cannot be stored in a system with time-independent Hamiltonian interacting with heat bath of temperature $T>0$ during time that…
By using local quantum teleportation of a fixed state to one qubit of an entangled pair sent from the other party, it is shown how one party can commit a bit with only classical information as evidence that results in an unconditionally…
This paper builds on no-go theorems to the effect that quantum theory is inconsistent with observations being absolute; that is, unique and non-relative. Unlike the existing no-go results, the one introduced here is based on a…
We study an analog of the well-known Gel'fand Pinsker Channel which uses quantum states for the transmission of the data. We consider the case where both the sender's inputs to the channel and the channel states are to be taken from a…
We further study the security of the quantum bit commitment (QBC) protocol we previously proposed [Phys. Rev. A 74, 022332 (2006).], by analyzing the reduced density matrix \rho_{b}^{B} which describes the quantum state at Bob's side…
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…