arXiv subjects

Andreas Winter

Publications and source records attributed to Andreas Winter.

At least 109 records · Page 6Linked to original sources

arXiv2018

Ultimate data hiding in quantum mechanics and beyond

The phenomenon of data hiding, i.e. the existence of pairs of states of a bipartite system that are perfectly distinguishable via general entangled measurements yet almost indistinguishable under LOCC, is a distinctive signature of nonclassicality. The relevant figure of merit is the maximal ratio (called data hiding ratio) between the distinguishability norms associated with the two sets of measurements we are comparing, typically all measurements vs LOCC protocols. For a bipartite $n\times n$ quantum system, it is known that the data hiding ratio scales as $n$, i.e. the square root of the real dimension of the local state space of density matrices. We show that for bipartite $n_A\times n_B$ systems the maximum data hiding ratio against LOCC protocols is $Θ\left(\min\{n_A,n_B\}\right)$. This scaling is better than the previously obtained upper bounds $O\left(\sqrt{n_A n_B}\right)$ and $\min\{n_A^2, n_B^2\}$, and moreover our intuitive argument yields constants close to optimal. In this paper, we investigate data hiding in the more general context of general probabilistic theories (GPTs), an axiomatic framework for physical theories encompassing only the most basic requirements about the predictive power of the theory. The main result of the paper is the determination of the maximal data hiding ratio obtainable in an arbitrary GPT, which is shown to scale linearly in the minimum of the local dimensions. We exhibit an explicit model achieving this bound up to additive constants, finding that the quantum mechanical data hiding ratio is only of the order of the square root of the maximal one. Our proof rests crucially on an unexpected link between data hiding and the theory of projective and injective tensor products of Banach spaces. Finally, we develop a body of techniques to compute data hiding ratios for a variety of restricted classes of GPTs that support further symmetries.

quant-ph↗

arXiv2018

Thermodynamics from information

Thermodynamics and information have intricate inter-relations. The justification of the fact that information is physical, is done by inter-linking information and thermodynamics - through Landauer's principle. This modern approach towards information recently has improved our understanding of thermodynamics, both in classical and quantum domains. Here we show thermodynamics as a consequence of information conservation. Our approach can be applied to most general situations, where systems and thermal-baths could be quantum, of arbitrary sizes and even could posses inter-system correlations. The approach does not rely on an a priori predetermined temperature associated to a thermal bath, which is not meaningful for finite-size cases. Hence, the thermal-baths and systems are not different, rather both are treated on an equal footing. This results in a "temperature"-independent formulation of thermodynamics. We exploit the fact that, for a fix amount of coarse-grained information, measured by the von Neumann entropy, any system can be transformed to a state that possesses minimal energy, without changing its entropy. This state is known as a completely passive state, which assumes Boltzmann-Gibb's canonical form with an intrinsic temperature. This leads us to introduce the notions of bound and free energy, which we further use to quantify heat and work respectively. With this guiding principle of information conservation, we develop universal notions of equilibrium, heat and work, Landauer's principle and also universal fundamental laws of thermodynamics. We show that the maximum efficiency of a quantum engine, equipped with a finite baths, is in general lower than that of an ideal Carnot's engine. We also introduce a resource theoretic framework for intrinsic-temperature based thermodynamics, within which we address the problem of work extraction and state transformations.

quant-ph↗

arXiv2018

Lateral heterostructures of two-dimensional materials by electron-beam induced stitching

We present a novel methodology to synthesize two-dimensional (2D) lateral heterostructures of graphene and MoS2 sheets with molecular carbon nanomembranes (CNMs), which is based on electron beam induced stitching. Monolayers of graphene and MoS2 were grown by chemical vapor deposition (CVD) on copper and SiO2 substrates, respectively, transferred onto gold/mica substrates and patterned by electron beam lithography or photolithography. Self-assembled monolayers (SAMs) of aromatic thiols were grown on the gold film in the areas where the 2D materials were not present. An irradiation with a low energy electron beam was employed to convert the SAMs into CNMs and simultaneously stitching the CNM edges to the edges of graphene and MoS2, therewith forming a heterogeneous but continuous film composed of two different materials. The formed lateral heterostructures possess a high mechanical stability, enabling their transfer from the gold substrate onto target substrates and even the preparation as freestanding sheets. We characterized the individual steps of this synthesis and the structure of the final heterostructures by complementary analytical techniques including optical microscopy, Raman spectroscopy, atomic force microscopy (AFM), helium ion microscopy (HIM), X-ray photoelectron spectroscopy (XPS) and high-resolution transmission electron microscopy (HRTEM) and find that they possess nearly atomically sharp boundaries.

cond-mat.mes-hall↗

arXiv2018

Quantum Reference Frames and Their Applications to Thermodynamics

