arXiv subjects

Michael M. Wolf

Publications and source records attributed to Michael M. Wolf.

At least 55 records · Page 3Linked to original sources

arXiv2015

Tight bound on relative entropy by entropy difference

We prove a lower bound on the relative entropy between two finite-dimensional states in terms of their entropy difference and the dimension of the underlying space. The inequality is tight in the sense that equality can be attained for any prescribed value of the entropy difference, both for quantum and classical systems. We outline implications for information theory and thermodynamics, such as a necessary condition for a process to be close to thermodynamic reversibility, or an easily computable lower bound on the classical channel capacity. Furthermore, we derive a tight upper bound, uniform for all states of a given dimension, on the variance of the surprisal, whose thermodynamic meaning is that of heat capacity.

quant-ph↗

arXiv2015

Perturbation Theory for Parent Hamiltonians of Matrix Product States

This article investigates the stability of the ground state subspace of a canonical parent Hamiltonian of a Matrix product state against local perturbations. We prove that the spectral gap of such a Hamiltonian remains stable under weak local perturbations even in the thermodynamic limit, where the entire perturbation might not be bounded. Our discussion is based on preceding work by D.A. Yarotsky that develops a perturbation theory for relatively bounded quantum perturbation of classical Hamiltonians. We exploit a renormalization procedure, which on large scale transforms the parent Hamiltonian of a Matrix product state into a classical Hamiltonian plus some perturbation. We can thus extend D.A. Yarotsky's results to provide a perturbation theory for parent Hamiltonians of Matrix product states and recover some of the findings of independent contributions by S. Michalakis et al. [arXiv:1109.1588] and J. I. Cirac et al. [arXiv:1306.4003].

math-ph↗

arXiv2014

Spectral Anomaly Detection in Very Large Graphs: Models, Noise, and Computational Complexity

Anomaly detection in massive networks has numerous theoretical and computational challenges, especially as the behavior to be detected becomes small in comparison to the larger network. This presentation focuses on recent results in three key technical areas, specifically geared toward spectral methods for detection. We first discuss recent models for network behavior, and how their structure can be exploited for efficient computation of the principal eigenspace of the graph. In addition to the stochasticity of background activity, a graph of interest may be observed through a noisy or imperfect mechanism, which may hinder the detection process. A few simple noise models are discussed, and we demonstrate the ability to fuse multiple corrupted observations and recover detection performance. Finally, we discuss the challenges in scaling the spectral algorithms to large-scale high-performance computing systems, and present preliminary recommendations to achieve good performance with current parallel eigensolvers.

cs.SI↗

arXiv2014

Frustration free gapless Hamiltonians for Matrix Product States

For every Matrix Product State (MPS) one can always construct a so-called parent Hamiltonian. This is a local, frustration free, Hamiltonian which has the MPS as ground state and is gapped. Whenever that parent Hamiltonian has a degenerate ground state (the so-called non-injective case), we construct another 'uncle' Hamiltonian which is local and frustration free but gapless, and its spectrum is $\R^+$. The construction is obtained by linearly perturbing the matrices building up the state in a random direction, and then taking the limit where the perturbation goes to zero. For MPS where the parent Hamiltonian has a unique ground state (the so-called injective case) we also build such uncle Hamiltonian with the same properties in the thermodynamic limit.

quant-ph↗

arXiv2014

Spectral convergence bounds for classical and quantum Markov processes

We introduce a new framework that yields spectral bounds on norms of functions of transition maps for finite, homogeneous Markov chains. The techniques employed work for bounded semigroups, in particular for classical as well as for quantum Markov chains and they do not require additional assumptions like detailed balance, irreducibility or aperiodicity. We use the method in order to derive convergence bounds that improve significantly upon known spectral bounds. The core technical observation is that power-boundedness of transition maps of Markov chains enables a Wiener algebra functional calculus in order to upper bound any norm of any holomorphic function of the transition map. Finally, we discuss how general detailed balance conditions for quantum Markov processes lead to spectral convergence bounds.

math-ph↗

arXiv2014

An improved Landauer Principle with finite-size corrections

