arXiv subjects

Stefan Wolf

Publications and source records attributed to Stefan Wolf.

At least 73 records · Page 4Linked to original sources

arXiv2013

Multi-User Non-Locality Amplification

Non-local correlations are among the most fascinating features of quantum theory from the point of view of information: Such correlations, although not allowing for signaling, are unexplainable by pre-shared information. The correlations have applications in cryptography, communication complexity, and sit at the very heart of many attempts of understanding quantum theory -- and its limits -- in terms of classical information. In these contexts, the question is crucial whether such correlations can be amplified or distilled, i.e., whether and how weak correlations can be used for generating (a smaller amount of) stronger. Whereas the question has been studied quite extensively for bipartite correlations (yielding both pessimistic and optimistic results), only little is known in the multi-partite case. We introduce a general framework of reductions between multi-party input-output systems. Within this formalism, we show that a natural n-party generalization of the well-known Popescu-Rohrlich box can be distilled, by an adaptive protocol, to the algebraic maximum.We use this result further to show that a much broader class of correlations, including all purely threepartite correlations, can be distilled from arbitrarily weak to almost maximal strength with partial communication, i.e., using only a subset of the channels required for the creation of the same correlation from scratch. Alternatively, this means that arbitrarily weak non-local correlations can have a "communication value" in the context of the generation of maximal non-locality.

quant-ph↗

arXiv2013

Distillation of Multi-Party Non-Locality With and Without Partial Communication

Non-local correlations are one of the most fascinating consequences of quantum physics from the point of view of information: Such correlations, although not allowing for signaling, are unexplainable by pre-shared information. The correlations have applications in cryptography, communication complexity, and sit at the very heart of many attempts of understanding quantum theory -- and its limits -- better in terms of classical information. In these contexts, the question is crucial whether such correlations can be distilled, i.e., whether weak correlations can be used for generating (a smaller amount of) stronger. Whereas the question has been studied quite extensively for bipartite correlations (yielding both pessimistic and optimistic results), only little is known in the multi-partite case. We show that a natural generalization of the well-known Popsecu-Rohrlich box can be distilled, by an adaptive protocol, to the algebraic maximum. We use this result further to show that a much bigger class of correlations, including all purely three-partite correlations, can be distilled from arbitrarily weak to maximal strength with partial communication, i.e., using only a subset of the channels required for the creation of the same correlation from scratch. In other words, we show that arbitrarily weak non-local correlations can have a "communication value" in the context of the generation of maximal non-locality.

quant-ph↗

arXiv2011

Bipartite Units of Non-Locality

Imagine a task in which a group of separated players aim to simulate a statistic that violates a Bell inequality. Given measurement choices the players shall announce an output based solely on the results of local operations -- which they can discuss before the separation -- on shared random data and shared copies of a so-called unit correlation. In the first part of this article we show that in such a setting the simulation of any bipartite correlation, not containing the possibility of signaling, can be made arbitrarily accurate by increasing the number of shared Popescu-Rohrlich (PR) boxes. This establishes the PR box as a simple asymptotic unit of bipartite nonlocality. In the second part we study whether this property extends to the multipartite case. More generally, we ask if it is possible for separated players to asymptotically reproduce any nonsignaling statistic by local operations on bipartite unit correlations. We find that non-adaptive strategies are limited by a constant accuracy and that arbitrary strategies on n resource correlations make a mistake with a probability greater or equal to c/n, for some constant c.

quant-ph↗

arXiv2011

Nonlocality is transitive

We show a transitivity property of nonlocal correlations: There exist tripartite nonsignaling correlations of which the bipartite marginals between A and B as well as B and C are nonlocal and any tripartite nonsignaling system between A, B, and C consistent with them must be such that the bipartite marginal between A and C is also nonlocal. This property represents a step towards ruling out certain alternative models for the explanation of quantum correlations such as hidden communication at finite speed. Whereas it is not possible to rule out this model experimentally, it is the goal of our approach to demonstrate this explanation to be logically inconsistent: either the communication cannot remain hidden, or its speed has to be infinite. The existence of a three-party system that is pairwise nonlocal is of independent interest in the light of the monogamy property of nonlocality.

quant-ph↗

arXiv2010

The non-locality of n noisy Popescu-Rohrlich boxes

We quantify the amount of non-locality contained in n noisy versions of so-called Popescu-Rohrlich boxes (PRBs), i.e., bipartite systems violating the CHSH Bell inequality maximally. Following the approach by Elitzur, Popescu, and Rohrlich, we measure the amount of non-locality of a system by representing it as a convex combination of a local behaviour, with maximal possible weight, and a non-signalling system. We show that the local part of n systems, each of which approximates a PRB with probability $1-ε$, is of order $Θ(ε^{\lceil n/2\rceil})$ in the isotropic, and equal to $(3ε)^n$ in the maximally biased case.

