PhyslibSearch

QuantumInfo.Finite.Entropy.SSA

43 declarations

definition

Operator norm Aop\|A\|_{\text{op}} of a matrix AA

#opNorm

For a matrix AMm×n(k)A \in M_{m \times n}(\mathbf{k}) over a field k\mathbf{k} (where k\mathbf{k} is R\mathbb{R} or C\mathbb{C}), let LA:2n2mL_A: \ell_2^n \to \ell_2^m be the associated linear map between Euclidean spaces. The operator norm Aop\|A\|_{\text{op}} is defined as the operator norm of LAL_A viewed as a continuous linear map, which is given by Aop=supx21Ax2\|A\|_{\text{op}} = \sup_{\|x\|_2 \le 1} \|Ax\|_2.

theorem

AA is an Isometry     Ax=x\implies \|Ax\| = \|x\|

#isometry_preserves_norm

Let AA be an n×mn \times m matrix over a field k\mathbb{k} (where k\mathbb{k} is R\mathbb{R} or C\mathbb{C}). If AA is an isometry, then for any vector xx in the mm-dimensional Euclidean space km\mathbb{k}^m, the norm of the image of xx under the linear map defined by AA is equal to the norm of xx, i.e., Ax=x\|Ax\| = \|x\|.

theorem

The operator norm of an isometry is 1

#opNorm_isometry

Let AA be a matrix of size n×mn \times m over the field K\mathbb{K} (where K\mathbb{K} is R\mathbb{R} or C\mathbb{C}), and suppose the column dimension mm is non-empty. If AA is an isometry, then its operator norm Aop\|A\|_{\text{op}} is equal to 11.

definition

Matrix representation of the map vvkkkv \mapsto v \otimes \sum_k |k\rangle|k\rangle

#map_to_tensor_MES

