Quantum Computation and the Evaluation of Tensor Networks

DOI10.1137/080739379zbMath1209.68261arXiv0805.0040OpenAlexW2023644179MaRDI QIDQ5390589

Itai Arad, Zeph A. Landau

Publication date: 4 April 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0805.0040

zbMATH Keywords

quantum algorithmstensor networksstatistical mechanical models

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (16)

Low depth quantum circuits for Ising models ⋮ QNLP in Practice: Running Compositional Models of Meaning on a Quantum Computer ⋮ Probabilistic nonunitary gate in imaginary time evolution ⋮ Unnamed Item ⋮ The BQP-hardness of approximating the Jones polynomial ⋮ Quantum algorithm design: techniques and applications ⋮ QUANTUM DISCORD AND QUANTUM COMPUTING — AN APPRAISAL ⋮ Shaded tangles for the design and verification of quantum circuits ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Zero-free regions of partition functions with applications to algorithms and graph limits ⋮ Statistical mechanical models for quantum codes with correlated noise ⋮ Exponential decay of correlations implies area law ⋮ A new connection between quantum circuits, graphs and the Ising partition function ⋮ On traces of tensor representations of diagrams ⋮ Hand-waving and interpretive dance: an introductory course on tensor networks

This page was built for publication: Quantum Computation and the Evaluation of Tensor Networks