Search

We study quantum Maxwell's demon in a discrete space-time setup. We consider a collection of particles hopping on a one-dimensional chain and a semipermeable barrier that allows the particles to hop in only one direction. Our main result is a formulation of a local unitary dynamics describing the action of this barrier. Such dynamics utilises an auxiliary system $\mathcal{A}$ and we study how properties of $\mathcal{A}$ influence the behaviour of particles. An immediate consequence of unitarity is the fact that particles cannot be trapped on one side of the barrier forever, unless $\mathcal{A}$ is infinite. In addition, coherent superpositions and quantum correlations are affected once particles enter the confinement region. Finally, we show that initial superposition of $\mathcal{A}$ allows the barrier to act as a beam splitter., Comment: 11 pages, 3 figures, comments welcome

The problem of device-independent randomness amplification against no-signaling adversaries has so far been studied under the assumption that the weak source of randomness is uncorrelated with the (quantum) devices used in the amplification procedure. In this work, we relax this assumption, and reconsider the original protocol of Colbeck and Renner using a Santha-Vazirani (SV) source. To do so, we introduce an SV-like condition for devices, namely that any string of SV source bits remains weakly random conditioned upon any other bit string from the same SV source and the outputs obtained when this further string is input into the devices. Assuming this condition, we show that a quantum device using a~singlet state to violate the chained Bell inequalities leads to full randomness in the asymptotic scenario of a large number of settings, for a restricted set of SV sources (with $0 \leq \varepsilon < (2^{(1/12)} - 1)/(2(2^{(1/12)} + 1)) \approx 0.0144$). We also study a device-independent protocol that allows for correlations between the sequence of boxes used in the protocol and the SV source bits used to choose the particular box from whose output the randomness is obtained. Assuming the SV-like condition for devices, we show that the honest parties can achieve amplification of the weak source, for the parameter range $0 \leq \varepsilon, 38 pages, 10 figures

We obtain a general connection between a quantum advantage in communication complexity and non-locality. We show that given any protocol offering a (sufficiently large) quantum advantage in communication complexity, there exists a way of obtaining measurement statistics which violate some Bell inequality. Our main tool is port-based teleportation. If the gap between quantum and classical communication complexity can grow arbitrarily large, the ratio of the quantum value to the classical value of the Bell quantity becomes unbounded with the increase in the number of inputs and outputs., main text did not change. Modified the acknowledgements section

We propose a family of non-locality unique games for 2 parties based on a square lattice on an arbitrary surface. We show that, due to structural similarities with error correction codes of Kitaev for fault tolerant quantum computation, the games have classical values computable in polynomial time for $d=2$ measurement outcomes. By representing games in their graph form, for arbitrary $d$ and underlying surface we provide their classification into equivalence classes with respect to relabeling of measurement outcomes, for a selected set of permutations which define the winning conditions. A case study of games with periodic boundary conditions is presented in order to verify their impact on classical and quantum values of the family of games. It suggests that quantum values suffer independently from presence of different winning conditions that can be imposed due to periodicity, as long as no local restrictions are in place., 18 pages, 16 figures

For every stabiliser $N$-qudit absolutely maximally entangled state, we present a method for determining the stabiliser generators and logical operators of a corresponding quantum error correction code. These codes encode $k$ qudits into $N-k$ qudits, with $k\leq \left \lfloor{N/2} \right \rfloor$, where the local dimension $d$ is prime. We use these methods to analyse the concatenation of such quantum codes and link this procedure to entanglement swapping. Using our techniques, we investigate the spread of quantum information on a tensor network code formerly used as a toy model for the AdS/CFT correspondence. In this network, we show how corrections arise to the Ryu-Takayanagi formula in the case of entangled input state, and that the bound on the entanglement entropy of the boundary state is saturated for absolutely maximally entangled input states., Comment: 11 pages, 7 figures

