Back to News
quantum-computing

Affine Filtering Measurements and Their Applications to Quantum Decoding

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
Researchers introduced affine filtering measurements, a refined quantum decoding technique that extends unambiguous state discrimination (USD) by identifying affine subspaces containing transmitted codewords or flagging erasures. This structured approach improves error correction in classical-quantum channels. The team proved that optimizing these measurements reduces to a linear program via character-based diagonalization, simplifying design for group-covariant pure-state codewords. This mathematical breakthrough enables efficient implementation in quantum decoding frameworks. Simulations on LDPC codes from Gallager ensembles showed affine filtering outperforms traditional symbol-wise USD and "pretty good" measurement decoders on i.i.d. pure-state channels, offering superior error resilience in practical scenarios. Unlike concurrent work by Buzet and Chailloux, this study focuses on code-aware constructions, tailoring measurements to specific error-correcting codes rather than generic symmetric state families, enhancing real-world applicability. The framework bridges quantum information theory and classical coding, providing a scalable method for local quantum error correction with potential impacts on fault-tolerant quantum computing and communication protocols.
Affine Filtering Measurements and Their Applications to Quantum Decoding

Summarize this article with:

Quantum Physics arXiv:2606.07852 (quant-ph) [Submitted on 5 Jun 2026] Title:Affine Filtering Measurements and Their Applications to Quantum Decoding Authors:Avijit Mandal, Noah Shutty, Henry D. Pfister, Stephen P. Jordan View a PDF of the paper titled Affine Filtering Measurements and Their Applications to Quantum Decoding, by Avijit Mandal and 2 other authors View PDF Abstract:Unambiguous state discrimination (USD) measurements are attractive because outcomes are either marked as conclusive (i.e., error free) or inconclusive (i.e., erased). We study affine filtering measurements, a structured variant of USD for decoding classical linear codes over pure-state classical-quantum channels, where a conclusive outcome identifies an affine subspace containing the transmitted codeword and an inconclusive outcome is treated as an erasure. For a group-covariant indexing of pure-state codewords, we show that the optimal design of affine filtering measurements is a semidefinite program that can be reduced to a linear program via character-based diagonalization. We use the resulting measurement to build a quantum decoding framework for local codes, and we demonstrate (via simulations on regular LDPC codes from Gallager ensembles using single parity check local constraints) that affine filtering based decoding can outperform symbol-wise USD and symbol-wise pretty good measurement based decoding methods on i.i.d. pure-state channels. In an independent and concurrent work, Buzet and Chailloux study similar fine-grained USD measurements for symmetric families of states. Their focus is on the code-agnostic setting whereas our focus is on code-aware constructions and decoding. Subjects: Quantum Physics (quant-ph); Information Theory (cs.IT) Cite as: arXiv:2606.07852 [quant-ph] (or arXiv:2606.07852v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2606.07852 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Avijit Mandal [view email] [v1] Fri, 5 Jun 2026 21:25:34 UTC (149 KB) Full-text links: Access Paper: View a PDF of the paper titled Affine Filtering Measurements and Their Applications to Quantum Decoding, by Avijit Mandal and 2 other authorsView PDFTeX Source view license Current browse context: quant-ph new | recent | 2026-06 Change to browse by: cs cs.IT math math.IT References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators 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. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-networking
quantum-investment

Source Information

Source: arXiv Quantum Physics