Unconditional privacy over channels which cannot convey quantum information

By sending systems in specially prepared quantum states, two parties can communicate without an eavesdropper being able to listen. The technique, called quantum cryptography, enables one to verify that the state of the quantum system has not been tampered with, and thus one can obtain privacy regardless of the power of the eavesdropper. All previous protocols relied on the ability to faithfully send quantum states. In fact, until recently, they could all be reduced to a single protocol where security is ensured though sharing maximally entangled states. Here we show this need not be the case -- one can obtain verifiable privacy even through some channels which cannot be used to reliably send quantum states.Comment: Related to quant-ph/0608195 and for a more general audienc

Local environment can enhance fidelity of quantum teleportation

We show how an interaction with the environment can enhance fidelity of quantum teleportation. To this end, we present examples of states which cannot be made useful for teleportation by any local unitary transformations; nevertheless, after being subjected to a dissipative interaction with the local environment, the states allow for teleportation with genuinely quantum fidelity. The surprising fact here is that the necessary interaction does not require any intelligent action from the parties sharing the states. In passing, we produce some general results regarding optimization of teleportation fidelity by local action. We show that bistochastic processes cannot improve fidelity of two-qubit states. We also show that in order to have their fidelity improvable by a local process, the bipartite states must violate the so-called reduction criterion of separability.Comment: 9 pages, Revte

Linear game non-contextuality and Bell inequalities - a graph-theoretic approach

We study the classical and quantum values of one- and two-party linear games, an important class of unique games that generalizes the well-known XOR games to the case of non-binary outcomes. We introduce a ``constraint graph" associated to such a game, with the constraints defining the linear game represented by an edge-coloring of the graph. We use the graph-theoretic characterization to relate the task of finding equivalent games to the notion of signed graphs and switching equivalence from graph theory. We relate the problem of computing the classical value of single-party anti-correlation XOR games to finding the edge bipartization number of a graph, which is known to be MaxSNP hard, and connect the computation of the classical value of more general XOR-d games to the identification of specific cycles in the graph. We construct an orthogonality graph of the game from the constraint graph and study its Lov\'{a}sz theta number as a general upper bound on the quantum value even in the case of single-party contextual XOR-d games. Linear games possess appealing properties for use in device-independent applications such as randomness of the local correlated outcomes in the optimal quantum strategy. We study the possibility of obtaining quantum algebraic violation of these games, and show that no finite linear game possesses the property of pseudo-telepathy leaving the frequently used chained Bell inequalities as the natural candidates for such applications. We also show this lack of pseudo-telepathy for multi-party XOR-type inequalities involving two-body correlation functions

Local information as a resource in distributed quantum systems

We develop a paradigm for distributed quantum systems, where not only quantum communication, but also information is a valuable resource. We construct a scheme for manipulating information in analogy to entanglement theory. In this scheme, instead of maximally entangled states, Alice and Bob distill product states. We then show that the main tools of entanglement theory are general enough to work also in this opposite scheme. We obtain, up to a plausible assumption, that the amount of information that must be lost during a concentration protocol can be expressed as the relative entropy distance from some set of states