arXiv subjects

Michael M. Wolf

Publications and source records attributed to Michael M. Wolf.

At least 37 records · Page 2Linked to original sources

arXiv2018

Are almost-symmetries almost linear?

It $d-$pends. Wigner's symmetry theorem implies that transformations that preserve transition probabilities of pure quantum states are linear maps on the level of density operators. We investigate the stability of this implication. On the one hand, we show that any transformation that preserves transition probabilities up to an additive $\varepsilon$ in a separable Hilbert space admits a weak linear approximation, i.e. one relative to any fixed observable. This implies the existence of a linear approximation that is $4\sqrt{\varepsilon} d$-close in Hilbert-Schmidt norm, with $d$ the Hilbert space dimension. On the other hand, we prove that a linear approximation that is close in norm and independent of $d$ does not exist in general. To this end, we provide a lower bound that depends logarithmically on $d$.

math-ph↗

arXiv2018

Universality and Optimality in the Information-Disturbance Tradeoff

We investigate the tradeoff between the quality of an approximate version of a given measurement and the disturbance it induces in the measured quantum system. We prove that if the target measurement is a non-degenerate von Neumann measurement, then the optimal tradeoff can always be achieved within a two-parameter family of quantum devices that is independent of the chosen distance measures. This form of almost universal optimality holds under mild assumptions on the distance measures such as convexity and basis-independence, which are satisfied for all the usual cases that are based on norms, transport cost functions, relative entropies, fidelities, etc. for both worst-case and average-case analysis. We analyze the case of the cb-norm (or diamond norm) more generally for which we show dimension-independence of the derived optimal tradeoff for general von Neumann measurements. A SDP solution is provided for general POVMs and shown to exist for arbitrary convex semialgebraic distance measures.

quant-ph↗

arXiv2018

Measurement-Disturbance Tradeoff Outperforming Optimal Cloning

One of the characteristic features of quantum mechanics is that every measurement that extracts information about a general quantum system necessarily causes an unavoidable disturbance to the state of this system. A plethora of different approaches has been developed to characterize and optimize this tradeoff. Here, we apply the framework of quantum instruments to investigate the optimal tradeoff and to derive a class of procedures that is optimal with respect to most meaningful measures. We focus our analysis on binary measurements on qubits as commonly used in communication and computation protocols and demonstrate theoretically and in an experiment that the optimal universal asymmetric quantum cloner, albeit ideal for cloning, is not an optimal procedure for measurements and can be outperformed with high significance.

quant-ph↗

arXiv2018

Undecidability of the Spectral Gap (short version)

The spectral gap - the energy difference between the ground state and first excited state - is central to quantum many-body physics. Many challenging open problems, such as the Haldane conjecture, existence of gapped topological spin liquid phases, or the Yang-Mills gap conjecture, concern spectral gaps. These and other problems are particular cases of the general spectral gap problem: given a quantum many-body Hamiltonian, is it gapped or gapless? Here we prove that this is an undecidable problem. We construct families of quantum spin systems on a 2D lattice with translationally-invariant, nearest-neighbour interactions for which the spectral gap problem is undecidable. This result extends to undecidability of other low energy properties, such as existence of algebraically decaying ground-state correlations. The proof combines Hamiltonian complexity techniques with aperiodic tilings, to construct a Hamiltonian whose ground state encodes the evolution of a quantum phase-estimation algorithm followed by a universal Turing Machine. The spectral gap depends on the outcome of the corresponding Halting Problem. Our result implies that there exists no algorithm to determine whether an arbitrary model is gapped or gapless. It also implies that there exist models for which the presence or absence of a spectral gap is independent of the axioms of mathematics.

quant-ph↗

arXiv2018

Quantum compression relative to a set of measurements

In this work, we investigate the possibility of compressing a quantum system to one of smaller dimension in a way that preserves the measurement statistics of a given set of observables. In this process, we allow for an arbitrary amount of classical side information. We find that the latter can be bounded, which implies that the minimal compression dimension is stable in the sense that it cannot be decreased by allowing for small errors. Various bounds on the minimal compression dimension are proven and an SDP-based algorithm for its computation is provided. The results are based on two independent approaches: an operator algebraic method using a fixed point result by Arveson and an algebro-geometric method that relies on irreducible polynomials and Bézout's theorem. The latter approach allows lifting the results from the single copy level to the case of multiple copies and from completely positive to merely positive maps.

quant-ph↗

arXiv2018

Quantum Tomography under Prior Information

We provide a detailed analysis of the question: how many measurement settings or outcomes are needed in order to identify a quantum system which is constrained by prior information? We show that if the prior information restricts the system to a set of lower dimensionality, then topological obstructions can increase the required number of outcomes by a factor of two over the number of real parameters needed to characterize the system. Conversely, we show that almost every measurement becomes informationally complete with respect to the constrained set if the number of outcomes exceeds twice the Minkowski dimension of the set. We apply the obtained results to determine the minimal number of outcomes of measurements which are informationally complete with respect to states with rank constraints. In particular, we show that 4d-4 measurement outcomes (POVM elements) is enough in order to identify all pure states in a d-dimensional Hilbert space, and that the minimal number is at most 2 log_2(d) smaller than this upper bound.

