2
$\begingroup$

Consider the $ [[4,2,2]] $ stabilizer code with stabilizer generators $ XXXX,ZZZZ $. Logical $ X $ on the first qubit is $$ XIXI $$ Logical $ Z $ on the first qubit $$ ZZII $$ Logical $ X $ on the second qubit is $$ XXII $$ Logical $ Z $ on the second qubit is $$ ZIZI $$ It is also the case that $ SWAP_{2,3} $ implements logical SWAP (this isn't technically transversal, but it is a code automorphism).

For any single qubit Clifford gate $ C $ the physical gate $ C^{\otimes 4} $ preserves the code space, implementing some logical operation. For example $ H^{\otimes 4} $ and $ P^{\otimes 4} $ both implement logical gates. The specific gates are described on page 3 of https://arxiv.org/abs/1610.03507 just before Figure 3. See also page 165.

Are there any other transversal gates besides these? Really my question is is there a good reference listing (or claiming to list) all transversal gates of the $ [[4,2,2]] $ code?

Improve this question
$\endgroup$
1
  • $\begingroup$ As far as single qubit transversal gates go, example 5 of arxiv.org/pdf/0706.1382.pdf claims that the (local) automorphism group of the $[[4,2,2]]$ code is $\langle H^{\otimes 4}, P^{\otimes 4} \rangle$. $\endgroup$
    – Eric Kubischta
    May 8 at 0:45

1 Answer 1

Reset to default
2
$\begingroup$

A nice reference for transversal gates available in small codes is https://arxiv.org/abs/1912.10063. In Table 1, they mention that Paulis and CNOTs are available with the [[4,2,2]] code and provide some further references.

Improve this answer
$\endgroup$
5
  • 1
    $\begingroup$ Thanks for the reference. The $ [[4,2,2]] $ code is stabilizer code and in particular a CSS code. Every stabilizer code has transversal Paulis and every CSS code has transversal CNOT. So this paper does not say anything interesting about transversality of the the $ [[4,2,2]] $ code beyond the fact that it is a CSS code $\endgroup$
    – Ian Gershon Teixeira
    May 1 at 17:19
  • 2
    $\begingroup$ @IanGershonTeixeira if their search was in fact exhaustive then there are no other gates. I didn't read the full paper to see how good their method is. I would have given it more attention if they had more interesting results. For example for the [[8,3,3]] code they only found the Paulis... $\endgroup$
    – unknown
    May 1 at 21:53
  • $\begingroup$ The method in the paper above uses machine learning and is likely a heuristic and not an exhaustive search. I think their approach is most useful when exhaustive search is not possible. For the $[[4,2,2]]$ you could exhaustively check all local Clifford gates with a computer; there are 'only' $24^4$ of them. Maybe disjointness could be used to show that all logical operators are Clifford? $\endgroup$
    – Jonas Anderson
    May 3 at 4:03
  • $\begingroup$ For future reference, @JonasAnderson is using Theorem 13 from arxiv.org/pdf/quant-ph/9704043.pdf that states that the automorphism group of a $[[2m, 2m-2, 2]]$ code lies in the Clifford group. This will only be relevant for the single qubit transversal gates but indeed one can perform an exhaustive (finite) search in this case. $\endgroup$
    – Eric Kubischta
    May 8 at 0:48
  • $\begingroup$ lol nice , does someone want to do an exhaustive search? $\endgroup$
    – Ian Gershon Teixeira
    Jul 26 at 21:45

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Not the answer you're looking for? Browse other questions tagged or ask your own question.