arXiv subjects

Michal Horodecki

Publications and source records attributed to Michal Horodecki.

At least 19 recordsLinked to original sources

arXiv2019

Information-thermodynamics link revisited

The so-called information-thermodynamics link created by a thought experiment of Szilard became a core of the modern orthodoxy in the field of quantum information and resources theory in quantum thermodynamics. We remind existing objections against standard interpretation of Szilard engine operation and illustrate them by two quantum models: particle in a box with time-dependent thin potential barrier and the spin-boson model. The consequences of the emerging superselection rules for thermodynamics and foundations of quantum mechanics are discussed. The role of non-ergodic systems as information carriers and the thermodynamic cost of stability and accuracy of information processing is briefly discussed and compared to the generally accepted Landauer's principle.

quant-ph↗

arXiv2016

Efficient Quantum Pseudorandomness

Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g. in computation, communication and control. Fully random transformations require exponential time for either classical or quantum systems, but in many case pseudorandom operations can emulate certain properties of truly random ones. Indeed in the classical realm there is by now a well-developed theory of such pseudorandom operations. However the construction of such objects turns out to be much harder in the quantum case. Here we show that random quantum circuits are a powerful source of quantum pseudorandomness. This gives the for the first time a polynomialtime construction of quantum unitary designs, which can replace fully random operations in most applications, and shows that generic quantum dynamics cannot be distinguished from truly random processes. We discuss applications of our result to quantum information science, cryptography and to understanding self-equilibration of closed quantum dynamics.

quant-ph↗

arXiv2016

Amplifying the randomness of weak sources correlated with devices

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<0.0132$, against a class of attacks given as a mixture of product box sequences, made of extremal no-signaling boxes, with additional symmetry conditions. Composable security proof against this class of attacks is provided.

quant-ph↗

arXiv2015

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↗

arXiv2015

Operator space approach to steering inequality

In \cite{JP2011,JPPVW2010} the operator space theory was applied to study bipartite Bell inequalities. The aim of the paper is to follow this line of research and use the operator space technique to analyze the steering scenario. We obtain a bipartite steering functional with unbounded largest violation of steering inequality, as well as we can construct all ingredients explicitly. It turns out that the unbounded largest violation is obtained by non maximally entangled state. Moreover, we focus on the bipartite dichotomic case where we construct a steering functional with unbounded largest violation of steering inequality. This phenomenon is different to the Bell scenario where only bounded largest violation can be obtained by any bipartite dichotomic Bell functional.

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

Exponential Decay of Correlations Implies Area Law

We prove that a finite correlation length, i.e. exponential decay of correlations, implies an area law for the entanglement entropy of quantum states defined on a line. The entropy bound is exponential in the correlation length of the state, thus reproducing as a particular case Hastings proof of an area law for groundstates of 1D gapped Hamiltonians. As a consequence, we show that 1D quantum states with exponential decay of correlations have an efficient classical approximate description as a matrix product state of polynomial bond dimension, thus giving an equivalence between injective matrix product states and states with a finite correlation length. The result can be seen as a rigorous justification, in one dimension, of the intuition that states with exponential decay of correlations, usually associated with non-critical phases of matter, are simple to describe. It also has implications for quantum computing: It shows that unless a pure state quantum computation involves states with long-range correlations, decaying at most algebraically with the distance, it can be efficiently simulated classically. The proof relies on several previous tools from quantum information theory - including entanglement distillation protocols achieving the hashing bound, properties of single-shot smooth entropies, and the quantum substate theorem - and also on some newly developed ones. In particular we derive a new bound on correlations established by local random measurements, and we give a generalization to the max-entropy of a result of Hastings concerning the saturation of mutual information in multiparticle systems. The proof can also be interpreted as providing a limitation on the phenomenon of data hiding in quantum states.

quant-ph↗

arXiv2014

Bell and steering scenarios in terms of operator systems