quant-ph↗

arXiv2018

Sparse Matrix-Matrix Multiplication on Multilevel Memory Architectures : Algorithms and Experiments

Architectures with multiple classes of memory media are becoming a common part of mainstream supercomputer deployments. So called multi-level memories offer differing characteristics for each memory component including variation in bandwidth, latency and capacity. This paper investigates the performance of sparse matrix multiplication kernels on two leading high-performance computing architectures -- Intel's Knights Landing processor and NVIDIA's Pascal GPU. We describe a data placement method and a chunking-based algorithm for our kernels that exploits the existence of the multiple memory spaces in each hardware platform. We evaluate the performance of these methods w.r.t. standard algorithms using the auto-caching mechanisms. Our results show that standard algorithms that exploit cache reuse performed as well as multi-memory-aware algorithms for architectures such as KNLs where the memory subsystems have similar latencies. However, for architectures such as GPUs where memory subsystems differ significantly in both bandwidth and latency, multi-memory-aware methods are crucial for good performance. In addition, our new approaches permit the user to run problems that require larger capacities than the fastest memory of each compute node without depending on the software-managed cache mechanisms.

cs.DC↗

arXiv2018

Size-Driven Quantum Phase Transitions

Can the properties of the thermodynamic limit of a many-body quantum system be extrapolated by analysing a sequence of finite-size cases? We present a model for which such an approach gives completely misleading results: a translationally invariant, local Hamiltonian on a square lattice with open boundary conditions and constant spectral gap, which has a classical product ground state for all system sizes smaller than a particular threshold size, but a ground state with topological degeneracy for all system sizes larger than this threshold. Starting from a minimal case with spins of dimension 6 and threshold lattice size 15 x 15, we show that the latter grows faster than any computable function with increasing local spin dimension. The resulting effect may be viewed as a new type of quantum phase transition that is driven by the size of the system rather than by an external field or coupling strength. We prove that the construction is thermally robust, opening the possibility that these effects are accessible to experimental observation.

quant-ph↗

arXiv2017

Constrained Quantum Tomography of Semi-Algebraic Sets with Applications to Low-Rank Matrix Recovery

We analyze quantum state tomography in scenarios where measurements and states are both constrained. States are assumed to live in a semi-algebraic subset of state space and measurements are supposed to be rank-one POVMs, possibly with additional constraints. Specifically, we consider sets of von Neumann measurements and sets of local observables. We provide upper bounds on the minimal number of measurement settings or outcomes that are required for discriminating all states within the given set. The bounds exploit tools from real algebraic geometry and lead to generic results that do not only show the existence of good measurements but guarantee that almost all measurements with the same dimension characteristic perform equally well. In particular, we show that on an $n$-dimensional Hilbert space any two states of a semi-algebraic subset can be discriminated by $k$ generic von Neumann measurements if $k(n-1)$ is larger than twice the dimension of the subset. In case the subset is given by states of rank at most $r$, we show that $k$ generic von Neumann measurements suffice to discriminate any two states provided that $k(n-1)>4r(n-r)-2$. We obtain corresponding results for low-rank matrix recovery of hermitian matrices in the scenario where the linear measurement mapping is induced by tight frames.

quant-ph↗

arXiv2016

Perturbation Bounds for Williamson's Symplectic Normal Form

Given a real-valued positive semidefinite matrix, Williamson proved that it can be diagonalised using symplectic matrices. The corresponding diagonal values are known as the symplectic spectrum. This paper is concerned with the stability of Williamson's decomposition under perturbations. We provide norm bounds for the stability of the symplectic eigenvalues and prove that if $S$ diagonalises a given matrix $M$ to Williamson form, then $S$ is stable if the symplectic spectrum is nondegenerate and $S^TS$ is always stable. Finally, we sketch a few applications of the results in quantum information theory.

math.SP↗

arXiv2016

An operational measure for squeezing

We propose and analyse a mathematical measure for the amount of squeezing contained in a continuous variable quantum state. We show that the proposed measure operationally quantifies the minimal amount of squeezing needed to prepare a given quantum state and that it can be regarded as a squeezing analogue of the "entanglement of formation". We prove that the measure is convex and superadditive and we provide analytic bounds as well as a numerical convex optimisation algorithm for its computation. By example, we then show that the amount of squeezing needed for the preparation of certain multi-mode quantum states can be significantly lower than naive approaches suggest.

math-ph↗

arXiv2016

Comment on "On the uncomputability of the spectral gap"

The aim of this short note is to clarify some of the claims made in the comparison made in [S. Lloyd, On the uncomputability of the spectral gap, arXiv:1602.05924] between our recent result [T.S. Cubitt, D. Perez-Garcia, M.M. Wolf, Undecidability of the spectral gap, Nature 528, 207-211 (2015), arXiv:1502.04573] and his 1994 paper [S. Lloyd, Necessary and sufficient conditions for quantum computation, J. Mod. Opt. 41(12), 2503-2520 (1994)].

