arXiv subjects

Andrzej Grudka

Publications and source records attributed to Andrzej Grudka.

At least 37 records · Page 2Linked to original sources

arXiv2018

The Conditional Uncertainty Principle

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, (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.

quant-ph↗

arXiv2017

No-signaling versus quantum constraints for spatio-temporal correlations caused by weak measurement

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.

quant-ph↗

arXiv2017

Do black holes create polyamory?

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.

hep-th↗

arXiv2017

Measurement uncertainty from no-signaling and non-locality

quant-ph↗

arXiv2016

Creation of superposition of unknown quantum states

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.

quant-ph↗

arXiv2015

Communication strength of correlations violating monogamy relations

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.

quant-ph↗

arXiv2015

Nonsignaling quantum random access code boxes

A well known cryptographic primitive is so called random access code. Namely, Alice is to send to Bob one of two bits, so that Bob has the choice 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 so called Popescu- Rohrlich box, was introduced and widely studied. In particular, it is known that Popescu-Rohrlich box enables simulation of the random access code with the support of one bit of communication. Here, we propose a quantum analogue of this phenomenon. Namely, we define an analogue of a random access code, where instead of classical bits, one encodes qubits. We provide a quantum non-signaling box that if supported with two classical bits, allows to simulate a quantum version of 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 superposition of two choices, the output will be in a mixed state rather than in a superposition of required states.

quant-ph↗

arXiv2015

Quantum communication complexity advantage implies violation of a Bell inequality

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.

quant-ph↗

arXiv2015

Axiomatic approach to contextuality and nonlocality

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.

quant-ph↗

arXiv2015

Robust Device-Independent Randomness Amplification with Few Devices

Randomness amplification is the task of transforming a source of somewhat random bits into a source of fully random bits. Although it is impossible to amplify randomness from a single source by classical means, the situation is different considering non-local correlations allowed by quantum mechanics. Here we give the first device-independent protocol for randomness amplification using a constant number of devices. The protocol involves four devices, can amplify any non-deterministic source into a fully random source, tolerates a constant rate of error, and has its correctness based solely on the assumption of no-signaling between the devices. In contrast all previous protocols either required an unbounded number of devices, or could only amplify sources sufficiently close to fully random.

quant-ph↗

arXiv2015

Long-distance quantum communication over noisy networks without long-time quantum memory

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.

quant-ph↗

arXiv2014

Simple scheme for encoding and decoding a qubit in unknown state for various topological codes

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.

quant-ph↗

arXiv2014

When Are Popescu-Rohrlich Boxes and Random Access Codes Equivalent?

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.

quant-ph↗

arXiv2014

Entanglement witnessing and quantum cryptography with non-ideal ferromagnetic detectors

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.

cond-mat.mes-hall↗

arXiv2013

Conjectured strong complementary-correlations tradeoff

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.

quant-ph↗

arXiv2013

Robust Device Independent Randomness Amplification

In randomness amplification a slightly random source is used to produce an improved random source. Perhaps surprisingly, a single source of randomness cannot be amplified at all classically. However, the situation is different if one considers correlations allowed by quantum mechanics as an extra resource. Here we present a protocol that amplifies Santha-Vazirani sources arbitrarily close to deterministic into fully random sources. The protocol is device independent, depending only on the observed statistics of the devices and on the validity of the no-signaling principle between different devices. It improves previously-known protocols in two respects. First the protocol is tolerant to noise so that even noisy quantum-mechanical systems give rise to good devices for the protocol. Second it is simpler, being based on the violation of a four-party Bell inequality and on the XOR as a hash function. As a technical tool we prove a new de Finetti theorem where the subsystems are selected from a Santha-Vazirani source.

quant-ph↗

arXiv2013

Free randomness amplification using bipartite chain correlations

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.

quant-ph↗

arXiv2012

Nonlocality activation in entanglement swapping chains

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.

quant-ph↗