Landauer's Principle relates entropy decrease and heat dissipation during logically irreversible processes. Most theoretical justifications of Landauer's Principle either use thermodynamic reasoning or rely on specific models based on arguable assumptions. Here, we aim at a general and minimal setup to formulate Landauer's Principle in precise terms. We provide a simple and rigorous proof of an improved version of the Principle, which is formulated in terms of an equality rather than an inequality. The proof is based on quantum statistical mechanics concepts rather than on thermodynamic argumentation. From this equality version, we obtain explicit improvements of Landauer's bound that depend on the effective size of the thermal reservoir and reduce to Landauer's bound only for infinite-sized reservoirs.

quant-ph↗

arXiv2014

Quantum channels with polytopic images and image additivity

We study quantum channels with respect to their image, i.e., the image of the set of density operators under the action of the channel. We first characterize the set of quantum channels having polytopic images and show that additivity of the minimal output entropy can be violated in this class. We then provide a complete characterization of quantum channels $T$ that are universally image additive in the sense that for any quantum channel $S$, the image of $T \otimes S$ is the convex hull of the tensor product of the images of $T$ and $S$. These channels turn out to form a strict subset of entanglement breaking channels with polytopic images and a strict superset of classical-quantum channels.

quant-ph↗

arXiv2014

Quantifying the Effect of Matrix Structure on Multithreaded Performance of the SpMV Kernel

Sparse matrix-vector multiplication (SpMV) is the core operation in many common network and graph analytics, but poor performance of the SpMV kernel handicaps these applications. This work quantifies the effect of matrix structure on SpMV performance, using Intel's VTune tool for the Sandy Bridge architecture. Two types of sparse matrices are considered: finite difference (FD) matrices, which are structured, and R-MAT matrices, which are unstructured. Analysis of cache behavior and prefetcher activity reveals that the SpMV kernel performs far worse with R-MAT matrices than with FD matrices, due to the difference in matrix structure. To address the problems caused by unstructured matrices, novel architecture improvements are proposed.

cs.DC↗

arXiv2014

Fault-ignorant Quantum Search

