Consistent ordering of tuples for qubit-operations pairs in PauliTerm

The PauliTerm class has an inconsistent ordering for tuples formed out of pairs of qubits and operations on qubits. Consider the following code snippet:

from pyquil.paulis import *

pt = sX(0) * sY(1)
pt_ops = pt.operations_as_set()
pt_new = PauliTerm.from_list(list(pt_ops))

raises an AssertionError with no clear reason why it's failing. The reason is that list(pt_ops) creates a list of tuples of the form (qubit, operation) whereas PauliTerm.from_list(..) demands a list of tuples of the form (operation, qubit). The fix for the above code snippet is then the rather ugly looking

pt_new = PauliTerm.from_list([(i[1], i[0]) for i in pt_ops])
assert pt_new == pt

Start in the pyquil.paulis module with PauliTerm.operations_as_set and PauliTerm.from_list, then reproduce the example using sX(0) * sY(1). Trace the tuple order each method returns and accepts; done means the example can pass operations_as_set directly to from_list and the resulting PauliTerm equals the original.