Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Cambridge University Press eBooks

Criterion of Truncation: Symmetric Systems

Tao Xiang

Published Aug 31, 2023• 0 citations
Publisher

Abstract

Truncation of basis states is a vital step in the tensor network renormalization. This chapter introduces the concept of reduced density matrices and discusses the criterion of judging which state should be retained and which not in the basis truncation. In a Hermitian system, the reduced density matrix of a quantum state is semi-positive definite, and its eigenvalues measure the probabilities of the corresponding eigenvectors. Therefore, we should do the truncation according to the eigenvalues of the reduced density matrix. This criterion is equivalent to taking a Schmidt decomposition for the wave function of the quantum state and truncating the basis states according to their singular values. It is also equivalent to maximizing the fidelity of the targeted state before and after truncation. We also introduce the edge and bond density matrices and show that they have the same eigen-spectra as the reduced density matrix.

DOI
10.1017/9781009398671.007

Related papers

Criterion of Truncation: Nonsymmetric Systems

Tao Xiang

This chapter discusses the truncation criteria in the RG treatment of a non-Hermitian matrix, starting with a modified definition of the reduced density matrix using the leading left and right eigenvectors. As the reduced density matrix so defined is not Hermitian, there is no theorem to protect or guarantee that its eigenvalues are semi-positive definite. This non-Hermitian problem causes trouble in the determination of an optimized truncation scheme. Three truncation schemes for determining the RG transformation matrices are introduced, relying on the canonical diagonalization of the reduced density matrix, biorthonormalization, and lower-rank approximation of the environment density matrix, respectively. The canonical diagonalization scheme is optimal if the reduced density matrix is semi-positive definite. The scheme of biorthonormalization may not be optimal, but it is mathematically more stable.

Cambridge University Press eBooks•Aug 31, 2023•0 citations

QUANTUM ENTANGLEMENT AND APPROXIMATION BY POSITIVE MATRICES

Xiaofen Huang, Naihuan Jing

We give an exact solution to the nonlinear optimization problem of approximating a Hermitian matrix by positive semi-definite matrices. Our algorithm was then used to judge whether a quantum state is entangled or not. We show that the exact approximation of a density matrices by tensor product of positive semi-definite operators is determined by the additivity property of the density matrix.

arXiv:1207.2827•Oct 1, 2011•0 citations

Entanglement and Quantumness - New Numerical Approaches -

Fabian Bohnet-Waldraff

The main topic of this compilation thesis is the investigation of multipartite entanglement of finite dimensional systems. We developed a numerical algorithm that detects if a multipartite state is entangled or separable in a finite number of steps of a semi-definite optimization task. This method is an extension of previously known semi-definite methods, which are inconclusive when the state is separable. In our case, if the state is separable, an explicit decomposition into a mixture of separable states can be extracted. This was achieved by mapping the entanglement problem onto the mathematically well studied truncated moment problem. Additionally, a new way of writing the partially transposed state for symmetric multi-qubit states was developed which simplifies many results previously known in entanglement theory. This new way of writing the partial transpose criterion unifies different interpretations and alternative formulations of the partial transpose criterion and it is also a part in the aforementioned semi-definite algorithm. The geometric properties of entangled symmetric states of two qubits were studied in detail: We could answer the question of how far a given pure state is from the convex hull of symmetric separable states, as measured by the Hilbert-Schmidt distance, by giving an explicit formula for the closest separable symmetric state. For mixed states we could provide a numerical upper and analytical lower bound for this distance. For a larger number of qubits we investigated the ball of absolutely classical states, i.e. symmetric multi-qubit states that stay separable under any unitary transformation. We found an analytical lower bound for the radius of this ball around the maximally mixed symmetric state and gave a numerical upper bound on this radius, by searching for an entangled state as close as possible to the maximally mixed symmetric state. The tensor representation of a symmetric multi-qubit state, or spin-j state, allowed us to study entanglement properties based on the spectrum of the tensor via tensor eigenvalues. The definiteness of this tensor relates to the entanglement of the state it represents and, hence, the smallest tensor eigenvalue can be used to detect entanglement. However, the tensor eigenvalues are more difficult to determine than the familiar matrix eigenvalues which made the investigation computationally more challenging. The relationship between the value of the smallest tensor eigenvalue and the amount of entanglement in the state was also investigated. It turned out that they are strongly correlated for small system sizes, i.e. for up to six qubits. However, to investigate this correlation we needed an independent way to gauge the amount of entanglement of a state and in order to do so we improved existing numerical methods to determine the distance of a state to the set of separable symmetric states, using a combination of linear and quadratic programming. The tensor representation of symmetric multi-qubit states was also used to formally define a new tensor class of regularly decomposable tensors that corresponds to the set of separable symmetric multi-qubit states.

•Sep 29, 2017•0 citations

Morphology of Two-Partite Entanglement in some, Highly Entangled, Small Qubit Systems

Roman Gieralak, Kozik, Wojciech

