Limitations on transversal gates for hypergraph product codes

• URL: http://arxiv.org/abs/2012.05842v1
• Date: Thu, 10 Dec 2020 17:34:42 GMT
• Title: Limitations on transversal gates for hypergraph product codes
• Authors: Simon Burton and Dan Browne
• Abstract summary: We analyze the structure of the logical operators from a class of quantum codes that generalizes the surface codes. By generalizing an argument of Bravyi and K"onig, we find that gates for these codes must be restricted to the Clifford group.
• Score: 1.218340575383456
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We analyze the structure of the logical operators from a class of quantum codes that generalizes the surface codes. These are the hypergraph product codes, restricted to the vertical sector. By generalizing an argument of Bravyi and K\"onig, we find that transversal gates for these codes must be restricted to the Clifford group.

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)
• 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)
• Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
  We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
  arXiv  Detail & Related papers  (2023-07-20T10:51:23Z)
• Holographic Codes from Hyperinvariant Tensor Networks [70.31754291849292]
  We show that a new class of exact holographic codes, extending the previously proposed hyperinvariant tensor networks into quantum codes, produce the correct boundary correlation functions. This approach yields a dictionary between logical states in the bulk and the critical renormalization group flow of boundary states.
  arXiv  Detail & Related papers  (2023-04-05T20:28:04Z)
• Transversal Diagonal Logical Operators for Stabiliser Codes [0.0]
  Pauli group operators can be implemented on quantum error correction codes. We identify logical operators composed of single and multi-qubit diagonal Clifford hierarchy gates. We show a method for constructing CSS codes that have a desired diagonal logical Clifford hierarchy operator implemented using single qubit phase gates.
  arXiv  Detail & Related papers  (2023-03-27T21:49:37Z)
• 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)
• Partitioning qubits in hypergraph product codes to implement logical gates [0.0]
  Transversal gates are the simplest type of fault-tolerant logical gates. We show that gates can be used as the basis for universal quantum computing on LDPC codes.
  arXiv  Detail & Related papers  (2022-04-22T16:45:19Z)
• Fold-Transversal Clifford Gates for Quantum Codes [9.843798303860343]
  We generalize the concept of folding from surface codes to CSS codes. We consider a hyperbolic quantum code called Bring's code. We show that by restricting the logical subspace of Bring's code to four qubits, we can obtain the full Clifford group.
  arXiv  Detail & Related papers  (2022-02-14T12:00:35Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)
• Fault-tolerant logical gates in holographic stabilizer codes are severely restricted [0.0]
  We evaluate the usefulness of holographic stabilizer codes for practical purposes by studying their allowed sets of fault-tolerantly implementable gates. We show that the set of stabilizerly implementable logical operations is contained in the Clifford group for sufficiently localized logical subsystems.
  arXiv  Detail & Related papers  (2021-03-24T18:00:05Z)

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.