Simulating Quantum Computation by Contracting Tensor Networks

DOI10.1137/050644756zbMath1165.81017arXivquant-ph/0511069OpenAlexW2072969317MaRDI QIDQ3631899

Yaoyun Shi, Igor L. Markov

Publication date: 22 June 2009

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

Full work available at URL: https://arxiv.org/abs/quant-ph/0511069

zbMATH Keywords

computational complexitytreewidthquantum computationtensor networkone-way quantum computationclassical simulation

Mathematics Subject Classification ID

Related Items (29)

Contextuality Scenarios Arising from Networks of Stochastic Processes ⋮ The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems ⋮ Tensor networks and the enumerative geometry of graphs ⋮ Graph parameters from symplectic group invariants ⋮ On the Satisfiability of Quantum Circuits of Small Treewidth ⋮ On the satisfiability of quantum circuits of small treewidth ⋮ Tensor network contractions for \#SAT ⋮ MPS-VQE: a variational quantum computational chemistry simulator with matrix product states ⋮ Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks ⋮ Simulation of quantum many-body systems on Amazon cloud ⋮ Equivalence between contextuality and negativity of the Wigner function for qudits ⋮ Constant-degree graph expansions that preserve treewidth ⋮ Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$ ⋮ Algebraic Methods in Quantum Informatics ⋮ On efficiently solvable cases of quantum \(k\)-SAT ⋮ Efficient Construction of Functional Representations for Quantum Algorithms ⋮ Efficient tree decomposition of high-rank tensors ⋮ Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design ⋮ Unnamed Item ⋮ Zero-free regions of partition functions with applications to algorithms and graph limits ⋮ Clifford gates in the Holant framework ⋮ Mixed partition functions and exponentially bounded edge-connection rank ⋮ Classical spin systems and the quantum stabilizer formalism: General mappings and applications ⋮ Exponential decay of correlations implies area law ⋮ A new connection between quantum circuits, graphs and the Ising partition function ⋮ A Complete Dichotomy Rises from the Capture of Vanishing Signatures ⋮ Algorithms and complexity for Turaev-Viro invariants ⋮ Quantum median filter for total variation image denoising ⋮ On traces of tensor representations of diagrams

This page was built for publication: Simulating Quantum Computation by Contracting Tensor Networks