Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes

• URL: http://arxiv.org/abs/2308.03750v2
• Date: Fri, 22 Nov 2024 18:55:45 GMT
• Title: Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes
• Authors: Oscar Higgott, Nikolas P. Breuckmann,
• Abstract summary: We construct families of Floquet codes derived from colour code tilings of closed hyperbolic surfaces. We also construct semi-hyperbolic Floquet codes, which have improved distance scaling.
• Score: 7.059472280274009
• License:
• Abstract: We construct families of Floquet codes derived from colour code tilings of closed hyperbolic surfaces. These codes have weight-two check operators, a finite encoding rate and can be decoded efficiently with minimum-weight perfect matching. We also construct semi-hyperbolic Floquet codes, which have improved distance scaling, and are obtained via a fine-graining procedure. Using a circuit-based noise model that assumes direct two-qubit measurements, we show that semi-hyperbolic Floquet codes can be $48\times$ more efficient than planar honeycomb codes and therefore over $100\times$ more efficient than alternative compilations of the surface code to two-qubit measurements, even at physical error rates of $0.3\%$ to $1\%$. We further demonstrate that semi-hyperbolic Floquet codes can have a teraquop footprint of only 32 physical qubits per logical qubit at a noise strength of $0.1\%$. For standard circuit-level depolarising noise at $p=0.1\%$, we find a $30\times$ improvement over planar honeycomb codes and a $5.6\times$ improvement over surface codes. Finally, we analyse small instances that are amenable to near-term experiments, including a Floquet code derived from the Bolza surface that encodes four logical qubits into 16 physical qubits.

Related papers

• Quantum error correction below the surface code threshold [107.92016014248976]
  Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit. We present two surface code memories operating below a critical threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-24T23:08:50Z)
• Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes [38.729065908701585]
  We introduce a new class of qubit codes that we call Evenbly codes. Our work indicates that Evenbly codes may show promise for practical quantum computing applications.
  arXiv  Detail & Related papers  (2024-07-16T17:18:13Z)
• SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
  We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
  arXiv  Detail & Related papers  (2024-07-12T16:50:01Z)
• High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory [0.6144680854063939]
  We present a new family of quantum low-density parity-check codes, which we call radial codes. In simulations of circuit-level noise, we observe comparable error suppression to surface codes of similar distance. Their error correction capabilities, tunable parameters and small size make them promising candidates for implementation on near-term quantum devices.
  arXiv  Detail & Related papers  (2024-06-20T16:08:06Z)
• Fault-tolerant hyperbolic Floquet quantum error correcting codes [0.0]
  We introduce a family of dynamically generated quantum error correcting codes that we call "hyperbolic Floquet codes" One of our hyperbolic Floquet codes uses 400 physical qubits to encode 52 logical qubits with a code distance of 8, i.e., it is a $[[400,52,8]]$ code. At small error rates, comparable logical error suppression to this code requires 5x as many physical qubits (1924) when using the honeycomb Floquet code with the same noise model and decoder.
  arXiv  Detail & Related papers  (2023-09-18T18:00:02Z)
• Discovery of Optimal Quantum Error Correcting Codes via Reinforcement Learning [0.0]
  The recently introduced Quantum Lego framework provides a powerful method for generating complex quantum error correcting codes. We gamify this process and unlock a new avenue for code design and discovery using reinforcement learning (RL) We train on two such properties, maximizing the code distance, and minimizing the probability of logical error under biased Pauli noise.
  arXiv  Detail & Related papers  (2023-05-10T18:00:03Z)
• 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)
• Suppressing quantum errors by scaling a surface code logical qubit [147.2624260358795]
  We report the measurement of logical qubit performance scaling across multiple code sizes. Our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. Results mark the first experimental demonstration where quantum error correction begins to improve performance with increasing qubit number.
  arXiv  Detail & Related papers  (2022-07-13T18:00:02Z)
• 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)
• Low overhead fault-tolerant quantum error correction with the surface-GKP code [60.44022726730614]
  We propose a highly effective use of the surface-GKP code, i.e., the surface code consisting of bosonic GKP qubits instead of bare two-dimensional qubits. We show that a low logical failure rate $p_L 10-7$ can be achieved with moderate hardware requirements.
  arXiv  Detail & Related papers  (2021-03-11T23:07:52Z)
• A Numerical Study of Bravyi-Bacon-Shor and Subsystem Hypergraph Product Codes [0.0]
  We show that hypergraph product codes can be obtained by entangling the gauge qubits of two SHP codes. For circuit noise, a BBS code and a SHP code have pseuds of $2times10-3$ and $8times10-4$, respectively.
  arXiv  Detail & Related papers  (2020-02-14T21:40:44Z)

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.