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

The European Physical Journal Plus

Generalized n-locality correlations in tree tensor network configuration

Li‐Hua Yang, Xiaofei Qi, Jinchuan Hou

Published Aug 31, 2023• 4 citations
Publisher
DOI
10.1140/epjp/s13360-023-04356-9

Related papers

Characterizing n-chain-locality of correlation tensors based on linear networks

Yajing FAN, Zhihua Guo, Huaixin Cao +1 more

Quantum Information Processing•Jul 30, 2026•0 citations

Nonlocal correlations in the tree-tensor-network configuration

Li‐Hua Yang, Xiaofei Qi, Jinchuan Hou

The process of entanglement swapping showed that suitable measurements can generate nonlocal correlations even from particles that never interacted directly. This fact was generalized to the concept of bilocality for a quantum network, where there are three observers sharing two independent sources. Since then, the nonlocality nature was explored in various quantum networks. In this work, we consider the nonlocality of $({2}^{n}\ensuremath{-}1)$-partite tree-tensor networks, which are widely used in quantum communications. We derive the Bell-type inequalities which are respectively satisfied by all $({2}^{n}\ensuremath{-}2)$-local correlations and all local correlations, and demonstrate the maximal quantum violations of these inequalities and the robustness to noise in these tree networks.

Physical Review A•Oct 5, 2021•28 citations

Tree Tensor Network State with Variable Tensor Order: An Efficient Multireference Method for Strongly Correlated Systems

V. Murg, Frank Verstraete, Reinhold Schneider +2 more

We study the tree-tensor-network-state (TTNS) method with variable tensor orders for quantum chemistry. TTNS is a variational method to efficiently approximate complete active space (CAS) configuration interaction (CI) wave functions in a tensor product form. TTNS can be considered as a higher order generalization of the matrix product state (MPS) method. The MPS wave function is formulated as products of matrices in a multiparticle basis spanning a truncated Hilbert space of the original CAS-CI problem. These matrices belong to active orbitals organized in a one-dimensional array, while tensors in TTNS are defined upon a tree-like arrangement of the same orbitals. The tree-structure is advantageous since the distance between two arbitrary orbitals in the tree scales only logarithmically with the number of orbitals N, whereas the scaling is linear in the MPS array. It is found to be beneficial from the computational costs point of view to keep strongly correlated orbitals in close vicinity in both arrangements; therefore, the TTNS ansatz is better suited for multireference problems with numerous highly correlated orbitals. To exploit the advantages of TTNS a novel algorithm is designed to optimize the tree tensor network topology based on quantum information theory and entanglement. The superior performance of the TTNS method is illustrated on the ionic-neutral avoided crossing of LiF. It is also shown that the avoided crossing of LiF can be localized using only ground state properties, namely one-orbital entanglement.

Journal of Chemical Theory and Computation•Feb 3, 2015•97 citations

Measurement-dependent nonlocality in tree tensor networks

Meng Cui, Jinchuan Hou, Lihua Yang +1 more

The European Physical Journal Plus•Apr 20, 2026•0 citations

Tree Tensor Networks

Timo Felser

Graduate texts in physics•Jan 1, 2026•0 citations

TTNOpt: Tree tensor network package for high-rank tensor compression

Ryo Watanabe, Hidetaka Manabe, Toshiya Hikihara +1 more

We have developed TTNOpt, a software package that utilizes tree tensor networks (TTNs) for quantum spin systems and high-dimensional data analysis. TTNOpt provides efficient and powerful TTN computations by locally optimizing the network structure, guided by the entanglement pattern of the target tensors. For quantum spin systems, TTNOpt searches for the ground state of Hamiltonians with bilinear spin interactions and magnetic fields, and computes physical properties of these states, including the variational energy, bipartite entanglement entropy (EE), single-site expectation values, and two-site correlation functions. Additionally, TTNOpt can target the lowest-energy state within a specified subspace, provided that the Hamiltonian conserves total magnetization. For high-dimensional data analysis, TTNOpt factorizes complex tensors into TTN states that maximize fidelity to the original tensors by optimizing the tensors and the network. When a TTN is provided as input, TTNOpt reconstructs the network based on the EE without referencing the fidelity of the original state. We present three demonstrations of TTNOpt:(1) Ground-state search for the hierarchical chain model with a system size of $256$. The entanglement patterns of the ground state manifest themselves in a tree structure, and TTNOpt successfully identifies the tree.(2) Factorization of a quantic tensor of the $2^{24}$ dimensions representing a three-variable function where each variant has a weak bit-wise correlation. The optimized TTN shows that its structure isolates the variables from each other.(3) Reconstruction of the matrix product network representing a $16$-variable normal distribution characterized by a tree-like correlation structure. TTNOpt can reveal hidden correlation structures of the covariance matrix.

