Related papers: Classical Coding Problem from Transversal $T$ Gates

Classical Coding Problem from Transversal $T$ Gates

URL: http://arxiv.org/abs/2001.04887v3
Date: Wed, 18 Aug 2021 20:45:42 GMT
Title: Classical Coding Problem from Transversal $T$ Gates
Authors: Narayanan Rengaswamy, Robert Calderbank, Michael Newman, and Henry D. Pfister
Abstract summary: 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.
Score: 10.478611957969145
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Universal quantum computation requires the implementation of a logical non-Clifford gate. In this paper, we characterize all stabilizer codes whose code subspaces are preserved under physical $T$ and $T^{-1}$ gates. For example, this could enable magic state distillation with non-CSS codes and, thus, provide better parameters than CSS-based protocols. However, among non-degenerate stabilizer codes that support transversal $T$, we prove that CSS codes are optimal. We also show that triorthogonal codes are, essentially, the only family of CSS codes that realize logical transversal $T$ via physical transversal $T$. Using our algebraic approach, we reveal new purely-classical coding problems that are intimately related to the realization of logical operations via transversal $T$. Decreasing monomial codes are also used to construct a code that realizes logical CCZ. Finally, we use Ax's theorem to characterize the logical operation realized on a family of quantum Reed-Muller codes. This result is generalized to finer angle $Z$-rotations in arXiv:1910.09333.

Related papers

Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
arXiv Detail & Related papers (2024-10-10T04:07:24Z)
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)
Equivalence Classes of Quantum Error-Correcting Codes [49.436750507696225]
Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes. We represent QECC's in a form called a ZX diagram, consisting of a tensor network.
arXiv Detail & Related papers (2024-06-17T20:48:43Z)
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)
Homological Quantum Rotor Codes: Logical Qubits from Torsion [51.9157257936691]
homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code. We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
arXiv Detail & Related papers (2023-03-24T00:29:15Z)
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)
Divisible Codes for Quantum Computation [0.6445605125467572]
Divisible codes are defined by the property that codeword weights share a common divisor greater than one. This paper explores how they can be used to protect quantum information as it is transformed by logical gates.
arXiv Detail & Related papers (2022-04-27T20:18:51Z)
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)
Climbing the Diagonal Clifford Hierarchy [0.6445605125467572]
We introduce a method of synthesizing codes that realize a target logical diagonal gate at some level $l$ in the Clifford hierarchy. The method combines three basic operations: concatenation, removal of $Z$-stabilizers, and addition of $X$-stabilizers. For the coherent noise model, we describe how to switch between computation and storage of intermediate results in a decoherence-free subspace.
arXiv Detail & Related papers (2021-10-22T17:08:18Z)
Designing the Quantum Channels Induced by Diagonal Gates [0.5735035463793007]
Diagonal gates play an important role in implementing a universal set of quantum operations. This paper describes the process of preparing a code state, applying a diagonal physical gate, measuring a code syndrome, and applying a Pauli correction.
arXiv Detail & Related papers (2021-09-28T04:39:15Z)

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