Long-range-enhanced surface codes

• URL: http://arxiv.org/abs/2309.11719v4
• Date: Fri, 11 Oct 2024 22:20:06 GMT
• Title: Long-range-enhanced surface codes
• Authors: Yifan Hong, Matteo Marinelli, Adam M. Kaufman, Andrew Lucas,
• Abstract summary: The surface code is a quantum error-correcting code for one logical qubit, protected by spatially localized parity checks in two dimensions. We show that storing more logical qubits requires either sacrificing the robustness of the surface code against errors or increasing the number of physical qubits. Long-range-enhanced surface codes outperform conventional surface codes using hundreds of physical qubits, and represent a practical strategy to enhance the robustness of logical qubits to errors in near-term devices.
• Score: 0.0
• License:
• Abstract: The surface code is a quantum error-correcting code for one logical qubit, protected by spatially localized parity checks in two dimensions. Due to fundamental constraints from spatial locality, storing more logical qubits requires either sacrificing the robustness of the surface code against errors or increasing the number of physical qubits. We bound the minimal number of spatially nonlocal parity checks necessary to add logical qubits to a surface code while maintaining, or improving, robustness to errors. We saturate the lower limit of this bound, when the number of added logical qubits is a constant, using a family of hypergraph product codes, interpolating between the surface code and constant-rate low-density parity-check codes. Fault-tolerant protocols for logical gates in the quantum code can be inherited from its classical parent codes. We provide near-term practical implementations of this code for hardware based on trapped ions or neutral atoms in mobile optical tweezers. Long-range-enhanced surface codes outperform conventional surface codes using hundreds of physical qubits, and represent a practical strategy to enhance the robustness of logical qubits to errors in near-term devices.

Related papers

• High-distance codes with transversal Clifford and $T$-gates [0.6138671548064355]
  We present a family of high-distance triply even codes which admit an implementation of the logical $textttT$-gate. To our knowledge, both code families require a lower qubit overhead than any other qubit stabilizer code of the same distance which can realize their respective gates.
  arXiv  Detail & Related papers  (2024-08-22T22:45:47Z)
• Toward a 2D Local Implementation of Quantum LDPC Codes [1.1936126505067601]
  Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes. We present an error correction protocol built on a bilayer architecture that aims to reduce operational overheads when restricted to 2D local gates.
  arXiv  Detail & Related papers  (2024-04-26T19:48:07Z)
• Lift-Connected Surface Codes [1.4767596539913115]
  We use the recently introduced lifted product to construct a family of Quantum Low Density Parity Check Codes (QLDPC codes) The codes we obtain can be viewed as stacks of surface codes that are interconnected, leading to the name lift-connected surface (LCS) codes. For example, already at moderate numbers of physical qubits in the order of tens, LCS codes of equal size have lower logical error rate or similarly, require fewer qubits for a fixed target logical error rate.
  arXiv  Detail & Related papers  (2024-01-05T17:22:49Z)
• Matching Generalized-Bicycle Codes to Neutral Atoms for Low-Overhead Fault-Tolerance [7.718509743812828]
  We present a protocol for implementing a restricted set of space-efficient quantum error correcting codes in atom arrays. This protocol enables generalized-bicycle codes that require up to 10x fewer physical qubits than surface codes. We also evaluate a proof-of-concept quantum memory hier- archy where generalized-bicycle codes are used in conjunction with surface codes for general computation.
  arXiv  Detail & Related papers  (2023-11-28T17:31:08Z)
• 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)
• Hierarchical memories: Simulating quantum LDPC codes with local gates [0.05156484100374058]
  Constant-rate low-density parity-check (LDPC) codes are promising candidates for constructing efficient fault-tolerant quantum memories. We construct a new family of hierarchical codes, that encode a number of logical qubits K = Omega(N/log(N)2. Under conservative assumptions, we find that the hierarchical code outperforms the basic encoding where all logical qubits are encoded in the surface code.
  arXiv  Detail & Related papers  (2023-03-08T18:48:12Z)
• 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)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
  We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions. We explore novel schemes for universal logic that improve resource overheads. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
  arXiv  Detail & Related papers  (2021-12-22T19:00:03Z)
• Relaxation times do not capture logical qubit dynamics [50.04886706729045]
  We show that spatial noise correlations can give rise to rich and counter-intuitive dynamical behavior of logical qubits. This work will help to guide and benchmark experimental implementations of logical qubits.
  arXiv  Detail & Related papers  (2020-12-14T19:51:19Z)

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.