arXiv:2505.05908•Computer Physics Communications•Oct 30, 2025•2 citations
The process of entanglement swapping showed that suitable measurements can generate nonlocal correlations even from particles that never interacted directly. This fact was generalized to the concept of bilocality for a quantum network, where there are three observers sharing two independent sources. Since then, the nonlocality nature was explored in various quantum networks. In this work, we consider the nonlocality of $({2}^{n}\ensuremath{-}1)$-partite tree-tensor networks, which are widely used in quantum communications. We derive the Bell-type inequalities which are respectively satisfied by all $({2}^{n}\ensuremath{-}2)$-local correlations and all local correlations, and demonstrate the maximal quantum violations of these inequalities and the robustness to noise in these tree networks.
We study the tree-tensor-network-state (TTNS) method with variable tensor orders for quantum chemistry. TTNS is a variational method to efficiently approximate complete active space (CAS) configuration interaction (CI) wave functions in a tensor product form. TTNS can be considered as a higher order generalization of the matrix product state (MPS) method. The MPS wave function is formulated as products of matrices in a multiparticle basis spanning a truncated Hilbert space of the original CAS-CI problem. These matrices belong to active orbitals organized in a one-dimensional array, while tensors in TTNS are defined upon a tree-like arrangement of the same orbitals. The tree-structure is advantageous since the distance between two arbitrary orbitals in the tree scales only logarithmically with the number of orbitals N, whereas the scaling is linear in the MPS array. It is found to be beneficial from the computational costs point of view to keep strongly correlated orbitals in close vicinity in both arrangements; therefore, the TTNS ansatz is better suited for multireference problems with numerous highly correlated orbitals. To exploit the advantages of TTNS a novel algorithm is designed to optimize the tree tensor network topology based on quantum information theory and entanglement. The superior performance of the TTNS method is illustrated on the ionic-neutral avoided crossing of LiF. It is also shown that the avoided crossing of LiF can be localized using only ground state properties, namely one-orbital entanglement.
We have developed TTNOpt, a software package that utilizes tree tensor networks (TTNs) for quantum spin systems and high-dimensional data analysis. TTNOpt provides efficient and powerful TTN computations by locally optimizing the network structure, guided by the entanglement pattern of the target tensors. For quantum spin systems, TTNOpt searches for the ground state of Hamiltonians with bilinear spin interactions and magnetic fields, and computes physical properties of these states, including the variational energy, bipartite entanglement entropy (EE), single-site expectation values, and two-site correlation functions. Additionally, TTNOpt can target the lowest-energy state within a specified subspace, provided that the Hamiltonian conserves total magnetization. For high-dimensional data analysis, TTNOpt factorizes complex tensors into TTN states that maximize fidelity to the original tensors by optimizing the tensors and the network. When a TTN is provided as input, TTNOpt reconstructs the network based on the EE without referencing the fidelity of the original state. We present three demonstrations of TTNOpt:(1) Ground-state search for the hierarchical chain model with a system size of 256256256. The entanglement patterns of the ground state manifest themselves in a tree structure, and TTNOpt successfully identifies the tree.(2) Factorization of a quantic tensor of the 2242^{24}224 dimensions representing a three-variable function where each variant has a weak bit-wise correlation. The optimized TTN shows that its structure isolates the variables from each other.(3) Reconstruction of the matrix product network representing a 161616-variable normal distribution characterized by a tree-like correlation structure. TTNOpt can reveal hidden correlation structures of the covariance matrix.