Let d1d_1 and d2d_2 be dimensions. The matrix MC((d1×d2)×d2)×d1M \in \mathbb{C}^{((d_1 \times d_2) \times d_2) \times d_1} is defined such that its entries are given by M((i,j),k),l={1if i=l and j=k0otherwise M_{((i, j), k), l} = \begin{cases} 1 & \text{if } i = l \text{ and } j = k \\ 0 & \text{otherwise} \end{cases} for indices i,l{1,,d1}i, l \in \{1, \dots, d_1\} and j,k{1,,d2}j, k \in \{1, \dots, d_2\}. This matrix represents the linear map vvkkkv \mapsto v \otimes \sum_k |k\rangle|k\rangle, which maps a vector in Cd1\mathbb{C}^{d_1} to a tensor product of itself and a maximally entangled state (MES) basis sum in Cd2Cd2\mathbb{C}^{d_2} \otimes \mathbb{C}^{d_2}.

theorem

Trace property of `map_to_tensor_MES` using Kronecker product with Identity

#map_to_tensor_MES_prop

Let AA be a complex matrix of size (d1×d2)×(d1×d2)(d_1 \times d_2) \times (d_1 \times d_2). Let MM be the matrix `map_to_tensor_MES` of size ((d1×d2)×d2)×d1((d_1 \times d_2) \times d_2) \times d_1. Then the product M(AId2)MM^* (A \otimes I_{d_2}) M is equal to the partial trace of AA over the second system, denoted as Tr2(A)\text{Tr}_2(A), where MM^* denotes the conjugate transpose and Id2I_{d_2} is the d2×d2d_2 \times d_2 identity matrix.

definition

The isometry VρV_{\rho} for quantum relative entropy generalizations

#V_rho

Let ρAB\rho_{AB} be a Hermitian matrix acting on the Hilbert space HAHB\mathcal{H}_A \otimes \mathcal{H}_B, where dAd_A and dBd_B denote the dimensions of the respective subspaces. The isometry VρV_{\rho} is the matrix in C(dA×dB)×dB,dA\mathbb{C}^{(d_A \times d_B) \times d_B, d_A} defined by Vρ=(ρABIB)MρA1V_{\rho} = (\sqrt{\rho_{AB}} \otimes I_B) \cdot M \cdot \sqrt{\rho_A^{-1}} where: - ρA=TrB(ρAB)\rho_A = \text{Tr}_B(\rho_{AB}) is the partial trace of ρAB\rho_{AB} over the system BB. - ρA1\sqrt{\rho_A^{-1}} is the principal square root of the inverse of ρA\rho_A. - IBI_B is the identity matrix of size dBd_B. - \otimes denotes the Kronecker product (tensor product). - MM is the fixed linear map `map_to_tensor_MES` mapping dA(dA×dB)×dBd_A \to (d_A \times d_B) \times d_B related to the maximally entangled state.

definition

The Isometry VσV_\sigma for the matrix σBC\sigma_{BC}

#V_sigma

Given a Hermitian matrix σBC\sigma_{BC} acting on the Hilbert space HBHC\mathcal{H}_B \otimes \mathcal{H}_C, the map VσV_\sigma is an operator (represented as a matrix) from HC\mathcal{H}_C to HB(HBHC)\mathcal{H}_B \otimes (\mathcal{H}_B \otimes \mathcal{H}_C). It is defined by applying the construction VρV_\rho to the permuted matrix σCB\sigma_{CB} and reindexing the resulting components to match the tensor product structure dB×(dB×dC)dB \times (dB \times dC). This isometry is a key component in the proofs of quantum relative entropy inequalities, specifically for establishing strong subadditivity (SSA).

theorem

VρVρ=ρA1/2TrB(ρAB)ρA1/2V_\rho^\dagger V_\rho = \rho_A^{-1/2} \text{Tr}_B(\rho_{AB}) \rho_A^{-1/2}

#V_rho_conj_mul_self_eq

Let ρAB\rho_{AB} be a positive definite Hermitian matrix on the tensor product space CdACdB\mathbb{C}^{d_A} \otimes \mathbb{C}^{d_B}. Let ρA=TrB(ρAB)\rho_A = \text{Tr}_B(\rho_{AB}) be the partial trace of ρAB\rho_{AB} over the system BB, and let ρA1/2\rho_A^{-1/2} denote the square root of the inverse of ρA\rho_A. Then the product of the adjoint of the isometry-like matrix Vρ(ρAB)V_\rho(\rho_{AB}) with itself satisfies Vρ(ρAB)Vρ(ρAB)=ρA1/2TrB(ρAB)ρA1/2V_\rho(\rho_{AB})^\dagger V_\rho(\rho_{AB}) = \rho_A^{-1/2} \text{Tr}_B(\rho_{AB}) \rho_A^{-1/2}.

theorem

The partial trace TrB\text{Tr}_B preserves positive definiteness

#PosDef_traceRight

Let AA be a positive definite Hermitian matrix acting on the tensor product space CdACdB\mathbb{C}^{d_A} \otimes \mathbb{C}^{d_B}, where the dimension dBd_B is non-zero. Then its partial trace over the right system BB, denoted as TrB(A)\text{Tr}_B(A), is also a positive definite matrix.

theorem

Partial Trace over the Left Subsystem Preserves Positive Definiteness

#PosDef_traceLeft

Let AA be a Hermitian matrix acting on the tensor product space CdACdB\mathbb{C}^{d_A} \otimes \mathbb{C}^{d_B}. If the dimension dAd_A is non-zero (i.e., the type dAd_A is `Nonempty`) and AA is positive definite (A0A \succ 0), then its partial trace over the first subsystem, denoted by TrA(A)\text{Tr}_A(A), is also a positive definite matrix.

theorem

VρV_\rho is an isometry: VρVρ=IV_\rho^\dagger V_\rho = I

#V_rho_isometry

Let ρAB\rho_{AB} be a positive definite Hermitian matrix acting on the bipartite Hilbert space HAHB\mathcal{H}_A \otimes \mathcal{H}_B, where the dimension of system BB is non-zero (dB>0d_B > 0). Let VρV_{\rho} be the isometry operator associated with ρAB\rho_{AB}. Then, the product of the conjugate transpose of VρV_{\rho} and itself is the identity matrix, i.e., (Vρ)Vρ=I(V_{\rho})^\dagger V_{\rho} = I.

theorem

VσV_{\sigma} is an isometry for positive definite σBC\sigma_{BC}

#V_sigma_isometry

Let HB\mathcal{H}_B and HC\mathcal{H}_C be finite-dimensional Hilbert spaces with dimensions dBd_B and dCd_C respectively, such that dB>0d_B > 0. For any positive definite Hermitian matrix σBC\sigma_{BC} acting on HBHC\mathcal{H}_B \otimes \mathcal{H}_C, the matrix VσV_{\sigma} satisfies the isometry condition (Vσ)Vσ=I(V_{\sigma})^\dagger V_{\sigma} = \mathbb{I}, where (Vσ)(V_{\sigma})^\dagger denotes the conjugate transpose and I\mathbb{I} is the identity matrix on HC\mathcal{H}_C.

definition

The matrix operator WW for the Strong Subadditivity (SSA) proof infrastructure

#W_mat

Given two Hermitian matrices ρAB\rho_{AB} acting on the Hilbert space HAHB\mathcal{H}_A \otimes \mathcal{H}_B and σBC\sigma_{BC} acting on HBHC\mathcal{H}_B \otimes \mathcal{H}_C, the operator WW is defined as the square matrix of size (dA×dB×dC)(d_A \times d_B \times d_C) given by the product: W=(ρABσC1)(ρA1σBC)W = (\sqrt{\rho_{AB}} \otimes \sqrt{\sigma_{C}^{-1}}) \cdot (\sqrt{\rho_{A}^{-1}} \otimes \sqrt{\sigma_{BC}}) where: - ρA=TrB(ρAB)\rho_A = \text{Tr}_B(\rho_{AB}) is the partial trace of ρAB\rho_{AB} over system BB. - σC=TrB(σBC)\sigma_C = \text{Tr}_B(\sigma_{BC}) is the partial trace of σBC\sigma_{BC} over system BB. - \sqrt{\cdot} and ()1(\cdot)^{-1} denote the principal matrix square root and matrix inverse respectively. - The second term is reindexed to ensure compatibility with the tensor product structure of the first term on the composite space HAHBHC\mathcal{H}_A \otimes \mathcal{H}_B \otimes \mathcal{H}_C.

theorem

Submultiplicativity of Matrix Operator Norm

#opNorm_mul_le

Let AA be an l×ml \times m matrix and BB be an m×nm \times n matrix over a field K\mathbb{K} (where K\mathbb{K} is either R\mathbb{R} or C\mathbb{C}). The operator norm op\| \cdot \|_{\text{op}} satisfies the submultiplicative property: ABopAopBop\|A \cdot B\|_{\text{op}} \le \|A\|_{\text{op}} \cdot \|B\|_{\text{op}} where the operator norm is the induced norm from the Euclidean space.

theorem

The Operator Norm Aop\|A\|_{\text{op}} is Invariant Under Reindexing Rows and Columns

#opNorm_reindex_proven

Let AA be an m×nm \times n matrix over a field K\mathbb{K} (where K\mathbb{K} is R\mathbb{R} or C\mathbb{C}). Given bijections (equivalences) e:mle: m \simeq l and f:npf: n \simeq p, let AA' be the l×pl \times p matrix obtained by reindexing the rows and columns of AA according to ee and ff respectively. Then the operator norm of the reindexed matrix is equal to the operator norm of the original matrix, i.e., Aop=Aop\|A'\|_{\text{op}} = \|A\|_{\text{op}}.

definition

Kronecker product Uρ=VρIdCU_\rho = V_\rho \otimes I_{d_C}

#U_rho

Let ρAB\rho_{AB} be a Hermitian matrix acting on the Hilbert space HAHB\mathcal{H}_A \otimes \mathcal{H}_B with dimensions dA×dBd_A \times d_B. We define the operator UρU_\rho as the Kronecker product (tensor product) of the matrix VρV_\rho and the identity matrix IdCI_{d_C} of dimension dC×dCd_C \times d_C: Uρ=VρIdCU_\rho = V_\rho \otimes I_{d_C} where VρV_\rho is a matrix of size ((dA×dB)×dB)×dA((d_A \times d_B) \times d_B) \times d_A. The resulting matrix UρU_\rho maps from the space of dimension dA×dCd_A \times d_C to the space of dimension (dA×dB×dB)×dC(d_A \times d_B \times d_B) \times d_C.

definition

The operator Uσ=IAVσU_\sigma = I_A \otimes V_\sigma

#U_sigma

Given a Hermitian matrix σBC\sigma_{BC} acting on the Hilbert space CdBCdC\mathbb{C}^{d_B} \otimes \mathbb{C}^{d_C}, we define the matrix UσU_\sigma as the Kronecker product of the identity matrix IAI_A (of dimension dA×dAd_A \times d_A) and the matrix Vσ(σBC)V_\sigma(\sigma_{BC}). Specifically, Uσ=IAVσU_\sigma = I_A \otimes V_\sigma, resulting in a matrix of size (dAdBdBdC)×(dAdC)(d_A \cdot d_B \cdot d_B \cdot d_C) \times (d_A \cdot d_C). This construction serves as a helper operator for proving Strong Subadditivity (SSA) and operator inequalities in quantum information theory.

theorem

AH=A\|A^H\| = \|A\|

#opNorm_conjTranspose_eq_opNorm

Let AA be an m×nm \times n matrix over a field k\mathbb{k} (where k\mathbb{k} is R\mathbb{R} or C\mathbb{C}). The operator norm of the conjugate transpose of AA, denoted as AH\|A^{H}\|, is equal to the operator norm of AA, denoted as A\|A\|.

theorem

VV=I    VVIV^\dagger V = I \implies V V^\dagger \le I for complex matrices

#isometry_mul_conjTranspose_le_one

Let VV be an m×nm \times n matrix over the complex numbers C\mathbb{C}. If VV is an isometry, such that VV=IV^\dagger V = I (where VV^\dagger denotes the conjugate transpose and II is the identity matrix), then VVIV V^\dagger \le I in terms of the Loewner partial order (i.e., IVVI - V V^\dagger is a positive semi-definite matrix).

theorem

The product of two isometries ABA^\dagger B satisfies (AB)(AB)I(A^\dagger B)^\dagger (A^\dagger B) \le I

#conjTranspose_isometry_mul_isometry_le_one

Let AA be a k×mk \times m complex matrix and BB be a k×nk \times n complex matrix. If both AA and BB are isometries (meaning AA=ImA^\dagger A = I_m and BB=InB^\dagger B = I_n, where \dagger denotes the conjugate transpose), then the product of the conjugate transpose of ABA^\dagger B with itself satisfies (AB)(AB)In(A^\dagger B)^\dagger (A^\dagger B) \le I_n in the sense of the Loewner partial order on positive semidefinite matrices.

theorem

A.reindex(e)B.reindex(e)    ABA.reindex(e) \le B.reindex(e) \iff A \le B

#reindex_le_reindex_iff

Let dd and d2d_2 be finite types. For any equivalence e:dd2e : d \simeq d_2 and any Hermitian matrices A,BHermitianMat(d,C)A, B \in \text{HermitianMat}(d, \mathbb{C}), the inequality A.reindex(e)B.reindex(e)A.reindex(e) \le B.reindex(e) holds if and only if ABA \le B, where the inequality denotes the Loewner order (positivity of the difference) and the reindexing is the transformation of matrices under the coordinate change provided by ee.

theorem

(AB)1=A1B1(A \otimes B)^{-1} = A^{-1} \otimes B^{-1} for Hermitian Matrices

#inv_kronecker

Let AA be a non-singular Hermitian matrix of size m×mm \times m and BB be a non-singular Hermitian matrix of size n×nn \times n over the complex numbers C\mathbb{C}. The inverse of their Kronecker product is equal to the Kronecker product of their inverses, i.e., (AB)1=A1B1(A \otimes B)^{-1} = A^{-1} \otimes B^{-1}.

theorem

Matrix Inversion Commutes with Reindexing

#inv_reindex

Let AA be a Hermitian matrix with complex entries indexed by a finite set dd, and let e:dd2e: d \simeq d_2 be a bijection to another finite index set d2d_2. The inverse of the reindexed matrix AA is equal to the reindexing of the inverse matrix A1A^{-1} using the same bijection ee. That is, (A.reindex e)1=A1.reindex e(A.reindex \ e)^{-1} = A^{-1}.reindex \ e.

theorem

The Kronecker product of positive definite Hermitian matrices ABA \otimes B is positive definite

#PosDef_kronecker

Let AA be a Hermitian matrix of size m×mm \times m and BB be a Hermitian matrix of size n×nn \times n over the complex numbers C\mathbb{C}. If AA is positive definite and BB is positive definite, then their Kronecker product ABA \otimes B is also positive definite.

theorem

Positive Definiteness is Invariant under Matrix Reindexing

#PosDef_reindex

Let AA be a Hermitian matrix of size d×dd \times d over the complex numbers C\mathbb{C}. If AA is positive definite (A0A \succ 0) and e:dd2e: d \simeq d_2 is an equivalence (reindexing) between the index sets dd and d2d_2, then the reindexed matrix AA' (where Ai,j=Ae1(i),e1(j)A'_{i,j} = A_{e^{-1}(i), e^{-1}(j)}) is also positive definite.

