Computer Science – Computational Complexity
Scientific paper
2010-05-11
Computer Science
Computational Complexity
24 pages (inc appendix & refs)
Scientific paper
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.
No associations
LandOfFree
Binary Matroids and Quantum Probability Distributions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Binary Matroids and Quantum Probability Distributions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Binary Matroids and Quantum Probability Distributions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-383976