aiqbench analysis
This research introduces a maximum-utility decoding framework that optimizes continuous long-range order in GHZ state preparation, addressing limitations of traditional binary recovery methods like MWPM. By integrating syndrome encoding with a convolutional neural network for refinement, the proposed scalable two-stage decoder achieves near-optimal performance at significantly reduced computational cost. This advancement directly enhances fault-tolerant protocols and metrology applications by maximizing decoded quantum order in measurement-based architectures.
Optimal Decoding for Measurement-Based GHZ State Preparation: The Maximum-Utility Decoder
arXiv:2608.00160v1 Announce Type: new Abstract: The meticulous preparation of macroscopic Greenberger-Horne-Zeilinger (GHZ) states provides a foundational resource for quantum technologies such as metrology, cryptography, and fault-tolerant codes. While state-of-the-art measurement-based protocols offer efficient low-depth execution, their performance can be bottlenecked by conventional decoders, such as minimum weight perfect matching (MWPM) or even maximum-likelihood decoding (MLD), which optimize for $binary$ logical recovery and fail to maximize the $continuous$ long-range order characteristic of a GHZ state for two-dimensional geometries. Here we overcome this limitation by framing the decoding problem as minimum Bayesian risk inference, introducing a general paradigm that maximizes the expected ${utility}$ of the decoded state. Implementing this maximum-utility approach, we construct an algorithm that achieves the highest possible per-shot decoded quantum order and thereby establish an optimal decoding strategy for measurement-based GHZ state preparation. To improve its computational efficiency, we design a scalable two-stage decoder, which first encodes the syndromes into the edge weights of MWPM and then refines the result with a convolutional neural network trained to maximize the expected utility, at a fraction of the cost of the optimal decoder. Remarkably, we find that the first stage alone$\unicode{x2014}$which makes the matching aware of the gauge choice at no cost beyond bare MWPM$\unicode{x2014}$already performs near-optimally up to the largest sizes we study, $N=256\times256$, closing up to $87\%$ of the gap between the bare-MWPM and optimal decoding thresholds. Generalizing MWPM and MLD, the maximum-utility decoder (MUD) establishes a versatile framework that can be explicitly tailored to the operational demands of specific experiments by redefining the utility function.
Abstract:The meticulous preparation of macroscopic Greenberger-Horne-Zeilinger (GHZ) states provides a foundational resource for quantum technologies such as metrology, cryptography, and fault-tolerant codes. While state-of-the-art measurement-based protocols offer efficient low-depth execution, their performance can be bottlenecked by conventional decoders, such as minimum weight perfect matching (MWPM) or even maximum-likelihood decoding (MLD), which optimize for $binary$ logical recovery and fail to maximize the $continuous$ long-range order characteristic of a GHZ state for two-dimensional geometries. Here we overcome this limitation by framing the decoding problem as minimum Bayesian risk inference, introducing a general paradigm that maximizes the expected ${utility}$ of the decoded state. Implementing this maximum-utility approach, we construct an algorithm that achieves the highest possible per-shot decoded quantum order and thereby establish an optimal decoding strategy for measurement-based GHZ state preparation. To improve its computational efficiency, we design a scalable two-stage decoder, which first encodes the syndromes into the edge weights of MWPM and then refines the result with a convolutional neural network trained to maximize the expected utility, at a fraction of the cost of the optimal decoder. Remarkably, we find that the first stage alone$\unicode{x2014}$which makes the matching aware of the gauge choice at no cost beyond bare MWPM$\unicode{x2014}$already performs near-optimally up to the largest sizes we study, $N=256\times256$, closing up to $87\%$ of the gap between the bare-MWPM and optimal decoding thresholds. Generalizing MWPM and MLD, the maximum-utility decoder (MUD) establishes a versatile framework that can be explicitly tailored to the operational demands of specific experiments by redefining the utility function.
7+8 pages, 5+7 figures. Data available at this https URL
Quantum Physics (quant-ph); Disordered Systems and Neural Networks (cond-mat.dis-nn); Statistical Mechanics (cond-mat.stat-mech)
arXiv:2608.00160 [quant-ph]
(or arXiv:2608.00160v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2608.00160 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 365 words
Related coverage

News
Quantum Computing Report · Jul 25, 2026

Inside the megakernel serving engine for North Mini Code
Cohere · Sep 8, 2026

Interview with Matthias Troyer, Vice President & Technical Fellow at Microsoft
Quantum Computing Report · Sep 23, 2026

Build a Physical AI model factory with NVIDIA Cosmos 3 on SageMaker HyperPod
AWS · Sep 4, 2026