Related papers: Nonsignaling quantum random access code boxes
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 consider visible compression for discrete memoryless sources of mixed quantum states when only classical information can be sent from Alice to Bob. We assume that Bob knows the source statistics, and that Alice and Bob have identical…
Assume that two distant parties, Alice and Bob, as well as an adversary, Eve, have access to (quantum) systems prepared jointly according to a tripartite state. In addition, Alice and Bob can use local operations and authenticated public…
As our main result we show that, in order to achieve the randomness assisted message - and entanglement transmission capacities of a finite arbitrarily varying quantum channel it is not necessary that sender and receiver share…
We propose an efficient quantum protocol performing quantum bit commitment, which is a simple cryptographic primitive involved with two parties, called a committer and a verifier. Our protocol is non-interactive, uses no supplemental shared…
We propose a scheme to achieve quantum computation with neutral atoms whose interactions are catalyzed by single photons. Conditional quantum gates, including an $N$-atom Toffoli gate and nonlocal gates on remote atoms, are obtained through…
We propose a cryptographic scheme that is deterministic: Alice sends single photons to Bob, and each and every photon detected supplies one key bit -- no photon is wasted. This is in marked contrast to other schemes in which a random…
In a world where Quantum Networks are rapidly becoming a reality, the development of the Quantum Internet is gaining increasing interest. Nevertheless, modern quantum networks are still in the early stages of development and have limited…
Central cryptographic functionalities such as encryption, authentication, or secure two-party computation cannot be realized in an information-theoretically secure way from scratch. This serves as a motivation to study what (possibly weak)…
We consider the problem of hiding sender and receiver of classical and quantum bits (qubits), even if all physical transmissions can be monitored. We present a quantum protocol for sending and receiving classical bits anonymously, which is…
We consider one of the quantum key distribution protocols recently introduced in Ref. [Pirandola et al., Nature Physics 4, 726 (2008)]. This protocol consists in a two-way quantum communication between Alice and Bob, where Alice encodes…
Quantum statistics can be considered from the perspective of postquantum no-signaling theories in which either none or only a certain number of quantum systems are trusted. In these scenarios, the role of states is played by the so-called…
Blind quantum computation (BQC) allows a client (Alice), who only possesses relatively poor quantum devices, to delegate universal quantum computation to a server (Bob) in such a way that Bob cannot know Alice's inputs, algorithm, and…
Suppose Alice and Bob share a maximally entangled state of any finite dimension and each perform two-outcome measurements on the respective part of the state. It is known, due to the recent result of Regev and Toner, that if a classical…
We present a quantum no-key protocol for direct and secure transmission of quantum and classical messages based on simple Boolean function computation with several quantum gates and Shamir's interactive idea of classical message encryption.…
A set of nonlocal correlations that have come to be known as a PR box suggest themselves as a natural unit of nonlocality, much as a singlet is a natural unit of entanglement. We present two results relevant to this idea. One is that a wide…
We study the communication protocol known as a Quantum Random Access Code (QRAC) which encodes $n$ classical bits into $m$ qubits ($m<n$) with a probability of recovering any of the initial $n$ bits of at least $p>\tfrac{1}{2}$. Such a code…
We propose a teleportation protocol that enables perfect transmission of a qubit using a partially entangled two-qutrit quantum channel. Within our scheme, we analyze the relationship among the three key ingredients of teleportation: (i)…
Studies addressing the question "Can a learner complete the learning securely?" have recently been spurred from the standpoints of fundamental theory and potential applications. In the relevant context of this question, we present a…
Oblivious transfer is a cryptographic primitive where Alice has two bits and Bob wishes to learn some function of them. Ideally, Alice should not learn Bob's desired function choice and Bob should not learn any more than what is logically…