Simulatings POVMs on EPR pairs with six bits of expected communication

We present a classical protocol for simulating correlations obtained by bipartite POVMs on an EPR pair. The protocol uses shared random variables (also known as local hidden variables) augmented by six bits of expected communication.Comment: 3 pages, short not

Algorithmic Networks: central time to trigger expected emergent open-endedness

This article investigates emergence and complexity in complex systems that can share information on a network. To this end, we use a theoretical approach from information theory, computability theory, and complex networks. One key studied question is how much emergent complexity (or information) arises when a population of computable systems is networked compared with when this population is isolated. First, we define a general model for networked theoretical machines, which we call algorithmic networks. Then, we narrow our scope to investigate algorithmic networks that optimize the average fitnesses of nodes in a scenario in which each node imitates the fittest neighbor and the randomly generated population is networked by a time-varying graph. We show that there are graph-topological conditions that cause these algorithmic networks to have the property of expected emergent open-endedness for large enough populations. In other words, the expected emergent algorithmic complexity of a node tends to infinity as the population size tends to infinity. Given a dynamic network, we show that these conditions imply the existence of a central time to trigger expected emergent open-endedness. Moreover, we show that networks with small diameter compared to the network size meet these conditions. We also discuss future research based on how our results are related to some problems in network science, information theory, computability theory, distributed computing, game theory, evolutionary biology, and synergy in complex systems.Comment: This is a revised version of the research report no. 4/2018 at the National Laboratory for Scientific Computing (LNCC), Brazi

Classical Teleportation of a Quantum Bit

Classical teleportation is defined as a scenario where the sender is given the classical description of an arbitrary quantum state while the receiver simulates any measurement on it. This scenario is shown to be achievable by transmitting only a few classical bits if the sender and receiver initially share local hidden variables. Specifically, a communication of 2.19 bits is sufficient on average for the classical teleportation of a qubit, when restricted to von Neumann measurements. The generalization to positive-operator-valued measurements is also discussed.Comment: 4 pages, RevTe

One-way quantum key distribution: Simple upper bound on the secret key rate

We present a simple method to obtain an upper bound on the achievable secret key rate in quantum key distribution (QKD) protocols that use only unidirectional classical communication during the public-discussion phase. This method is based on a necessary precondition for one-way secret key distillation; the legitimate users need to prove that there exists no quantum state having a symmetric extension that is compatible with the available measurements results. The main advantage of the obtained upper bound is that it can be formulated as a semidefinite program, which can be efficiently solved. We illustrate our results by analysing two well-known qubit-based QKD protocols: the four-state protocol and the six-state protocol. Recent results by Renner et al., Phys. Rev. A 72, 012332 (2005), also show that the given precondition is only necessary but not sufficient for unidirectional secret key distillation.Comment: 11 pages, 1 figur

Beyond the Goldenberg-Vaidman protocol: Secure and efficient quantum communication using arbitrary, orthogonal, multi-particle quantum states

It is shown that maximally efficient protocols for secure direct quantum communications can be constructed using any arbitrary orthogonal basis. This establishes that no set of quantum states (e.g. GHZ states, W states, Brown states or Cluster states) has an advantage over the others, barring the relative difficulty in physical implementation. The work provides a wide choice of states for experimental realization of direct secure quantum communication protocols. We have also shown that this protocol can be generalized to a completely orthogonal state based protocol of Goldenberg-Vaidman (GV) type. The security of these protocols essentially arises from duality and monogamy of entanglement. This stands in contrast to protocols that employ non-orthogonal states, like Bennett-Brassard 1984 (BB84), where the security essentially comes from non-commutativity in the observable algebra.Comment: 7 pages, no figur

Entanglement of zero angular momentum mixtures and black hole entropy

We calculate the entanglement of formation and the entanglement of distillation for arbitrary mixtures of the zero spin states on an arbitrary-dimensional bipartite Hilbert space. Such states are relevant to quantum black holes and to decoherence-free subspaces based communication. The two measures of entanglement are equal and scale logarithmically with the system size. We discuss its relation to the black hole entropy law. Moreover, these states are locally distinguishable but not locally orthogonal, thus violating a conjecture that the entanglement measures coincide only on locally orthogonal states. We propose a slightly weaker form of this conjecture. Finally, we generalize our entanglement analysis to any unitary group.Comment: 5 pages, revtex4 Final version. A discussion of local orthogonality and entanglement is adde

Maximally Non-Local and Monogamous Quantum Correlations

We introduce a version of the chained Bell inequality for an arbitrary number of measurement outcomes, and use it to give a simple proof that the maximally entangled state of two d dimensional quantum systems has no local component. That is, if we write its quantum correlations as a mixture of local correlations and general (not necessarily quantum) correlations, the coefficient of the local correlations must be zero. This suggests an experimental programme to obtain as good an upper bound as possible on the fraction of local states, and provides a lower bound on the amount of classical communication needed to simulate a maximally entangled state in dxd dimensions. We also prove that the quantum correlations violating the inequality are monogamous among non-signalling correlations, and hence can be used for quantum key distribution secure against post-quantum (but non-signalling) eavesdroppers.Comment: 5 pages, no figure