We construct a quantum reference frame, which can be used to approximately implement arbitrary unitary transformations on a system in the presence of any number of extensive conserved quantities, by absorbing any back action provided by the conservation laws. Thus, the reference frame at the same time acts as a battery for the conserved quantities. Our construction features a physically intuitive, clear and implementation-friendly realisation. Indeed, the reference system is composed of the same types of subsystems as the original system and is finite for any desired accuracy. In addition, the interaction with the reference frame can be broken down into two-body terms coupling the system to one of the reference frame subsystems at a time. We apply this construction to quantum thermodynamic setups with multiple, possibly non-commuting conserved quantities, which allows for the definition of explicit batteries in such cases.

quant-ph↗

arXiv2018

Squashed entanglement, k-extendibility, quantum Markov chains, and recovery maps

Squashed entanglement [Christandl and Winter, J. Math. Phys. 45(3):829-840 (2004)] is a monogamous entanglement measure, which implies that highly extendible states have small value of the squashed entanglement. Here, invoking a recent inequality for the quantum conditional mutual information [Fawzi and Renner, Commun. Math. Phys. 340(2):575-611 (2015)] greatly extended and simplified in various work since, we show the converse, that a small value of squashed entanglement implies that the state is close to a highly extendible state. As a corollary, we establish an alternative proof of the faithfulness of squashed entanglement [Brandao, Christandl and Yard, Commun. Math. Phys. 306:805-830 (2011)]. We briefly discuss the previous and subsequent history of the Fawzi-Renner bound and related conjectures, and close by advertising a potentially far-reaching generalization to universal and functorial recovery maps for the monotonicity of the relative entropy.

quant-ph↗

arXiv2018

Fully Quantum Arbitrarily Varying Channels: Random Coding Capacity and Capacity Dichotomy

We consider a model of communication via a fully quantum jammer channel with quantum jammer, quantum sender and quantum receiver, which we dub quantum arbitrarily varying channel (QAVC). Restricting to finite dimensional user and jammer systems, we show, using permutation symmetry and a de Finetti reduction, how the random coding capacity (classical and quantum) of the QAVC is reduced to the capacity of a naturally associated compound channel, which is obtained by restricting the jammer to i.i.d. input states. Furthermore, we demonstrate that the shared randomness required is at most logarithmic in the block length, using a random matrix tail bound. This implies a dichotomy theorem: either the classical capacity of the QAVC is zero, and then also the quantum capacity is zero, or each capacity equals its random coding variant.

quant-ph↗

arXiv2017

Energy-constrained diamond norm with applications to the uniform continuity of continuous variable channel capacities

The channels, and more generally superoperators acting on the trace class operators of a quantum system naturally form a Banach space under the completely bounded trace norm (aka diamond norm). However, it is well-known that in infinite dimension, the norm topology is often "too strong" for reasonable applications. Here, we explore a recently introduced energy-constrained diamond norm on superoperators (subject to an energy bound on the input states). Our main motivation is the continuity of capacities and other entropic quantities of quantum channels, but we also present an application to the continuity of one-parameter unitary groups and certain one-parameter semigroups of quantum channels.

quant-ph↗

arXiv2017

Logarithmic coherence: Operational interpretation of $\ell_1$-norm coherence

We show that the distillable coherence---which is equal to the relative entropy of coherence---is, up to a constant factor, always bounded by the $\ell_1$-norm measure of coherence (defined as the sum of absolute values of off diagonals). Thus the latter plays a similar role as logarithmic negativity plays in entanglement theory and this is the best operational interpretation from a resource-theoretic viewpoint. Consequently the two measures are intimately connected to another operational measure, the robustness of coherence. We find also relationships between these measures, which are tight for general states, and the tightest possible for pure and qubit states. For a given robustness, we construct a state having minimum distillable coherence.

quant-ph↗

arXiv2017

Generalized Laws of Thermodynamics in the Presence of Correlations

The laws of thermodynamics, despite their wide range of applicability, are known to break down when systems are correlated with their environments. Here, we generalize thermodynamics to physical scenarios which allow presence of correlations, including those where strong correlations are present. We exploit the connection between information and physics, and introduce a consistent redefinition of heat dissipation by systematically accounting for the information flow from system to bath in terms of the conditional entropy. As a consequence, the formula for the Helmholtz free energy is accordingly modified. Such a remedy not only fixes the apparent violations of Landauer's erasure principle and the second law due to anomalous heat flows, but also leads to a generally valid reformulation of the laws of thermodynamics. In this information-theoretic approach, correlations between system and environment store work potential. Thus, in this view, the apparent anomalous heat flows are the refrigeration processes driven by such potentials.

quant-ph↗

arXiv2017

Resource Theory of Coherence - Beyond States

