Parameterized entanglement measures with computable lower bounds

被引：0
|
作者：
Bao, Gui [1 ]
Zhu, Xue-Na [1 ]
机构：
[1] Ludong Univ, Sch Math & Stat Sci, Yantai 264025, Shandong, Peoples R China
来源：
QUANTUM INFORMATION PROCESSING | 2025年 / 24卷 / 03期
关键词：
Entanglement measures; q-concurrence; Lower bounds; SEPARABILITY; CRITERION;
D O I：
10.1007/s11128-025-04692-y
中图分类号：
O4 [物理学];
学科分类号：
0702 ;
摘要：
In this work, we present the parameterized entanglement measures, q-concurrence with q>0 and q not equal 1. And we derive analytical lower bounds for the entanglement measures by using positive partial transposition and realignment criteria, detailed examples are presented. Moreover, we show that the increase of q-concurrence (1<q<2)for some superposition states are upper bounded by 1/2.
引用
收藏
页数：14
相关论文
共 50 条
  • [21] Lower bounds and parameterized approach for longest common subsequence
    Huang, Xiuzhen
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2006, 4112 : 136 - 145
  • [22] Strong computational lower bounds via parameterized complexity
    Chen, Jianer
    Huang, Xiuzhen
    Kanj, Iyad A.
    Xia, Ge
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2006, 72 (08) : 1346 - 1367
  • [23] Some lower bounds in parameterized AC0
    Chen, Yijia
    Flum, Jorg
    INFORMATION AND COMPUTATION, 2019, 267 : 116 - 134
  • [24] Hierarchy of Efficiently Computable and Faithful Lower Bounds to Quantum Discord
    Piani, Marco
    PHYSICAL REVIEW LETTERS, 2016, 117 (08)
  • [25] Entanglement and the lower bounds on the speed of quantum evolution
    Borras, A.
    Casas, M.
    Plastino, A. R.
    Plastino, A.
    PHYSICAL REVIEW A, 2006, 74 (02):
  • [26] Lower bounds for attainable fidelities in entanglement purification
    Giedke, G
    Briegel, HJ
    Cirac, JI
    Zoller, P
    PHYSICAL REVIEW A, 1999, 59 (04): : 2641 - 2648
  • [27] Improved lower and upper bounds for entanglement of formation
    Zhu, Xue-Na
    Fei, Shao-Ming
    PHYSICAL REVIEW A, 2012, 86 (05):
  • [28] Computable measure of entanglement
    Vidal, G
    Werner, RF
    PHYSICAL REVIEW A, 2002, 65 (03): : 1 - 11
  • [29] ALGORITHMIC LOWER BOUNDS FOR PROBLEMS PARAMETERIZED BY CLIQUE-WIDTH
    Fomin, Fedor V.
    Golovach, Petr A.
    Lokshtanov, Daniel
    Saurabh, Saket
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 493 - 502
  • [30] On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models
    Ghosal, Purnata
    Rao, B. V. Raghavendra
    FUNDAMENTA INFORMATICAE, 2020, 177 (01) : 69 - 93
12345