Code conversion with the quantum Golay code for a universal transversal gate set

• URL: http://arxiv.org/abs/2307.14425v3
• Date: Thu, 18 Apr 2024 18:06:29 GMT
• Title: Code conversion with the quantum Golay code for a universal transversal gate set
• Authors: Matthew Sullivan,
• Abstract summary: The $[[7,1,3]]$ Steane code and $[[23,1,7]]$ quantum Golay code have been identified as good candidates for fault-tolerant quantum computing via code concatenation. A crucial ingredient to this procedure is the $[49,1,5]]$ triorthogonal code, which can itself be seen as related to the self-dual $[[17,1,5]]$ 2D color code.
• Score: 0.13597551064547497
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The $[[7,1,3]]$ Steane code and $[[23,1,7]]$ quantum Golay code have been identified as good candidates for fault-tolerant quantum computing via code concatenation. These two codes have transversal implementations of all Clifford gates, but require some other scheme for fault-tolerant $T$ gates. Using magic states, Clifford operations, and measurements is one common scheme, but magic state distillation can have a large overhead. Code conversion is one avenue for implementing a universal gate set fault-tolerantly without the use of magic state distillation. Analogously to how the $[[7,1,3]]$ Steane code can be fault-tolerantly converted to and from the $[[15,1,3]]$ Reed-Muller code which has a transversal $T$ gate, the $[[23,1,7]]$ Golay code can be converted to a $[[95,1,7]]$ triorthogonal code with a transversal $T$ gate. A crucial ingredient to this procedure is the $[[49,1,5]]$ triorthogonal code, which can itself be seen as related to the self-dual $[[17,1,5]]$ 2D color code. Additionally, a method for code conversion based on a transversal CNOT between the codes, rather than stabilizer measurements, is described.

Related papers

• Targeted Clifford logical gates for hypergraph product codes [61.269295538188636]
  We construct explicit targeted logical gates for hypergraph product codes. As a concrete example, we give logical circuits for the $[[18,2,3]]$ toric code.
  arXiv  Detail & Related papers  (2024-11-26T02:32:44Z)
• Color code with a logical control-$S$ gate using transversal $T$ rotations [2.1756081703276]
  Three-dimensional examples of the color code have shown us how its structure, specifically the intersection of the supports of logical operators, can give rise to non-Clifford $T$ and $CCZ$. Here we present a color code with a logical control-$S$ gate that is accomplished with $Tdagger$ rotations on its physical qubits.
  arXiv  Detail & Related papers  (2024-11-22T16:08:33Z)
• Computation with quantum Reed-Muller codes and their mapping onto 2D atom arrays [2.3020018305241328]
  We give a fault tolerant construction for error correction and computation using two punctured quantum Reed-Muller codes. We show that code switching between these codes can be accomplished using Steane error correction. We map the PQRM codes to a 2D layout suitable for implementation in arrays of trapped atoms.
  arXiv  Detail & Related papers  (2024-10-30T17:47:35Z)
• Asymptotically Good Quantum Codes with Transversal Non-Clifford Gates [23.22566380210149]
  We construct quantum codes that support $CCZ$ gates over qudits of arbitrary prime power dimension $q$. The only previously known construction with such linear dimension and distance required a growing alphabet size $q$.
  arXiv  Detail & Related papers  (2024-08-17T16:54:51Z)
• SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
  We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
  arXiv  Detail & Related papers  (2024-07-12T16:50:01Z)
• A Family of Quantum Codes with Exotic Transversal Gates [0.0]
  An algorithm shows the binary icosahedral group $2I$ together with a $T$-like gate forms the most efficient single-qubit gate set. To carry out the algorithm fault tolerantly requires a code that implements $ico$ly. We fill this void by constructing a family of distanced = 3$ codes that all implement $2I$ly.
  arXiv  Detail & Related papers  (2023-05-11T17:58:29Z)
• CSS code surgery as a universal construction [51.63482609748332]
  We define code maps between Calderbank-Shor-Steane (CSS) codes using maps between chain complexes. We describe code surgery between such codes using a specific colimit in the category of chain complexes.
  arXiv  Detail & Related papers  (2023-01-31T16:17:25Z)
• Morphing quantum codes [77.34726150561087]
  We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate. We construct a family of hybrid color-toric codes by morphing the color code.
  arXiv  Detail & Related papers  (2021-12-02T17:43:00Z)
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes [63.62764375279861]
  We compare two leading FT implementations of the T gate in 2D color codes under circuit noise. We find a circuit noise threshold of 0.07(1)% for the T gate via code switching, almost an order of magnitude below that achievable by state distillation in the same setting.
  arXiv  Detail & Related papers  (2021-01-06T19:00:01Z)
• Classical Coding Problem from Transversal $T$ Gates [10.478611957969145]
  We show that triorthogonal codes are, essentially, the only family of CSS codes that realize logical $T$ via physical $T$. We also use Ax's theorem to characterize the logical operation realized on a family of quantum Reed-Muller codes.
  arXiv  Detail & Related papers  (2020-01-14T16:45:48Z)
• Efficient color code decoders in $d\geq 2$ dimensions from toric code decoders [77.34726150561087]
  We prove that the Restriction Decoder successfully corrects errors in the color code if and only if the corresponding toric code decoding succeeds. We numerically estimate the Restriction Decoder threshold for the color code in two and three dimensions against the bit-flip and phase-flip noise.
  arXiv  Detail & Related papers  (2019-05-17T17:41:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.