History of BQP/Talk

	Revision 3 . . December 9, 2001 11:57 pm by (logged).204.25.xxx
	Revision 2 . . December 9, 2001 1:17 am by Taw [1/4]
	Revision 1 . . August 27, 2001 11:27 am by AxelBoldt [*How many qubits?]

---

Difference (from prior major revision) (no other diffs)

Added: 1a2,4

: I think it is assumed that there's always enough of them, just as we do with Turing tapes. --Seb

Added: 3a7,8

:The probability that the algorithm fails N times in a row is (1/4)N. Actually I think 1/4 is more or less arbitrary; choosing any other (rational?) number in ]0,1/2[ would not change the class. --Seb