We give a quantum-inspired O(n4) algorithm computing the Tutte polynomial of a lattice path matroid, where n is the size of the ground set of the matroid. Furthermore, this can be improved to O(n2) arithmetic operations if we evaluate the Tutte polynomial on a given input, fixing the values of the variables. The best existing algorithm, found in 2004, was O(n5), and the problem has only been known to be polynomial time since 2003. Conceptually, our algorithm embeds the computation in a determinant using a recently demonstrated equivalence of categories useful for counting problems such as those that appear in simulating quantum systems.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)