Tensor Network Variational Diagonalization (TNVD)

• TNVD is a variational method that compresses the full eigenvalue spectrum into a matrix product state while representing eigenstates with a shared variational quantum circuit.
• The method fuses tensor-network compression with a brick-wall circuit layout to achieve polynomial scaling, drastically reducing the complexity compared to exact diagonalization.
• Benchmark studies on spin chains and disordered systems reveal that TNVD accurately recovers spectral and entanglement properties, with performance sensitive to the underlying entanglement structure.

Searching arXiv for the primary TNVD paper and any directly related references mentioned in the provided data. Tensor Network Variational Diagonalization (TNVD) is a variational framework for diagonalizing quantum many-body Hamiltonians by combining tensor-network compression of the full eigenvalue spectrum with a variational quantum circuit (VQC) representation of eigenstates. In the formulation introduced in "Diagonalizing large-scale quantum many-body Hamiltonians using variational quantum circuit and tensor network" (Zhou et al., 8 Aug 2025), the complete set of eigenenergies is encoded as a matrix product state (MPS), while the corresponding eigenstates are represented as the images of computational-basis product states under a shared circuit $\hat U(\theta_U)$. The method is designed to replace the exponentially scaled computational complexity of exact diagonalization (ED) by a polynomial-in-$N$ variational procedure, and was benchmarked for spin chains up to $N=100$ (Zhou et al., 8 Aug 2025).

1. Definition and representational structure

TNVD starts from the observation that a spin-$\tfrac12$ chain of length $N$ has a $2^N$-dimensional spectrum $\{E_\alpha\}_{\alpha=0}^{2^N-1}$, which can be reindexed as the entries of an $N$th-order tensor $E[r_1\cdots r_N]$ with $r_i\in\{0,1\}$. In TNVD, this tensor is approximated by a right-canonical MPS of bond dimension $N$0,

$N$1

The storage cost of this MPS scales as $N$2, which the paper identifies as polynomial in system size (Zhou et al., 8 Aug 2025).

The eigenstates are represented differently. Rather than storing each $N$3 independently, TNVD assumes that all eigenstates are generated by applying the same VQC to different product states:

$N$4

where $N$5 is the binary encoding of $N$6. The circuit uses a brick-wall layout of nearest-neighbor two-qubit gates with depth $N$7, and its total number of real parameters scales as $N$8 (Zhou et al., 8 Aug 2025).

This factorization separates spectral information from basis transformation. The MPS carries the full set of eigenvalues, while the VQC defines a global change of basis from product states to approximate eigenstates. A plausible implication is that TNVD may be viewed as a compressed eigendecomposition ansatz tailored to one-dimensional many-body systems, with efficiency determined jointly by the compressibility of the spectrum tensor and the circuit complexity of the eigenbasis.

2. Variational objective and optimization problem

The general tensor-network state ansatz in the paper is written as

$N$9

For TNVD itself, the variational parameters are collected into $N=100$0, comprising both the MPS tensors for the spectrum and the VQC parameters for the eigenbasis (Zhou et al., 8 Aug 2025).

The target of optimization is an ansatz operator $N=100$1 intended to approximate the Hamiltonian $N=100$2. The paper measures the discrepancy through the logarithmic Schmidt distance

$N=100$3

where $N=100$4 is the Frobenius norm. The subtraction of $N=100$5 is chosen so that a perfect decomposition gives $N=100$6 (Zhou et al., 8 Aug 2025). The norm is expanded as

$N=100$7

Each contribution is reported to be computable in either $N=100$8 or $N=100$9 time, where $\tfrac12$0 is the TEBD bond cutoff used while evolving $\tfrac12$1 through the circuit (Zhou et al., 8 Aug 2025). This places the computational bottleneck in tensor contractions and TEBD-based propagation through $\tfrac12$2 and $\tfrac12$3, rather than in explicit matrix diagonalization.

Within this formulation, the optimization problem is not cast as minimizing individual eigenstate residuals or a Rayleigh quotient for selected states. Instead, it targets an operator-level approximation to the full Hamiltonian decomposition. This suggests that TNVD is intrinsically a full-spectrum variational method rather than a low-energy variational solver.

3. Algorithmic workflow

TNVD takes as inputs an MPO representation of the Hamiltonian $\tfrac12$4, a maximum MPS bond dimension $\tfrac12$5, circuit depth $\tfrac12$6, TEBD cutoff $\tfrac12$7, learning rate $\tfrac12$8, and convergence tolerance $\tfrac12$9 (Zhou et al., 8 Aug 2025). The paper specifies the following workflow.

