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

• URL: http://arxiv.org/abs/2210.08166v2
• Date: Mon, 17 Jul 2023 02:03:18 GMT
• Title: Tensor Network Efficiently Representing Schmidt Decomposition of Quantum Many-Body States
• Authors: Peng-Fei Zhou, Ying Lu, Jia-Hao Wang, Shi-Ju Ran
• Abstract summary: Schmidt network state (Schmidt TNS) efficiently represents the Schmidt decomposition of finite- and even infinite-size quantum states. We show that the MPS encoding the Schmidt coefficients is weakly entangled even when the entanglement entropy of the 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.
• Score: 6.941759751222217
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• High Schmidt number concentration in quantum bound entangled states [0.135975510645475]
  We introduce efficient analytical tools for calculating the Schmidt number for a class of bipartite states. We construct a Schmidt number three PPT state in five dimensional systems and a family of states with a Schmidt number of $(d+1)/2$ for odd $d$-dimensional systems.
  arXiv  Detail & Related papers  (2024-02-20T12:33:57Z)
• Simulating lossy Gaussian boson sampling with matrix product operators [7.33258560389563]
  We show that efficient tensor network simulations are likely possible under the $N_textoutproptosqrtN$ scaling of the number of surviving photons. We overcome previous challenges due to the large local space dimensions in Gaussian boson sampling with hardware acceleration.
  arXiv  Detail & Related papers  (2023-01-30T12:10:39Z)
• Towards Neural Variational Monte Carlo That Scales Linearly with System Size [67.09349921751341]
  Quantum many-body problems are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing quantum states, and the Variational Monte Carlo (VMC) algorithm, has been shown to be a promising method for solving such problems. We propose a NN architecture called Vector-Quantized Neural Quantum States (VQ-NQS) that utilizes vector-quantization techniques to leverage redundancies in the local-energy calculations of the VMC algorithm.
  arXiv  Detail & Related papers  (2022-12-21T19:00:04Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Barren plateaus in quantum tensor network optimization [0.0]
  We analyze the variational optimization of quantum circuits inspired by matrix product states (qMPS), tree tensor networks (qTTN), and the multiscale entanglement renormalization ansatz (qMERA) We show that the variance of the cost function gradient decreases exponentially with the distance of a Hamiltonian term from the canonical centre in the quantum tensor network.
  arXiv  Detail & Related papers  (2022-09-01T08:42:35Z)
• Probing phases of quantum matter with an ion-trap tensor-network quantum eigensolver [1.291175895836647]
  We encode a TN ansatz state directly into a quantum simulator, which can potentially offer an exponential advantage over purely numerical simulation. In particular, we demonstrate the optimization of a quantum-encoded TN ansatz state using a variational quantum eigensolver on an ion-trap quantum computer.
  arXiv  Detail & Related papers  (2022-03-24T18:00:19Z)
• Robust preparation of Wigner-negative states with optimized SNAP-displacement sequences [41.42601188771239]
  We create non-classical states of light in three-dimensional microwave cavities. These states are useful for quantum computation. We show that this way of creating non-classical states is robust to fluctuations of the system parameters.
  arXiv  Detail & Related papers  (2021-11-15T18:20:38Z)
• Efficient bit encoding of neural networks for Fock states [77.34726150561087]
  The complexity of the neural network scales only with the number of bit-encoded neurons rather than the maximum boson number. In the high occupation regime its information compression efficiency is shown to surpass even maximally optimized density matrix implementations.
  arXiv  Detail & Related papers  (2021-03-15T11:24:40Z)
• Efficient and Flexible Approach to Simulate Low-Dimensional Quantum Lattice Models with Large Local Hilbert Spaces [0.08594140167290096]
  We introduce a mapping that allows to construct artificial $U(1)$ symmetries for any type of lattice model. Exploiting the generated symmetries, numerical expenses that are related to the local degrees of freedom decrease significantly. Our findings motivate an intuitive physical picture of the truncations occurring in typical algorithms.
  arXiv  Detail & Related papers  (2020-08-19T14:13:56Z)
• Gaussian Process States: A data-driven representation of quantum many-body physics [59.7232780552418]
  We present a novel, non-parametric form for compactly representing entangled many-body quantum states. The state is found to be highly compact, systematically improvable and efficient to sample. It is also proven to be a universal approximator' for quantum states, able to capture any entangled many-body state with increasing data set size.
  arXiv  Detail & Related papers  (2020-02-27T15:54:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.