Tensor Network Efficiently Representing Schmidt Decomposition of Quantum Many-Body States

Abstract

Efficient methods to access the entanglement of a quantum many-body state, where the complexity generally scales exponentially with the system size $N$, have long a concern. Here we propose the Schmidt tensor network state (Schmidt TNS) that efficiently represents the Schmidt decomposition of finite- and even infinite-size quantum states with nontrivial bipartition boundary. The key idea is to represent the Schmidt coefficients (i.e., entanglement spectrum) and transformations in the decomposition to tensor networks (TNs) with linearly-scaled complexity versus $N$. Specifically, the transformations are written as the TNs formed by local unitary tensors, and the Schmidt coefficients are encoded in a positive-definite matrix product state (MPS). Translational invariance can be imposed on the TNs and MPS for the infinite-size cases. The validity of Schmidt TNS is demonstrated by simulating the ground state of the quasi-one-dimensional spin model with geometrical frustration. Our results show that the MPS encoding the Schmidt coefficients is weakly entangled even when the entanglement entropy of the decomposed state is strong. This justifies the efficiency of using MPS to encode the Schmidt coefficients, and promises an exponential speedup on the full-state sampling tasks.

arXiv comment5 pages, 4 figures

References in corpus (34)

• The density-matrix renormalization group in the age of matrix product states
• Area laws for the entanglement entropy - a review
• Efficient classical simulation of slightly entangled quantum computations
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• Efficient simulation of one-dimensional quantum many-body systems
• Entanglement renormalization
• Matrix product states represent ground states faithfully
• Classical simulation of infinite-size quantum lattice systems in two spatial dimensions
• Efficient quantum state tomography
• Criticality, the area law, and the computational power of PEPS
• Classical simulation of quantum many-body systems with a tree tensor network
• The iTEBD algorithm beyond unitary evolution
• Entropy scaling and simulability by Matrix Product States
• Studying Two Dimensional Systems With the Density Matrix Renormalization Group
• Renormalization and tensor product states in spin chains and lattices
• The computational complexity of PEPS
• Entanglement spectrum and boundary theories with projected entangled-pair states
• Differentiable Programming Tensor Networks
• Real- and imaginary-time evolution with compressed quantum circuits
• Lecture Notes of Tensor Network Contractions
• Encoding of Matrix Product States into Quantum Circuits of One- and Two-Qubit Gates
• Machine Learning by Unitary Tensor Network of Hierarchical Tree Structure
• Hyper-invariant tensor networks and holography
• Contracting projected entangled pair states is average-case hard
• Light cone tensor network and time evolution
• Automatic Differentiation for Second Renormalization of Tensor Networks
• Scalable Quantum Tomography with Fidelity Estimation
• Automatically Differentiable Quantum Circuit for Many-qubit State Preparation
• Adaptive-weighted tree tensor networks for disordered quantum many-body systems
• Tree tensor networks and entanglement spectra
• Variational Numerical Renormalization Group: Bridging the gap between NRG and Density Matrix Renormalization Group
• Automatic Differentiable Numerical Renormalization Group
• Deterministic and Entanglement-Efficient Preparation of Amplitude-Encoded Quantum Registers

Cited by in corpus (1)

• SpinGlassPEPS.jl: Tensor-network package for Ising-like optimization on quasi-two-dimensional graphs