The most popular, bipartite methods approach to the analysis of entanglement included in genuine entangled quantum states, describing n-partite, n > 2 quantum systems are based on the notion of entropy of the corresponding reduced density matrices or/and the use of Negativity measure. However the equivalence of these two different measures is not clear. In particular, the equivalence of these notions of being maximally entangled in the sense of amount of entanglement included is not known. In the case of special, maximally entangled, with respect to the Negativity measure, pure states, describing 5 and 6 qubit systems, the equivalence to the entropy measure based definitions was shown by the straightforward calculations based on Schmidt’s decomposition method.

Studia Informatica System and information technology•Jun 8, 2016•1 citation

Separability and entanglement of n-qubit and a qubit and a qudit using Hilbert–Schmidt decompositions

Y. Ben-Aryeh, A. Mann

Hilbert–Schmidt (HS) decompositions are employed for analyzing systems of [Formula: see text]-qubit, and a qubit with a qudit. Negative eigenvalues, obtained by partial-transpose (PT) plus local unitary (PTU) transformations for one qubit from the whole system, are used for indicating entanglement/separability. A sufficient criterion for full separability of the [Formula: see text]-qubit and qubit–qudit systems is given. We use the singular value decomposition (SVD) for improving the criterion for full separability. General properties of entanglement and separability are analyzed for a system of a qubit and a qudit and [Formula: see text]-qubit systems, with emphasis on maximally disordered subsystems (MDS) (i.e. density matrices for which tracing over any subsystem gives the unit density matrix). A sufficient condition that [Formula: see text] (MDS) is not separable is that it has an eigenvalue larger than [Formula: see text] for a qubit and a qudit, and larger than [Formula: see text] for [Formula: see text]-qubit system. The PTU transformation does not change the eigenvalues of the [Formula: see text]-qubit MDS density matrices for odd [Formula: see text]. Thus, the Peres–Horodecki (PH) criterion does not give any information about entanglement of these density matrices. The PH criterion may be useful for indicating inseparability for even [Formula: see text]. The changes of the entanglement and separability properties of the GHZ state, the Braid entangled state and the [Formula: see text] state by mixing them with white noise are analyzed by the use of the present methods. The entanglement and separability properties of the GHZ-diagonal density matrices, composed of mixture of 8[Formula: see text]GHZ density matrices with probabilities [Formula: see text], is analyzed as function of these probabilities. In some cases, we show that the PH criterion is both sufficient and necessary.

International Journal of Quantum Information•Aug 1, 2016•4 citations

Optimal local basis truncation of lattice quantum many-body systems

Peter Majcen, Giovanni Cataldi, Pietro Silvi +1 more

We show how to optimally reduce the local Hilbert basis of lattice quantum many-body (QMB) Hamiltonians. The basis truncation exploits the most relevant eigenvalues of the estimated single-site reduced density matrix (RDM). It is accurate and numerically stable across different model phases, even close to quantum phase transitions. We apply this procedure to different models, such as the Sine-Gordon model, the $φ^{4}$ theory, and lattice gauge theories, namely Abelian $\mathrm{U}(1)$ and non-Abelian $\mathrm{SU}(2)$, in one and two spatial dimensions. Our results reduce state-of-the-art estimates of computational resources for classical and quantum simulations.

