I have been playing with a new complexity class AFQP, defined in a yet-to-be-published manuscript by Alagna and Fleming. A language L is in AFQP if there is a polynomial-time quantum Turing machine Q such that for all inputs x,If x is in L, then Q(x) accepts with high probability.If x is not in L, then Q(x) rejects with high probability.Q(x) only has O(log |x|) quantumly entangled bits as well as