Pipelined correlated minimum weight perfect matching of the surface code

• URL: http://arxiv.org/abs/2205.09828v2
• Date: Mon, 11 Dec 2023 16:12:16 GMT
• Title: Pipelined correlated minimum weight perfect matching of the surface code
• Authors: Alexandru Paler, Austin G. Fowler
• Abstract summary: We describe a pipeline approach to decoding the surface code using minimum weight perfect matching. An independent no-communication parallelizable processing stage reweights the graph according to likely correlations. A later general stage finishes the matching. We validate the new algorithm on the fully fault-tolerant toric, unrotated, and rotated surface codes.
• Score: 56.01788646782563
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We describe a pipeline approach to decoding the surface code using minimum weight perfect matching, including taking into account correlations between detection events. An independent no-communication parallelizable processing stage reweights the graph according to likely correlations, followed by another no-communication parallelizable stage for high confidence matching. A later general stage finishes the matching. This is a simplification of previous correlated matching techniques which required a complex interaction between general matching and re-weighting the graph. Despite this simplification, which gives correlated matching a better chance of achieving real-time processing, we find the logical error rate practically unchanged. We validate the new algorithm on the fully fault-tolerant toric, unrotated, and rotated surface codes, all with standard depolarizing noise. We expect these techniques to be applicable to a wide range of other decoders.

Related papers

• LGU-SLAM: Learnable Gaussian Uncertainty Matching with Deformable Correlation Sampling for Deep Visual SLAM [11.715999663401591]
  Learnable 2D Gaussian uncertainty model is designed to associate matching-frame pairs. A multi-scale deformable correlation strategy is devised to adaptively fine-tune the sampling of each direction. Experiments on real-world and synthetic datasets are conducted to validate the effectiveness and superiority of our method.
  arXiv  Detail & Related papers  (2024-10-30T17:20:08Z)
• Improved accuracy for decoding surface codes with matching synthesis [0.40182506671515367]
  We present a method, called matching synthesis, for decoding quantum codes that produces an enhanced assignment of errors from an ensemble of decoders. Matching synthesis takes the solutions of an ensemble of approximate solvers for the minimum-weight hypergraph matching problem. We show that matching synthesis has favorable scaling properties where accuracy begins to saturate with an ensemble size of 60.
  arXiv  Detail & Related papers  (2024-08-22T05:34:36Z)
• Distributed Extra-gradient with Optimal Complexity and Communication Guarantees [60.571030754252824]
  We consider monotone variational inequality (VI) problems in multi-GPU settings where multiple processors/workers/clients have access to local dual vectors. Extra-gradient, which is a de facto algorithm for monotone VI problems, has not been designed to be communication-efficient. We propose a quantized generalized extra-gradient (Q-GenX), which is an unbiased and adaptive compression method tailored to solve VIs.
  arXiv  Detail & Related papers  (2023-08-17T21:15:04Z)
• Optimal Algorithms for Stochastic Complementary Composite Minimization [55.26935605535377]
  Inspired by regularization techniques in statistics and machine learning, we study complementary composite minimization. We provide novel excess risk bounds, both in expectation and with high probability. Our algorithms are nearly optimal, which we prove via novel lower complexity bounds for this class of problems.
  arXiv  Detail & Related papers  (2022-11-03T12:40:24Z)
• Neural Matching Fields: Implicit Representation of Matching Fields for Visual Correspondence [41.39740414165091]
  We present a novel method for semantic correspondence, called Neural Matching Field (NeMF) We learn a high-dimensional matching field, since a naive exhaustive inference would require querying from all pixels in the 4D space to infer pixel-wise correspondences. With these combined, competitive results are attained on several standard benchmarks for semantic correspondence.
  arXiv  Detail & Related papers  (2022-10-06T05:38:27Z)
• Efficient and Accurate Skeleton-Based Two-Person Interaction Recognition Using Inter- and Intra-body Graphs [7.563146292108742]
  We propose a lightweight model for accurately recognizing two-person interactions. In addition to the architecture, which incorporates middle fusion, we introduce a factorized convolution technique to reduce the weight parameters. We also introduce a network stream that accounts for relative distance changes between inter-body joints to improve accuracy.
  arXiv  Detail & Related papers  (2022-07-26T04:28:40Z)
• Learning Optical Flow from a Few Matches [67.83633948984954]
  We show that the dense correlation volume representation is redundant and accurate flow estimation can be achieved with only a fraction of elements in it. Experiments show that our method can reduce computational cost and memory use significantly, while maintaining high accuracy.
  arXiv  Detail & Related papers  (2021-04-05T21:44:00Z)
• Optimizing Mode Connectivity via Neuron Alignment [84.26606622400423]
  Empirically, the local minima of loss functions can be connected by a learned curve in model space along which the loss remains nearly constant. We propose a more general framework to investigate effect of symmetry on landscape connectivity by accounting for the weight permutations of networks being connected.
  arXiv  Detail & Related papers  (2020-09-05T02:25:23Z)
• Learning to Accelerate Heuristic Searching for Large-Scale Maximum Weighted b-Matching Problems in Online Advertising [51.97494906131859]
  Bipartite b-matching is fundamental in algorithm design, and has been widely applied into economic markets, labor markets, etc. Existing exact and approximate algorithms usually fail in such settings due to either requiring intolerable running time or too much computation resource. We propose textttNeuSearcher which leverages the knowledge learned from previously instances to solve new problem instances.
  arXiv  Detail & Related papers  (2020-05-09T02:48:23Z)
• Quasi-Newton Solver for Robust Non-Rigid Registration [35.66014845211251]
  We propose a formulation for robust non-rigid registration based on a globally smooth robust estimator for data fitting and regularization. We apply the majorization-minimization algorithm to the problem, which reduces each iteration to solving a simple least-squares problem with L-BFGS.
  arXiv  Detail & Related papers  (2020-04-09T01:45:05Z)

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.