Of course not, but if one believes that information cannot be destroyed in a theory of quantum gravity, then we run into apparent contradictions with quantum theory when we consider evaporating black holes. Namely that the no-cloning theorem or the principle of entanglement monogamy is violated. Here, we show that neither violation need hold, since, in arguing that black holes lead to cloning or non-monogamy, one needs to assume a tensor product structure between two points in space-time that could instead be viewed as causally connected. In the latter case, one is violating the semi-classical causal structure of space, which is a strictly weaker implication than cloning or non-monogamy. We show that the lack of monogamy that can emerge in evaporating space times is one that is allowed in quantum mechanics, and is very naturally related to a lack of monogamy of correlations of outputs of measurements performed at subsequent instances of time of a single system. A particular example of this is the Horowitz-Maldacena proposal, and we argue that it needn't lead to cloning or violations of entanglement monogamy. For measurements on systems which appear to be leaving a black hole, we introduce the notion of the temporal product, and argue that it is just as natural a choice for measurements as the tensor product. For black holes, the tensor and temporal products have the same measurement statistics, but result in different type of non-monogamy of correlations, with the former being forbidden in quantum theory while the latter is allowed. In the case of the AMPS firewall experiment we find that the entanglement structure is modified, and one must have entanglement between the infalling Hawking partners and early time outgoing Hawking radiation which surprisingly tame violation of entanglement monogamy., 20 pages, comments welcome, grants added to acknowledgements

In any theory satisfying the no-signaling principle correlations generated among spatially separated parties in a Bell-type experiment are subject to certain constraints known as monogamy relations. Recently, in the context of the black hole information loss problem it was suggested that these monogamy relations might be violated. This in turn implies that correlations arising in such a scenario must violate the no-signaling principle and hence can be used to send classical information between parties. Here, we study the amount of information that can be sent using such correlations. To this aim, we first provide a framework associating them with classical channels whose capacities are then used to quantify the usefulness of these correlations in sending information. Finally, we determine the minimal amount of information that can be sent using signaling correlations violating the monogamy relation associated to the chained Bell inequalities., Comment: 14 pages, 2 figures; improved version; accepted for publication in Foundations of Physics

We develop a general operational framework that formalizes the concept of conditional uncertainty in a measure-independent fashion. Our formalism is built upon a mathematical relation which we call conditional majorization. We define conditional majorization and, for the case of classical memory, we provide its thorough characterization in terms of monotones, i.e., functions that preserve the partial order under conditional majorization. We demonstrate the application of this framework by deriving two types of memory-assisted uncertainty relations, (1) a monotone-based conditional uncertainty relation and (2) a universal measure-independent conditional uncertainty relation, both of which set a lower bound on the minimal uncertainty that Bob has about Alice's pair of incompatible measurements, conditioned on arbitrary measurement that Bob makes on his own system. We next compare the obtained relations with their existing entropic counterparts and find that they are at least independent. Ministry of Education (MOE) National Research Foundation (NRF) Published version This work is supported by ERC Advanced Grant QOLAPS and National Science Centre Grants Mae- stro No. DEC-2011/02/A/ST2/00305 and OPUS 9 No. 2015/17/B/ST2/01945. V.N. acknowledges financial support from the Ministry of Education of Singapore, the National Research Foundation (NRF Fellowship Reference No. NRF- NRFF2016-02), and the John Templeton Foundation (Grant No. 54914).

One of the formulations of Heisenberg uncertainty principle, concerning so-called measurement uncertainty, states that the measurement of one observable modifies the statistics of the other. Here, we derive such a measurement uncertainty principle from two comprehensible assumptions: impossibility of instantaneous messaging at a distance (no-signaling), and violation of Bell inequalities (non-locality). The uncertainty is established for a pair of observables of one of two spatially separated systems that exhibit non-local correlations. To this end, we introduce a gentle form of measurement which acquires partial information about one of the observables. We then bound disturbance of the remaining observables by the amount of information gained from the gentle measurement, minus a correction depending on the degree of non-locality. The obtained quantitative expression resembles the quantum mechanical formulations, yet it is derived without the quantum formalism and complements the known qualitative effect of disturbance implied by non-locality and no-signaling., Comment: 4 pages main + 8 pages appendix; 3 figures