quant-ph↗

arXiv2015

Positivity of linear maps under tensor powers

We investigate linear maps between matrix algebras that remain positive under tensor powers, i.e., under tensoring with $n$ copies of themselves. Completely positive and completely co-positive maps are trivial examples of this kind. We show that for every $n\in\mathbb{N}$ there exist non-trivial maps with this property and that for two-dimensional Hilbert spaces there is no non-trivial map for which this holds for all $n$. For higher dimensions we reduce the existence question of such non-trivial "tensor-stable positive maps" to a one-parameter family of maps and show that an affirmative answer would imply the existence of NPPT bound entanglement. As an application we show that any tensor-stable positive map that is not completely positive yields an upper bound on the quantum channel capacity, which for the transposition map gives the well-known cb-norm bound. We furthermore show that the latter is an upper bound even for the LOCC-assisted quantum capacity, and that moreover it is a strong converse rate for this task.

quant-ph↗

arXiv2015

Sinkhorn normal form for unitary matrices

Sinkhorn proved that every entry-wise positive matrix can be made doubly stochastic by multiplying with two diagonal matrices. In this note we prove a recently conjectured analogue for unitary matrices: every unitary can be decomposed into two diagonal unitaries and one whose row- and column sums are equal to one. The proof is non-constructive and based on a reformulation in terms of symplectic topology. As a corollary, we obtain a decomposition of unitary matrices into an interlaced product of unitary diagonal matrices and discrete Fourier transformations. This provides a new decomposition of linear optics arrays into phase shifters and canonical multiports described by Fourier transformations.

math-ph↗

arXiv2015

Relative Entropy Convergence for Depolarizing Channels

We study the convergence of states under continuous-time depolarizing channels with full rank fixed points in terms of the relative entropy. The optimal exponent of an upper bound on the relative entropy in this case is given by the log-Sobolev-1 constant. Our main result is the computation of this constant. As an application we use the log-Sobolev-1 constant of the depolarizing channels to improve the concavity inequality of the von-Neumann entropy. This result is compared to similar bounds obtained recently by Kim et al. and we show a version of Pinsker's inequality, which is optimal and tight if we fix the second argument of the relative entropy. Finally, we consider the log-Sobolev-1 constant of tensor-powers of the completely depolarizing channel and use a quantum version of Shearer's inequality to prove a uniform lower bound.

quant-ph↗

arXiv2015

Connected components of irreducible maps and 1D quantum phases

We investigate elementary topological properties of sets of completely positive (CP) maps that arise in quantum Perron-Frobenius theory. We prove that the set of primitive CP maps of fixed Kraus rank is path-connected and we provide a complete classification of the connected components of irreducible CP maps at given Kraus rank and fixed peripheral spectrum in terms of a multiplicity index. These findings are then applied to analyse 1D quantum phases by studying equivalence classes of translational invariant Matrix Product States that correspond to the connected components of the respective CP maps. Our results extend the previously obtained picture in that they do not require blocking of physical sites, they lead to analytic paths and they allow to decompose into ergodic components and to study the breaking of translational symmetry.

math-ph↗

arXiv2015

Entropy Production of Doubly Stochastic Quantum Channels

We study the entropy increase of quantum systems evolving under primitive, doubly stochastic Markovian noise and thus converging to the maximally mixed state. This entropy increase can be quantified by a logarithmic-Sobolev constant of the Liouvillian generating the noise. We prove a universal lower bound on this constant that stays invariant under taking tensor-powers. Our methods involve a new comparison method to relate logarithmic-Sobolev constants of different Liouvillians and a technique to compute logarithmic-Sobolev inequalities of Liouvillians with eigenvectors forming a projective representation of a finite abelian group. Our bounds improve upon similar results established before and as an application we prove an upper bound on continuous-time quantum capacities. In the last part of this work we study entropy production estimates of discrete-time doubly-stochastic quantum channels by extending the framework of discrete-time logarithmic-Sobolev inequalities to the quantum case.

quant-ph↗

arXiv2015

Quantum Subdivision Capacities and Continuous-time Quantum Coding

Quantum memories can be regarded as quantum channels that transmit information through time without moving it through space. Aiming at a reliable storage of information we may thus not only encode at the beginning and decode at the end, but also intervene during the transmission - a possibility not captured by the ordinary capacities in Quantum Shannon Theory. In this work we introduce capacities that take this possibility into account and study them in particular for the transmission of quantum information via dynamical semigroups of Lindblad form. When the evolution is subdivided and supplemented by additional continuous semigroups acting on arbitrary block sizes, we show that the capacity of the ideal channel can be obtained in all cases. If the supplementary evolution is reversible, however, this is no longer the case. Upper and lower bounds for this scenario are proven. Finally, we provide a continuous coding scheme and simple examples showing that adding a purely dissipative term to a Liouvillian can sometimes increase the quantum capacity.

quant-ph↗