Families of bipartite states classifiable by the positive partial transposition criterion

IF 0.7 4区物理与天体物理 Q3 COMPUTER SCIENCE, THEORY & METHODS

Quantum Information & Computation Pub Date : 2009-06-06 DOI:10.5555/2011362.2011372

F. Steinhoff, M. C. Oliveira

引用次数: 4

Abstract

We construct a family of bipartite states of arbitrary dimension whose eigenvalues of thepartially transposed matrix can be inferred directly from the block structure of the globaldensity matrix. We identify from this several subfamilies in which the PPT criterion isboth necessary and sufficient. A sufficient criterion of separability is obtained, which isfundamental for the discussion. We show how several examples of states known to beclassifiable by the PPT criterion indeed belong to this general set. Possible uses of thesestates in numerical analysis of entanglement and in the search of PPT bound entangledstates are briefly discussed.

查看原文本刊更多论文

用正偏置换准则可分类的二部态族

构造了一个任意维二部态族，其部分转置矩阵的特征值可以直接从全局密度矩阵的块结构中推断出来。我们从这几个亚族中确定PPT标准是必要和充分的。得到了一个充分的可分性判据，这是讨论可分性的基础。我们展示了几个可以通过PPT标准分类的已知状态的例子是如何属于这个一般集合的。简要讨论了这些级数在纠缠的数值分析和寻找PPT束缚纠缠态中的可能用途。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Quantum Information & Computation 物理-计算机：理论方法

CiteScore

1.70

自引率

0.00%

发文量

审稿时长

3.3 months

期刊介绍： Quantum Information & Computation provides a forum for distribution of information in all areas of quantum information processing. Original articles, survey articles, reviews, tutorials, perspectives, and correspondences are all welcome. Computer science, physics and mathematics are covered. Both theory and experiments are included. Illustrative subjects include quantum algorithms, quantum information theory, quantum complexity theory, quantum cryptology, quantum communication and measurements, proposals and experiments on the implementation of quantum computation, communications, and entanglement in all areas of science including ion traps, cavity QED, photons, nuclear magnetic resonance, and solid-state proposals.