Coherence vectors and correlation matrices are important functions frequently used in physics. The numerical calculation of these functions directly from their definitions, which involves Kronecker products and matrix multiplications, may seem to be a reasonable option. Notwithstanding, as we demonstrate in this paper, some algebraic manipulations before programming can reduce considerably their computational complexity. Besides, we provide Fortran code to generate generalized Gell-Mann matrices and to compute the optimized and unoptimized versions of associated Bloch’s vectors and correlation matrix in the case of bipartite quantum systems. As a code test and application example, we consider the calculation of Hilbert-Schmidt quantum discords.
1. Introduction
Correlation functions are fundamental objects for statistical analysis and are thus ubiquitous in most kinds of scientific inquiries and their applications [1, 2]. In physics, correlation functions have an important role for research in areas such as quantum optics and open systems [3, 4], phase transitions and condensed matter physics [5, 6], and quantum field theory and nuclear and particle physics [7]. Another area in which correlation functions are omnipresent is quantum information science (QIS), an interdisciplinary field that extends the applicability of the classical theories of information, computation, and computational complexity [8–10].
Investigations about the quantum correlations in physical systems have been one of the main catalyzers for developments in QIS [11–15]. There are several guises of quantum correlations, and quantum discord stands among the most promising quantum resources for fueling the quantum advantage [16–26]. When computing or witnessing quantum discord, or other kinds of correlation or quantumness quantifiers, we are frequently faced with the need for calculating coherence vectors and correlation matrices [27–41]. And it is the main aim of this paper to provide formulas for these functions which are amenable for more efficient numerical calculations when compared with the direct implementation of their definitions.
In order to define coherence vectors and correlation matrices, let us consider a composite bipartite system with Hilbert space Hab=Ha⊗Hb. Hereafter, the corresponding dimensions are denoted by ds=dimHs for s=ab,a,b. In addition, let Γjs, with(1)TrΓjs=0,TrΓjsΓks=2δjkbeing a basis for the special unitary group SU(ds). Any density operator describing the state of the system Hab can be written in the local basis Γja⊗Γkb as follows:(2)ρ=1dabIa⊗Ib+∑j=1da2-1ajΓja⊗Ib+Ia⊗∑k=1db2-1bkΓkb+∑j=1da2-1∑k=1db2-1cj,kΓja⊗Γkb,where(3)j=1,…,da2-1,k=1,…,db2-1and Is is the identity operator in Hs. One can readily verify that the components of the coherence (or Bloch’s) vectors a=(a1,…,ada2-1) and b=(b1,…,bdb2-1) and of the correlation matrix C=(cj,k) are given by(4)aj=2-1daTrΓja⊗Ibρ,bk=2-1dbTrIa⊗Γkbρ,cj,k=2-2dabTrΓja⊗Γkbρ.It is worth mentioning that the mean value of any observable in Hs, for s=a,b,ab, can be obtained using these quantities.
In https://github.com/jonasmaziero/LibForQ.git, we provide Fortran code to compute the coherence vectors, correlation matrices, and quantum discord quantifiers we deal with here. Besides these functions, there are other tools therein that may be of interest to the reader. The instructions on how to use the software are provided in the readme file. Related to the content of this section, the subroutine bloch_vector_gellmann_unopt(ds, ρs, s) returns the coherence vectors a or b and the subroutine corrmat_gellmann_unopt(da, db, ρ, C) computes the correlation matrix C. Now, let us notice that if calculated directly from the equations above, for da,db≫1, the computational complexity (CC) to obtain the coherence vectors a and b or the correlation matrix C is(5)CCa=CCb=CCC≈Oda6db6.
The remainder of this paper is structured as follows. In Section 2, we obtain formulas for a, b, and C which are amenable for more efficient numerical computations. In Section 3, we test these formulas by applying them in the calculation of Hilbert-Schmidt quantum discords. In Section 4, we make some final remarks about the usefulness and possible applications of the results reported here.
2. Computing Coherence Vectors and Correlation Matrices
The partial trace function [42] can be used in order to obtain the reduced states ρa=Trb(ρ) and ρb=Tra(ρ) and to write the components of Bloch’s vectors in the form(6)aj=2-1daTrΓjaρa,bk=2-1dbTrΓkbρb.Thus, when computing the coherence vectors of the parties a and b, we shall solve a similar problem; so let us consider it separately. That is to say, we shall regard a generic density operator written as(7)ρs=1dsIs+∑j=1d2-1sjΓjs,where sj=2-1dsTr(ρsΓjs).
Now, and for the remainder of this paper, we assume that the matrix elements of regarded density operator ρ in the standard computational basis are given. We want to compute Bloch’s vector [43]: s=(s1,…,sds2-1). For the sake of doing that, a particular basis Γjs must be chosen. Here we pick the generalized Gell-Mann matrices, which are presented as follows in three groups [44]:(8)Γjs1=2jj+1∑k=1j+1-jδk,j+1kk,for j=1,…,ds-1,Γk,ls2=kl+lk,for 1≤k<l≤ds,Γk,ls3=-ikl-lk,for 1≤k<l≤ds,which are named the diagonal, symmetric, and antisymmetric groups, respectively. The last two groups possess ds(ds-1)/2 generators each. Any one of these matrices can be obtained by calling the subroutine gellmann(ds, g, k, l, Γ(k,l)s(g)). For the first group, g=1, we make j=k and, in this case, one can set l to any integer.
It is straightforward seeing that, for the generators above, the corresponding components of Bloch’s vector can be expressed directly in terms of the matrix elements of the density operator ρs as follows:(9)sj1=ds2jj+1∑k=1j+1-jδk,j+1kρsk,for j=1,…,ds-1,sk,l2=dsRelρsk,for 1≤k<l≤ds,sk,l2=dsImlρsk,for 1≤k<l≤ds.
These expressions were implemented in the Fortran subroutine bloch_vector_gellmann(ds, ρs, s). With this subroutine and the partial trace function [42], we can compute the coherence vectors a and b.
We observe that after these simple algebraic manipulations the computational complexity of Bloch’s vector turns out to be basically the CC for the partial trace function. Hence, from [42], we have that, for da,db≫1,(10)CCa≈Oda2db,CCb≈Odadb2.
One detail we should keep in mind when making use of the codes linked to this paper is the convention we apply to the indexes of the components of s. For the first group of generators, Γjs(1), naturally, j=1,…,ds-1. We continue with the second group of generators, Γjs(2)=Γ(k,l)s(2), by setting j(k,l)=(1,2)=ds-1+1=ds, j(k,l)=(1,3)=ds+1,…,j(k,l)=(1,ds)=2(ds-1), j(k,l)=(2,3)=2(ds-1)+1,…. The same convention is used for the third group of generators, Γjs(3)=Γ(k,l)s(3), but here we begin with j(k,l)=(1,2)=ds-1+2-1ds(ds-1)+1=ds+2-1ds(ds-1).
Next we address the computation of the correlation matrix C=(cj,k), which is a da2-1×(db2-1) matrix that we write in the following form:(11)C=C1,1C1,2C1,3C2,1C2,2C2,3C3,1C3,2C3,3,with the submatrices given as shown below. For convenience, we define the auxiliary variables:(12)ι≔2jj+1,κ≔2kk+1,ς≔dadb4.
The matrix elements of C(1,1), whose dimension is da-1×(db-1), correspond to the diagonal generators for a and diagonal generators for b:(13)cj,k1,1=ςTrΓja1⊗Γkb1ρ=ςικTr∑m=1j+1-jδm,j+1mm⊗∑p=1k+1-kδp,k+1ppρ=ςικ∑m=1j+1∑p=1k+1-jδm,j+1-kδp,k+1Trmm⊗ppρ=ςικ∑m=1j+1∑p=1k+1-jδm,j+1-kδp,k+1mpρmp.
The matrix elements of C(1,2), whose dimension is da-1×2-1db(db-1), correspond to the diagonal generators for a and symmetric generators for b:(14)cj,k1,2=ςTrΓja1⊗Γkb2ρ=ςTrΓja1⊗Γp,qb2ρ=ςTrι∑m=1j+1-jδm,j+1mm⊗pq+qpρ=ςι∑m=1j+1-jδm,j+1Trmpmqρ+Trmqmpρ=ςι∑m=1j+1-jδm,j+1mqρmp+mqρmp∗=2ςι∑m=1j+1-jδm,j+1Remqρmp.
The matrix elements of C(1,3), whose dimension is da-1×2-1db(db-1), correspond to the diagonal generators for a and antisymmetric generators for b:(15)cj,k1,3=ςTrΓja1⊗Γkb3ρ=ςTrΓja1⊗Γp,qb3ρ=-iςιTr∑m=1j+1-jδm,j+1mm⊗pq-qpρ=-iςι∑m=1j+1-jδm,j+1Trmpmqρ-Trmqmpρ=-iςι∑m=1j+1-jδm,j+1mqρmp-mqρmp∗=2ςι∑m=1j+1-jδm,j+1Immqρmp.
The matrix elements of C(2,1), whose dimension is 2-1dada-1×(db-1), correspond to the symmetric generators for a and diagonal generators for b:(16)cj,k2,1=ςTrΓja2⊗Γkb1ρ=ςTrΓm,na2⊗Γkb1ρ=ςTrmn+nm⊗κ∑p=1k+1-kδp,k+1ppρ=ςκ∑p=1k+1-kδp,k+1Trmpnpρ+Trnpmpρ=ςκ∑p=1k+1-kδp,k+1npρmp+npρmp∗=2ςκ∑p=1k+1-kδp,k+1Renpρmp.
The matrix elements of C(2,2), whose dimension is 2-1dada-1×2-1db(db-1), correspond to the symmetric generators for a and symmetric generators for b:(17)cj,k2,2=ςTrΓja2⊗Γkb2ρ=ςTrΓm,na2⊗Γp,qb2ρ=ςTrmn+nm⊗pq+qpρ=ςnqρmp+mqρnp+npρmq+mpρnq=2ςRenqρmp+Renpρmq.
The matrix elements of C(2,3), whose dimension is 2-1dada-1×2-1db(db-1), correspond to the symmetric generators for a and antisymmetric generators for b:(18)cj,k2,3=ςTrΓja2⊗Γkb3ρ=ςTrΓm,na2⊗Γp,qb3ρ=ςTrmn+nm⊗-ipq-qpρ=-iςnqρmp+mqρnp-npρmq-mpρnq=2ςImnqρmp-Imnpρmq.
The matrix elements of C(3,1), whose dimension is 2-1dada-1×(db-1), correspond to the antisymmetric generators for a and diagonal generators for b:(19)cj,k3,1=ςTrΓja3⊗Γkb1ρ=TrΓm,na3⊗Γkb1ρ=ςTr-imn-nm⊗κ∑p=1k+1-kδp,k+1ppρ=-iςκ∑p=1k+1-kδp,k+1npρmp-mpρnp=2ςκ∑p=1k+1-kδp,k+1Imnpρmp.
The matrix elements of C(3,2), whose dimension is 2-1dada-1×2-1db(db-1), correspond to the antisymmetric generators for a and symmetric generators for b:(20)cj,k3,2=ςTrΓja3⊗Γkb2ρ=ςTrΓm,na3⊗Γp,qb2ρ=ςTr-imn-nm⊗pq+qpρ=-iςnqρmp-mpρnq+npρmq-mqρnp=2ςImnqρmp+Imnpρmq.
The matrix elements of C(3,3), whose dimension is 2-1dada-1×2-1db(db-1), correspond to antisymmetric generators for a and antisymmetric generators for b:(21)cj,k3,3=ςTrΓja3⊗Γkb3ρ=ςTrΓm,na3⊗Γp,qb3ρ=ςTr-imn-nm⊗-ipq-qpρ=-ςnqρmp+mpρnq-npρmq-mqρnp=2ςRenpρmq-Renqρmp.
We remark that when implementing these expressions numerically, for the sake of mapping the local to the global computational basis, we utilize, for example,(22)np≡n-1db+p.
The subroutine corrmat_gellmann(da, db, ρ, C) returns the correlation matrix C=(cj,k), as written in (11), associated with the bipartite density operator ρ and computed using the Gell-Mann basis, as described in this section. The convention for the indexes of the matrix elements cj,k is defined in the same way as for the coherence vectors. The computational complexity for C, computed via the optimized expressions obtained in this section, is, for da,db≫1,(23)CCC≈Oda2db2.By generating some random density matrices [45], we checked that the expressions and the corresponding code for the unoptimized and optimized versions of a, b, and C agree. Additional tests shall be presented in the next section, where we calculate some quantum discord quantifiers.
3. Computing Hilbert-Schmidt Quantum Discords
The calculation of quantum discord functions (QD) usually involves hard optimization problems [46, 47]. In the last few years, a large amount of effort has been dedicated towards computing QD analytically, with success being obtained mostly for low-dimensional quantum systems [48–65]. Although not meeting all the required properties for a bona fide QD quantifier [66], the Hilbert-Schmidt discord (HSD) [67],(24)Dhsaρ=minρcqρ-ρcq22,is drawing much attention due to its amenability for analytical computations when compared with most other QD measures. In the last equation, the minimization is performed over the classical-quantum states:(25)ρcq=∑jpjajaj⊗ρjb,with pj being a probability distribution, |aj〉 being an orthonormal basis for Ha, ρjb being generic density operators defined in Hb, and O2≔Tr(O†O) being the Hilbert-Schmidt norm of the linear operator O, with O† being the transpose conjugate of O.
In this paper, as a basic test for the Fortran code provided to obtain coherence vectors and correlation matrices, we shall compute the following lower bound for the HSD [68]:(26)Dhsaρ=∑j=dada2-1λja,where λja are the eigenvalues, sorted in nonincreasing order, of the da2-1×(da2-1) matrix:(27)Ξa=2da2dbaat+2dbCCt.In the above equation, t stands for the transpose of a vector or matrix. We observe that the other version of the HSD, Dhsb, can be obtained from the above equations simply by exchanging a and b and using CtC instead of CCt.
It is interesting that, as was proved in [69], a bipartite state ρ, with polarization vectors a and b and correlation matrix C, is classical-quantum if and only if there exists a (da-1)-dimensional projector Πa in the space Rda2-1 such that(28)Πaa=a,ΠaC=C.Based on this fact, an ameliorated version for the Hilbert-Schmidt quantum discord (AHSD) was proposed [69]:(29)Dhsaaρ≔minΠaΥa-ΠaΥa22, with the matrix Υa defined as(30)Υa≔2da2dbfbagb2dbC,where f and g are arbitrary functions of b≡b2. Then, by setting f(b)=g(b)=P(ρb) and using the purity,(31)Pρb≔Trρb2∑j,kρj,kb2,to address the problem of noncontractivity of the Hilbert-Schmidt distance, the following analytical formula was presented [69]:(32)Dhsaaρ=1Pρb∑j=dada2-1λja=DhsaρPρb.
Thus both discord quantifiers Dhsa and Dhsaa are, at the end of the day, obtained from the eigenvalues λja. And the computation of these eigenvalues requires the knowledge of the coherence vector a (or b) and of the correlation matrix C. These QD measures were implemented in the Fortran functions discord_hs(ssys, da, db, ρ) and discord_hsa(ssys, da, db, ρ), where ssys = ”s”, with s=a,b, specifies which version of the quantum discord is to be computed. As an example, let us use the formulas provided in this paper and the associated code to compute the HSD and AHSD of Werner states in Ha⊗Hb (with da=db): (33)ρw=da-wdada2-1Ia⊗Ib+daw-1dada2-1F,where w∈[-1,1] and F=∑j,k=1dajkkj. The reduced states of ρw are Is/ds, whose purity is P(ρs)=1/ds. The results for the HSD and AHSD of ρw are presented in Figure 1.
The points are the values of the ameliorated Hilbert-Schmidt quantum discord of Werner states computed numerically using (32). The lines are the corresponding values of the AHSD plotted via the analytical formula: Dhsaa(ρw)=daDhsa(ρw)=(daw-1)2/((da-1)(da+1)2). Due to the symmetry of ρw, here Dhsaa(ρw)=Dhsab(ρw). In the inset the difference between the times taken by the two methods to compute the AHSD for a fixed value of da is shown. We see clearly here that our optimized algorithm gives an exponential speedup against the brute force calculation of Bloch’s vectors and correlation matrix.
4. Concluding Remarks
In this paper, we addressed the problem of computing coherence vectors and correlations matrices. We obtained formulas for these functions which make possible considerably more efficient numerical implementation when compared with the direct use of their definitions. We provided Fortran code to calculate all the quantities regarded in this paper. As a test for our formulas and code, we computed Hilbert-Schmidt quantum discords of Werner states. It is important to observe that although our focus here was in quantum information science, the tools provided can find application in other areas, such as the calculation of order parameters and correlations functions for the study of phase transitions in discrete quantum or classical systems.
Competing Interests
The author declares that there are no competing interests regarding the publication of this paper.
Acknowledgments
This work was supported by the following Brazilian funding agencies: Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) (Processes 441875/2014-9 and 303496/2014-2), Instituto Nacional de Ciência e Tecnologia de Informação Quântica (INCT-IQ) (Process 2008/57856-6), and Coordenação de Desenvolvimento de Pessoal de Nível Superior (CAPES) (Process 6531/2014-08). The author gratefully acknowledges the hospitality of the Physics Institute and Laser Spectroscopy Group at Universidad de la República, Uruguay.
JaynesE. T.2003New York, NY, USACambridge University Press10.1017/cbo9780511790423MR1992316CarltonM. A.DevoreJ. L.2014New York, NY, USASpringerSpringer Texts in Statistics10.1007/978-1-4939-0395-5MR3288497GerryC.KnightP.2005New York, NY, USACambridge University PressBreuerH.-P.PetruccioneF.2002New York, NY, USAOxford University PressMR2012610SachdevS.2011New York, NY, USACambridge University Press10.1017/cbo9780511973765MR2789712HutchinsonJ.KeatingJ. P.MezzadriF.On relations between one-dimensional quantum and two-dimensional classical spin systems201520151865202610.1155/2015/652026MR34372992-s2.0-84953911128Álvarez-GauméL.Vázquez-MozoM.2012Berlin, GermanySpringer10.1007/978-3-642-23728-7MR30144732-s2.0-84855181102NielsenM. A.ChuangI. L.2000Cambridge, UKCambridge University PressMR1796805PreskillJ.Quantum Information and Computation, http://theory.caltech.edu/people/preskill/ph229/WildeM. M.2013Cambridge, UKCambridge University Press10.1017/cbo9781139525343MR3088659ReidM. D.DrummondP. D.BowenW. P.CavalcantiE. G.LamP. K.BachorH. A.AndersenU. L.LeuchsG.The Einstein-Podolsky-Rosen paradox: from concepts to applications20098141727175110.1103/RevModPhys.81.1727HorodeckiR.HorodeckiP.HorodeckiM. H.Quantum entanglement200981286594210.1103/RevModPhys.81.865MR2515619ZBL1205.810122-s2.0-67649480613LiM.FeiS.-M.Li-JostX.Quantum entanglement: separability, measure, fidelity of teleportation, and distillation201020105730107210.1155/2010/301072MR2600780CéleriL. C.MazieroJ.SerraR. M.Theoretical and experimental aspects of quantum discord and related measures201197-81837187310.1142/s0219749911008374MR29483652-s2.0-83055167259ModiK.BrodutchA.CableH.PaterekT.VedralV.The classical-quantum boundary for correlations: discord and related measures2012844, article 165510.1103/revmodphys.84.16552-s2.0-84870218896Soares-PintoD. O.AuccaiseR.MazieroJ.Gavini-VianaA.SerraR. M.CéleriL. C.On the quantumness of correlations in nuclear magnetic resonance201237019764821483610.1098/rsta.2011.03642-s2.0-84866402280ÁvilaM.SunG. H.Salas-BritoA. L.Scales of time where the quantum discord allows an efficient execution of the DQC1 algorithm20142014436790510.1155/2014/3679052-s2.0-84899532270StreltsovA.2015Springer Briefs in PhysicsDattaA.ShajiA.CavesC. M.Quantum discord and the power of one qubit2008100505050210.1103/physrevlett.100.0505022-s2.0-38949118027CavalcantiD.AolitaL.BoixoS.ModiK.PianiM.WinterA.Operational interpretations of quantum discord20118303232410.1103/physreva.83.0323242-s2.0-79957959673PirandolaS.Quantum discord as a resource for quantum cryptography20144, article 695610.1038/srep069562-s2.0-84923323330RoaL.RetamalJ. C.Alid-VaccarezzaM.Dissonance is required for assisted optimal state discrimination2011107808040110.1103/physrevlett.107.0804012-s2.0-84860389136PianiM.NarasimhacharV.CalsamigliaJ.Quantumness of correlations, quantumness of ensembles and quantum data hiding20141611300110.1088/1367-2630/16/11/1130012-s2.0-84910141985DakićB.LippY. O.MaX.RingbauerM.KropatschekS.BarzS.PaterekT.VedralV.ZeilingerA.BruknerČ.WaltherP.Quantum discord as resource for remote state preparation20128966667010.1038/nphys23772-s2.0-84865755455GirolamiD.SouzaA. M.GiovannettiV.TufarelliT.FilgueirasJ. G.SarthourR. S.Soares-PintoD. O.OliveiraI. S.AdessoG.Quantum discord determines the interferometric power of quantum states20141122121040110.1103/PhysRevLett.112.2104012-s2.0-84901660706ChuanT. K.MaillardJ.ModiK.PaterekT.PaternostroM.PianiM.Quantum discord bounds the amount of distributed entanglement2012109707050110.1103/physrevlett.109.0705012-s2.0-84865203252MazieroJ.SerraR. M.Classicality witness for two-qubit states20121038125002810.1142/s0219749912500281MR29428722-s2.0-84861474625AuccaiseR.MazieroJ.CéleriL. C.Soares-PintoD. O.DeazevedoE. R.BonagambaT. J.SarthourR. S.OliveiraI. S.SerraR. M.Experimentally witnessing the quantumness of correlations2011107707050110.1103/PhysRevLett.107.0705012-s2.0-80051478086PaulaF. M.SilvaI. A.MontealegreJ. D.SouzaA. M.DeazevedoE. R.SarthourR. S.SaguiaA.OliveiraI. S.Soares-PintoD. O.AdessoG.SarandyM. S.Observation of environment-induced double sudden transitions in geometric quantum correlations20131112525040110.1103/PhysRevLett.111.2504012-s2.0-84890594268SilvaI. A.GirolamiD.AuccaiseR.SarthourR. S.OliveiraI. S.BonagambaT. J.DeazevedoE. R.Soares-PintoD. O.AdessoG.Measuring bipartite quantum correlations of an unknown state20131101414050110.1103/physrevlett.110.1405012-s2.0-84876012091AguilarG. H.Jiménez FaríasO.MazieroJ.SerraR. M.Souto RibeiroP. H.WalbornS. P.Experimental estimate of a classicality witness via a single measurement2012108606360110.1103/PhysRevLett.108.0636012-s2.0-84856914496BayatA.BoseS.Entanglement transfer through an antiferromagnetic spin chain201020101112718210.1155/2010/127182MR2576351CianciarusoM.BromleyT. R.RogaW.Lo FrancoR.AdessoG.Universal freezing of quantum correlations within the geometric approach201551017710.1038/srep101772-s2.0-84930959059BromleyT. R.CianciarusoM.Lo FrancoR.AdessoG.Unifying approach to the quantification of bipartite correlations by Bures distance201447402040530210.1088/1751-8113/47/40/405302MR32647582-s2.0-84907918186AaronsonB.FrancoR. L.CompagnoG.AdessoG.Hierarchy and dynamics of trace distance correlations20131509302210.1088/1367-2630/15/9/0930222-s2.0-84885045488AaronsonB.Lo FrancoR.AdessoG.Comparative investigation of the freezing phenomena for quantum correlations under nondissipative decoherence201388101212010.1103/physreva.88.0121202-s2.0-84880638717BellomoB.GiorgiG. L.GalveF.Lo FrancoR.CompagnoG.ZambriniR.Unified view of correlations using the square-norm distance201285303210410.1103/physreva.85.0321042-s2.0-84857964288BellomoB.Lo FrancoR.CompagnoG.Dynamics of geometric and entropic quantifiers of correlations in open quantum systems201286101231210.1103/physreva.86.0123122-s2.0-84863826351Lo FrancoR.BellomoB.AnderssonE.CompagnoG.Revival of quantum correlations without system-environment back-action201285303231810.1103/physreva.85.0323182-s2.0-84858397675XuJ.-S.SunK.LiC.-F.XuX.-Y.GuoG.-C.AnderssonE.Lo FrancoR.CompagnoG.Experimental recovery of quantum correlations in absence of system-environment back-action20134, article 285110.1038/ncomms38512-s2.0-84889256896FrancoR. L.BellomoB.ManiscalcoS.CompagnoG.Dynamics of quantum correlations in two-qubit systems within non-Markovian environments2013271–320134505310.1142/s0217979213450537MR30002192-s2.0-84872369435MazieroJ.Computing partial traces and reduced density matriceshttp://arxiv.org/abs/1601.07458BrüningE.MäkeläH.MessinaA.PetruccioneF.Parametrizations of density matrices201259112010.1080/09500340.2011.632097MR28727732-s2.0-84856917736BertlmannR. A.KrammerP.Bloch vectors for qudits200841232123530310.1088/1751-8113/41/23/235303MR24545202-s2.0-44449115679MazieroJ.Fortran code for generating random probability vectors, unitaries, and quantum states20163, article 410.3389/fict.2016.00004HuangY.Computing quantum discord is NP-complete20141603302710.1088/1367-2630/16/3/033027MR31944882-s2.0-84898007514ChandaT.DasT.SadhukhanD.PalA. K.Sen DeA.SenU.Reducing computational complexity of quantum correlations201592606230110.1103/physreva.92.0623012-s2.0-84950121126LuoS.Quantum discord for two-qubit systems20087704230310.1103/physreva.77.0423032-s2.0-41749110247LuoS.ZhangQ.Observable correlations in two-qubit states2009136116517710.1007/s10955-009-9779-0MR25252342-s2.0-70349314942AliM.RauA. R. P.AlberG.Quantum discord for two-qubit X states201081042105MazieroJ.CeleriL. C.SerraR. M.Symmetry aspects of quantum discordhttps://arxiv.org/abs/1004.2082GirolamiD.AdessoG.Quantum discord for general two-qubit states: analytical progress201183505210810.1103/physreva.83.0521082-s2.0-79961088444ChenQ.ZhangC.YuS.YiX. X.OhC. H.Quantum discord of two-qubit X state201184404231310.1103/physreva.84.042313HassanA. S. M.LariB.JoagP. S.Tight lower bound to the geometric measure of quantum discord201285202430210.1103/physreva.85.0243022-s2.0-84856915685CiccarelloF.TufarelliT.GiovannettiV.Toward computability of trace distance discord20141601303810.1088/1367-2630/16/1/0130382-s2.0-84894180012SpehnerD.OrszagM.Geometric quantum discord with Bures distance: the qubit case20144732003530210.1088/1751-8113/47/3/035302MR31508552-s2.0-84891459891JafarizadehM. A.KarimiN.ZahirH.Quantum discord for generalized bloch sphere states2014685, article 13610.1140/epjd.e2014-40677-62-s2.0-84902072970DaoudM.Ahl LaamaraR.SeddikS.Hilbert-Schmidt measure of pairwise quantum discord for three-qubit X states201576220723010.1016/s0034-4877(15)30030-6MR3427700BeggiA.BuscemiF.BordoneP.Analytical expression of genuine tripartite quantum discord for symmetrical X-states201514257359210.1007/s11128-014-0882-zMR33048812-s2.0-84925487724WangY.-K.JingN.FeiS.-M.WangZ.-X.CaoJ.-P.FanH.One-way deficit of two-qubit X states20151472487249710.1007/s11128-015-1005-12-s2.0-84930758767MaZ.ChenZ.FanchiniF. F.FeiS.-M.Quantum discord for d 2 systems201551026210.1038/srep102622-s2.0-84930670539JingN.ZhangX.WangY.-K.Comment on: oneway deficit of two qubit X states2015144511452110.1007/s11128-015-1132-8LiG.LiuY.TangH.YinX.ZhangZ.Analytic expression of quantum correlations in qutrit Werner states undergoing local and nonlocal unitary operations201514255957210.1007/s11128-014-0888-6MR3304880ZBL1311.810322-s2.0-84925539800ObandoP. C.PaulaF. M.SarandyM. S.Trace-distance correlations for X states and the emergence of the pointer basis in Markovian and non-Markovian regimes201592303230710.1103/physreva.92.0323072-s2.0-84941895992HuangY.Quantum discord for two-qubit X states: analytical formula with very small worst-case error201388101430210.1103/physreva.88.0143022-s2.0-84880581635BrodutchA.ModiK.Criteria for measures of quantum correlations2012129-10, article 0721MR3014706DakićB.VedralV.BruknerC.Necessary and sufficient condition for nonzero quantum discord20101051919050210.1103/physrevlett.105.1905022-s2.0-78149319038LuoS.FuS.Geometric measure of quantum discord2010823403430210.1103/physreva.82.034302MR2772007AkhtarshenasS. J.MohammadiH.KarimiS.AzmiZ.Computable measure of quantum correlation201514124726710.1007/s11128-014-0839-2MR32963172-s2.0-84920575638