Evolving Quantum Error-Correcting Encodings for Molecular Simulation

• URL: http://arxiv.org/abs/2606.25870v1
• Date: Wed, 24 Jun 2026 14:19:43 GMT
• Title: Evolving Quantum Error-Correcting Encodings for Molecular Simulation
• Abstract summary: We study a language model edits a program, an external verifier scores the result, and high-scoring programs are retained and remutated.<n>As a case study, we apply this loop to the Generalized Superfast (GSE), a fermion-to-qubit encoding.<n>To our knowledge these are the first GSE/superfast encodings beyond distance $3$ for dense molecular Hamiltonians.
• Score: 0.6372261626436676
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Useful quantum algorithms require many coupled discrete design choices. We study LLM-driven evolutionary program synthesis -- a language model edits a program, an external verifier scores the result, and high-scoring programs are retained and re-mutated -- as a tool for quantum-computing research. As a case study, we apply this loop to the Generalized Superfast Encoding (GSE), a fermion-to-qubit encoding whose prior molecular constructions reach code distance $3$. The search discovered interpretable constructor programs whose codes have \emph{exact} distance $5$ on the molecular instances tested, and distance $6$ on one $20$-mode instance, under strict stabilizer-coset semantics. To our knowledge these are the first GSE/superfast encodings beyond distance $3$ for dense molecular Hamiltonians. A second search, guided by verifier analysis of the first artifact, found a circulant constructor that reaches a five-qubits-per-mode floor on the tested $12$-, $14$-, $16$-, and $20$-mode instances, with certified dense-rule fallback at the failing $18$-mode case. As secondary resource descriptors, in a code-capacity \emph{memory} comparison at $p=10^{-3}$ the resulting encodings use $4.2$--$5.0\times$ fewer data qubits than a scoped per-mode Jordan--Wigner $+$ $[[25,1,5]]$ surface route and have $3.4$--$8.2\times$ lower logical-failure rates under finite-weight decoding tables with explicit truncation brackets; we claim no circuit-level fault-tolerance or Trotter-cost advantage. The search trajectory illustrates a general operating lesson: rewarding distance alone selects trivial dense graphs, whereas holding verified distance fixed and rewarding compression selects structured rules.

Related papers

• Entropic Rigidity in Quantum Memories: How Geometry and Algebra Control the Onset of Degeneracy Corrections [4.226475360842309]
  We determine the first physical error weight $m$ at which their logical winner sets become disjoint.<n>The onset fixes the leading operational failure gap, proportional to the $m$th power of the physical noise strength.
  arXiv  Detail & Related papers  (2026-08-19T01:17:59Z)
• Hardness of approximation for minimum-weight decoding of two-dimensional topological quantum codes [0.0]
  We study the computational complexity of minimum-weight decoding for topological quantum codes.<n>For color codes under independent $X$- and $Z$-error models, we consider Separate Minimum-Weight decoding.
  arXiv  Detail & Related papers  (2026-08-17T20:37:08Z)
• Quantum error correction at ultra-low overhead [0.0]
  Suppressing errors is the central challenge for useful large-scale quantum computing.<n>We introduce Cornucopia codes, a family of practical, hardware-efficient quantum low-density parity-check codes.<n>Results bring demonstrations of ultra-low overhead quantum error correction within the reach of near-term quantum processors.
  arXiv  Detail & Related papers  (2026-08-03T18:13:57Z)
• Logical Compilation for Multi-Qubit Iceberg Patches [0.9221237159787892]
  We study the problem of mapping program qubits to logical qubits for high-rate codes.<n>We propose a framework that addresses this problem on two fronts.<n>Our compiler is the first work to explore mapping and compilation for high-rate codes.
  arXiv  Detail & Related papers  (2026-04-10T23:31:03Z)
• $\ exttt{Droid}$: A Resource Suite for AI-Generated Code Detection [75.6327970381944]
  $textbf$textttDroidCollection$$ is an open data suite for training and evaluating machine-generated code detectors.<n>It includes over a million code samples, seven programming languages, outputs from 43 coding models, and three real-world coding domains.<n>We also develop a suite of encoder-only detectors trained using a multi-task objective over $textttDroidCollection$$.
  arXiv  Detail & Related papers  (2025-07-11T12:19:06Z)
• Tesseract: A Search-Based Decoder for Quantum Error Correction [0.029541734875307393]
  Tesseract is a Most-Likely Error decoder for low-density-parity-check quantum error-correcting codes.<n>We show that Tesseract is significantly faster than integer programming while retaining moderate physical error rates.<n>We also find that Tesseract can decode protocols for surface codes on neutral atom quantum computers.
  arXiv  Detail & Related papers  (2025-03-14T01:23:53Z)
• Efficient and Universal Neural-Network Decoder for Stabilizer-Based Quantum Error Correction [44.698141103370546]
  GraphQEC is a code-agnostic decoder leveraging machine-learning on the graph structure of stabilizer codes with linear time complexity.<n>Our approach represents the first universal solution for real-time quantum error correction across arbitrary stabilizer codes.
  arXiv  Detail & Related papers  (2025-02-27T10:56:53Z)
• Demonstrating dynamic surface codes [118.67046728951689]
  We experimentally demonstrate three time-dynamic implementations of the surface code.<n>First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three.<n>Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors.<n>Third, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead.
  arXiv  Detail & Related papers  (2024-12-18T21:56: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.<n>Our work indicates that Evenbly codes may show promise for practical quantum computing applications.
  arXiv  Detail & Related papers  (2024-07-16T17:18:13Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Performance Analysis of Quantum CSS Error-Correcting Codes via MacWilliams Identities [9.69910104594168]
  We analyze the performance of stabilizer codes, one of the most important classes for practical implementations. We introduce a novel approach that combines the knowledge of WE with a logical operator analysis. For larger codes our bound provides $rho_mathrmL approx 1215 rho4$ and $rho_mathrmL approx 663 rho5$ for the $[85,1,7]]$ and the $[181,1,10]]$ surface codes.
  arXiv  Detail & Related papers  (2023-05-02T10:19:02Z)
• Scalable Quantum Error Correction for Surface Codes using FPGA [67.74017895815125]
  A fault-tolerant quantum computer must decode and correct errors faster than they appear. We report a distributed version of the Union-Find decoder that exploits parallel computing resources for further speedup. The implementation employs a scalable architecture called Helios that organizes parallel computing resources into a hybrid tree-grid structure.
  arXiv  Detail & Related papers  (2023-01-20T04:23:00Z)
• Quantum Resources Required to Block-Encode a Matrix of Classical Data [56.508135743727934]
  We provide circuit-level implementations and resource estimates for several methods of block-encoding a dense $Ntimes N$ matrix of classical data to precision $epsilon$. We examine resource tradeoffs between the different approaches and explore implementations of two separate models of quantum random access memory (QRAM) Our results go beyond simple query complexity and provide a clear picture into the resource costs when large amounts of classical data are assumed to be accessible to quantum algorithms.
  arXiv  Detail & Related papers  (2022-06-07T18:00:01Z)

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.