Super-exponential distinguishability of correlated quantum states

被引:0
|
作者
Bunth, Gergely [1 ,2 ]
Maroti, Gabor [1 ,2 ]
Mosonyi, Milan [1 ,2 ]
Zimboras, Zoltan [1 ,3 ]
机构
[1] MTA BME Lendulet Quantum Informat Theory Res Grp, Budapest, Hungary
[2] Budapest Univ Technol & Econ, Inst Math, Dept Anal, Muegyet Rkp 3, H-1111 Budapest, Hungary
[3] Wigner Res Ctr Phys, POB 49, H-1525 Budapest, Hungary
关键词
State discrimination; Fermionic quasi-free states; XX model; Renyi divergences;
D O I
10.1007/s11005-022-01620-4
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
In the problem of asymptotic binary i.i.d. state discrimination, the optimal asymptotics of the type I and the type II error probabilities is in general an exponential decrease to zero as a function of the number of samples; the set of achievable exponent pairs is characterized by the quantum Hoeffding bound theorem. A super-exponential decrease for both types of error probabilities is only possible in the trivial case when the two states are orthogonal and hence can be perfectly distinguished using only a single copy of the system. In this paper, we show that a qualitatively different behavior can occur when there is correlation between the samples. Namely, we use gauge-invariant and translation-invariant quasi-free states on the algebra of the canonical anti-commutation relations to exhibit pairs of states on an infinite spin chain with the properties that (a) all finite-size restrictions of the states have invertible density operators and (b) the type I and the type II error probabilities both decrease to zero at least with the speed e(-nc log n) with some positive constant c, i.e., with a super-exponential speed in the sample size n. Particular examples of such states include the ground states of the X X model corresponding to different transverse magnetic fields. In fact, we prove our result in the setting of binary composite hypothesis testing, and hence, it can be applied to prove super-exponential distinguishability of the hypotheses that the transverse magnetic field is above a certain threshold vs. that it is below a strictly lower value.
引用
收藏
页数:25
相关论文
共 50 条
  • [31] A new gradient search interpretation of super-exponential algorithm
    Li, XL
    IEEE SIGNAL PROCESSING LETTERS, 2006, 13 (03) : 173 - 176
  • [32] Super-exponential 2-dimensional Dehn functions
    Barnard, Josh
    Brady, Noel
    Dani, Pallavi
    GROUPS GEOMETRY AND DYNAMICS, 2012, 6 (01) : 1 - 51
  • [33] SUPER-EXPONENTIAL CONVOLUTION KERNELS ON R-TAU
    CHOQUET, G
    COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES SERIE A, 1979, 288 (19): : 903 - 905
  • [34] Super-exponential decay of solutions to differential equations in Rd
    Buzano, Ernesto
    Modern Trends in Pseudo-Differential Operators, 2007, 172 : 117 - 133
  • [35] Performance analysis of a recursive fractional super-exponential algorithm
    Gomes, J
    Barroso, V
    ICASSP '99: 1999 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, PROCEEDINGS VOLS I-VI, 1999, : 2483 - 2486
  • [36] The number of boundedly generated semigroups is super-exponential in the cardinality
    Be’eri Greenfeld
    Semigroup Forum, 2018, 96 : 600 - 602
  • [37] The number of boundedly generated semigroups is super-exponential in the cardinality
    Greenfeld, Be'eri
    SEMIGROUP FORUM, 2018, 96 (03) : 600 - 602
  • [38] There exist graphs with super-exponential Ramsey multiplicity constant
    Fox, Jacob
    JOURNAL OF GRAPH THEORY, 2008, 57 (02) : 89 - 98
  • [39] Distinguishability of generic quantum states
    Puchala, Zbigniew
    Pawela, Lukasz
    Zyczkowski, Karol
    PHYSICAL REVIEW A, 2016, 93 (06)
  • [40] On the Distinguishability of Random Quantum States
    Ashley Montanaro
    Communications in Mathematical Physics, 2007, 273 : 619 - 636