Computing the Tutte polynomial of lattice path matroids using determinantal circuits

DOI10.1016/j.tcs.2015.07.042zbMath1329.68120arXiv1312.3537OpenAlexW1491410076MaRDI QIDQ496045

Jason Morton, Jacob M. Turner

Publication date: 16 September 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

matroidsTutte polynomialquantum simulationcounting complexitytensor networks

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (5)

A finite-tame-wild trichotomy theorem for tensor diagrams ⋮ Generalized counting constraint satisfaction problems with determinantal circuits ⋮ On lattice path matroid polytopes: integer points and Ehrhart polynomial ⋮ Delta-matroids as subsystems of sequences of Higgs lifts ⋮ Facial structures of lattice path matroid polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized counting constraint satisfaction problems with determinantal circuits
• A spanning tree expansion of the Jones polynomial
• The geometry of tensor calculus. I
• Chip firing and the Tutte polynomial
• Lattice path matroids: Enumerative aspects and Tutte polynomials
• Expressiveness of matchgates.
• Holographic algorithms without matchgates
• On the \(h\)-vector of a lattice path matroid
• Lattice path matroids: structural properties
• The complexity of partition functions
• Tensor network methods for invariant theory
• Channel kets, entangled states, and the location of quantum information
• A Tutte polynomial for toric arrangements
• Matchgates and classical simulation of quantum circuits
• On the computational complexity of the Jones and Tutte polynomials
• Quantum computers that can be simulated classically in polynomial time
• Multi-Path Matroids
• A Contribution to the Theory of Chromatic Polynomials
• A polynomial quantum algorithm for approximating the Jones polynomial
• Theory and Applications of Models of Computation

This page was built for publication: Computing the Tutte polynomial of lattice path matroids using determinantal circuits