A graph-based formalism for surface codes and twists

• URL: http://arxiv.org/abs/2101.09349v4
• Date: Wed, 17 Jul 2024 03:42:40 GMT
• Title: A graph-based formalism for surface codes and twists
• Authors: Rahul Sarkar, Theodore J. Yoder,
• Abstract summary: We provide a rigorous formalism for constructing surface codes with twists. We associate a surface code to any graph $G$ embedded on any 2D-manifold. We calculate and bound various code properties such as the rate and distance.
• Score: 0.7673339435080445
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Twist defects in surface codes can be used to encode more logical qubits, improve the code rate, and implement logical gates. In this work we provide a rigorous formalism for constructing surface codes with twists generalizing the well-defined homological formalism introduced by Kitaev for describing CSS surface codes. In particular, we associate a surface code to any graph $G$ embedded on any 2D-manifold, in such a way that (1) qubits are associated to the vertices of the graph, (2) stabilizers are associated to faces, (3) twist defects are associated to odd-degree vertices. In this way, we are able to reproduce the variety of surface codes, with and without twists, in the literature and produce some new examples. We also calculate and bound various code properties such as the rate and distance in terms of topological graph properties such as genus, systole, and face-width.

Related papers

• Layer Codes [0.0]
  In three dimensions an analogous simple yet optimal code was not previously known. The output codes have the special structure of being topological defect networks formed by layers of surface code joined along one-dimensional junctions.
  arXiv  Detail & Related papers  (2023-09-28T15:11:37Z)
• NeuroGF: A Neural Representation for Fast Geodesic Distance and Path Queries [77.04220651098723]
  This paper presents the first attempt to represent geodesics on 3D mesh models using neural implicit functions. Specifically, we introduce neural geodesic fields (NeuroGFs), which are learned to represent the all-pairs geodesics of a given mesh. NeuroGFs exhibit exceptional performance in solving the single-source all-destination (SSAD) and point-to-point geodesics.
  arXiv  Detail & Related papers  (2023-06-01T13:32:21Z)
• Flattening-Net: Deep Regular 2D Representation for 3D Point Cloud Analysis [66.49788145564004]
  We present an unsupervised deep neural architecture called Flattening-Net to represent irregular 3D point clouds of arbitrary geometry and topology. Our methods perform favorably against the current state-of-the-art competitors.
  arXiv  Detail & Related papers  (2022-12-17T15:05:25Z)
• A Genus-two Surface Code [0.0]
  We construct a double-toric surface code by exploiting the planar tessellation using a rhombus-shaped tile. With n data qubits, we are able to encode at least n/3 logical qubits or quantum memories.
  arXiv  Detail & Related papers  (2022-11-23T04:13:29Z)
• Neural Convolutional Surfaces [59.172308741945336]
  This work is concerned with a representation of shapes that disentangles fine, local and possibly repeating geometry, from global, coarse structures. We show that this approach achieves better neural shape compression than the state of the art, as well as enabling manipulation and transfer of shape details.
  arXiv  Detail & Related papers  (2022-04-05T15:40:11Z)
• Holography, cellulations and error correcting codes [0.0]
  We study codes associated with holographic geometries in higher dimensions, relating cellulations of the spatial sections of the geometries to stabiliser codes. We construct analogues of the HaPPY code for three-dimensional hyperbolic space (AdS$_4$), using both absolutely maximally entangled (AME) and non-AME codes. We explain how our codes could be applied to interesting classes of holographic dualities based on gravity-scalar theories (such as JT gravity) through toroidal reductions of hyperbolic spaces.
  arXiv  Detail & Related papers  (2021-12-23T11:16:56Z)
• DualConv: Dual Mesh Convolutional Networks for Shape Correspondence [44.94765770516059]
  Convolutional neural networks have been extremely successful for 2D images and are readily extended to handle 3D voxel data. In this paper we explore how these networks can be extended to the dual face-based representation of triangular meshes. Our experiments demonstrate that building additionally convolutional models that explicitly leverage the neighborhood size regularity of dual meshes enables learning shape representations that perform on par or better than previous approaches.
  arXiv  Detail & Related papers  (2021-03-23T11:22:47Z)
• Graph state representation of the toric code [0.0]
  We show that the toric code graph is composed of only two kinds of subgraphs: star graphs (which encode Greenberger-Horne-Zeilinger states) and half graphs. The results provide a new graph-theoretic framework for the investigation of topological order and the development of novel topological error correction codes.
  arXiv  Detail & Related papers  (2021-03-23T02:27:07Z)
• Primal-Dual Mesh Convolutional Neural Networks [62.165239866312334]
  We propose a primal-dual framework drawn from the graph-neural-network literature to triangle meshes. Our method takes features for both edges and faces of a 3D mesh as input and dynamically aggregates them. We provide theoretical insights of our approach using tools from the mesh-simplification literature.
  arXiv  Detail & Related papers  (2020-10-23T14:49:02Z)
• DSG-Net: Learning Disentangled Structure and Geometry for 3D Shape Generation [98.96086261213578]
  We introduce DSG-Net, a deep neural network that learns a disentangled structured and geometric mesh representation for 3D shapes. This supports a range of novel shape generation applications with disentangled control, such as of structure (geometry) while keeping geometry (structure) unchanged. Our method not only supports controllable generation applications but also produces high-quality synthesized shapes, outperforming state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-08-12T17:06:51Z)
• Deep Geometric Texture Synthesis [83.9404865744028]
  We propose a novel framework for synthesizing geometric textures. It learns texture statistics from local neighborhoods of a single reference 3D model. Our network displaces mesh vertices in any direction, enabling synthesis of geometric textures.
  arXiv  Detail & Related papers  (2020-06-30T19:36:38Z)

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.