abbrev

The index type ((dA×dB)×dB)×(dB×dC)((d_A \times d_B) \times d_B) \times (d_B \times d_C)

#BigIdx

Given three types dA,dB,d_A, d_B, and dCd_C, the type BigIdx\text{BigIdx} is defined as the product type ((dA×dB)×dB)×(dB×dC)((d_A \times d_B) \times d_B) \times (d_B \times d_C). This structure represents a specific indexing set used in the context of quantum relative entropy and operator inequalities, notably for proving Strong Subadditivity (SSA).

abbrev

The index type (dA×dB)×dC(d_A \times d_B) \times d_C

#SmallIdx

Given three types dA,dB,d_A, d_B, and dCd_C, which typically serve as the index sets for Hilbert spaces HA,HB,\mathcal{H}_A, \mathcal{H}_B, and HC\mathcal{H}_C in a tripartite quantum system, the type SmallIdx\text{SmallIdx} is defined as the Cartesian product (dA×dB)×dC(d_A \times d_B) \times d_C. This structure represents the index set for the composite system HAHBHC\mathcal{H}_A \otimes \mathcal{H}_B \otimes \mathcal{H}_C.

abbrev

The index type (dA×dB)×(dB×(dB×dC))(d_A \times d_B) \times (d_B \times (d_B \times d_C))