We generalize the recently proposed resource theory of coherence (or superposition) [Baumgratz, Cramer & Plenio, Phys. Rev. Lett. 113:140401; Winter & Yang, Phys. Rev. Lett. 116:120404] to the setting where not only the free ("incoherent") resources, but also the objects manipulated are quantum operations, rather than states. In particular, we discuss an information theoretic notion of coherence capacity of a quantum channel, and prove a single-letter formula for it in the case of unitaries. Then we move to the coherence cost of simulating a channel, and prove achievability results for unitaries and general channels acting on a $d$-dimensional system; we show that a maximally coherent state of rank $d$ is always sufficient as a resource if incoherent operations are allowed. We also show lower bounds on the simulation cost of channels that allow us to conclude that there exists bound coherence in operations, i.e. maps with non-zero cost of implementing them but zero coherence capacity; this is in contrast to states, which do not exhibit bound coherence.

quant-ph↗

arXiv2017

From log-determinant inequalities to Gaussian entanglement via recoverability theory

Many determinantal inequalities for positive definite block matrices are consequences of general entropy inequalities, specialised to Gaussian distributed vectors with prescribed covariances. In particular, strong subadditivity (SSA) yields \begin{equation*} \ln\det V_{AC} + \ln\det V_{BC} - \ln\det V_{ABC} - \ln\det V_C \geq 0 \end{equation*} for all $3\times 3$-block matrices $V_{ABC}$, where subscripts identify principal submatrices. We shall refer to the above inequality as SSA of log-det entropy. In this paper we develop further insights on the properties of the above inequality and its applications to classical and quantum information theory. In the first part of the paper, we show how to find known and new necessary and sufficient conditions under which saturation with equality occurs. Subsequently, we discuss the role of the classical transpose channel (also known as Petz recovery map) in this problem and find its action explicitly. We then prove some extensions of the saturation theorem, by finding faithful lower bounds on a log-det conditional mutual information. In the second part, we focus on quantum Gaussian states, whose covariance matrices are not only positive but obey additional constraints due to the uncertainty relation. For Gaussian states, the log-det entropy is equivalent to the Rényi entropy of order $2$. We provide a strengthening of log-det SSA for quantum covariance matrices that involves the so-called Gaussian Rényi-$2$ entanglement of formation, a well-behaved entanglement measure defined via a Gaussian convex roof construction. We then employ this result to define a log-det entropy equivalent of the squashed entanglement, which is remarkably shown to coincide with the Gaussian Rényi-$2$ entanglement of formation. This allows us to establish useful properties of such measure(s), like monogamy, faithfulness, and additivity on Gaussian states.

quant-ph↗

arXiv2017

Approximate Degradable Quantum Channels

Degradable quantum channels are an important class of completely positive trace-preserving maps. Among other properties, they offer a single-letter formula for the quantum and the private classical capacity and are characterized by the fact that a complementary channel can be obtained from the channel by applying a degrading channel. In this work we introduce the concept of approximate degradable channels, which satisfy this condition up to some finite $\varepsilon\geq0$. That is, there exists a degrading channel which upon composition with the channel is $\varepsilon$-close in the diamond norm to the complementary channel. We show that for any fixed channel the smallest such $\varepsilon$ can be efficiently determined via a semidefinite program. Moreover, these approximate degradable channels also approximately inherit all other properties of degradable channels. As an application, we derive improved upper bounds to the quantum and private classical capacity for certain channels of interest in quantum communication.

quant-ph↗

arXiv2017

Equilibration time scales of physically relevant observables

We address the problem of understanding from first principles the conditions under which a quantum system equilibrates rapidly with respect to a concrete observable. On the one hand previously known general upper bounds on the time scales of equilibration were unrealistically long, with times scaling linearly with the dimension of the Hilbert space. These bounds proved to be tight, since particular constructions of observables scaling in this way were found. On the other hand, the computed equilibration time scales for certain classes of typical measurements, or under the evolution of typical Hamiltonians, turn out to be unrealistically short. However neither classes of results cover physically relevant situations, which up to now had only been tractable in specific models. In this paper we provide a new upper bound on the equilibration time scales which, under some physically reasonable conditions, give much more realistic results than previously known. In particular, we apply this result to the paradigmatic case of a system interacting with a thermal bath, where we obtain an upper bound for the equilibration time scale independent of the size of the bath. In this way, we find general conditions that single out observables with realistic equilibration times within a physically relevant setup.

quant-ph↗

arXiv2017

Decoupling with random diagonal unitaries

We investigate decoupling, one of the most important primitives in quantum Shannon theory, by replacing the uniformly distributed random unitaries commonly used to achieve the protocol, with repeated applications of random unitaries diagonal in the Pauli-$Z$ and -$X$ bases. This strategy was recently shown to achieve an approximate unitary $2$-design after a number of repetitions of the process, which implies that the strategy gradually achieves decoupling. Here, we prove that even fewer repetitions of the process achieve decoupling at the same rate as that with the uniform ones, showing that rather imprecise approximations of unitary $2$-designs are sufficient for decoupling. We also briefly discuss efficient implementations of them and implications of our decoupling theorem to coherent state merging and relative thermalisation.

