Upper Bounds on Device-Independent Quantum Key Distribution.

Quantum key distribution (QKD) is a method that distributes a secret key to a sender and a receiver by the transmission of quantum particles (e.g., photons). Device-independent quantum key distribution (DIQKD) is a version of QKD with a stronger notion of security, in that the sender and receiver base their protocol only on the statistics of input and outputs of their devices as inspired by Bell's theorem. We study the rate at which DIQKD can be carried out for a given bipartite quantum state distributed between the sender and receiver or a quantum channel connecting them. We provide upper bounds on the achievable rate going beyond upper bounds possible for QKD. In particular, we construct states and channels where the QKD rate is significant while the DIQKD rate is negligible. This gap is illustrated for a practical case arising when using standard postprocessing techniques for entangled two-qubit states.

Private Weakly-Random Sequences from Human Heart Rate for Quantum Amplification.

We investigate whether the heart rate can be treated as a semi-random source with the aim of amplification by quantum devices. We use a semi-random source model called ε-Santha-Vazirani source, which can be amplified via quantum protocols to obtain a fully private random sequence. We analyze time intervals between consecutive heartbeats obtained from Holter electrocardiogram (ECG) recordings of people of different sex and age. We propose several transformations of the original time series into binary sequences. We have performed different statistical randomness tests and estimated quality parameters. We find that the heart can be treated as a good enough, and private by its nature, source of randomness that every human possesses. As such, in principle, it can be used as input to quantum device-independent randomness amplification protocols. The properly interpreted ε parameter can potentially serve as a new characteristic of the human heart from the perspective of medicine.

Distributed Private Randomness Distillation.

We develop the resource theory of private randomness extraction in the distributed and device-dependent scenario. We begin by introducing the notion of independent random bits, which are bipartite states containing ideal private randomness for each party, and motivate the natural set of free operations. As a conceptual tool, we introduce virtual quantum state merging, which is essentially the flip side of quantum state merging, without communication. We focus on the bipartite case and find the rate regions achievable in different settings. Surprisingly, it turns out that local noise can boost randomness extraction. As a consequence of our analysis, we resolve a long-standing problem by giving an operational interpretation for the reverse coherent information (up to a constant term logd) as the number of private random bits obtained by sending quantum states from one honest party (server) to another one (client) via the eavesdropped quantum channel.

Randomness Amplification under Minimal Fundamental Assumptions on the Devices.

Recently, the physically realistic protocol amplifying the randomness of Santha-Vazirani sources producing cryptographically secure random bits was proposed; however, for reasons of practical relevance, the crucial question remained open regarding whether this can be accomplished under the minimal conditions necessary for the task. Namely, is it possible to achieve randomness amplification using only two no-signaling components and in a situation where the violation of a Bell inequality only guarantees that some outcomes of the device for specific inputs exhibit randomness? Here, we solve this question and present a device-independent protocol for randomness amplification of Santha-Vazirani sources using a device consisting of two nonsignaling components. We show that the protocol can amplify any such source that is not fully deterministic into a fully random source while tolerating a constant noise rate and prove the composable security of the protocol against general no-signaling adversaries. Our main innovation is the proof that even the partial randomness certified by the two-party Bell test [a single input-output pair (u^{*}, x^{*}) for which the conditional probability P(x^{*}|u^{*}) is bounded away from 1 for all no-signaling strategies that optimally violate the Bell inequality] can be used for amplification. We introduce the methodology of a partial tomographic procedure on the empirical statistics obtained in the Bell test that ensures that the outputs constitute a linear min-entropy source of randomness. As a technical novelty that may be of independent interest, we prove that the Santha-Vazirani source satisfies an exponential concentration property given by a recently discovered generalized Chernoff bound.

When are Popescu-Rohrlich boxes and random access codes equivalent?

We study a problem of interconvertibility of two supraquantum resources: one is the so-called Popescu-Rohrlich (PR) box, which violates Clauser-Horne-Shimony-Holt inequality up to the maximal algebraic bound, and the second is the so-called random access code (RAC). The latter is a functionality that enables Bob (receiver) to choose one of two bits of Alice. It is known that a PR box supplemented with one bit of communication can be used to simulate a RAC. We ask the converse question: to what extent can a RAC can simulate a PR box? To this end, we introduce a "racbox": a box such that when it is supplemented with one bit of communication it offers a RAC. As said, a PR box can simulate a racbox. The question we raise is whether any racbox can simulate a PR box. We show that a nonsignaling racbox, indeed, can simulate a PR box; hence, these two resources are equivalent. We also provide an example of a signaling racbox that cannot simulate a PR box. We give a resource inequality between racboxes and PR boxes and show that it is saturated.