We investigate the problem of quantum searching on a noisy quantum computer. Taking a 'fault-ignorant' approach, we analyze quantum algorithms that solve the task for various different noise strengths, which are possibly unknown beforehand. We prove lower bounds on the runtime of such algorithms and thereby find that the quadratic speedup is necessarily lost (in our noise models). However, for low but constant noise levels the algorithms we provide (based on Grover's algorithm) still outperform the best noiseless classical search algorithm.

quant-ph↗

arXiv2013

Standard super-activation for Gaussian channels requires squeezing

The quantum capacity of bosonic Gaussian quantum channels can be non-additive in a particularly striking way: a pair of such optical-fiber type channels can individually have zero quantum capacity but super-activate each other such that the combined channel has strictly positive capacity. This has been shown in [Nature Photonics 5, 624 (2011)] where it was conjectured that squeezing is a necessary resource for this phenomenon. We provide a proof of this conjecture by showing that for gauge covariant channels a Choi matrix with positive partial transpose implies that the channel is entanglement-breaking. In addition, we construct an example which shows that this implication fails to hold for Gaussian channels which arise from passive interactions with a squeezed environment.

quant-ph↗

arXiv2013

Coexistence does not imply joint measurability

One of the hallmarks of quantum theory is the realization that distinct measurements cannot in general be performed simultaneously, in stark contrast to classical physics. In this context the notions of coexistence and joint measurability are employed to analyze the possibility of measuring together two general quantum observables, characterizing different degrees of compatibility between measurements. It is known that two jointly measurable observables are always coexistent, and that the converse holds for various classes of observables, including the case of observables with two outcomes. Here we resolve, in the negative, the open question whether this equivalence holds in general. Our resolution strengthens the notions of coexistence and joint measurability by showing that both are robust against small imperfections in the measurement setups.

quant-ph↗

arXiv2013

Perturbation Bounds for Quantum Markov Processes and their Fixed Points

We investigate the stability of quantum Markov processes with respect to perturbations of their transition maps. In the first part, we introduce a condition number that measures the sensitivity of fixed points of a quantum channel to perturbations. We establish upper and lower bounds on this condition number in terms of subdominant eigenvalues of the transition map. In the second part, we consider quantum Markov processes that converge to a unique stationary state and we analyze the stability of the evolution at finite times. In this way we obtain a linear relation between the mixing time of a quantum Markov process and the sensitivity of its fixed point with respect to perturbations of the transition map.

math-ph↗

arXiv2012

Entanglement, fractional magnetization and long-range interactions

Based on the theory of Matrix Product States, we give precise statements and complete analytical proofs of the following claim: a large fractionalization in the magnetization or the need of long-range interactions imply large entanglement in the state of a quantum spin chain.

quant-ph↗

arXiv2012

Extending quantum operations

For a given set of input-output pairs of quantum states or observables, we ask the question whether there exists a physically implementable transformation that maps each of the inputs to the corresponding output. The physical maps on quantum states are trace-preserving completely positive maps, but we also consider variants of these requirements. We generalize the definition of complete positivity to linear maps defined on arbitrary subspaces, then formulate this notion as a semidefinite program, and relate it by duality to approximative extensions of this map. This gives a characterization of the maps which can be approximated arbitrarily well as the restriction of a map that is completely positive on the whole algebra, also yielding the familiar extension theorems on operator spaces. For quantum channel extensions and extensions by probabilistic operations we obtain semidefinite characterizations, and we also elucidate the special case of Abelian in- or outputs. Finally, revisiting a theorem by Alberti and Uhlmann, we provide simpler and more widely applicable conditions for certain extension problems on qubits, and by using a semidefinite programming formulation we exhibit counterexamples to seemingly reasonable but false generalizations of the Alberti-Uhlmann theorem.

math-ph↗

arXiv2012

Extracting dynamical equations from experimental data is NP-hard

The behavior of any physical system is governed by its underlying dynamical equations. Much of physics is concerned with discovering these dynamical equations and understanding their consequences. In this work, we show that, remarkably, identifying the underlying dynamical equation from any amount of experimental data, however precise, is a provably computationally hard problem (it is NP-hard), both for classical and quantum mechanical systems. As a by-product of this work, we give complexity-theoretic answers to both the quantum and classical embedding problems, two long-standing open problems in mathematics (the classical problem, in particular, dating back over 70 years).

quant-ph↗

arXiv2012

Quantum states on Harmonic lattices

We investigate bosonic Gaussian quantum states on an infinite cubic lattice in arbitrary spatial dimensions. We derive general properties of such states as ground states of quadratic Hamiltonians for both critical and non-critical cases. Tight analytic relations between the decay of the interaction and the correlation functions are proven and the dependence of the correlation length on band gap and effective mass is derived. We show that properties of critical ground states depend on the gap of the point-symmetrized rather than on that of the original Hamiltonian. For critical systems with polynomially decaying interactions logarithmic deviations from polynomially decaying correlation functions are found. Moreover, we provide a generalization of the matrix product state representation for Gaussian states and show that properties hold analogously to the case of finite dimensional spin systems.

quant-ph↗

arXiv2012

Gaussian Matrix Product States

We introduce Gaussian Matrix Product States (GMPS), a generalization of Matrix Product States (MPS) to lattices of harmonic oscillators. Our definition resembles the interpretation of MPS in terms of projected maximally entangled pairs, starting from which we derive several properties of GMPS, often in close analogy to the finite dimensional case: We show how to approximate arbitrary Gaussian states by MPS, we discuss how the entanglement in the bonds can be bounded, we demonstrate how the correlation functions can be computed from the GMPS representation, and that they decay exponentially in one dimension, and finally relate GMPS and ground states of local Hamiltonians.

quant-ph↗

arXiv2011

Gapless Hamiltonians for the toric code using the PEPS formalism

We study Hamiltonians which have Kitaev's toric code as a ground state, and show how to construct a Hamiltonian which shares the ground space of the toric code, but which has gapless excitations with a continuous spectrum in the thermodynamic limit. Our construction is based on the framework of Projected Entangled Pair States (PEPS), and can be applied to a large class of two-dimensional systems to obtain gapless "uncle Hamiltonians".

quant-ph↗