First, one initializes random MPS tensors $N$0 with bond dimension at most $N$1, together with random VQC parameters $N$2. The MPO of $N$3 is then constructed via automata. The optimization loop proceeds until $N$4.

At each iteration, the ansatz operator $N$5 is reconstructed by contracting the spectrum MPS, $N$6-tensors, the circuit $N$7, additional $N$8-tensors, and the Hermitian conjugate MPS. After computing the cost $N$9, gradients $2^N$0 and $2^N$1 are obtained either by automatic differentiation or by analytic tensor-network contractions combined with TEBD. Parameters are updated according to gradient descent,

$2^N$2

An optional re-orthonormalization step may be applied to maintain canonical form of the MPS (Zhou et al., 8 Aug 2025).

After convergence, the MPS tensors are used to recover the full eigenvalue set $2^N$3, while the optimized circuit generates eigenstates by acting on all product states. The explicit extraction rule is to contract the MPS at physical indices $2^N$4 to obtain a scalar $2^N$5, and to build each eigenstate as $2^N$6 (Zhou et al., 8 Aug 2025).

The paper also notes that, in practice, each two-qubit gate is parameterized via a small latent tensor network, citing a prior reference identified there as Ref. [ZHR21ADQC], so that gradients can be computed uniformly. Since no arXiv identifier is supplied in the provided material, the role of that reference can only be stated at this level of specificity.

4. Computational scaling and comparison with exact diagonalization

The computational complexity reported for TNVD is organized by subroutine. MPO-to-MPO contractions, including terms such as $2^N$7, scale as $2^N$8. MPS inner products scale as $2^N$9. TEBD evolution of the MPO through the circuit and its conjugate scales as $\{E_\alpha\}_{\alpha=0}^{2^N-1}$0. The total per-iteration cost is therefore approximately

$\{E_\alpha\}_{\alpha=0}^{2^N-1}$1

By contrast, ED is reported to cost $\{E_\alpha\}_{\alpha=0}^{2^N-1}$2 to store and $\{E_\alpha\}_{\alpha=0}^{2^N-1}$3 or worse to diagonalize (Zhou et al., 8 Aug 2025).

The central claim of TNVD is therefore a change in asymptotic scaling from exponential to polynomial in $\{E_\alpha\}_{\alpha=0}^{2^N-1}$4, contingent on fixed or controlled growth of the variational bond and truncation parameters. In the presentation of the method, this polynomial scaling is not merely a heuristic compression statement but an explicit accounting of the dominant contraction costs.

The significance of this contrast is practical as well as formal. Because TNVD stores the spectrum as an MPS rather than as an explicit vector of $\{E_\alpha\}_{\alpha=0}^{2^N-1}$5 energies, downstream operations such as sampling from the density of states become tractable at sizes beyond the ED limit. This suggests a different computational regime from conventional diagonalization: one in which global spectral access is retained, but only in compressed variational form.

5. Benchmarks on the transverse-field Ising chain

The numerical benchmarks reported in the paper use the transverse-field Ising chain

$\{E_\alpha\}_{\alpha=0}^{2^N-1}$6

with $\{E_\alpha\}_{\alpha=0}^{2^N-1}$7 (Zhou et al., 8 Aug 2025).

For small systems with $\{E_\alpha\}_{\alpha=0}^{2^N-1}$8, comparison to ED is given through the mean absolute eigenenergy error

$\{E_\alpha\}_{\alpha=0}^{2^N-1}$9

For $N$0, $N$1, and $N$2, this error stayed below $N$3, and the logarithmic Schmidt distance $N$4 tracked $N$5 closely, with sublinear growth versus $N$6 (Zhou et al., 8 Aug 2025).

For larger systems up to $N$7, the paper reports that $N$8 grew only slowly, reaching approximately $N$9 to $E[r_1\cdots r_N]$0, which is interpreted there as indicating controlled global error. The authors further sampled $E[r_1\cdots r_N]$1 eigenenergies from the MPS spectrum and constructed the density-of-states histogram $E[r_1\cdots r_N]$2. For both $E[r_1\cdots r_N]$3 and $E[r_1\cdots r_N]$4, the histograms were fit by a Gaussian,

$E[r_1\cdots r_N]$5

with identical $E[r_1\cdots r_N]$6 to within $E[r_1\cdots r_N]$7 (Zhou et al., 8 Aug 2025).

