Graph state representation of the toric code

• URL: http://arxiv.org/abs/2103.12268v3
• Date: Fri, 25 Jun 2021 17:52:43 GMT
• Title: Graph state representation of the toric code
• Authors: Pengcheng Liao, David L. Feder
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Given their potential for fault-tolerant operations, topological quantum states are currently the focus of intense activity. Of particular interest are topological quantum error correction codes, such as the surface and planar stabilizer codes that are equivalent to the celebrated toric code. While every stabilizer state maps to a graph state under local Clifford operations, the graphs associated with topological stabilizer codes remain unknown. 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 topological order is identified with the existence of multiple star graphs, which reveals a connection between the repetition and toric codes. The graph structure readily yields a log-depth quantum circuit for state preparation, assuming geometrically non-local gates, which can be reduced to a constant depth including ancillae and measurements at the cost of increasing the circuit width. The results provide a new graph-theoretic framework for the investigation of topological order and the development of novel topological error correction codes.

Related papers

• Deep Manifold Graph Auto-Encoder for Attributed Graph Embedding [51.75091298017941]
  This paper proposes a novel Deep Manifold (Variational) Graph Auto-Encoder (DMVGAE/DMGAE) for attributed graph data. The proposed method surpasses state-of-the-art baseline algorithms by a significant margin on different downstream tasks across popular datasets.
  arXiv  Detail & Related papers  (2024-01-12T17:57:07Z)
• ADA-GAD: Anomaly-Denoised Autoencoders for Graph Anomaly Detection [84.0718034981805]
  We introduce a novel framework called Anomaly-Denoised Autoencoders for Graph Anomaly Detection (ADA-GAD) In the first stage, we design a learning-free anomaly-denoised augmentation method to generate graphs with reduced anomaly levels. In the next stage, the decoders are retrained for detection on the original graph.
  arXiv  Detail & Related papers  (2023-12-22T09:02:01Z)
• Quantum Codes on Graphs [0.0]
  We consider some questions related to codes constructed using various graphs. We consider Floquet codes which can be constructed using emergent fermions"
  arXiv  Detail & Related papers  (2023-08-20T13:22:58Z)
• 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)
• Engineering holography with stabilizer graph codes [2.7309692684728617]
  Recent technological progress in artificial quantum systems renders the experimental realization of holographic codes within reach. We show how to obtain encoding and decoding circuits for the hyperbolic pentagon code, before focusing on a small instance of the holographic code on twelve qubits.
  arXiv  Detail & Related papers  (2022-09-19T12:16:23Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Quantitative approach to Grover's quantum walk on graphs [62.997667081978825]
  We study Grover's search algorithm focusing on continuous-time quantum walk on graphs. Instead of finding specific graph topologies convenient for the related quantum walk, we fix the graph topology and vary the underlying graph endowed Laplacians.
  arXiv  Detail & Related papers  (2022-07-04T19:33:06Z)
• Deep Graph-level Anomaly Detection by Glocal Knowledge Distillation [61.39364567221311]
  Graph-level anomaly detection (GAD) describes the problem of detecting graphs that are abnormal in their structure and/or the features of their nodes. One of the challenges in GAD is to devise graph representations that enable the detection of both locally- and globally-anomalous graphs. We introduce a novel deep anomaly detection approach for GAD that learns rich global and local normal pattern information by joint random distillation of graph and node representations.
  arXiv  Detail & Related papers  (2021-12-19T05:04:53Z)
• Topological graph states and quantum error correction codes [0.0]
  We derive necessary and sufficient conditions for a family of graph states to be in TQO-1. TQO-1 is a class of quantum error correction code states whose code distance scales macroscopically with the number of physical qubits.
  arXiv  Detail & Related papers  (2021-12-05T07:43:24Z)
• Understanding holographic error correction via unique algebras and atomic examples [0.25782420501870296]
  We introduce a fully constructive characterisation of holographic quantum error-correcting codes. We employ quantum circuits to construct a number of examples of holographic codes.
  arXiv  Detail & Related papers  (2021-10-27T18:17:37Z)
• Approximate Bacon-Shor Code and Holography [0.0]
  We explicitly construct a class of holographic quantum error correction codes with non-algebra centers. We use the Bacon-Shor codes and perfect tensors to construct a gauge code (or a stabilizer code with gauge-fixing) We then construct approximate versions of the holographic hybrid codes by "skewing" the code subspace.
  arXiv  Detail & Related papers  (2020-10-12T18:39:09Z)

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.