vix.ing · top · new · best · stats

Which Bipartite States are Lazy

2014/02/28 by Jianwei Xu · 3 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Bipartite graph #Computer science #Discrete mathematics #Entropy (arrow of time) #Gaussian #Geometry #Graph #Mathematics #Physics #Product (mathematics) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum mechanics #Spectroscopy and Quantum Chemical Studies #State (computer science) #quant-ph

paper · pdf · doi:10.1007/s10773-014-2281-8

published in International Journal of Theoretical Physics 54(3), 860-867 (Springer Science+Business Media) · 7 pages, no figure. With corrections to version 1

arxiv created 2014/03/26 · openalex publication_date 2014/08/02 · arxiv updated 2015/06/18 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05

Abstract

A bipartite state is called lazy if the entropy rate of one subsystem is vanishing for any coupling to the other subsystem. In this paper, we provide a necessary and sufficient condition for a finite-dimensional bipartite state to be lazy, and prove that a two-mode Gaussian state is lazy if and only if it is a direct product state.

Citations