{'fraction_non_alphanumeric': 0.036783575705731396, 'fraction_numerical': 0.017964071856287425, 'mean_word_length': 4.545023696682464, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Semi-Clifford and Generalized Semi-Clifford Operations

Fault-tolerant quantum computation is a basic problem in quantum computation, and teleportation is one of the main techniques in this theory. Using teleportation on stabilizer codes, the most well-known quantum codes, Pauli gates and Clifford operators can be applied fault-tolerantly. Indeed, this technique can be generalized for an extended set of gates, the so called Ck hierarchy gates, introduced by Gottesman and Chuang (Nature, 402, 390-392). Ck gates are a generalization of Clifford operators, but our knowledge of these sets is not as rich as our knowledge of Clifford gates. Zeng et al. in (Phys. Rev. A 77, 042313) raise the question of the relation between Ck hierarchy and the set of semi-Clifford and generalized semi-Clifford operators. They conjecture that any Ck gate is a generalized semi-Clifford operator. In this paper, we prove this conjecture for k = 3. Using the techniques that we develop, we obtain more insight on how to characterize C3 gates. Indeed, the more we understand C3, the more intuition we have on Ck, k ≥ 4, and then we have a way of attacking the conjecture for larger k.