Realistic noise-tolerant randomness amplification using finite number of devices.

Randomness is a fundamental concept, with implications from security of modern data systems, to fundamental laws of nature and even the philosophy of science. Randomness is called certified if it describes events that cannot be pre-determined by an external adversary. It is known that weak certified randomness can be amplified to nearly ideal randomness using quantum-mechanical systems. However, so far, it was unclear whether randomness amplification is a realistic task, as the existing proposals either do not tolerate noise or require an unbounded number of different devices. Here we provide an error-tolerant protocol using a finite number of devices for amplifying arbitrary weak randomness into nearly perfect random bits, which are secure against a no-signalling adversary. The correctness of the protocol is assessed by violating a Bell inequality, with the degree of violation determining the noise tolerance threshold. An experimental realization of the protocol is within reach of current technology.

Limitations on quantum key repeaters.

A major application of quantum communication is the distribution of entangled particles for use in quantum key distribution. Owing to noise in the communication line, quantum key distribution is, in practice, limited to a distance of a few hundred kilometres, and can only be extended to longer distances by use of a quantum repeater, a device that performs entanglement distillation and quantum teleportation. The existence of noisy entangled states that are undistillable but nevertheless useful for quantum key distribution raises the question of the feasibility of a quantum key repeater, which would work beyond the limits of entanglement distillation, hence possibly tolerating higher noise levels than existing protocols. Here we exhibit fundamental limits on such a device in the form of bounds on the rate at which it may extract secure key. As a consequence, we give examples of states suitable for quantum key distribution but unsuitable for the most general quantum key repeater protocol.

Quantum key distribution based on arbitrarily weak distillable entangled states.

States with private correlations but little or no distillable entanglement were recently reported. Here, we consider the secure distribution of such states, i.e., the situation when an adversary gives two parties such states and they have to verify privacy. We present a protocol which enables the parties to extract from such untrusted states an arbitrarily long and secure key, even though the amount of distillable entanglement of the untrusted states can be arbitrarily small.

Secure key from bound entanglement.

We characterize the set of shared quantum states which contain a cryptographically private key. This allows us to recast the theory of privacy as a paradigm closely related to that used in entanglement manipulation. It is shown that one can distill an arbitrarily secure key from bound entangled states. There are also states that have less distillable private keys than the entanglement cost of the state. In general, the amount of distillable key is bounded from above by the relative entropy of entanglement. Relationships between distillability and distinguishability are found for a class of states which have Bell states correlated to separable hiding states. We also describe a technique for finding states exhibiting irreversibility in entanglement distillation.

Locking entanglement with a single qubit.

We study the loss of entanglement of a bipartite state subjected to discarding or measurement of one qubit. Examining behavior of different entanglement measures, we find that entanglement of formation, entanglement cost, logarithmic negativity, and one-way distillable entanglement are lockable measures in that they can decrease arbitrarily after measuring one qubit. We prove that any convex and asymptotically noncontinuous measure is lockable. As a consequence, all the convex-roof measures can be locked. The relative entropy of entanglement is shown to be a nonlockable measure.

Local indistinguishability: more nonlocality with less entanglement.

We provide a first operational method for checking local indistinguishability of orthogonal states. It originates from that in Ghosh et al. [Phys. Rev. Lett. 87, 5807 (2001)]], though we deal with pure states. Our method shows that probabilistic local distinguishing is possible for a complete multipartite orthogonal basis if and only if all vectors are product. Also, it leads to local indistinguishability of a set of orthogonal pure states of 3 multiply sign in circle 3, which shows that one can have more nonlocality with less entanglement, where "more nonlocality" is in the sense of "increased local indistinguishability of orthogonal states." This is, to our knowledge, the only known example where d orthogonal states in d multiply sign in circle d are locally indistinguishable.

Local information as a resource in distributed quantum systems.

A new paradigm for distributed quantum systems where information is a valuable resource is developed. After finding a unique measure for information, we construct a scheme for its manipulation in analogy with entanglement theory. In this scheme, instead of maximally entangled states, two parties distill local states. We show that, surprisingly, the main tools of entanglement theory are general enough to work in this opposite scheme. Up to plausible assumptions, we show that the amount of information that must be lost during the protocol of concentration of local information can be expressed as the relative entropy distance from some special set of states.