quant-ph↗

arXiv2010

Bit Commitment from Weak Non-Locality

So-called non-local boxes, which have been introduced as an idealization-in different respects-of the behavior of entangled quantum states, have been known to allow for unconditional bit commitment between the two involved parties. We show that, actually, any possible non-local correlation which produces random bits on both sides can be used to implement bit commitment, and that this holds even when the parties are allowed to delay their inputs to the box. Since a particular example is the behavior of an EPR pair, this resource allows for implementing unconditionally secure bit commitment as long as the parties cannot entangle their Qbits with any other system.

quant-ph↗

arXiv2010

Bit Commitment from Non-Signaling Correlations

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) primitives they can be based on. We consider as such starting points general two-party input-output systems that do not allow for message transmission, and show that they can be used for realizing unconditionally secure bit commitment as soon as they are non-trivial, i.e., cannot be securely realized from distributed randomness only.

quant-ph↗

arXiv2010

Quantum Cryptography Based Solely on Bell's Theorem

Information-theoretic key agreement is impossible to achieve from scratch and must be based on some - ultimately physical - premise. In 2005, Barrett, Hardy, and Kent showed that unconditional security can be obtained in principle based on the impossibility of faster-than-light signaling; however, their protocol is inefficient and cannot tolerate any noise. While their key-distribution scheme uses quantum entanglement, its security only relies on the impossibility of superluminal signaling, rather than the correctness and completeness of quantum theory. In particular, the resulting security is device independent. Here we introduce a new protocol which is efficient in terms of both classical and quantum communication, and that can tolerate noise in the quantum channel. We prove that it offers device-independent security under the sole assumption that certain non-signaling conditions are satisfied. Our main insight is that the XOR of a number of bits that are partially secret according to the non-signaling conditions turns out to be highly secret. Note that similar statements have been well-known in classical contexts. Earlier results had indicated that amplification of such non-signaling-based privacy is impossible to achieve if the non-signaling condition only holds between events on Alice's and Bob's sides. Here, we show that the situation changes completely if such a separation is given within each of the laboratories.

quant-ph↗

arXiv2009

A geometric version of BGP reflection functors

Quiver Grassmannians and quiver flags are natural generalisations of usual Grassmannians and flags. They arise in the study of quiver representations and Hall algebras. In general, they are projective varieties which are neither smooth nor irreducible. We use a scheme theoretic approach to calculate their tangent space and to obtain a dimension estimate similar to one of Reineke. Using this we can show that if there is a generic representation, then these varieties are smooth and irreducible. If we additionally have a counting polynomial we deduce that their Euler characteristic is positive and that the counting polynomial evaluated at zero yields one. After having done so, we introduce a geometric version of BGP reflection functors which allows us to deduce an even stronger result about the constant coefficient of the counting polynomial. We use this to obtain an isomorphism between the Hall algebra at q=0 and Reineke's generic extension monoid in the Dynkin case.

math.RT↗

arXiv2009

The Hall algebra and the composition monoid

Let Q be a quiver. M. Reineke and A. Hubery investigated the connection between the composition monoid, as introduced by M. Reineke, and the generic composition algebra, as introduced by C. M. Ringel, specialised at q=0. In this thesis we continue their work. We show that if Q is a Dynkin quiver or an oriented cycle, then the composition algebra at q=0 is isomorphic to the monoid algebra of the composition monoid. Moreover, if Q is an acyclic, extended Dynkin quiver, we show that there exists an epimorphism from the composition algebra at q=0 to the monoid algebra of the composition monoid, and we describe its non-trivial kernel. Our main tool is a geometric version of BGP reflection functors on quiver Grassmannians and quiver flags, that is varieties consisting of filtrations of a fixed representation by subrepresentations of fixed dimension vectors. These functors enable us to calculate various structure constants of the composition algebra. Moreover, we investigate geometric properties of quiver flags and quiver Grassmannians, and show that under certain conditions, quiver flags are irreducible and smooth. If, in addition, we have a counting polynomial, these properties imply the positivity of the Euler characteristic of the quiver flag.

math.RT↗

arXiv2009

The impossibility of non-signaling privacy amplification

Barrett, Hardy, and Kent have shown in 2005 that protocols for quantum key agreement exist the security of which can be proven under the assumption that quantum or relativity theory is correct. More precisely, this is based on the non-local behavior of certain quantum systems, combined with the non-signaling postulate from relativity. An advantage is that the resulting security is independent of what (quantum) systems the legitimate parties' devices operate on: they do not have to be trusted. Unfortunately, the protocol proposed by Barrett et al. cannot tolerate any errors caused by noise in the quantum channel. Furthermore, even in the error-free case it is inefficient: its communication complexity is Theta(1/epsilon) when forcing the attacker's information below epsilon, even if only a single key bit is generated. Potentially, the problem can be solved by privacy amplification of relativistic - or non-signaling - secrecy. We show, however, that such privacy amplification is impossible with respect to the most important form of non-local behavior, and application of arbitrary hash functions.

