REVIEW 1 cited by
Survey on Computational Applications of Tensor Network Simulations
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
read the original abstract
Tensor networks are a popular and computationally efficient approach to simulate general quantum systems on classical computers and, in a broader sense, a framework for dealing with high-dimensional numerical problems. This paper presents a broad literature review of state-of-the-art applications of tensor networks and related topics across many research domains including: machine learning, mathematical optimisation, materials science, quantum chemistry and quantum circuit simulation. This review aims to clarify which classes of relevant applications have been proposed for which class of tensor networks, and how these perform compared with other classical or quantum simulation methods. We intend this review to be a high-level tour on tensor network applications which is easy to read by non-experts, focusing on key results and limitations rather than low-level technical details of tensor networks.
Forward citations
Cited by 1 Pith paper
-
Optimizing Tensor Network Partitioning using Simulated Annealing
A simulated annealing refinement of tensor network partitionings for distributed contraction lowers estimated computational and memory cost by about 8x on average versus naive partitioning on MQT Bench circuits.
Discussion (0). Continue with ORCID to comment.