Posts by Jan Tułowiecki

1. Diagonal operator decomposition on restricted topologies via enumeration of quantum state subsets

   We analyse the CX implementation cost of generic diagonal operators, based on the target device topology.

2. Clifford circuits over non-cyclic abelian groups

   We present a generalized approach to Clifford group construction for any abelian group.

3. IGMO 2022 results

   We are proud to announce that two of our employees achieved Gold Honours at International Gamma Mathematics Olympiad 2022 (IGMO) – open, international mathematical olympiad.

4. IBM Quantum Challenge – Jan's write-up

   I introduce a permanent-based approach to the final problem of IBM Fall 2020 Quantum Challenge and prove its correctness. I describe a way to implement it as a quantum circuit and discuss the combinatorial consequences of such approach. The optimized solution obtained the score of 6574 and the 6th place in the final challenge ranking.

5. A note on the winning solution of the Fall 2020 IBM Quantum Challenge

   What could have happened if we had applied our low-level optimizations to the winning solution?

6. Efficient unstructured search implementation on current ion-trap quantum processors

   We present experimental results on running unstructured search in spaces defined by 4, 5 and 6 qubits on ion-trapped quantum processor. Our best circuits obtained respectively 66%, 26% and 6% average probability of measuring the marked element.