Decoder Performance in Hybrid CV-Discrete Surface-Code Threshold Estimation Using LiDMaS+

• URL: http://arxiv.org/abs/2603.06730v1
• Date: Fri, 06 Mar 2026 03:33:00 GMT
• Title: Decoder Performance in Hybrid CV-Discrete Surface-Code Threshold Estimation Using LiDMaS+
• Abstract summary: Threshold estimation is central to faulttolerant quantum computing, but the reported threshold depends not only on the code and noise model, but also on the decoder used to interpret syndrome data.<n>We study this dependence for surface-code threshold estimation under both a standard Pauli noise model and a hybrid continuous-variable/discrete model motivated by GKP-style digitization.
• Score: 3.833542530785707
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Threshold estimation is central to fault-tolerant quantum computing, but the reported threshold depends not only on the code and noise model, but also on the decoder used to interpret syndrome data. We study this dependence for surface-code threshold estimation under both a standard Pauli noise model and a hybrid continuous-variable/discrete model motivated by GKP-style digitization. Using LiDMaS+ as a common experimental platform, we compare minimum-weight perfect matching (MWPM) and Union-Find under matched sweep grids, matched distances, and deterministic seeding, and we additionally evaluate trained neural-guided MWPM in the hybrid regime. In the Pauli baseline at distance $d=5$, MWPM consistently outperforms Union-Find, reducing the mean sampled logical error rate from $0.384$ to $0.260$, and producing a stable threshold summary with crossing median $p_c \approx 0.053$. In the hybrid fixed-distance run, Union-Find is substantially worse than MWPM (mean LER $0.1657$ versus $0.1195$), while trained neural-guided MWPM tracks MWPM closely (mean LER $0.1158$). Across hybrid multi-distance sweeps, the distance-dependent reversal in logical-error ordering remains visible, but the grid-based crossing estimator still returns boundary-valued $σ_c=0.05$ for all decoders. Neural-guided runs also show elevated decoder-failure diagnostics at high noise ($\max$ decoder-failure rate $0.1335$ at $d=7,σ=0.60$), indicating that learned guidance quality and decoder robustness must be reported alongside threshold curves. These results show that decoder choice and estimator design both materially affect threshold inference.

Related papers

• Approximate maximum-likelihood decoding via truncated free energies [3.4237938456166304]
  Maximum-likelihood decoding (MLD) achieves the minimum logical error rate of stabilizer codes under known i.i.d. Pauli noise.<n>We introduce approximate maximum-likelihood decoding (AMLD), a black-box framework that recycles the candidate samples discarded by inner decoders into a per-class truncated free-energy estimator.
  arXiv  Detail & Related papers  (2026-09-03T14:40:22Z)
• Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
  Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
  arXiv  Detail & Related papers  (2026-08-25T15:07:11Z)
• Modeling Normal Is All You Need: Joint Latent Clustering for Anomaly Detection in Multimodal Cyber-Physical Systems [47.027290803102666]
  Normal behaviour is the union of many imbalanced, curved, thin-fringed operating regimes.<n>We model the normal law with a jointly learned latent representation plus explicit Gaussian-mixture mode clustering.<n>We evaluate under a deliberately fair protocol: raw point-wise metrics with no point adjustment, a trivial-detector difficulty split, prevalence-matched F1, and train-normal-only calibration.
  arXiv  Detail & Related papers  (2026-07-07T10:10:00Z)
• Error Highways: Scaling Predictive Coding to Very Deep Networks [45.88028371034407]
  Predictive coding networks (PCNs) offer a biologically-plausible, local-learning alternative to back-propagation of errors (backprop)<n>A central obstacle to scaling PCNs is that the learning signal decays rapidly as it propagates away from clamped boundaries.<n>We propose highway error propagation (HEP), a scheme that augments the free energy function underlying predictive coding (PC) by altering its neural structure.
  arXiv  Detail & Related papers  (2026-06-22T01:12:29Z)
• CAWN: Continuous Acoustic Wave Networks for Autoregressive Language Modeling [46.16066322190728]
  We introduce the Continuous Acoustic Wave Network (CAWN), a fully continuous sequence-mixing architecture.<n>Instead of discrete matrix-based attention, CAWN projects hidden states into multi-headed complex-domain phasors.<n>To prevent signal degradation over ultra-long contexts, we introduce a dual-gated Selective Phase Resonance mechanism.
  arXiv  Detail & Related papers  (2026-04-05T20:13:22Z)
• Decoder Dependence in Surface-Code Threshold Estimation with Native Gottesman-Kitaev-Preskill Digitization and Parallelized Sampling [4.11280059407553]
  We benchmark decoder dependence in surface-code threshold studies under two matched regimes: Pauli noise and native GKP-style Gaussian displacement digitization.<n>Using LiDMaS+ v1.1.0, we benchmark MWPM, Union-Find (UF), Belief Propagation (BP), and neural-guided MWPM with fixed seeds, identical sweep grids, and unified reporting across runs 06--14.
  arXiv  Detail & Related papers  (2026-03-25T18:07:04Z)
