QuantumInfo.Finite.Entropy.SSA
43 declarations
Operator norm of a matrix
#opNormFor a matrix over a field (where is or ), let be the associated linear map between Euclidean spaces. The operator norm is defined as the operator norm of viewed as a continuous linear map, which is given by .
is an Isometry
#isometry_preserves_normLet be an matrix over a field (where is or ). If is an isometry, then for any vector in the -dimensional Euclidean space , the norm of the image of under the linear map defined by is equal to the norm of , i.e., .
The operator norm of an isometry is 1
#opNorm_isometryLet be a matrix of size over the field (where is or ), and suppose the column dimension is non-empty. If is an isometry, then its operator norm is equal to .
Matrix representation of the map
#map_to_tensor_MESLet and be dimensions. The matrix is defined such that its entries are given by for indices and . This matrix represents the linear map , which maps a vector in to a tensor product of itself and a maximally entangled state (MES) basis sum in .
Trace property of `map_to_tensor_MES` using Kronecker product with Identity
#map_to_tensor_MES_propLet be a complex matrix of size . Let be the matrix `map_to_tensor_MES` of size . Then the product is equal to the partial trace of over the second system, denoted as , where denotes the conjugate transpose and is the identity matrix.
The isometry for quantum relative entropy generalizations
#V_rhoLet be a Hermitian matrix acting on the Hilbert space , where and denote the dimensions of the respective subspaces. The isometry is the matrix in defined by where: - is the partial trace of over the system . - is the principal square root of the inverse of . - is the identity matrix of size . - denotes the Kronecker product (tensor product). - is the fixed linear map `map_to_tensor_MES` mapping related to the maximally entangled state.
The Isometry for the matrix
#V_sigmaGiven a Hermitian matrix acting on the Hilbert space , the map is an operator (represented as a matrix) from to . It is defined by applying the construction to the permuted matrix and reindexing the resulting components to match the tensor product structure . This isometry is a key component in the proofs of quantum relative entropy inequalities, specifically for establishing strong subadditivity (SSA).
Let be a positive definite Hermitian matrix on the tensor product space . Let be the partial trace of over the system , and let denote the square root of the inverse of . Then the product of the adjoint of the isometry-like matrix with itself satisfies .
The partial trace preserves positive definiteness
#PosDef_traceRightLet be a positive definite Hermitian matrix acting on the tensor product space , where the dimension is non-zero. Then its partial trace over the right system , denoted as , is also a positive definite matrix.
Partial Trace over the Left Subsystem Preserves Positive Definiteness
#PosDef_traceLeftLet be a Hermitian matrix acting on the tensor product space . If the dimension is non-zero (i.e., the type is `Nonempty`) and is positive definite (), then its partial trace over the first subsystem, denoted by , is also a positive definite matrix.
is an isometry:
#V_rho_isometryLet be a positive definite Hermitian matrix acting on the bipartite Hilbert space , where the dimension of system is non-zero (). Let be the isometry operator associated with . Then, the product of the conjugate transpose of and itself is the identity matrix, i.e., .
is an isometry for positive definite
#V_sigma_isometryLet and be finite-dimensional Hilbert spaces with dimensions and respectively, such that . For any positive definite Hermitian matrix acting on , the matrix satisfies the isometry condition , where denotes the conjugate transpose and is the identity matrix on .
The matrix operator for the Strong Subadditivity (SSA) proof infrastructure
#W_matGiven two Hermitian matrices acting on the Hilbert space and acting on , the operator is defined as the square matrix of size given by the product: where: - is the partial trace of over system . - is the partial trace of over system . - and 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 .
Submultiplicativity of Matrix Operator Norm
#opNorm_mul_leLet be an matrix and be an matrix over a field (where is either or ). The operator norm satisfies the submultiplicative property: where the operator norm is the induced norm from the Euclidean space.
The Operator Norm is Invariant Under Reindexing Rows and Columns
#opNorm_reindex_provenLet be an matrix over a field (where is or ). Given bijections (equivalences) and , let be the matrix obtained by reindexing the rows and columns of according to and respectively. Then the operator norm of the reindexed matrix is equal to the operator norm of the original matrix, i.e., .
Kronecker product
#U_rhoLet be a Hermitian matrix acting on the Hilbert space with dimensions . We define the operator as the Kronecker product (tensor product) of the matrix and the identity matrix of dimension : where is a matrix of size . The resulting matrix maps from the space of dimension to the space of dimension .
The operator
#U_sigmaGiven a Hermitian matrix acting on the Hilbert space , we define the matrix as the Kronecker product of the identity matrix (of dimension ) and the matrix . Specifically, , resulting in a matrix of size . This construction serves as a helper operator for proving Strong Subadditivity (SSA) and operator inequalities in quantum information theory.
Let be an matrix over a field (where is or ). The operator norm of the conjugate transpose of , denoted as , is equal to the operator norm of , denoted as .
for complex matrices
#isometry_mul_conjTranspose_le_oneLet be an matrix over the complex numbers . If is an isometry, such that (where denotes the conjugate transpose and is the identity matrix), then in terms of the Loewner partial order (i.e., is a positive semi-definite matrix).
The product of two isometries satisfies
#conjTranspose_isometry_mul_isometry_le_oneLet be a complex matrix and be a complex matrix. If both and are isometries (meaning and , where denotes the conjugate transpose), then the product of the conjugate transpose of with itself satisfies in the sense of the Loewner partial order on positive semidefinite matrices.
Let and be finite types. For any equivalence and any Hermitian matrices , the inequality holds if and only if , 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 .
for Hermitian Matrices
#inv_kroneckerLet be a non-singular Hermitian matrix of size and be a non-singular Hermitian matrix of size over the complex numbers . The inverse of their Kronecker product is equal to the Kronecker product of their inverses, i.e., .
Matrix Inversion Commutes with Reindexing
#inv_reindexLet be a Hermitian matrix with complex entries indexed by a finite set , and let be a bijection to another finite index set . The inverse of the reindexed matrix is equal to the reindexing of the inverse matrix using the same bijection . That is, .
The Kronecker product of positive definite Hermitian matrices is positive definite
#PosDef_kroneckerLet be a Hermitian matrix of size and be a Hermitian matrix of size over the complex numbers . If is positive definite and is positive definite, then their Kronecker product is also positive definite.
Positive Definiteness is Invariant under Matrix Reindexing
#PosDef_reindexLet be a Hermitian matrix of size over the complex numbers . If is positive definite () and is an equivalence (reindexing) between the index sets and , then the reindexed matrix (where ) is also positive definite.
The index type
#BigIdxGiven three types and , the type is defined as the product type . This structure represents a specific indexing set used in the context of quantum relative entropy and operator inequalities, notably for proving Strong Subadditivity (SSA).
The index type
#SmallIdxGiven three types and , which typically serve as the index sets for Hilbert spaces and in a tripartite quantum system, the type is defined as the Cartesian product . This structure represents the index set for the composite system .
The index type
#MidIdxGiven three types and (typically representing the dimensions or index sets of Hilbert spaces and ), the type is defined as the nested product type . 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.
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
Intermediate operator inequality for Strong Subadditivity:
#intermediate_ineqLet be finite-dimensional Hilbert spaces with dimensions . Let be a positive definite Hermitian matrix on and be a positive definite Hermitian matrix on . Let and denote the respective partial traces. Then the following operator inequality holds on : where the reindexing is performed using the inverse associativity equivalence .
Operator extension of Strong Subadditivity (SSA):
#operator_ineq_SSALet be a positive definite Hermitian matrix on the Hilbert space and be a positive definite Hermitian matrix on . Let and denote the respective partial traces. Then the following operator inequality holds: where the right-hand side is reindexed via the associator to match the dimensions of the left-hand side.
Weak Monotonicity of von Neumann Entropy under Partial Traces
#Sᵥₙ_wmFor a tripartite quantum mixed state defined on a system with dimensions , the von Neumann entropies of its various partial traces satisfy the weak monotonicity inequality: where is the partial trace over the second and third subsystems (represented by `ρ.traceRight`), is the partial trace over the first and second subsystems (represented by `ρ.traceLeft.traceLeft`), corresponds to the entropy of the state on the first two subsystems (represented by `ρ.assoc'.traceRight`), and corresponds to the entropy of the state on the last two subsystems (represented by `ρ.traceLeft`).
Strong Subadditivity of von Neumann Entropy
#Sᵥₙ_strong_subadditivityFor a quantum mixed state on a tripartite system with state space , let be the reduced state on the first two subsystems, be the reduced state on the last two subsystems, and be the reduced state on the middle subsystem. Then the von Neumann entropy satisfies the strong subadditivity inequality:
Subadditivity of von Neumann Entropy
#Sᵥₙ_subadditivityFor any quantum mixed state on a composite system with dimensions , let be the reduced state on the first subsystem and be the reduced state on the second subsystem. Then the von Neumann entropy of the composite state is less than or equal to the sum of the von Neumann entropies of its reduced states:
Triangle inequality for pure tripartite states
#Sᵥₙ_pure_tripartite_triangleLet be a pure state vector in a tripartite Hilbert space indexed by , and let be the corresponding density matrix. Let denote the von Neumann entropy . The von Neumann entropy of the reduced state of the first subsystem is bounded by the sum of the entropies of the second and third subsystems, and . Specifically, where denotes the partial trace over the -th and -th subsystems.
Araki-Lieb Triangle Inequality
#Sᵥₙ_triangle_ineq_one_wayLet be a quantum mixed state on a bipartite system with dimensions . Let denotes the von Neumann entropy. Let be the reduced density matrix of the first subsystem (obtained by `traceRight`) and be the reduced density matrix of the second subsystem (obtained by `traceLeft`). Then the following inequality holds: This inequality represents one direction of the Araki-Lieb triangle inequality.
Araki-Lieb Triangle Inequality for von Neumann Entropy
#Sᵥₙ_triangle_subaddivityLet be a quantum mixed state on a bipartite composite system . Let denote the von Neumann entropy. Let be the reduced mixed state obtained by taking the partial trace over the second subsystem, and 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:
Weak Monotonicity of Quantum Conditional Entropy
#Sᵥₙ_weak_monotonicityLet be a tripartite quantum mixed state on the system . Let be the reduced state on obtained by reassociating and tracing out , and let be the reduced state on obtained by swapping and , reassociating, tracing out , and swapping the remaining components. Then the sum of the quantum conditional entropies and is non-negative:
Strong Subadditivity of Quantum Entropy as
#qConditionalEnt_strong_subadditivityFor any quantum mixed state on a tripartite system , the conditional entropy of the system satisfies , where is the quantum conditional entropy and is the quantum conditional entropy of the reduced state obtained by taking the partial trace over the third subsystem.
for Tripartite Quantum States
#qMutualInfo_strong_subadditivityLet be a quantum mixed state on a tripartite system with dimensions . Let denote the quantum mutual information of a bipartite state . If we define the reduced state as the partial trace over the third subsystem of the reassociated state, i.e., , then the quantum mutual information of the system satisfies the strong subadditivity inequality:
Non-negativity of Quantum Conditional Mutual Information ()
#qcmi_nonnegFor any quantum mixed state on a tripartite system with dimensions , the quantum conditional mutual information is non-negative, i.e., .
For any tripartite quantum mixed state defined on a system with dimensions , the quantum conditional mutual information is bounded above by twice the logarithm of the dimension of the first subsystem . That is, where denotes the cardinality (dimension) of the type .
Let be a quantum mixed state on a tripartite system with dimensions and . The quantum conditional mutual information , denoted as `qcmi ρ`, satisfies the inequality where is the dimension of the subsystem (represented by `Fintype.card dC`).
