Pith. sign in

REVIEW 4 cited by

Differentiable Programming of Isometric Tensor Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2110.03898 v2 pith:IDKPDBGC submitted 2021-10-08 quant-ph cond-mat.str-elcs.LG

Differentiable Programming of Isometric Tensor Networks

classification quant-ph cond-mat.str-elcs.LG
keywords tensorprogrammingdifferentiableisometricmodelnetworkauto-differentiationclassical
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Differentiable programming is a new programming paradigm which enables large scale optimization through automatic calculation of gradients also known as auto-differentiation. This concept emerges from deep learning, and has also been generalized to tensor network optimizations. Here, we extend the differentiable programming to tensor networks with isometric constraints with applications to multiscale entanglement renormalization ansatz (MERA) and tensor network renormalization (TNR). By introducing several gradient-based optimization methods for the isometric tensor network and comparing with Evenbly-Vidal method, we show that auto-differentiation has a better performance for both stability and accuracy. We numerically tested our methods on 1D critical quantum Ising spin chain and 2D classical Ising model. We calculate the ground state energy for the 1D quantum model and internal energy for the classical model, and scaling dimensions of scaling operators and find they all agree with the theory well.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Scaling at Chiral Clock Criticality via Entanglement Renormalization

    cond-mat.stat-mech 2026-04 unverdicted novelty 7.0

    MERA tensor networks produce continuously varying effective scaling dimensions along the Z3 chiral clock critical line, starting from 3-state Potts values as the chiral parameter increases.

  2. Forward-mode automatic differentiation for the tensor renormalization group and its relation to the impurity method

    hep-lat 2026-02 conditional novelty 7.0

    Forward-mode AD for TRG is derived with (k+1)(k+2)/2 cost scaling, linked to impurity methods, and tested on the 2D/3D Ising model for energy, specific heat, and critical exponents.

  3. Automatically Differentiable Nonlinear Tensor Networks (ADNTNs) for Exponential Parameter Compression of Deep Neural Networks

    cs.LG 2026-05 unverdicted novelty 6.0

    ADNTNs compress DNN weights by 2000x-77000x per layer on AlexNet and VGG-16 using nonlinear tensor network cores trained with reverse-mode AD, often matching or exceeding baseline accuracy.

  4. Automatically Differentiable Nonlinear Tensor Networks (ADNTNs) for Exponential Parameter Compression of Deep Neural Networks

    cs.LG 2026-05 conditional novelty 5.5

    Hierarchical nonlinear tensor networks generate dense, conv, and attention weights from few cores, yielding extreme per-layer compression with competitive CIFAR-10 accuracy on VGG-16.