• Fair Decoder Baselines and Rigorous Finite-Size Scaling for Bivariate Bicycle Codes on the Quantum Erasure Channel [0.14323566945483496]
  We run both uninformed and empherasure-aware surface code baselines alongside BP-OSD decoding of BB codes.<n>With standard depolarizing-weight MWPM and no erasure information, performance matches random guessing on the erasure channel.<n>BB at $N=1296$ has a modest edge in threshold over the surface code at twice the qubit count, and a 12$times$ lower normalized overhead.
  arXiv  Detail & Related papers  (2026-03-19T15:53:51Z)
• High-Dimensional Gaussian Mean Estimation under Realizable Contamination [43.56842719227285]
  We study mean estimation for a Gaussian distribution with identity covariance in $mathbbRd$ under a missing data scheme termed realizable $$-contamination model.<n>In this model an adversary can choose a function $r(x)$ between 0 and $$ and each sample $x$ goes missing with probability $r(x)$.
  arXiv  Detail & Related papers  (2026-03-17T17:04:18Z)
• Decoding Correlated Errors in Quantum LDPC Codes [41.04211723135311]
  We introduce a decoding framework for correlated errors in quantum LDPC codes under circuit-level noise.<n>The core of our approach is a graph augmentation and rewiring for interference (GARI) method, which modifies the correlated detector error model.<n>Preliminary FPGA implementation results show that such high accuracy can be achieved in real time, with a per-round average decoding latency of 273 ns and sub-microsecond latency in 99.99% of the decoding instances.
  arXiv  Detail & Related papers  (2025-10-15T19:59:05Z)
• Enhancing Fault-Tolerant Surface Code Decoding with Iterative Lattice Reweighting [12.330043396100635]
  We introduce the Iterative Reweighting Minimum-Weight Perfect Matching (IRMWPM) decoder.<n>We show that IRMWPM reduces logical error rates by over 20x with only a few distances.<n>It also raises the accuracy threshold from 1% to 1.16%, making it practical for near-term real-time decoding.
  arXiv  Detail & Related papers  (2025-09-08T14:45:59Z)
• GAN decoder on a quantum toric code for noise-robust quantum teleportation [21.80993228019571]
  We propose a generative adversarial network (GAN)-based decoder for quantum topological codes.<n>We apply it to enhance a quantum teleportation protocol under depolarizing noise.
  arXiv  Detail & Related papers  (2024-09-11T03:17:47Z)
• Role of Locality and Weight Sharing in Image-Based Tasks: A Sample Complexity Separation between CNNs, LCNs, and FCNs [42.551773746803946]
  Vision tasks are characterized by the properties of locality and translation invariance. The superior performance of convolutional neural networks (CNNs) on these tasks is widely attributed to the inductive bias of locality and weight sharing baked into their architecture. Existing attempts to quantify the statistical benefits of these biases in CNNs over locally connected neural networks (LCNs) and fully connected neural networks (FCNs) fall into one of the following categories.
  arXiv  Detail & Related papers  (2024-03-23T03:57:28Z)
• Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination [42.526664955704746]
  We study sparse estimation tasks in Huber's contamination model with a focus on mean estimation, PCA, and linear regression. For each of these tasks, we give the first sample and computationally efficient robust estimators with optimal error guarantees. At the technical level, we develop a novel multidimensional filtering method in the sparse regime that may find other applications.
  arXiv  Detail & Related papers  (2024-03-15T15:51:27Z)
• Near Sample-Optimal Reduction-based Policy Learning for Average Reward MDP [58.13930707612128]
  This work considers the sample complexity of obtaining an $varepsilon$-optimal policy in an average reward Markov Decision Process (AMDP) We prove an upper bound of $widetilde O(H varepsilon-3 ln frac1delta)$ samples per state-action pair, where $H := sp(h*)$ is the span of bias of any optimal policy, $varepsilon$ is the accuracy and $delta$ is the failure probability.
  arXiv  Detail & Related papers  (2022-12-01T15:57:58Z)
• Denoising MCMC for Accelerating Diffusion-Based Generative Models [54.06799491319278]
  Diffusion models are powerful generative models that simulate the reverse of diffusion processes using score functions to synthesize data from noise. Here, we propose an approach to accelerating score-based sampling: Denoising MCMC. We show that Denoising Langevin Gibbs (DLG), an instance of DMCMC, successfully accelerates all six reverse-S/ODE computation tasks.
  arXiv  Detail & Related papers  (2022-09-29T07:16:10Z)
• Offline Reinforcement Learning at Multiple Frequencies [62.08749079914275]
  We study how well offline reinforcement learning algorithms can accommodate data with a mixture of frequencies during training. We present a simple yet effective solution that enforces consistency in the rate of $Q$-value updates to stabilize learning.
  arXiv  Detail & Related papers  (2022-07-26T17:54:49Z)

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.