The aim of this paper is to indicate possible applications of operator systems in qualitative description of varoius scenarios while studying non-locality. To this end we study in details the notion of generalized non-commuting cube. Following ideas of Fritz and Farenick-Kavruk-Paulsen-Todorov we show in systematic way that various classes of Tsirelson's correlation boxes as well as NPA hierarchies can be described by using various operator system tensor products of generalized non-commuting cubes. Moreover, we show also that noncommuting cubes can be applied for the description of steering assemblages. Next we study some aproximation properties of noncommuting cubes by finite dimensional models. Finaly, we indicate possibility to use the framework operator systems for studying Bell and steering inequalities.

math.OA↗

arXiv2013

Bound entangled states with extremal properties

Following recent work of Beigi and Shor, we investigate PPT states that are "heavily entangled." We first exploit volumetric methods to show that in a randomly chosen direction, there are PPT states whose distance in trace norm from separable states is (asymptotically) at least 1/4. We then provide explicit examples of PPT states which are nearly as far from separable ones as possible. To obtain a distance of 2-ε from the separable states, we need a dimension of 2^{poly(\log(1/ε))}, as opposed to 2^{poly(1/ε)} given by the construction of Beigi and Shor. We do so by exploiting the so called {\it private states}, introduced earlier in the context of quantum cryptography. We also provide a lower bound for the distance between private states and PPT states and investigate the distance between pure states and the set of PPT states.

quant-ph↗

arXiv2013

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↗

arXiv2013

An area law for entanglement from exponential decay of correlations

Area laws for entanglement in quantum many-body systems give useful information about their low-temperature behaviour and are tightly connected to the possibility of good numerical simulations. An intuition from quantum many-body physics suggests that an area law should hold whenever there is exponential decay of correlations in the system, a property found, for instance, in non-critical phases of matter. However, the existence of quantum data-hiding state--that is, states having very small correlations, yet a volume scaling of entanglement--was believed to be a serious obstruction to such an implication. Here we prove that notwithstanding the phenomenon of data hiding, one-dimensional quantum many-body states satisfying exponential decay of correlations always fulfil an area law. To obtain this result we combine several recent advances in quantum information theory, thus showing the usefulness of the field for addressing problems in other areas of physics.

quant-ph↗

arXiv2013

Remarks on the equivalence of full additivity and monotonicity for the entanglement cost

We analyse the relationship between the full additivity of the entanglement cost and its full monotonicity under local operations and classical communication. We show that the two properties are equivalent for the entanglement cost. The proof works for the regularization of any convex, subadditive, and asymptotically continuous entanglement monotone, and hence also applies to the asymptotic relative entropy of entanglement.

quant-ph↗

arXiv2013

Entanglement distillation by extendible maps

It is known that from entangled states that have positive partial transpose it is not possible to distill maximally entangled states by local operations and classical communication (LOCC). A long-standing open question is whether maximally entangled states can be distilled from every state with a non-positive partial transpose. In this paper we study a possible approach to the question consisting of enlarging the class of operations allowed. Namely, instead of LOCC operations we consider k-extendible operations, defined as maps whose Choi-Jamiolkowski state is k-extendible. We find that this class is unexpectedly powerful - e.g. it is capable of distilling EPR pairs even from product states. We also perform numerical studies of distillation of Werner states by those maps, which show that if we raise the extension index k simultaneously with the number of copies of the state, then the class of k-extendible operations is not that powerful anymore and provide a better approximation to the set of LOCC operations.

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

Exponential Quantum Speed-ups are Generic

A central problem in quantum computation is to understand which quantum circuits are useful for exponential speed-ups over classical computation. We address this question in the setting of query complexity and show that for almost any sufficiently long quantum circuit one can construct a black-box problem which is solved by the circuit with a constant number of quantum queries, but which requires exponentially many classical queries, even if the classical machine has the ability to postselect. We prove the result in two steps. In the first, we show that almost any element of an approximate unitary 3-design is useful to solve a certain black-box problem efficiently. The problem is based on a recent oracle construction of Aaronson and gives an exponential separation between quantum and classical bounded-error with postselection query complexities. In the second step, which may be of independent interest, we prove that linear-sized random quantum circuits give an approximate unitary 3-design. The key ingredient in the proof is a technique from quantum many-body theory to lower bound the spectral gap of local quantum Hamiltonians.

