Related papers: Two quantum algorithms for communication between s…
In the standard protocol for quantum teleportation, one assumes that Bob is able to perform ideal operations on his qubit. Here, we analyze the case in which some of these operations are more reliable than others. Moreover, we consider the…
We demonstrate that two spatially separated parties (Alice and Bob) can utilize shared prior quantum entanglement, and classical communications, to establish a synchronized pair of atomic clocks. In contrast to classical synchronization…
We first consider quantum communication protocols between a sender Alice and a receiver Bob, which transfer Alice's quantum information to Bob by means of non-local resources, such as classical communication, quantum communication, and…
We consider a distributed quantum hypothesis testing problem with communication constraints, in which the two hypotheses correspond to two different states of a bipartite quantum system, multiple identical copies of which are shared between…
Teleportation usually involves entangled particles 1,2 shared by Alice and Bob, Bell-state measurement on particle 1 and system particle by Alice, classical communication to Bob, and unitary transformation by Bob on particle 2. We propose a…
Quantum key distribution (QKD) enables Alice and Bob to exchange a secret key over a public, untrusted quantum channel. Compared to classical key exchange, QKD achieves everlasting security: after the protocol execution the key is secure…
We present a method for checking Peres separability criterion in an arbitrary bipartite quantum state $\rho_{AB}$ within local operations and classical communication scenario. The method does not require the prior state reconstruction and…
We obtain strict upper bounds on the bit transmission rate for communication of Classical bit codewords over Quantum channels. Albeit previous arguments in arXiv: 1804.01797 which have demonstrated that lower bounds can be shown to hold for…
In quantum weak oblivious transfer, Alice sends Bob two bits and Bob can learn one of the bits at his choice. It was found that the security of such a protocol is bounded by $2P_{Alice}^{\ast }+P_{Bob}^{\ast }\geq 2$, where $P_{Alice}^{\ast…
In 1935, Einstein, Podolsky, and Rosen argued that quantum mechanics is incomplete based on the assumption that local actions cannot influence elements of reality at a distant location (local realism). In this work, using a recently defined…
We discuss the following variant of the standard minimum error state discrimination problem: Alice picks the state she sends to Bob among one of several disjoint state ensembles, and she communicates him the chosen ensemble only at a later…
This paper considers a two-terminal problem in which Alice and Bob aim to perform a joint measurement on a bipartite quantum system $\rho^{AB}$. Alice transmits the results of her measurements to Bob over a classical channel, and the two…
Hiding the wireless communication by transmitter Alice to intended receiver Bob from a capable and attentive adversary Willie has been widely studied under the moniker "covert communications". However, when such covert communication is done…
Bob has a black box that emits a single pure state qudit which is, from his perspective, uniformly distributed. Alice wishes to give Bob evidence that she has knowledge about the emitted state while giving him little or no information about…
This work presents a deterministic scheme for the teleportation of a single qutrit state, held by the sender Alice, using maximally entangled two-qutrit states as resource channels. These states have been constructed from symmetric and…
According to Bell's theorem, certain entangled states cannot be simulated classically using local hidden variables (LHV). But if can we augment LHV by classical communication, how many bits are needed to simulate them? There is a strong…
Quantum illumination permits Alice and Bob to communicate at 50 Mbit/s over 50 km of low-loss fiber with error probability less than 10^(-6) while the optimum passive eavesdropper's error probability must exceed 0.28.
Based on an EPR pair of qubits and allowing asymptotically secure key distribution, a secure communication protocol is presented. Bob sends either of the EPR pair qubits to Alice. Alice receives the travel qubit. Then she can encode…
In this paper we propose a method through which $n$-qubit states can simultaneously be bi-directionally transmitted between two users. We assume that Alice and Bob, the legitimate users, each have a $n$-qubit GHZ-like state and want to…
The usual representation of quantum algorithms is limited to the process of solving the problem. We extend it to the process of setting the problem. Bob, the problem setter, selects a problem-setting by the initial measurement. Alice, the…