We show that sharp measurements of total magnetization cannot be used to reveal contextuality in macroscopic many-body systems of spins of arbitrary dimension. We decompose each such measurement into set of projectors corresponding to well-defined value of total magnetization. We then show that such sets of projectors are too restricted to construct Kochen–Specker sets.

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., Quantum mechanics allows to generate nearly ideal random strings from initially weak random sources, important for security of data systems, but this remains elusive in practice. Here the authors propose a realistic, error-tolerant and secure protocol for randomness amplification of arbitrary bits.

The superposition principle is one of the landmarks of quantum mechanics. The importance of quantum superpositions provokes questions about the limitations that quantum mechanics itself imposes on the possibility of their generation. In this work we systematically study the problem of creation of superpositions of unknown quantum states. First, we prove a no-go theorem that forbids the existence of a universal probabilistic quantum protocol producing a superposition of two unknown quantum states. Secondly, we provide an explicit probabilistic protocol generating a superposition of two unknown states, each having a fixed overlap with the known referential pure state. The protocol is proven to be unique and optimal. Moreover, it can be implemented on arbitrary Hilbert spaces. In the context of quantum optics it can be used to efficiently generate highly nonclassical or nongaussian states., 4.5 pages + 4.5 pages of Appandix, 4 figures, updated discussion on the Alvarez-Rodriguez et. al. article arxiv:1411.4534, updated references, accepted for publication in PRL

Entangled states are essential in basics quantum communication protocols and quantum cryptography. Ferromagnetic contacts can work as a spin detector, giving possibility of converting information about electron spin to the electric charge, and therefore, detection of entangled states with the electric current measurements is possible. Method of confirming entanglement with non-ideal detectors is presented, the impact of decoherence and noise on states and quality of entanglement is discussed. Entanglement witness (EW) operator method is compared with the CHSH inequalities approach. Required spin polarization for the EW is lower than for the CHSH inequalities. System with asymmetric spin polarizations of detectors was analyzed, including the CHSH inequalities and the EW method.

A well-known cryptographic primitive is the so-called random access code. Namely, Alice is to send to Bob one of two bits, so that Bob has the choice of which bit he wants to learn about. However, at any time, Alice should not learn Bob's choice, and Bob should learn only the bit of his choice. The task is impossible to accomplish by means of either classical or quantum communication. On the other hand, a concept of correlations stronger than quantum ones, exhibited by the so-called Popescu-Rohrlich box, was introduced and widely studied. In particular, it is known that the Popescu-Rohrlich box enables simulation of the random access code with the support of one bit of communication. Here, we propose a quantum analog of this phenomenon. Namely, we define an analog of a random access code, where instead of classical bits, one encodes qubits. We provide a quantum nonsignaling box that if supported with two classical bits, allows one to simulate a quantum version of a random access code. We point out that two bits are necessary. We also show that a quantum random access code cannot be fully quantum: when Bob inputs the superposition of two choices, the output will be in a mixed state rather than in a superposition of required states.

Understanding the role that quantum entanglement plays as a resource in various information processing tasks is one of the crucial goals of quantum information theory. Here we propose a new perspective for studying quantum entanglement: distributed computation of functions without communication between nodes. To formalize this approach, we propose identity games. Surprisingly, despite of no-signaling, we obtain that non-local quantum strategies beat classical ones in terms of winning probability for identity games originating from certain bipartite and multipartite functions. Moreover we show that, for majority of functions, access to general non-signaling resources boosts success probability two times in comparison to classical ones, for number of outputs large enough.

