Journal
SIAM JOURNAL ON COMPUTING
Volume 39, Issue 7, Pages 3089-3121Publisher
SIAM PUBLICATIONS
DOI: 10.1137/080739379
Keywords
tensor networks; quantum algorithms; statistical mechanical models
Ask authors/readers for more resources
We present a quantum algorithm that additively approximates the value of a tensor network to a certain scale. When combined with existing results, this provides a complete problem for quantum computation. The result is a simple new way of looking at quantum computation in which unitary gates are replaced by tensors and time is replaced by the order in which the tensor network is swallowed. We use this result to derive new quantum algorithms that approximate the partition function of a variety of classical statistical mechanical models, including the Potts model.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available