arXiv (All)
open access
Efficient Application of Tensor Network Operators to Tensor Network States Through Successive Deterministic Compression
We introduce an algorithm to apply tree tensor network operators to tree tensor network states followed by compression. Especially when applying a matrix product operator to matrix product states, this serves as a key subroutine in tensor network algorithms. We name the method successive determinist
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Compressing multivariate functions with tree tensor networks#617772
- Compressing multivariate functions with tree tensor networks#617272
- Tensor (machine learning)#343076
- Tensorization is a powerful but underexplored tool for compression and interpretability of neural networks#1108927
- Tensorion: A Tensor-Aware Generalization of the Muon Optimizer#307016
Record · ID 1143674
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive