Fermion-to-qubit encodings with arbitrary code distance

• URL: http://arxiv.org/abs/2505.02916v2
• Date: Tue, 20 May 2025 14:55:00 GMT
• Title: Fermion-to-qubit encodings with arbitrary code distance
• Authors: Manuel G. Algaba, Miha Papič, Inés de Vega, Alessio Calzona, Fedor Šimkovic IV,
• Abstract summary: We introduce a framework which allows to scale the code distance of local fermion-to-qubit encodings in one and two dimensions without growing the weights of stabilizers.<n>This is achieved by embedding low-distance encodings into the surface code in the form of topological defects.<n>We show that our strategy is also extendable to other topological codes by explicitly embedding the LE into a 6.6.6 color code.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a framework which allows to systematically and arbitrarily scale the code distance of local fermion-to-qubit encodings in one and two dimensions without growing the weights of stabilizers. This is achieved by embedding low-distance encodings into the surface code in the form of topological defects. We introduce a family of Ladder Encodings (LE), which is optimal in the sense that the code distance is equal to the weights of density and nearest-neighbor hopping operators of a one-dimensional Fermi-Hubbard model. In two dimensions, we show how to scale the code distance of LE as well as other low-distance encodings such as Verstraete-Cirac and Derby-Klassen. We further introduce Perforated Encodings, which locally encode two fermionic spin modes within the same surface code structure. We show that our strategy is also extendable to other topological codes by explicitly embedding the LE into a 6.6.6 color code.

Related papers

• Almost Linear Decoder for Optimal Geometrically Local Quantum Codes [8.837439668920288]
  We show how to achieve geometrically local codes that maximize both the dimension and the distance, as well as the energy barrier of the code. This provides the first decoder for an optimal 3D geometrically local code.
  arXiv  Detail & Related papers  (2024-11-05T09:15:06Z)
• Transversal Clifford and T-gate codes of short length and high distance [0.6138671548064355]
  We construct three kinds of codes encoding a single logical qubit for distances up to $31$.<n>To our knowledge, these are the smallest known triorthogonal codes for their respective distances.
  arXiv  Detail & Related papers  (2024-08-22T22:45:47Z)
• Factor Graph Optimization of Error-Correcting Codes for Belief Propagation Decoding [62.25533750469467]
  Low-Density Parity-Check (LDPC) codes possess several advantages over other families of codes. The proposed approach is shown to outperform the decoding performance of existing popular codes by orders of magnitude.
  arXiv  Detail & Related papers  (2024-06-09T12:08:56Z)
• Progressive-Proximity Bit-Flipping for Decoding Surface Codes [8.971989179518214]
  Topological quantum codes, such as toric and surface codes, are excellent candidates for hardware implementation. Existing decoders often fall short of meeting requirements such as having low computational complexity. We propose a novel bit-flipping (BF) decoder tailored for toric and surface codes.
  arXiv  Detail & Related papers  (2024-02-24T22:38:05Z)
• Low-Weight High-Distance Error Correcting Fermionic Encodings [0.0]
  We search for practical fermion-to-qubit encodings with error correcting properties. We report multiple promising high-distance encodings which significantly improve the weights of stabilizers and logical operators.
  arXiv  Detail & Related papers  (2024-02-23T15:32:57Z)
• SCALAR-NeRF: SCAlable LARge-scale Neural Radiance Fields for Scene Reconstruction [66.69049158826677]
  We introduce SCALAR-NeRF, a novel framework tailored for scalable large-scale neural scene reconstruction. We structure the neural representation as an encoder-decoder architecture, where the encoder processes 3D point coordinates to produce encoded features. We propose an effective and efficient methodology to fuse the outputs from these local models to attain the final reconstruction.
  arXiv  Detail & Related papers  (2023-11-28T10:18:16Z)
• Towards Accurate Image Coding: Improved Autoregressive Image Generation with Dynamic Vector Quantization [73.52943587514386]
  Existing vector quantization (VQ) based autoregressive models follow a two-stage generation paradigm. We propose a novel two-stage framework: (1) Dynamic-Quantization VAE (DQ-VAE) which encodes image regions into variable-length codes based their information densities for accurate representation.
  arXiv  Detail & Related papers  (2023-05-19T14:56:05Z)
• 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)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• KO codes: Inventing Nonlinear Encoding and Decoding for Reliable Wireless Communication via Deep-learning [76.5589486928387]
  Landmark codes underpin reliable physical layer communication, e.g., Reed-Muller, BCH, Convolution, Turbo, LDPC and Polar codes. In this paper, we construct KO codes, a computationaly efficient family of deep-learning driven (encoder, decoder) pairs. KO codes beat state-of-the-art Reed-Muller and Polar codes, under the low-complexity successive cancellation decoding.
  arXiv  Detail & Related papers  (2021-08-29T21:08:30Z)
• Optimal local unitary encoding circuits for the surface code [0.2770822269241973]
  The surface code is a leading candidate quantum error correcting code, owing to its high threshold. We present an optimal local unitary encoding circuit for the planar surface code. We also show how our encoding circuit for the planar code can be used to prepare fermionic states in the compact mapping.
  arXiv  Detail & Related papers  (2020-02-02T11:09:46Z)

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.