Contraction of matchgate tensor networks on non-planar graphs

zbMATH Open1171.81318arXiv0801.2989MaRDI QIDQ3633642FDOQ3633642

Authors: Sergey Bravyi 

Publication date: 23 June 2009

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

Recommendations

• Theory and Applications of Models of Computation
• Valiant's holant theorem and matchgate tensors
• Tensor networks and the enumerative geometry of graphs
• Duality of graphical models and tensor networks
• Quantum computation and the evaluation of tensor networks

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Quantum computation (81P68)

Cited In (9)

• Majorana fermion codes
• Matchgate shadows for fermionic quantum simulation
• The rational approximations of the unitary groups
• Tensor network contractions for \#SAT
• On the optimal linear contraction order of tree tensor networks, and beyond
• Computing the Tutte polynomial of lattice path matroids using determinantal circuits
• Clifford gates in the Holant framework
• Duality of graphical models and tensor networks
• Boundary theories of critical matchgate tensor networks

This page was built for publication: Contraction of matchgate tensor networks on non-planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3633642)