Related papers: Proofs of Quantumness from Trapdoor Permutations
We discuss quantum key distribution protocols using quantum continuous variables. We show that such protocols can be made secure against individual gaussian attacks regardless the transmission of the optical line between Alice and Bob. This…
Remote state preparation enables one to create and manipulate a quantum state based on the shared entanglement between distant nodes. Here, we experimentally demonstrate remote preparation and manipulation of squeezed light. By performing…
We put forth Oblivious State Preparation (OSP) as a cryptographic primitive that unifies techniques developed in the context of a quantum server interacting with a classical client. OSP allows a classical polynomial-time sender to input a…
In order to avoid the risk of information leakage during the information mutual transmission between two authorized participants, i.e., Alice and Bob, a quantum dialogue protocol based on the entanglement swapping between any two Bell…
A new paradigm for secure communication, based on quantum illumination, is proposed. Alice uses spontaneous parametric down-conversion to send Bob a set of signal modes over a pure-loss channel while retaining the set of idler modes with…
In blind compression of quantum states, a sender Alice is given a specimen of a quantum state $\rho$ drawn from a known ensemble (but without knowing what $\rho$ is), and she transmits sufficient quantum data to a receiver Bob so that he…
An open quantum system leaks information into its environment. In some circumstances it is possible for an observer, say Alice, to recover that information, as a classical measurement record, in a variety of different ways, using different…
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…
In this paper we study interactive "one-shot" analogues of the classical Slepian-Wolf theorem. Alice receives a value of a random variable $X$, Bob receives a value of another random variable $Y$ that is jointly distributed with $X$.…
The article by Bouwmeester et al. on experimental quantum teleportation constitutes an important advance in the burgeoning field of quantum information. The experiment was motivated by the proposal of Bennett et al. in which an unknown…
Information about an unknown quantum state can be encoded in weak values of projectors belonging to a complete eigenbasis. We present a protocol that enables one party -- Bob -- to remotely determine the weak values corresponding to weak…
When the 4-state or the 6-state protocol of quantum cryptography is carried out on a noisy (i.e. realistic) quantum channel, then the raw key has to be processed to reduce the information of an adversary Eve down to an arbitrarily low…
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…
We experimentally demonstrate the transfer of an unknown single-qubit state from Alice to Bob via a two-step discrete-time quantum random walk on a cycle with four vertices on a four-qubit nuclear magnetic resonance quantum processor. The…
We give a (remote) quantum gambling scheme that makes use of the fact that quantum nonorthogonal states cannot be distinguished with certainty. In the proposed scheme, two participants Alice and Bob can be regarded as playing a game of…
Alice and Bob share a correlated composite quantum system AB. If AB is used as the key for a one-time pad cryptographic system, we show that the maximum amount of information that Alice can send securely to Bob is the quantum mutual…
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…
A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass, but all efficient classical computers cannot (under some cryptographic assumption). Such protocols play a crucial role in the…
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…
We introduce a model of quantum teleportation on a channel built on a quantum dot chain. Quantum dots are coupled through hopping and each dot can accept zero, one or two electrons. Vacuum and double occupation states have the same…