activity
20062017
most citedTensor Network Contractions for #SAT

44 citations · 153 across the 20 of their papers we have counts for

collaborators

21 papers

cs.DB2017★ 1 cited

Contextuality from missing and versioned data

Jason Morton

Traditionally categorical data analysis (e.g. generalized linear models) works with simple, flat datasets akin to a single table in a database with no notion of missing data or con…

stat.ML2015

Dimension of Marginals of Kronecker Product Models

Guido Montufar, Jason Morton

A Kronecker product model is the set of visible marginal probability distributions of an exponential family whose sufficient statistics matrix factorizes as a Kronecker product of…

math.RT2015★ 7 cited

A Complete Set of Invariants for LU-Equivalence of Density Operators

Jacob Turner, Jason Morton

We show that two density operators of mixed quantum states are in the same local unitary orbit if and only if they agree on polynomial invariants in a certain Noetherian ring for w…

quant-ph2014★ 44 cited

Tensor Network Contractions for #SAT

Jacob D. Biamonte, Jason Morton, Jacob W. Turner

The computational cost of counting the number of solutions satisfying a Boolean formula, which is a problem instance of #SAT, has proven subtle to quantify. Even when finding indiv…

math.CT2014★ 1 cited

Belief propagation in monoidal categories

Jason Morton

We discuss a categorical version of the celebrated belief propagation algorithm. This provides a way to prove that some algorithms which are known or suspected to be analogous, are…

math.CO2013★ 11 cited

Computing the Tutte Polynomial of Lattice Path Matroids Using Determinantal Circuits

Jason Morton, Jacob Turner

We give a quantum-inspired algorithm computing the Tutte polynomial of a lattice path matroid, where is the size of the ground set of the matroid. Furthermore, this ca…