We present a unified axiomatic approach to contextuality and non-locality based on the fact that both are resource theories. In those theories the main objects are consistent boxes, which can be transformed by certain operations to achieve certain tasks. The amount of resource is quantified by appropriate measures of the resource. Following recent paper [J.I. de Vicente, J. Phys. A: Math. Theor. {\bf 47}, 424017 (2014)], and recent development of abstract approach to resource theories, such as entanglement theory, we propose axioms and welcome properties for operations and measures of resources. As one of the axioms of the measure we propose the asymptotic continuity: the measure should not differ on boxes that are close to each other by more than the distance with a factor depending logarithmically on the dimension of the boxes. We prove that relative entropy of contextuality is asymptotically continuous. Considering another concept from entanglement theory---the convex roof of a measure---we prove that for some non-local and contextual polytopes, the relative entropy of a resource is upper bounded up to a constant factor by the cost of the resource. Finally, we prove that providing a measure $X$ of resource does not increase under allowed class of operations, such as e.g. wirings, the maximal distillable resource which can be obtained by these operations is bounded from above by the value of $X$ up to a constant factor. We show explicitly which axioms are used in the proofs of presented results, so that analogous results may remain true in other resource theories with analogous axioms. We also make use of the known distillation protocol of bipartite nonlocality to show how contextual resources can be distilled., 17 pages, comments are most welcome

We present a scheme for encoding and decoding an unknown state for CSS codes, based on syndrome measurements. We illustrate our method by means of Kitaev toric code, defected-lattice code, topological subsystem code and Haah 3D code. The protocol is local whenever in a given code the crossings between the logical operators consist of next neighbour pairs, which holds for the above codes. For subsystem code we also present scheme in a noisy case, where we allow for bit and phase-flip errors on qubits as well as state preparation and syndrome measurement errors. Similar scheme can be built for two other codes. We show that the fidelity of the protected qubit in the noisy scenario in a large code size limit is of $1-\mathcal{O}(p)$, where $p$ is a probability of error on a single qubit. Regarding Haah code we provide noiseless scheme, leaving the noisy case as an open problem., Comment: 12 pages, 8 figures

We present three different types of the evolution of a time-averaged probability distribution of the quantum walk on even cycles. We concentrate on initial states which lead to non-uniform limiting distributions.

A new scheme of quantum coding is presented. The scheme concerns the quantum states to which Schumacher's compression does not apply. It is shown that two qubits can be encoded in a single qutrit in such a way that one can faithfully reconstruct the state of one qubit. Decision on which of these two qubits is to be reconstructed can be made long after the encoding took place. The scheme succeeds with the average probability of 2/3., 7 pages

The notion of equivalence of maximally entangled bases of bipartite d–dimensional Hilbert spaces hd ⊗ hd is introduced. An explicit method of inequivalent bases construction is presented. PACS: 03.67.-a

Generalization of quantum information splitting protocol from qubits to qudits (quantum d-dimensional systems) is presented., Comment: 7 pages

A direct analysis of the protocol of randomness amplification using Bell inequality violation is performed in terms of the convex combination of no-signaling boxes required to simulate quantum violation of the inequality. The probability distributions of bits generated by a Santha-Vazirani source are shown to be mixtures of permutations of Bernoulli distributions with parameter defined by the source. An intuitive proof is provided for the range of partial randomness from which perfect randomness can be extracted using quantum correlations violating the chain inequalities. Exact values are derived in the asymptotic limit of a large number of measurement settings., Comment: 4+3 pages

We investigate theoretically the use of non-ideal ferromagnetic contacts as a mean to detect quantum entanglement of electron spins in transport experiments. We use a designated entanglement witness and find a minimal spin polarization of $��> 1/\sqrt{3} \approx 58 %$ required to demonstrate spin entanglement. This is significantly less stringent than the ubiquitous tests of Bell's inequality with $��> 1/\sqrt[4]{2}\approx 84%$. In addition, we discuss the impact of decoherence and noise on entanglement detection and apply the presented framework to a simple quantum cryptography protocol. Our results are directly applicable to a large variety of experiments., 10 pages, 4 figures

We conjecture new uncertainty relations which restrict correlations between results of measurements performed by two separated parties on a shared quantum state. The first uncertainty relation bounds the sum of two mutual informations when one party measures a single observable and the other party measures one of two observables. The uncertainty relation does not follow from Maassen-Uffink uncertainty relation and is much stronger than Hall uncertainty relation derived from the latter. The second uncertainty relation bounds the sum of two mutual informations when each party measures one of two observables. We provide numerical evidence for validity of conjectured uncertainty relations and prove them for large classes of states and observables., 7 pages

