Binary Matroids and Quantum Probability Distributions
Computational Complexity
2010-05-12 v1 Quantum Physics
Abstract
We characterise the probability distributions that arise from quantum circuits all of whose gates commute, and show when these distributions can be classically simulated efficiently. We consider also marginal distributions and the computation of correlation coefficients, and draw connections between the simulation of stabiliser circuits and the combinatorics of representable matroids, as developed in the 1990s.
Cite
@article{arxiv.1005.1744,
title = {Binary Matroids and Quantum Probability Distributions},
author = {Dan Shepherd},
journal= {arXiv preprint arXiv:1005.1744},
year = {2010}
}
Comments
24 pages (inc appendix & refs)