quant-ph↗

arXiv2009

Distilling Non-Locality

Two parts of an entangled quantum state can have a correlation in their joint behavior under measurements that is unexplainable by shared classical information. Such correlations are called non-local and have proven to be an interesting resource for information processing. Since non-local correlations are more useful if they are stronger, it is natural to ask whether weak non-locality can be amplified. We give an affirmative answer by presenting the first protocol for distilling non-locality in the framework of generalized non-signaling theories. Our protocol works for both quantum and non-quantum correlations. This shows that in many contexts, the extent to which a single instance of a correlation can violate a CHSH inequality is not a good measure for the usefulness of non-locality. A more meaningful measure follows from our results.

quant-ph↗

arXiv2008

A Limit on Non-Locality Distillation

Non-local correlations are not only a fascinating feature of quantum theory, but an interesting resource for information processing, for instance in communication-complexity theory or cryptography. An important question in this context is whether the resource can be distilled: Given a large amount of weak non-local correlations, is there a method to obtain strong non-locality using local operations and shared randomness? We partly answer this question by no: CHSH-type non-locality, the only possible non-locality of binary systems, which is not super-strong, but achievable by measurements on certain quantum states, has at best very limited distillability by any non-interactive classical method. This strongly extends and generalizes what was previously known, namely that there are two limits that cannot be overstepped: The Bell and Tsirelson bounds. Moreover, our results imply that there must be an infinite number of such bounds. A noticeable feature of our proof of this purely classical statement is that it is quantum mechanical in the sense that (both novel and known) facts from quantum theory are used in a crucial way to obtain the claimed results. One of these results, of independent interest, is that certain mixed entangled states cannot be distilled without communication. Weaker statements, namely limited distillability, have been known for Werner states.

quant-ph↗

arXiv2007

The Hall algebra of a cyclic quiver at $q=0$

We show that the generic Hall algebra of nilpotent representations of an oriented cycle specialised at $q=0$ is isomorphic to the generic extension monoid in the sense of Reineke. This continues the work of Reineke.

math.RT↗

arXiv2006

The single-serving channel capacity

In this paper we provide the answer to the following question: Given a noisy channel and epsilon>0, how many bits can be transmitted with an error of at most epsilon by a single use of the channel?

cs.IT↗

arXiv2006

Oblivious transfer and quantum channels

We show that oblivious transfer can be seen as the classical analogue to a quantum channel in the same sense as non-local boxes are for maximally entangled qubits.

quant-ph↗

arXiv2005

Oblivious transfer and quantum non-locality

Oblivious transfer, a central functionality in modern cryptography, allows a party to send two one-bit messages to another who can choose one of them to read, remaining ignorant about the other, whereas the sender does not learn the receiver's choice. Oblivious transfer the security of which is information-theoretic for both parties is known impossible to achieve from scratch. - The joint behavior of certain bi-partite quantum states is non-local, i.e., cannot be explained by shared classical information. In order to better understand such behavior, which is classically explainable only by communication, but does not allow for it, Popescu and Rohrlich have described a "non-locality machine": Two parties both input a bit, and both get a random output bit the XOR of which is the AND of the input bits. - We show a close connection, in a cryptographic sense, between OT and the "PR primitive." More specifically, unconditional OT can be achieved from a single realization of PR, and vice versa. Our reductions, which are single-copy, information-theoretic, and perfect, also lead to a simple and optimal protocol allowing for inverting the direction of OT.

quant-ph↗

arXiv2002

Towards Characterizing the Non-Locality of Entangled Quantum States

The behavior of entangled quantum systems can generally not be explained as being determined by shared classical randomness. In the first part of this paper, we propose a simple game for n players demonstrating this non-local property of quantum mechanics: While, on the one hand, it is immediately clear that classical players will lose the game with substantial probability, it can, on the other hand, always be won by players sharing an entangled quantum state. The simplicity of the classical analysis of our game contrasts the often quite involved analysis of previously proposed examples of this type. In the second part, aiming at a quantitative characterization of the non-locality of n-partite quantum states, we consider a general class of n-player games, where the amount of communication between certain (randomly chosen) groups of players is measured. Comparing the classical communication needed for both classical players and quantum players (initially sharing a given quantum state) to win such a game, a new type of separation results is obtained. In particular, we show that in order to simulate two separated qubits of an n-partite GHZ state at least (roughly) log(log(n)) bits of information are required.

quant-ph↗