We study a problem of interconvertibility of two supra-quantum resources: one is so called PR-box, which violates CHSH inequality up to maximal algebraic bound, and second is so called random access code (RAC). The latter is a functionality that enables Bob (receiver) to choose one of two bits of Alice. It has been known, that PR-box supplemented with one bit of communication can be used to simulate RAC. We ask the converse question: to what extent RAC can simulate PR-box? To this end we introduce racbox: a box such that supplemented with one bit of communication offers RAC. As said, PR-box can simulate racbox. The question we raise, is whether any racbox can simulate PR-box. We show that a non-signaling racbox indeed can simulate PR-box, hence those two resources are equivalent. We also provide an example of signalling racbox which cannot simulate PR-box. We give a resource inequality between racbox es and PR-boxes, and show that it is saturated., Comment: 10 pages, 4 figures

The problem of sharing entanglement over large distances is crucial for implementations of quantum cryptography. A possible scheme for long-distance entanglement sharing and quantum communication exploits networks whose nodes share Einstein-Podolsky-Rosen (EPR) pairs. In Perseguers et al. [Phys. Rev. A 78, 062324 (2008)] the authors put forward an important isomorphism between storing quantum information in a dimension $D$ and transmission of quantum information in a $D+1$-dimensional network. We show that it is possible to obtain long-distance entanglement in a noisy two-dimensional (2D) network, even when taking into account that encoding and decoding of a state is exposed to an error. For 3D networks we propose a simple encoding and decoding scheme based solely on syndrome measurements on 2D Kitaev topological quantum memory. Our procedure constitutes an alternative scheme of state injection that can be used for universal quantum computation on 2D Kitaev code. It is shown that the encoding scheme is equivalent to teleporting the state, from a specific node into a whole two-dimensional network, through some virtual EPR pair existing within the rest of network qubits. We present an analytic lower bound on fidelity of the encoding and decoding procedure, using as our main tool a modified metric on space-time lattice, deviating from a taxicab metric at the first and the last time slices., Comment: 15 pages, 10 figures; title modified; appendix included in main text; section IV extended; minor mistakes removed

We consider multiple entanglement swappings performed on a chain of bipartite states. Each state does not violate CHSH inequality. We show that before some critical number of entanglement swappings is achieved the output state does not violate this inequality either. However, if this number is achieved then for some results of Bell measurements obtained in the protocol of entanglement swapping the output state violates CHSH inequality. Moreover, we show that for different states we have different critical numbers for which CHSH inequality is activated., Comment: 4 pages

We observe that changing a phase at a single point in a discrete quantum walk results in a rather surprising localization effect. For certain values of this phase change the possibility of localization strongly depends on the internal coin-state of the walker., 5 pages, 4 figures

We show that recent results on the interaction of causality-respecting particles with particles on closed timelike curves derived in [Phys. Rev. A 82, 062330 (2010)] depend on ambiguous assumptions about the form of the state which is inputted into the proposed equivalent circuit. Choosing a different form of this state leads to an opposite conclusion on the power of closed timelike curves.

We consider distillation of entanglement from two qubit states which are mixtures of three mutually orthogonal states: two pure entangled states and one pure product state. We distill entanglement from such states by projecting n copies of the state on permutationally invariant subspace and then applying one-way hashing protocol. We find analytical expressions for the rate of the protocol. We also generalize this method to higher dimensional systems. To get analytical expression for two qubit case, we faced a mathematical problem of diagonalizing a family of matrices enjoying some symmetries w.r.t. to symmetric group. We have solved this problem in two ways: (i) directly, by use of Schur-Weyl decomposition and Young symmetrizers (ii) showing that the problem is equivalent to a problem of diagonalizing adjacency matrices in a particular instance of a so called algebraic association scheme., Comment: 22 pages, comments welcome

We consider violation of CHSH inequality for states before and after entanglement swapping. We present a pair of initial states which do not violate CHSH inequality however the final state violates CHSH inequality for some results of Bell measurements performed in order to swap entanglement., 3 pages, 2 figures

