Approximate Contraction of Arbitrary Tensor Networks with a Flexible and Efficient Density Matrix Algorithm
Tensor network contractions are widely used in statistical physics, quantum computing, and computer science. We introduce a method to efficiently approximate tensor network contractions using low-rank approximations, where each intermediate tensor generated during the contractions is approximated as...
Saved in:
| Main Authors: | Linjian Ma, Matthew Fishman, Edwin Miles Stoudenmire, Edgar Solomonik |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2024-12-01
|
| Series: | Quantum |
| Online Access: | https://quantum-journal.org/papers/q-2024-12-27-1580/pdf/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Fermionic tensor network contraction for arbitrary geometries
by: Yang Gao, et al.
Published: (2025-05-01) -
The Formula of Grangeat for Tensor Fields of Arbitrary Order in n Dimensions
by: T. Schuster
Published: (2007-01-01) -
Polynomial Approximation over Arbitrary Shape Domains
by: Mohammad J. Mahtabi, et al.
Published: (2024-11-01) -
Quantum approximated cloning-assisted density matrix exponentiation
by: Pablo Rodriguez-Grasa, et al.
Published: (2025-03-01) -
The Tensor Pade´-Type Approximant with Application in Computing Tensor Exponential Function
by: Chuanqing Gu, et al.
Published: (2018-01-01)