#MidIdx

Given three types dA,dB,d_A, d_B, and dCd_C (typically representing the dimensions or index sets of Hilbert spaces HA,HB,\mathcal{H}_A, \mathcal{H}_B, and HC\mathcal{H}_C), the type MidIdx\text{MidIdx} is defined as the nested product type (dA×dB)×(dB×(dB×dC))(d_A \times d_B) \times (d_B \times (d_B \times d_C)). This index set serves as an intermediate structure for defining linear operators and proving operator inequalities such as Strong Subadditivity (SSA) in quantum information theory.

theorem

W_mat_sq_le_one

#W_mat_sq_le_one

[Nonempty dA] [Nonempty dB] [Nonempty dC] (ρAB : HermitianMat (dA × dB) ℂ) (σBC : HermitianMat (dB × dC) ℂ) (hρ : ρAB.mat.PosDef) (hσ : σBC.mat.PosDef) : (W_mat ρAB σBC)ᴴ * (W_mat ρAB σBC) ≤ 1

theorem

Intermediate operator inequality for Strong Subadditivity: ρABσC1ρAσBC1\rho_{AB} \otimes \sigma_C^{-1} \le \rho_A \otimes \sigma_{BC}^{-1}

#intermediate_ineq

Let HA,HB,HC\mathcal{H}_A, \mathcal{H}_B, \mathcal{H}_C be finite-dimensional Hilbert spaces with dimensions dA,dB,dCd_A, d_B, d_C. Let ρAB\rho_{AB} be a positive definite Hermitian matrix on HAHB\mathcal{H}_A \otimes \mathcal{H}_B and σBC\sigma_{BC} be a positive definite Hermitian matrix on HBHC\mathcal{H}_B \otimes \mathcal{H}_C. Let ρA=TrB(ρAB)\rho_A = \text{Tr}_B(\rho_{AB}) and σC=TrB(σBC)\sigma_C = \text{Tr}_B(\sigma_{BC}) denote the respective partial traces. Then the following operator inequality holds on HAHBHC\mathcal{H}_A \otimes \mathcal{H}_B \otimes \mathcal{H}_C: ρABσC1reindex(ρAσBC1)\rho_{AB} \otimes \sigma_C^{-1} \le \text{reindex}(\rho_A \otimes \sigma_{BC}^{-1}) where the reindexing is performed using the inverse associativity equivalence (A×B)×CA×(B×C)(A \times B) \times C \simeq A \times (B \times C).

theorem

Operator extension of Strong Subadditivity (SSA): ρA1σBCρAB1σC\rho_A^{-1} \otimes \sigma_{BC} \le \rho_{AB}^{-1} \otimes \sigma_C

#operator_ineq_SSA

Let ρAB\rho_{AB} be a positive definite Hermitian matrix on the Hilbert space HAHB\mathcal{H}_A \otimes \mathcal{H}_B and σBC\sigma_{BC} be a positive definite Hermitian matrix on HBHC\mathcal{H}_B \otimes \mathcal{H}_C. Let ρA=TrB(ρAB)\rho_A = \text{Tr}_B(\rho_{AB}) and σC=TrB(σBC)\sigma_C = \text{Tr}_B(\sigma_{BC}) denote the respective partial traces. Then the following operator inequality holds: ρA1σBCρAB1σC\rho_A^{-1} \otimes \sigma_{BC} \le \rho_{AB}^{-1} \otimes \sigma_C where the right-hand side is reindexed via the associator (dA×dB)×dCdA×(dB×dC)(d_A \times d_B) \times d_C \simeq d_A \times (d_B \times d_C) to match the dimensions of the left-hand side.

theorem

Weak Monotonicity of von Neumann Entropy under Partial Traces

#Sᵥₙ_wm

For a tripartite quantum mixed state ρ\rho defined on a system with dimensions d1×d2×d3d_1 \times d_2 \times d_3, the von Neumann entropies SvNS_{vN} of its various partial traces satisfy the weak monotonicity inequality: SvN(Tr23(ρ))+SvN(Tr12(ρ))SvN(Tr3(ρ))+SvN(Tr1(ρ)) S_{vN}(\text{Tr}_{23}(\rho)) + S_{vN}(\text{Tr}_{12}(\rho)) \le S_{vN}(\text{Tr}_3(\rho)) + S_{vN}(\text{Tr}_1(\rho)) where Tr23(ρ)\text{Tr}_{23}(\rho) is the partial trace over the second and third subsystems (represented by `ρ.traceRight`), Tr12(ρ)\text{Tr}_{12}(\rho) is the partial trace over the first and second subsystems (represented by `ρ.traceLeft.traceLeft`), SvN(Tr3(ρ))S_{vN}(\text{Tr}_3(\rho)) corresponds to the entropy of the state on the first two subsystems (represented by `ρ.assoc'.traceRight`), and SvN(Tr1(ρ))S_{vN}(\text{Tr}_1(\rho)) corresponds to the entropy of the state on the last two subsystems (represented by `ρ.traceLeft`).

