Related papers: Faithful Simulation of Distributed Quantum Measure…

We initially consider a quantum system consisting of two qubits, which can be in one of two nonorthogonal states, \Psi_0 or \Psi_1. We distribute the qubits to two parties, Alice and Bob. They each measure their qubit and then compare their…

In this paper, we design the first computationally efficient codes for simultaneously reliable and covert communication over Binary Symmetric Channels (BSCs). Our setting is as follows: a transmitter Alice wishes to potentially reliably…

We have implemented an experimental set-up in order to demonstrate the feasibility of time-coding protocols for quantum key distribution. Alice produces coherent 20 ns faint pulses of light at 853 nm. They are sent to Bob with delay 0 ns…

We investigate an optimization problem of finding quantum sequential measurements, which forms a wide class of state discrimination problems with the restriction that only sequential measurements are allowed. Sequential measurements from…

Local pure states are an important resource for quantum computing. The problem of distilling local pure states from mixed ones can be cast in an information theoretic paradigm. The bipartite version of this problem where local purity must…

We propose a teleportation protocol involving beam splitting operations and binary-outcome measurements, such as parity measurements. These operations have a straightforward implementation using the dispersive regime of the Jaynes-Cummings…

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…

It is possible for two parties, Alice and Bob, to establish a secure communication link by sharing an ensemble of entangled particles, and then using these particles to generate a secret key. One way to establish that the particles are…

Self-testing is the task where spatially separated Alice and Bob cooperate to deduce the inner workings of untrusted quantum devices by interacting with them in a classical manner. We examine the task above where Alice and Bob do not trust…

We propose a new scheme in which perfect transmission of 1-qubit information is achieved with high success using purposefully delayed sharing of non-maximally entangled 2-qubit resource and repeated generalized Bell-state measurements…

We discuss sequential unambiguous state-discrimination measurements performed on the same qubit. Alice prepares a qubit in one of two possible states. The qubit is first sent to Bob, who measures it, and then on to Charlie, who also…

Suppose that Alice and Bob are located in distant laboratories, which are connected by an ideal quantum channel. Suppose further that they share many copies of a quantum state $\rho_{ABE}$, such that Alice possesses the $A$ systems and Bob…

We present two quantum information splitting schemes using respectively tripartite GHZ and asymmetric W states as quantum channels. We show that, if the secret state is chosen from a special ensemble and known to the sender (Alice), then…

Bit commitment is a fundamental cryptographic primitive in which Alice wishes to commit a secret bit to Bob. Perfectly secure bit commitment between two mistrustful parties is impossible through asynchronous exchange of quantum information.…

We present a protocol to simulate the quantum correlations of an arbitrary bipartite state, when the parties perform a measurement according to two traceless binary observables. We show that $\log(d)$ bits of classical communication is…

The mathematical framework of quantum theory, though fundamentally distinct from classical physics, raises the question of whether quantum processes can be efficiently simulated using classical resources. For instance, a sender (Alice)…

We initiate the study of quantifying nonlocalness of a bipartite measurement by the minimum amount of classical communication required to simulate the measurement. We derive general upper bounds, which are expressed in terms of certain…

The cryptographic protocol of coin tossing consists of two parties, Alice and Bob, that do not trust each other, but want to generate a random bit. If the parties use a classical communication channel and have unlimited computational…

We propose a communication protocol exploiting correlations between two events with a definite time-ordering: a) the outcome of a {\em weak measurement} on a spin, and b) the outcome of a subsequent ordinary measurement on the spin. In our…

We introduce a simple protocol for verifiable measurement-only blind quantum computing. Alice, a client, can perform only single-qubit measurements, whereas Bob, a server, can generate and store entangled many-qubit states. Bob generates…