Related papers: Quantum Codes on Graphs

Quantum Codes on Graphs

URL: http://arxiv.org/abs/2308.10264v1
Date: Sun, 20 Aug 2023 13:22:58 GMT
Title: Quantum Codes on Graphs
Authors: M. B. Hastings
Abstract summary: We consider some questions related to codes constructed using various graphs. We consider Floquet codes which can be constructed using emergent fermions"
Score: 0.0
License: http://creativecommons.org/licenses/by/4.0/
Abstract: We consider some questions related to codes constructed using various graphs, in particular focusing on graphs which are not lattices in two or three dimensions. We begin by considering Floquet codes which can be constructed using ``emergent fermions". Here, we are considering codes that in some sense generalize the honeycomb code[1] to more general, non-planar graphs. We then consider a class of these codes that is related to (generalized) toric codes on $2$-complexes. For (generalized) toric codes on $2$-complexes, the following question arises: can the distance of these codes grow faster than square-root? We answer the question negatively, and remark on recent systolic inequalities[2]. We then turn to the case that of planar codes with vacancies, or ``dead qubits", and consider the statistical mechanics of decoding in this setting. Although we do not prove a threshold, our results should be asymptotically correct for low error probability and high degree decoding graphs (high degree taken before low error probability). In an appendix, we discuss a toy model of vacancies in planar quantum codes, giving a phenomenological discussion of how errors occur when ``super-stabilizers" are not measured, and in a separate appendix we discuss a relation between Floquet codes and chain maps.

Related papers

Wire Codes [0.0]
We introduce a recipe to transform any quantum stabilizer code into a subsystem code with related code parameters that has weight and degree three. We call the subsystem codes produced by our recipe "wire codes" Our results constitute a general method to construct low-overhead subsystem codes on general graphs.
arXiv Detail & Related papers (2024-10-14T06:27:09Z)
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)
How much entanglement is needed for quantum error correction? [10.61261983484739]
It is commonly believed that logical states of quantum error-correcting codes have to be highly entangled. Here we show that this belief may or may not be true depending on a particular code.
arXiv Detail & Related papers (2024-05-02T14:35:55Z)
Floquetifying the Colour Code [0.0]
We use the ZX-calculus to create new Floquet codes that are in a definable sense equivalent to known stabilizer codes. This work shines a light on the relationship between'static' stabilizer and subsystem codes and 'dynamic' Floquet codes.
arXiv Detail & Related papers (2023-07-20T17:01:16Z)
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)
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)
Quantum computation on a 19-qubit wide 2d nearest neighbour qubit array [59.24209911146749]
This paper explores the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds. We engineer an error bias at the lowest level of encoding using the surface code. We then address this bias at a higher level of encoding using a lattice-surgery surface code bus.
arXiv Detail & Related papers (2022-12-03T06:16:07Z)
Quantum Tanner codes [0.38073142980732994]
We prove a theorem that simultaneously gives a growing minimum distance for the quantum code and recovers the local testability of the Dinur et al. code.
arXiv Detail & Related papers (2022-02-28T09:35:31Z)
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)
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)
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.