Physics-Informed Graph-Neural Decoding of the Surface Code: the Logical Signal as an Exact Topological Pairing

• URL: http://arxiv.org/abs/2607.20060v2
• Date: Wed, 29 Jul 2026 11:12:52 GMT
• Title: Physics-Informed Graph-Neural Decoding of the Surface Code: the Logical Signal as an Exact Topological Pairing
• Abstract summary: We develop a physics-informed graph neural network (GNN) decoder for the surface code that solves a discrete Poisson equation on the syndrome graph.<n>We show that the solver's edge current is a pure gradient flow whose harmonic (circulating) part vanishes identically.<n>We prove that this pairing is evaluated exactly and in closed form, with no learned readout parameters, as the net current drained between the two boundary sinks.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We develop a physics-informed graph neural network (GNN) decoder for the surface code that solves a discrete Poisson equation on the syndrome graph, with the syndrome as the charge source. We compare four readout architectures for extracting the logical-error probability: a potential-based readout that maps the Poisson field through a multilayer perceptron, two current-based readouts under single- and two-sink Dirichlet boundary conditions, and a diffusion-based variant. Comparing these, we show that the solver's edge current is a pure gradient flow whose harmonic (circulating) part vanishes identically. The logical signal therefore cannot be read as a component of the current itself; it is instead a topological pairing between the syndrome and a boundary-fixed harmonic coordinate that distinguishes the two code boundaries linked by the logical operator. We prove that this pairing is evaluated exactly and in closed form, with no learned readout parameters, as the net current drained between the two boundary sinks. On the rotated surface code under circuit-level depolarising noise, this single closed-form scalar matches the best full-field readout and, at larger code distance, significantly exceeds the single-sink current pool, so that isolating the pairing helps more, not less, as the field grows larger and sparser. The decoder is not intended to surpass minimum-weight perfect matching, near-optimal for this noise model; its contribution is an interpretable characterisation of the logical signal itself.

Related papers

• Learning Metamaterial Eigenmodes with Wavelet-Encoded Fourier Neural Operators [57.64362886310329]
  We show that a machine learning surrogate based on neural operators can learn and predict multiple eigenmodes of the elastic wave equation.<n>For metamaterial design, the resulting surrogate accelerates the simulation stage of the design cycle by three orders of magnitude relative to finite element analysis on a consumer-grade CPU.<n>These results also carry broader implications for designing input encodings in other multi-mode PDE solvers based on spectral neural operators.
  arXiv  Detail & Related papers  (2026-09-08T01:21:46Z)
• The Gain-Engineered Transmon [68.89136228609398]
  We introduce and experimentally realize a noise-biased qubit in a standard transmon-readout resonator circuit.<n>Our results open a path towards using this system as a simple building-block for hardware-efficient quantum error detection and correction schemes.
  arXiv  Detail & Related papers  (2026-08-26T17:00:42Z)
• Logarithmic depth compression of Heisenberg Hamiltonian simulation by fan-out parallelization, with built-in error detection [0.0]
  Fan-out-based gadget compiler trades circuit depth for width in simulations of Heisenberg-type nuclear magnetic resonance (NMR) Hamiltonians.<n>We simulate the zero-field NMR spectrum of tetramethylsilane, a 13-spin star system.
  arXiv  Detail & Related papers  (2026-08-20T16:46:41Z)
• Towards the Characterization of Logical Errors in Distributed Lattice Surgery [1.9622606672571925]
  Inter-module quantum operations are noisier than intra-module local gates, which introduces additional noise into the system.<n>We analyze distributed lattice surgery under heterogeneous noise conditions, focusing in particular on the merge operation as one of its fundamental subroutines.<n>Our results provide practical insights into selecting the optimal surface-code distance, establishing target local-gate fidelities, and determining the tolerable entangled-pair fidelity required for logical operations in a distributed architecture.
  arXiv  Detail & Related papers  (2026-07-31T09:06:26Z)
• Generative Diffusion Models of Stochastic Graph Signals [74.4097723209053]
  This paper tackles problems of conditional graph signal generative modeling and tackles them with a single denoising diffusion framework.<n>We learn a reverse diffusion process, parametrized by graph neural networks (GNNs), that draws graph signals conditioned directly on the graph topology and on node-feature side information.<n>We demonstrate our method on two generative tasks: stock price forecasting and optimal wireless resource allocation, with extensive numerical results in both domains.
  arXiv  Detail & Related papers  (2026-07-07T22:02:13Z)
• Directed Graph Topology Inference via Graph Filter Identification [54.541275287889164]
  We address the problem of inferring a directed network from nodal measurements generated by a graph convolutional filter.<n>A joint graph filter and topology identification algorithm is also proposed, which alternates between the aforementioned steps to offer improved sample complexity.
  arXiv  Detail & Related papers  (2026-06-25T18:25:57Z)
