Quick Navigation

Overview Topics Abstract Importance Paper Tools References Reactions Discussion Publication Related

Topics

Quantum Algorithms

The Find Rows and Columns and Decode algorithm for quantum expander codes

arXiv

Authors: Dimiter Ostrev

Year

2026

Paper ID

76259

Status

Preprint

Abstract Read

~2 min

Abstract Words

Citations

N/A

Abstract

A new adaptation of the Find Erasures and Decode algorithm from classical to quantum expander codes is presented. It runs in linear time and is parallelizable to logarithmic depth. Compared to Small Set Flip and Small Set Find, the new algorithm avoids the overhead of considering the subsets of stabilizer generators, requires less expansion and corrects more errors.

Why This Paper Matters

It adds a 2026 reference point for readers tracking recent quantum research.
A new adaptation of the Find Erasures and Decode algorithm from classical to quantum expander codes is presented.

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Become a member Sign in

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

[1] DOI https://doi.org/arXiv:2608.27211 [2] arXiv https://arxiv.org/abs/2608.27211 [3] Publisher https://arxiv.org/abs/2608.27211

Local Citation Graph (Related-Paper Links)

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0

Likes: 0 Dislikes: 0

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.