We analyze quantum network primitives which are entanglement-breaking. We show superadditivity of quantum and classical capacity regions for quantum multiple-access channel and quantum butterfly network. Since the effects are especially visible at high noise they suggest that quantum information effects may be particularly helpful in the case of the networks with occasional high noise rates. To our knowledge the present effects provide the first qualitative borderline between superadditivities of bipartite and multipartite systems., Accepted for publication in Phys. Rev. A as a Rapid Communication

We present an entanglement purification protocol for a mixture of a pure entangled state and a pure product state, which are orthogonal to each other. The protocol is combination of bisection method and one-way hashing protocol. We give recursive formula for the rate of the protocol for different states, i.e. the number of maximally entangled two-qubit pairs obtained with the protocol per a single copy of the initial state. We also calculate numerically the rate for some states., 4 pages, 1 figure

It is well known that for two qubits the upper bounds of the relative entropy of entanglement (REE) for a given concurrence as well as the negativity for a given concurrence are reached by pure states. We show that, by contrast, there are two-qubit mixed states for which the REE for some range of a fixed negativity is higher than that for pure states. Moreover, we demonstrate that a mixture of a pure entangled state and pure separable state orthogonal to it is likely to give the maximal REE. By noting that the negativity is a measure of entanglement cost under operations preserving positivity of partial transpose, our results provide an explicit example of operations such that, even though the entanglement cost for an exact preparation is the same, the entanglement of distillation of a mixed state can exceed that of pure states. This means that the entanglement manipulation via a pure state can result in a larger entanglement loss than that via a mixed state., Comment: 8 pages, 3 figures

It was presented by Cabello and Nakamura [A. Cabello, Phys. Rev. Lett. 90, 190401 (2003)], that the Kochen-Specker theorem applies to two dimensions if one uses Positive Operator-Valued Measures. We show that contextuality in their models is not of the Kochen-Specker type. It is rather the result of not keeping track of the whole system on which the measurement is performed. This is connected to the fact that there is no one-to-one correspondence between POVM elements and projectors on the extended Hilbert space and the same POVM element has to originate from two different projectors when used in Cabello's and Nakamura's models. Moreover, we propose a hidden-variable formulation of the above models., 4 pages, 1 figure, comments welcome

We discuss some properties of the Knill-Laflamme-Milburn scheme for quantum teleportation with both maximally and nonmaximally entangled states. We derive the error correction scheme when one performs teleportation with nonmaximally entangled states and we find the probability for perfect teleportation. We show that the maximally entangled state is optimal in such a case. We also show how the error correction scheme can be implemented experimentally when one uses polarization encoding., Comment: 4 pages

We consider entanglement swapping for certain mixed states. We assume that the initial states have the same singlet fraction and show that the final state can have singlet fraction greater than the initial states. We also consider two quantum teleportations and show that entanglement swapping can increase teleportation fidelity. Finally, we show how this effect can be demonstrated with linear optics., Comment: 5 pages, 4 figures

A lot of research has been done on multipartite correlations. However, it seems strange that there is no definition of so called genuine multipartite correlations. In this paper we propose three reasonable postulates which each measure or indicator of genuine multipartite correlations (or genuine multipartite entanglement) should satisfy. We also introduce degree of correlations which gives partial characterization of multipartite correlations. Then, we show that covariance does not satisfy two postulates and hence, it cannot be used as an indicator of genuine multipartite correlations. Finally, we propose candidate for a measure of genuine multipartite correlations based on the work that can be drawn from local bath by means of a multipartite state., Comment: Significantly extended version, an author added

We consider multiple teleportation in the Knill-Laflamme-Milburn (KLM) scheme. We introduce adaptive teleportation, i.e., such that the choice of entangled state used in the next teleportation depends on the results of the measurements performed during the previous teleportations. We show that adaptive teleportation enables an increase in the probability of faithful multiple teleportation in the KLM scheme. In particular if a qubit is to be teleported more than once then it is better to use nonmaximally entangled states than maximally entangled ones in order to achieve the highest probability of faithful teleportation., Comment: 4 pages, 1 figure