Topological graph states and quantum error correction codes

• URL: http://arxiv.org/abs/2112.02502v1
• Date: Sun, 5 Dec 2021 07:43:24 GMT
• Title: Topological graph states and quantum error correction codes
• Authors: Pengcheng Liao, Barry C. Sanders, David L. Feder
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Deciding if a given family of quantum states is topologically ordered is an important but nontrivial problem in condensed matter physics and quantum information theory. We derive necessary and sufficient conditions for a family of graph states to be in TQO-1, which is a class of quantum error correction code states whose code distance scales macroscopically with the number of physical qubits. Using these criteria, we consider a number of specific graph families, including the star and complete graphs, and the line graphs of complete and completely bipartite graphs, and discuss which are topologically ordered and how to construct the codewords. The formalism is then employed to construct several codes with macroscopic distance, including a three-dimensional topological code generated by local stabilizers that also has a macroscopic number of encoded logical qubits. The results indicate that graph states provide a fruitful approach to the construction and characterization of topological stabilizer quantum error correction codes.

Related papers

• Many-body quantum resources of graph states [0.0]
  Characterizing the non-classical correlations of a complex many-body system is an important part of quantum technologies. We consider four topologies, namely the star graph states with edges, Tur'an graphs, $r$-ary tree graphs, and square grid cluster states. We characterize many-body entanglement depth in graph states with up to $8$ qubits in $146$ classes non-equivalent under local transformations and graph isomorphisms.
  arXiv  Detail & Related papers  (2024-10-16T12:05:19Z)
• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• Chordal Graphs and Distinguishability of Quantum Product States [0.0]
  We identify chordality as the key graph structure that drives distinguishability in one-way LOCC. We derive a one-way LOCC characterization for chordal graphs that establishes a connection with the theory of matrix completions.
  arXiv  Detail & Related papers  (2023-05-17T12:17:47Z)
• Diagnostics of mixed-state topological order and breakdown of quantum memory [0.0]
  Topological quantum memory can protect information against local errors up to finite error thresholds. We provide an intrinsic characterization of the breakdown of topological quantum memory. We employ three information-theoretical quantities that can be regarded as generalizations of the diagnostics of ground-state topological order.
  arXiv  Detail & Related papers  (2023-01-13T18:21: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)
• From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
  We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions. For its practicability and wide-applicability, we give a brief review of typical graph learning techniques. We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
  arXiv  Detail & Related papers  (2022-02-19T02:56:47Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• 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)
• Geometric measure of entanglement of multi-qubit graph states and its detection on a quantum computer [0.0]
  The entanglement of a qubit with other qubits is found for the graph states represented by arbitrary graphs. The geometric measure of entanglement of the graph states is quantified on the quantum computer.
  arXiv  Detail & Related papers  (2021-06-20T12:47:09Z)
• On Applying the Lackadaisical Quantum Walk Algorithm to Search for Multiple Solutions on Grids [63.75363908696257]
  The lackadaisical quantum walk is an algorithm developed to search graph structures whose vertices have a self-loop of weight $l$. This paper addresses several issues related to applying the lackadaisical quantum walk to search for multiple solutions on grids successfully.
  arXiv  Detail & Related papers  (2021-06-11T09:43:09Z)
• 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)

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.