theorem

Strong Subadditivity of von Neumann Entropy Svn(ρ123)+Svn(ρ2)Svn(ρ12)+Svn(ρ23)S_{vn}(\rho_{123}) + S_{vn}(\rho_2) \leq S_{vn}(\rho_{12}) + S_{vn}(\rho_{23})

#Sᵥₙ_strong_subadditivity

For a quantum mixed state ρ123\rho_{123} on a tripartite system with state space d1×d2×d3d_1 \times d_2 \times d_3, let ρ12=Tr3(assoc(ρ123))\rho_{12} = \text{Tr}_3(\text{assoc}'(\rho_{123})) be the reduced state on the first two subsystems, ρ23=Tr1(ρ123)\rho_{23} = \text{Tr}_1(\rho_{123}) be the reduced state on the last two subsystems, and ρ2=Tr1(Tr3(ρ123))\rho_2 = \text{Tr}_1(\text{Tr}_3(\rho_{123})) be the reduced state on the middle subsystem. Then the von Neumann entropy SvnS_{vn} satisfies the strong subadditivity inequality: Svn(ρ123)+Svn(ρ2)Svn(ρ12)+Svn(ρ23)S_{vn}(\rho_{123}) + S_{vn}(\rho_2) \leq S_{vn}(\rho_{12}) + S_{vn}(\rho_{23})

theorem

Subadditivity of von Neumann Entropy Svn(ρ)Svn(ρ1)+Svn(ρ2)S_{vn}(\rho) \le S_{vn}(\rho_1) + S_{vn}(\rho_2)

#Sᵥₙ_subadditivity

For any quantum mixed state ρ\rho on a composite system with dimensions d1×d2d_1 \times d_2, let ρ1=Tr2(ρ)\rho_1 = \text{Tr}_2(\rho) be the reduced state on the first subsystem and ρ2=Tr1(ρ)\rho_2 = \text{Tr}_1(\rho) be the reduced state on the second subsystem. Then the von Neumann entropy SvnS_{vn} of the composite state is less than or equal to the sum of the von Neumann entropies of its reduced states: Svn(ρ)Svn(ρ1)+Svn(ρ2)S_{vn}(\rho) \le S_{vn}(\rho_1) + S_{vn}(\rho_2)

theorem

Triangle inequality for pure tripartite states S(A)S(B)+S(C)S(A) \le S(B) + S(C)

#Sᵥₙ_pure_tripartite_triangle

Let ψ|\psi\rangle be a pure state vector in a tripartite Hilbert space indexed by (d1×d2)×d3(d_1 \times d_2) \times d_3, and let ρ=ψψ\rho = |\psi\rangle\langle\psi| be the corresponding density matrix. Let S()S(\cdot) denote the von Neumann entropy SvnS_{vn}. The von Neumann entropy of the reduced state of the first subsystem d1d_1 is bounded by the sum of the entropies of the second and third subsystems, d2d_2 and d3d_3. Specifically, S(Tr23(ρ))S(Tr13(ρ))+S(Tr12(ρ))S(\text{Tr}_{23}(\rho)) \le S(\text{Tr}_{13}(\rho)) + S(\text{Tr}_{12}(\rho)) where Trij\text{Tr}_{ij} denotes the partial trace over the ii-th and jj-th subsystems.

theorem

Araki-Lieb Triangle Inequality S(ρA)S(ρB)+S(ρAB)S(\rho_A) \le S(\rho_B) + S(\rho_{AB})

#Sᵥₙ_triangle_ineq_one_way

Let ρ\rho be a quantum mixed state on a bipartite system with dimensions d1×d2d_1 \times d_2. Let Svn()S_{vn}(\cdot) denotes the von Neumann entropy. Let ρ1=Tr2(ρ)\rho_1 = \text{Tr}_2(\rho) be the reduced density matrix of the first subsystem (obtained by `traceRight`) and ρ2=Tr1(ρ)\rho_2 = \text{Tr}_1(\rho) be the reduced density matrix of the second subsystem (obtained by `traceLeft`). Then the following inequality holds: Svn(ρ1)Svn(ρ2)+Svn(ρ) S_{vn}(\rho_1) \le S_{vn}(\rho_2) + S_{vn}(\rho) This inequality represents one direction of the Araki-Lieb triangle inequality.

theorem

Araki-Lieb Triangle Inequality for von Neumann Entropy SvN(ρ1)SvN(ρ2)SvN(ρ)|S_{vN}(\rho_1) - S_{vN}(\rho_2)| \leq S_{vN}(\rho)

#Sᵥₙ_triangle_subaddivity

Let ρ\rho be a quantum mixed state on a bipartite composite system d1×d2d_1 \times d_2. Let SvNS_{vN} denote the von Neumann entropy. Let ρ1=Tr2(ρ)\rho_1 = \text{Tr}_2(\rho) be the reduced mixed state obtained by taking the partial trace over the second subsystem, and ρ2=Tr1(ρ)\rho_2 = \text{Tr}_1(\rho) be the reduced mixed state obtained by taking the partial trace over the first subsystem. Then the following triangle inequality (also known as the Araki-Lieb inequality) holds: SvN(ρ1)SvN(ρ2)SvN(ρ)|S_{vN}(\rho_1) - S_{vN}(\rho_2)| \leq S_{vN}(\rho)

theorem

Weak Monotonicity of Quantum Conditional Entropy S(AB)+S(AC)0S(A|B) + S(A|C) \geq 0

#Sᵥₙ_weak_monotonicity

Let ρ\rho be a tripartite quantum mixed state on the system A(BC)A \otimes (B \otimes C). Let ρAB\rho_{AB} be the reduced state on ABA \otimes B obtained by reassociating and tracing out CC, and let ρAC\rho_{AC} be the reduced state on ACA \otimes C obtained by swapping AA and BB, reassociating, tracing out BB, and swapping the remaining components. Then the sum of the quantum conditional entropies S(AB)S(A|B) and S(AC)S(A|C) is non-negative: 0S(AB)ρAB+S(AC)ρAC0 \leq S(A|B)_{\rho_{AB}} + S(A|C)_{\rho_{AC}}

theorem

Strong Subadditivity of Quantum Entropy as H(ABC)H(AB)H(A|BC) \leq H(A|B)

#qConditionalEnt_strong_subadditivity

For any quantum mixed state ρ123\rho_{123} on a tripartite system d1×d2×d3d_1 \times d_2 \times d_3, the conditional entropy of the system satisfies H(123)H(12)H(1|23) \leq H(1|2), where H(123)H(1|23) is the quantum conditional entropy S(123)S(23)S(123) - S(23) and H(12)H(1|2) is the quantum conditional entropy of the reduced state ρ12\rho_{12} obtained by taking the partial trace over the third subsystem.

theorem

I(A;BC)I(A;B)I(A; BC) \geq I(A; B) for Tripartite Quantum States

#qMutualInfo_strong_subadditivity

Let ρ123\rho_{123} be a quantum mixed state on a tripartite system with dimensions d1×(d2×d3)d_1 \times (d_2 \times d_3). Let I(A;B)I(A;B) denote the quantum mutual information of a bipartite state ρAB\rho_{AB}. If we define the reduced state ρ12\rho_{12} as the partial trace over the third subsystem of the reassociated state, i.e., ρ12=Tr3(assoc(ρ123))\rho_{12} = \text{Tr}_3(\text{assoc}'(\rho_{123})), then the quantum mutual information of the system satisfies the strong subadditivity inequality: I(d1;d2×d3)ρ123I(d1;d2)ρ12.I(d_1; d_2 \times d_3)_{\rho_{123}} \geq I(d_1; d_2)_{\rho_{12}}.

theorem

Non-negativity of Quantum Conditional Mutual Information (0qcmi ρ0 \le \text{qcmi } \rho)

#qcmi_nonneg

For any quantum mixed state ρ\rho on a tripartite system with dimensions dA×dB×dCd_A \times d_B \times d_C, the quantum conditional mutual information I(A:CB)ρI(A:C|B)_\rho is non-negative, i.e., 0I(A:CB)ρ0 \le I(A:C|B)_\rho.

theorem

I(A:CB)ρ2logdAI(A:C|B)_\rho \le 2 \log |d_A|

#qcmi_le_2_log_dim

For any tripartite quantum mixed state ρ\rho defined on a system with dimensions dA×dB×dCd_A \times d_B \times d_C, the quantum conditional mutual information I(A:CB)ρI(A:C|B)_\rho is bounded above by twice the logarithm of the dimension of the first subsystem AA. That is, I(A:CB)ρ2logdA I(A:C|B)_\rho \le 2 \log |d_A| where dA|d_A| denotes the cardinality (dimension) of the type dAd_A.

theorem

I(A:CB)ρ2logdCI(A:C|B)_\rho \le 2 \log d_C

#qcmi_le_2_log_dim'

Let ρ\rho be a quantum mixed state on a tripartite system ABCA \otimes B \otimes C with dimensions dA,dB,d_A, d_B, and dCd_C. The quantum conditional mutual information I(A:CB)ρI(A:C|B)_\rho, denoted as `qcmi ρ`, satisfies the inequality I(A:CB)ρ2logdCI(A:C|B)_\rho \le 2 \log d_C where dCd_C is the dimension of the subsystem CC (represented by `Fintype.card dC`).