These benchmarks establish the main empirical profile of TNVD given in the paper: accurate small-system agreement with ED, followed by extension to system sizes inaccessible to ED while retaining full-spectrum observables in compressed form. The data do not claim exact recovery at $E[r_1\cdots r_N]$8; rather, they document controlled variational approximation measured by $E[r_1\cdots r_N]$9 and consistency of sampled spectral statistics.

6. Dependence on entanglement structure

A major component of the TNVD study concerns the random-field Ising chain

$r_i\in\{0,1\}$0

used to probe how TNVD efficiency depends on the entanglement structure of eigenstates (Zhou et al., 8 Aug 2025).

The paper evaluates the normalized level-spacing ratio

$r_i\in\{0,1\}$1

and reports $r_i\in\{0,1\}$2 in the thermal ("GOE") phase and $r_i\in\{0,1\}$3 in deep many-body localized ("Poisson") behavior. TNVD error $r_i\in\{0,1\}$4 and $r_i\in\{0,1\}$5 are stated to be smallest in deep MBL, where eigenstates satisfy area-law entanglement entropy, and to increase when eigenstates acquire volume-law entanglement entropy (Zhou et al., 8 Aug 2025).

Within the thermal regime, the paper distinguishes two subregions. In Region I, at small $r_i\in\{0,1\}$6, low-lying states obey area law while mid-spectrum states display increasing entanglement entropy, described there as an AL$r_i\in\{0,1\}$7VL transition; TNVD error rises rapidly in this regime. In Region II, at larger $r_i\in\{0,1\}$8 but below the disorder threshold, the spectrum is described as full volume-law, and the errors plateau (Zhou et al., 8 Aug 2025).

The paper further identifies entanglement-entropy signatures correlated with TNVD performance. In the MBL phase, the distribution of entanglement entropy versus normalized eigenenergy $r_i\in\{0,1\}$9 forms a broad triangular cloud, and the density of states versus entanglement entropy is Gaussian. In the deep volume-law regime, the entanglement-entropy distribution collapses onto a "slender" Gaussian arc $N$00, while the density of states versus entanglement entropy becomes a shifted Poisson,

$N$01

In deep MBL, the arc collapses and nearly all states have very small area-law entanglement entropy, with the density of states versus $N$02 peaking at $N$03; the paper states that TNVD recovers these trivially (Zhou et al., 8 Aug 2025).

The interpretation advanced in the work is that area-law or weakly violating entanglement structures are favorable for TNVD, whereas volume-law eigenstates degrade efficiency. This suggests that TNVD’s practical domain is governed not only by Hamiltonian locality but also by the entanglement geometry of the full eigenbasis.

7. Position within large-scale many-body diagonalization

TNVD is presented as a diagonalization strategy that combines tensor-network compression and quantum-circuit parametrization to access the full spectrum of large-scale quantum many-body Hamiltonians. In the paper’s formulation, its distinctive feature is that the eigenenergy spectrum is encoded as an MPS while the eigenstates are encoded as circuit evolutions of product states (Zhou et al., 8 Aug 2025). That is different from ED, which stores and diagonalizes explicit matrices, and it is also different from variational methods aimed only at ground states or a small number of excited states.

The method’s benchmarks up to $N$04 are used in the paper to argue that TNVD can operate far beyond the computational limit of ED (Zhou et al., 8 Aug 2025). The paper further states that typical signs, including the distribution of entanglement entropy versus eigenenergy and the density of state versus entanglement entropy, indicate area law of entanglement entropy or its violation, and that these features are essential to TNVD efficiency. In this sense, TNVD is not simply a compression scheme; it is a diagnostic framework in which diagonalization accuracy, level statistics, and entanglement profiles are analyzed together.

The work also assigns a specific role to the VQC component. It states that the incorporation of VQC "lays a promising pathway to applying quantum computation to address the volume-law-EE Hamiltonians that lack efficient classical approaches" (Zhou et al., 8 Aug 2025). As phrased, this is a forward-looking implication rather than a demonstrated capability of the present benchmarks. A plausible implication is that hybrid tensor-network and circuit-based diagonalization may be especially relevant in regimes where classical tensor networks remain useful for spectral compression but the eigenbasis becomes too entangled for purely classical state representations to remain efficient.

Within the scope of the reported results, TNVD is therefore best understood as a full-spectrum variational diagonalization method whose success is tied to the compressibility of energies as an MPS and to the entanglement complexity of the eigenstates represented by a shared brick-wall VQC.