Key points are not available for this paper at this time.
We show that interesting multigate circuits can be constructed using a postselected controlled-sign gate that works with a probability (1∕3) ^n, where n-1 is the number of controlled-sign gates in the circuit, rather than (1∕9) ^n-1, as would be expected from a sequence of such gates. We suggest some quantum information tasks which could be demonstrated using these circuits, such as parity checking and cluster-state computation.
Timothy C. Ralph (Tue,) studied this question.