• Correlation-Assisted Odd-Parity Encoded Gates in Coupled Fluxonium Qubits under Non-Markovian TLS Noise [2.347018755209939]
  Cor longitudinal noise can be partially converted into common-mode fluctuations in an oddparity two-qubit subspace.<n>Projecting the exchange-coupled two-qubit Hamiltonian onto this subspace yields an effective logical Hamiltonian.<n>Results identify a noise-adapted control mechanism for odd-parity encoded operations in coupled fluxonium devices.
  arXiv  Detail & Related papers  (2026-06-05T08:07:36Z)
• Non-linear Sigma Model for the Surface Code with Coherent Errors [0.0]
  We study maximum-likelihood decoding of the square-lattice surface code in the presence of single-qubit unitary rotations.<n>We microscopically derive a non-linear sigma model with target space $mathrmSO (2n)/mathrmU(n)$ as the effective long-distance theory of this decoding problem.
  arXiv  Detail & Related papers  (2026-03-26T17:19:08Z)
• SWING: Unlocking Implicit Graph Representations for Graph Random Features [57.956136773668476]
  We propose SWING: Space Walks for Implicit Network Graphs, a new class of algorithms for computations involving Graph Random Features on graphs.<n>We provide detailed analysis of SWING and complement it with thorough experiments on different classes of i-graphs.
  arXiv  Detail & Related papers  (2026-02-13T08:12:38Z)
• Graph Signal Generative Diffusion Models [74.75869068073577]
  We introduce U-shaped encoder-decoder graph neural networks (U-GNNs) for graph signal generation using denoising diffusion processes.<n>The architecture learns node features at different resolutions with skip connections between the encoder and decoder paths.<n>We demonstrate the effectiveness of the diffusion model in probabilistic forecasting of stock prices.
  arXiv  Detail & Related papers  (2025-09-21T21:57:27Z)
• A Spectral Interpretation of Redundancy in a Graph Reservoir [51.40366905583043]
  This work revisits the definition of the reservoir in the Multiresolution Reservoir Graph Neural Network (MRGNN)<n>It proposes a variant based on a Fairing algorithm originally introduced in the field of surface design in computer graphics.<n>The core contribution of the paper lies in the theoretical analysis of the algorithm from a random walks perspective.
  arXiv  Detail & Related papers  (2025-07-17T10:02:57Z)
• Quantum Computing from Graphs [0.0]
  We introduce a representation of stabilizer codes as graphs with certain structures.<n>The graph representation gives insight into both code construction and algorithms.<n>We also use graphs to extend the quantum Gilbert-Varshamov bound to a three-way distance-rate-weight trade-off.
  arXiv  Detail & Related papers  (2025-01-29T19:47:39Z)
• Simulation of Graph Algorithms with Looped Transformers [6.0465914748433915]
  We study the ability of transformer networks to simulate algorithms on graphs from a theoretical perspective. We prove by construction that this architecture can simulate individual algorithms such as Dijkstra's shortest path. We show a Turing Completeness result with constant width when the extra attention heads are utilized.
  arXiv  Detail & Related papers  (2024-02-02T02:48:03Z)
• Optimal encoding of two dissipative interacting qubits [0.0]
  We investigate a system of two coupled qubits interacting with an Ohmic bath as a physical model for the implementation of one logical qubit. In this model, the interaction with the other qubit represents unitary noise while the Ohmic bath is responsible for finite temperature. We show that, while this is not sufficient to protect a qubit from decoherence, it can be exploited to encode one logical qubit with greater performance than the physical one.
  arXiv  Detail & Related papers  (2023-10-09T09:38:16Z)
• Geometric Graph Filters and Neural Networks: Limit Properties and Discriminability Trade-offs [122.06927400759021]
  We study the relationship between a graph neural network (GNN) and a manifold neural network (MNN) when the graph is constructed from a set of points sampled from the manifold. We prove non-asymptotic error bounds showing that convolutional filters and neural networks on these graphs converge to convolutional filters and neural networks on the continuous manifold.
  arXiv  Detail & Related papers  (2023-05-29T08:27:17Z)
• Effects of Graph Convolutions in Deep Networks [8.937905773981702]
  We present a rigorous theoretical understanding of the effects of graph convolutions in multi-layer networks. We show that a single graph convolution expands the regime of the distance between the means where multi-layer networks can classify the data. We provide both theoretical and empirical insights into the performance of graph convolutions placed in different combinations among the layers of a network.
  arXiv  Detail & Related papers  (2022-04-20T08:24:43Z)
• 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)
• Learning Frequency Domain Approximation for Binary Neural Networks [68.79904499480025]
  We propose to estimate the gradient of sign function in the Fourier frequency domain using the combination of sine functions for training BNNs. The experiments on several benchmark datasets and neural architectures illustrate that the binary network learned using our method achieves the state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2021-03-01T08:25:26Z)

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.