Several TODOs from #216. Many of the primitives are described in words without some gate decomposition. Will need to be worked out. - [ ] Implement the bitonic sort algorithm using comparitor bloq. - [ ] Bitonic sort: Sympy big-O complexity for T cost? - [ ] Comparator: complexity is from less than on two n qubit numbers + controlled swap. #176 - [ ] Squaring: missing clifford count - [ ] Greater than cliffords - [ ] Cliffords for synthesizing rotations