quant-ph↗

arXiv2017

Interferometric visibility and coherence

Recently, the basic concept of quantum coherence (or superposition) has gained a lot of renewed attention, after Baumgratz et al. [PRL 113:140401 (2014)], following Åberg [arXiv:quant-ph/0612146], have proposed a resource theoretic approach to quantify it. This has resulted in a large number of papers and preprints exploring various coherence monotones, and debating possible forms for the resource theory. Here we take the view that the operational foundation of coherence in a state, be it quantum or otherwise wave mechanical, lies in the observation of interference effects. Our approach here is to consider an idealised multi-path interferometer, with a suitable detector, in such a way that the visibility of the interference pattern provides a quantitative expression of the amount of coherence in a given probe state. We present a general framework of deriving coherence measures from visibility, and demonstrate it by analysing several concrete visibility parameters, recovering some known coherence measures and obtaining some new ones.

quant-ph↗

arXiv2017

Non-Gaussian operations on bosonic modes of light: Photon-added Gaussian channels

We present a framework for studying bosonic non-Gaussian channels of continuous-variable systems. Our emphasis is on a class of channels that we call photon-added Gaussian channels, which are experimentally viable with current quantum-optical technologies. A strong motivation for considering these channels is the fact that it is compulsory to go beyond the Gaussian domain for numerous tasks in continuous-variable quantum information processing such as entanglement distillation from Gaussian states and universal quantum computation. The single-mode photon-added channels we consider are obtained by using two-mode beam splitters and squeezing operators with photon addition applied to the ancilla ports giving rise to families of non-Gaussian channels. For each such channel, we derive its operator-sum representation, indispensable in the present context. We observe that these channels are Fock preserving (coherence nongenerating). We then report two examples of activation using our scheme of photon addition, that of quantum-optical nonclassicality at outputs of channels that would otherwise output only classical states and of both the quantum and private communication capacities, hinting at far-reaching applications for quantum-optical communication. Further, we see that noisy Gaussian channels can be expressed as a convex mixture of these non-Gaussian channels. We also present other physical and information-theoretic properties of these channels.

quant-ph↗

arXiv2017

Unitary $2$-designs from random $X$- and $Z$-diagonal unitaries

Unitary $2$-designs are random unitaries simulating up to the second order statistical moments of the uniformly distributed random unitaries, often referred to as Haar random unitaries. They are used in a wide variety of theoretical and practical quantum information protocols, and also have been used to model the dynamics in complex quantum many-body systems. Here, we show that unitary $2$-designs can be approximately implemented by alternately repeating random unitaries diagonal in the Pauli-$Z$ basis and that in the Pauli-$X$ basis. We also provide a converse about the number of repetitions needed to achieve unitary $2$-designs. These results imply that the process after $\ell$ repetitions achieves a $Θ(d^{-\ell})$-approximate unitary $2$-design. Based on the construction, we further provide quantum circuits that efficiently implement approximate unitary $2$-designs. Although a more efficient implementation of unitary $2$-designs is known, our quantum circuit has its own merit that it is divided into a constant number of commuting parts, which enables us to apply all commuting gates simultaneously and leads to a possible reduction of an actual execution time. We finally interpret the result in terms of the dynamics generated by time-dependent Hamiltonians and provide for the first time a random disordered time-dependent Hamiltonian that generates a unitary $2$-design after switching interactions only a few times.

quant-ph↗

arXiv2017

Information Theoretic Principles of Universal Discrete Denoising

Today, the internet makes tremendous amounts of data widely available. Often, the same information is behind multiple different available data sets. This lends growing importance to latent variable models that try to learn the hidden information from the available imperfect versions. For example, social media platforms can contain an abundance of pictures of the same person or object, yet all of which are taken from different perspectives. In a simplified scenario, one may consider pictures taken from the same perspective, which are distorted by noise. This latter application allows for a rigorous mathematical treatment, which is the content of this contribution. We apply a recently developed method of dependent component analysis to image denoising when multiple distorted copies of one and the same image are available, each being corrupted by a different and unknown noise process. In a simplified scenario, we assume that the distorted image is corrupted by noise that acts independently on each pixel. We answer completely the question of how to perform optimal denoising, when at least three distorted copies are available: First we define optimality of an algorithm in the presented scenario, and then we describe an aymptotically optimal universal discrete denoising algorithm (UDDA). In the case of binary data and binary symmetric noise, we develop a simplified variant of the algorithm, dubbed BUDDA, which we prove to attain universal denoising uniformly.

cs.IT↗