quant-ph↗

arXiv2012

Local random quantum circuits are approximate polynomial-designs

We prove that local random quantum circuits acting on n qubits composed of O(t^{10} n^2) many nearest neighbor two-qubit gates form an approximate unitary t-design. Previously it was unknown whether random quantum circuits were a t-design for any t > 3. The proof is based on an interplay of techniques from quantum many-body theory, representation theory, and the theory of Markov chains. In particular we employ a result of Nachtergaele for lower bounding the spectral gap of frustration-free quantum local Hamiltonians; a quasi-orthogonality property of permutation matrices; a result of Oliveira which extends to the unitary group the path-coupling method for bounding the mixing time of random walks; and a result of Bourgain and Gamburd showing that dense subgroups of the special unitary group, composed of elements with algebraic entries, are infty-copy tensor-product expanders. We also consider pseudo-randomness properties of local random quantum circuits of small depth and prove that circuits of depth O(t^{10}n) constitute a quantum t-copy tensor-product expander. The proof also rests on techniques from quantum many-body theory, in particular on the detectability lemma of Aharonov, Arad, Landau, and Vazirani. We give applications of the results to cryptography, equilibration of closed quantum dynamics, and the generation of topological order. In particular we show the following pseudo-randomness property of generic quantum circuits: Almost every circuit U of size O(n^k) on n qubits cannot be distinguished from a Haar uniform unitary by circuits of size O(n^{(k-9)/11}) that are given oracle access to U.

quant-ph↗

arXiv2010

Entangled inputs cannot make imperfect quantum channels perfect

Entangled inputs can enhance the capacity of quantum channels, this being one of the consequences of the celebrated result showing the non-additivity of several quantities relevant for quantum information science. In this work, we answer the converse question (whether entangled inputs can ever render noisy quantum channels have maximum capacity) to the negative: No sophisticated entangled input of any quantum channel can ever enhance the capacity to the maximum possible value; a result that holds true for all channels both for the classical as well as the quantum capacity. This result can hence be seen as a bound as to how "non-additive quantum information can be". As a main result, we find first practical and remarkably simple computable single-shot bounds to capacities, related to entanglement measures. As examples, we discuss the qubit amplitude damping and identify the first meaningful bound for its classical capacity.

quant-ph↗

arXiv2010

Contextuality offers security

The discovery of quantum key distribution by Bennett and Brassard (BB84) bases on the fundamental quantum feature: incompatibility of measurements of quantum non-commuting observables. In 1991 Ekert showed that cryptographic key can be generated at a distance with help of entangled (correlated) quantum particles. Recently Barrett, Hardy and Kent showed that the non-locality used by Ekert is itself a good resource of cryptographic key even beyond quantum mechanics. Their result paved the way to new generation of quantum cryptographic protocols - secure even if the devices are built by the very eavesdropper. However, there is a question, which is fundamental from both practical and philosophical point of view: does Nature offer security on operational level based on the original concept behind quantum cryptography - that information gain about one bservables must cause disturbance to another, incompatible one? Here we resolve this problem by using in place of non-locality another striking feature of quantum world - contextuality. It is a strong version of incompatibility manifested in the famous Kochen-Specker paradox. The crucial concept is the use of a new class of families of bipartite probability distributions which locally exhibit the Kochen-Specker paradox conditions and, in addition, exhibit perfect correlations. We show that if two persons share systems described by such a family then they can extract secure key. This is the first operational protocol that directly implements the fundamental feature of Nature: the information gain vs. disturbance trade-off. At the same time it provides natural device-independent cryptographic scheme within quantum mechanics suitable for current technology.

quant-ph↗