Diagonalizing large-scale quantum many-body Hamiltonians using variational quantum circuit and tensor network

• URL: http://arxiv.org/abs/2508.06159v1
• Date: Fri, 08 Aug 2025 09:29:17 GMT
• Title: Diagonalizing large-scale quantum many-body Hamiltonians using variational quantum circuit and tensor network
• Authors: Peng-Fei Zhou, Shuang Qiao, An-Chun Ji, Shi-Ju Ran,
• Abstract summary: TNVD encodes the full eigenenergy spectrum of a quantum many-body Hamiltonian into a matrix product state.<n> Numerical benchmarks up to $N=100$ spins are provided, which far surpass the computational limit of ED.<n>Our work establishes TNVD as a powerful and scalable diagonalization approach for large-scale quantum many-body Hamiltonians.
• Score: 1.474945380093949
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Exact diagonalization (ED) is an essential tool for exploring quantum many-body physics but is fundamentally limited by the exponentially-scaled computational complexity. Here, we propose tensor network variational diagonalization (TNVD), which encodes the full eigenenergy spectrum of a quantum many-body Hamiltonian into a matrix product state, and encodes the eigenstates as the evolutions of product states using variational quantum circuit (VQC). Thereby, TNVD reduces the computational complexity of diagonalization from exponential to polynomial in system size $N$. Numerical benchmarks up to $N=100$ spins are provided, which far surpass the computational limit of ED. We further consider quantum Ising model in a random field to reveal the underlying reliance between the efficiency of TNVD and entanglement properties of eigenstates. Typical signs, including the distribution of entanglement entropy (EE) versus eigenenergy and the density of state versus EE, are suggested to indicate area law of entanglement entropy or its violation, which are essential to the TNVD efficiency. Our work establishes TNVD as a powerful and scalable diagonalization approach for large-scale quantum many-body Hamiltonians. The incorporation of VQC lays a promising pathway to applying quantum computation to address the volume-law-EE Hamiltonians that lack efficient classical approaches.

Related papers

• Performance Guarantees for Quantum Neural Estimation of Entropies [31.955071410400947]
  Quantum neural estimators (QNEs) combine classical neural networks with parametrized quantum circuits.<n>We study formal guarantees for QNEs of measured relative entropies in the form of non-asymptotic error risk bounds.<n>Our theory aims to facilitate principled implementation of QNEs for measured relative entropies.
  arXiv  Detail & Related papers  (2025-11-24T16:36:06Z)
• Unconditionally separating noisy $\mathsf{QNC}^0$ from bounded polynomial threshold circuits of constant depth [6.8680041558282054]
  We show that parallel quantum computation can exhibit greater computational power than previously recognized.<n>We bridge the theory of non-local games in higher dimensions with computational advantage on emerging quantum computers.
  arXiv  Detail & Related papers  (2024-08-29T09:40:55Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Encoded probabilistic imaginary-time evolution on a trapped-ion quantum computer for ground and excited states of spin qubits [0.0]
  We employ a quantum computer to solve a low-energy effective Hamiltonian for spin defects in diamond and aluminium nitride.<n>The spin singlet state is difficult to compute using density functional theory (DFT), which should be described by multiple Slater determinants.<n>This is the first instance of an encoded PITE circuit being executed on a trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2024-07-15T09:07:54Z)
• Spin coupling is all you need: Encoding strong electron correlation in molecules on quantum computers [0.0]
  We show that quantum computers can efficiently simulate strongly correlated molecular systems by directly encoding the dominant entanglement structure in the form of spin-coupled initial states.<n>Our work provides a crucial component for enabling scalable quantum simulation of classically challenging electronic systems.
  arXiv  Detail & Related papers  (2024-04-29T17:14:21Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• 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)
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
  We analyze and optimize an improved quantum algorithm for topological data analysis. We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation. We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
  arXiv  Detail & Related papers  (2022-09-27T17:56:15Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Variational Adiabatic Gauge Transformation on real quantum hardware for effective low-energy Hamiltonians and accurate diagonalization [68.8204255655161]
  We introduce the Variational Adiabatic Gauge Transformation (VAGT) VAGT is a non-perturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit. The accuracy of VAGT is tested trough numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.
  arXiv  Detail & Related papers  (2021-11-16T20:50:08Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)

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.