arXiv:2509.17975•Sep 22, 2025•0 citations
Truncation of basis states is a vital step in the tensor network renormalization. This chapter introduces the concept of reduced density matrices and discusses the criterion of judging which state should be retained and which not in the basis truncation. In a Hermitian system, the reduced density matrix of a quantum state is semi-positive definite, and its eigenvalues measure the probabilities of the corresponding eigenvectors. Therefore, we should do the truncation according to the eigenvalues of the reduced density matrix. This criterion is equivalent to taking a Schmidt decomposition for the wave function of the quantum state and truncating the basis states according to their singular values. It is also equivalent to maximizing the fidelity of the targeted state before and after truncation. We also introduce the edge and bond density matrices and show that they have the same eigen-spectra as the reduced density matrix.
This chapter discusses the truncation criteria in the RG treatment of a non-Hermitian matrix, starting with a modified definition of the reduced density matrix using the leading left and right eigenvectors. As the reduced density matrix so defined is not Hermitian, there is no theorem to protect or guarantee that its eigenvalues are semi-positive definite. This non-Hermitian problem causes trouble in the determination of an optimized truncation scheme. Three truncation schemes for determining the RG transformation matrices are introduced, relying on the canonical diagonalization of the reduced density matrix, biorthonormalization, and lower-rank approximation of the environment density matrix, respectively. The canonical diagonalization scheme is optimal if the reduced density matrix is semi-positive definite. The scheme of biorthonormalization may not be optimal, but it is mathematically more stable.
The main topic of this compilation thesis is the investigation of multipartite entanglement of finite dimensional systems. We developed a numerical algorithm that detects if a multipartite state is entangled or separable in a finite number of steps of a semi-definite optimization task. This method is an extension of previously known semi-definite methods, which are inconclusive when the state is separable. In our case, if the state is separable, an explicit decomposition into a mixture of separable states can be extracted. This was achieved by mapping the entanglement problem onto the mathematically well studied truncated moment problem. Additionally, a new way of writing the partially transposed state for symmetric multi-qubit states was developed which simplifies many results previously known in entanglement theory. This new way of writing the partial transpose criterion unifies different interpretations and alternative formulations of the partial transpose criterion and it is also a part in the aforementioned semi-definite algorithm. The geometric properties of entangled symmetric states of two qubits were studied in detail: We could answer the question of how far a given pure state is from the convex hull of symmetric separable states, as measured by the Hilbert-Schmidt distance, by giving an explicit formula for the closest separable symmetric state. For mixed states we could provide a numerical upper and analytical lower bound for this distance. For a larger number of qubits we investigated the ball of absolutely classical states, i.e. symmetric multi-qubit states that stay separable under any unitary transformation. We found an analytical lower bound for the radius of this ball around the maximally mixed symmetric state and gave a numerical upper bound on this radius, by searching for an entangled state as close as possible to the maximally mixed symmetric state. The tensor representation of a symmetric multi-qubit state, or spin-j state, allowed us to study entanglement properties based on the spectrum of the tensor via tensor eigenvalues. The definiteness of this tensor relates to the entanglement of the state it represents and, hence, the smallest tensor eigenvalue can be used to detect entanglement. However, the tensor eigenvalues are more difficult to determine than the familiar matrix eigenvalues which made the investigation computationally more challenging. The relationship between the value of the smallest tensor eigenvalue and the amount of entanglement in the state was also investigated. It turned out that they are strongly correlated for small system sizes, i.e. for up to six qubits. However, to investigate this correlation we needed an independent way to gauge the amount of entanglement of a state and in order to do so we improved existing numerical methods to determine the distance of a state to the set of separable symmetric states, using a combination of linear and quadratic programming. The tensor representation of symmetric multi-qubit states was also used to formally define a new tensor class of regularly decomposable tensors that corresponds to the set of separable symmetric multi-qubit states.
The most popular, bipartite methods approach to the analysis of entanglement included in genuine entangled quantum states, describing n-partite, n > 2 quantum systems are based on the notion of entropy of the corresponding reduced density matrices or/and the use of Negativity measure. However the equivalence of these two different measures is not clear. In particular, the equivalence of these notions of being maximally entangled in the sense of amount of entanglement included is not known. In the case of special, maximally entangled, with respect to the Negativity measure, pure states, describing 5 and 6 qubit systems, the equivalence to the entropy measure based definitions was shown by the straightforward calculations based on Schmidt’s decomposition method.
Hilbert–Schmidt (HS) decompositions are employed for analyzing systems of [Formula: see text]-qubit, and a qubit with a qudit. Negative eigenvalues, obtained by partial-transpose (PT) plus local unitary (PTU) transformations for one qubit from the whole system, are used for indicating entanglement/separability. A sufficient criterion for full separability of the [Formula: see text]-qubit and qubit–qudit systems is given. We use the singular value decomposition (SVD) for improving the criterion for full separability. General properties of entanglement and separability are analyzed for a system of a qubit and a qudit and [Formula: see text]-qubit systems, with emphasis on maximally disordered subsystems (MDS) (i.e. density matrices for which tracing over any subsystem gives the unit density matrix). A sufficient condition that [Formula: see text] (MDS) is not separable is that it has an eigenvalue larger than [Formula: see text] for a qubit and a qudit, and larger than [Formula: see text] for [Formula: see text]-qubit system. The PTU transformation does not change the eigenvalues of the [Formula: see text]-qubit MDS density matrices for odd [Formula: see text]. Thus, the Peres–Horodecki (PH) criterion does not give any information about entanglement of these density matrices. The PH criterion may be useful for indicating inseparability for even [Formula: see text]. The changes of the entanglement and separability properties of the GHZ state, the Braid entangled state and the [Formula: see text] state by mixing them with white noise are analyzed by the use of the present methods. The entanglement and separability properties of the GHZ-diagonal density matrices, composed of mixture of 8[Formula: see text]GHZ density matrices with probabilities [Formula: see text], is analyzed as function of these probabilities. In some cases, we show that the PH criterion is both sufficient and necessary.
We show how to optimally reduce the local Hilbert basis of lattice quantum many-body (QMB) Hamiltonians. The basis truncation exploits the most relevant eigenvalues of the estimated single-site reduced density matrix (RDM). It is accurate and numerically stable across different model phases, even close to quantum phase transitions. We apply this procedure to different models, such as the Sine-Gordon model, the φ4φ^{4}φ4 theory, and lattice gauge theories, namely Abelian U(1)\mathrm{U}(1)U(1) and non-Abelian SU(2)\mathrm{SU}(2)SU(2), in one and two spatial dimensions. Our results reduce state-of-the-art estimates of computational resources for classical and quantum simulations.