CyberIntel ⬡ News
★ Saved ◆ Cyber Reads
← Back ◌ Quantum Computing May 31, 2021

Degenerate vs non-degenerate errors

Quantum Computing SE Archived Apr 14, 2026 ✓ Full text saved

One of the key features of quantum error correction that makes it different from classical error correction. When code is non-degenerate, an error $E$ takes codewords to different words. codewords. Formally, for all basis vectors $c_i$ , we get $\langle c_i, E c_i \rangle=0$ . This behavior is much more closer to classical error correction. Does this make decoding(/detecting) of non-degenerate codes easier since there is a very well developed classical machinery in many cases? The traditional wa

Full text archived locally
✦ AI Summary · Claude Sonnet


    Degenerate vs non-degenerate errors Ask Question Asked 4 years, 10 months ago Modified today Viewed 1k times 4 One of the key features of quantum error correction that makes it different from classical error correction. When code is non-degenerate, an error E 𝐸 takes codewords to different words. codewords. Formally, for all basis vectors c i 𝑐 𝑖 , we get ⟨ c i ,E c i ⟩=0 ⟨ 𝑐 𝑖 , 𝐸 𝑐 𝑖 ⟩ = 0 . This behavior is much more closer to classical error correction. Does this make decoding(/detecting) of non-degenerate codes easier since there is a very well developed classical machinery in many cases? The traditional way to detect or correct errors (at least for stabilizer codes) is getting syndrome by looking at commuting relations and then do syndrome decoding. The second step of syndrome decoding resembles closely to classical counterpart. Does that make degenerate error intrinsically harder to detect, or to put it other way, easier for non-degenerate errors? The motivation for this question is trying to understand can there be a reason where one prefers non-degenerate codes over degenerate codes. error-correctionstabilizer-codestabilizer-state Share Improve this question Follow edited 1 hour ago asked May 31, 2021 at 23:47 Root 5392 2 silver badges 13 13 bronze badges Add a comment 1 Answer Sorted by: Highest score (default) Date modified (newest first) Date created (oldest first) 4 As you say, non-degenerate codes have a lot of well-understood machinery that's brought in from the classical side. That helps us from a conceptual stance, and a mathematical one (making rigorous results easier to prove), although, in terms of practical implementation, doesn't necessarily mean that one is easier to implement than the other. Errors in a degenerate code do not need to be any harder to detect. For example, if you look at the Toric Code, this is degenerate but it's also a stabilizer code, so experimentally, it's just the same. If anything, it's easier because all the observables that we need to measure are local, each comprising just four neighbouring qubits. Why might you prefer non-degenerate models? I think, really, it comes down to the rigour of the mathematics behind some of the results. For example, things like the quantum Hamming bound apply to non-degenerate codes. We know where we stand. Actually, that gives degenerate codes a potential advantage in that they might be better than the non-degenerate ones. It's just hard to prove. I gave some numerical indications of this at some point for the Toric code: https://arxiv.org/abs/1208.4924. I think I also linked to some previous results for other degenerate codes. To give an indication of the challenge with the Toric code: an N×N 𝑁 × 𝑁 lattice has a code distance O(N) 𝑂 ( 𝑁 ) , while there exist non-degenerate codes of the same size with distance O( N 2 ) 𝑂 ( 𝑁 2 ) . So, on paper, this looks bad for degenerate codes. Nevertheless, one can prove (with some effort) that if the error model is independent per-qubit errors, you can correct for an error rate that is finite, i.e. almost all combinations of O( N 2 ) 𝑂 ( 𝑁 2 ) errors (up to some threshold value) that might typically arise can be corrected. So, we know some of these statements for the Toric code, but let's say you've come up with some wonderful knew degenerate code. How does it behave? No clue! But if you come up with a wonderful new non-degenerate code, you can immediately know a lot of its properties. Share Improve this answer Follow answered Jun 1, 2021 at 8:05 DaftWullie 64.4k4 4 gold badges 60 60 silver badges 148 148 bronze badges I understand that practical implementations could be even easier for degenerate codes. Let me rephrase this small question in particular: Will classical machinery syndrome decoding work equally for degenerate or non-degenerate codes? –  Root Commented Jun 1, 2021 at 14:51 I don't believe so. Degenerate codes, if you're working in this regime where there are more errors than the distance of the code, require some classical processing that (roughly) takes a global overview of what errors have happened, and has to apply some sort of heuristic to guess what the correction should be. There's been a lot of work on doing this well, but I don't think you'd class it under the classical machinery for syndrome decoding. –  DaftWullie Commented Jun 1, 2021 at 15:52 See, for example, arxiv.org/abs/0911.0581 –  DaftWullie Commented Jun 1, 2021 at 15:55 So will it be right to say that non-degenerate codes can directly use classical syndrome decoding (for example CWS codes) but degenerate codes (at least in the regime of degenerate errors) lack this feature since they are looking to correct larger errors. –  Root Commented Jun 1, 2021 at 17:23 I don't know that this is true of all non-degenerate codes. CSS codes are carefully constructed out of classical codes so that syndrome extraction closely parallels the classical case. However that doesn't mean there aren't intrinsically quantum non-degenerate codes which don't have a classical equivalent. –  DaftWullie Commented Jun 2, 2021 at 6:51 Add a comment Your Answer Sign up or log in Sign up using Google Sign up using Email and Password Post as a guest Name Email Required, but never shown Post Your Answer By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy. Start asking to get answers Find the answer to your question by asking. Ask question Explore related questions error-correctionstabilizer-codestabilizer-state See similar questions with these tags. The Overflow Blog Who needs VCs when you have friends like these? The messy truth of your AI strategies Related 3 Basics on CSS codes: manipulation of the ancillas to detect error 4 Accuracy threshold theorem: what is the physical probability of failure exactly 4 What are the main motivations for pursuing CSS codes over general non-CSS codes? 1 Motivation for simulating multiround syndrome extraction circuits for quantum error correction code 4 Dephasing noise and error correction 6 Error graphs and how decoders perform matching on them? 0 Feasibility of Quantum Error Correction Given Physical Noise Timescales 2 Error-discretisation theorem and existence of a recovery **independent** from the error set Hot Network Questions Is everyone identical behind the veil of ignorance? Is there a way to conduct an internationally-acknowledged referendum? What is the problem due to Dan Anderson and reportedly settled by AI? What role does vibrato have in the orchestra? Cleaning up LoginIp records: useful, harmful? \str_set_convert:Nnnn trouble in LuaLatex Is diamond the best shape for stealth? Would a future closed-loop steady-state economy (with no net resource depletion) mine outer space, and if so, for what? How can democracies build resilience when letting hard left/hard right regimes assume power? What security/border checks will I go through in a layover in Madrid when traveling from France to the US? Is there a camera plugin for macOS to appear to be looking straight at the camera? Short story (possibly by Fritz Leiber) about an English man in New York who is told to watch out for the fish hooks attached to a swerving car What are some advantages of set theory compared to type theory for mathematical research (foundations or otherwise)? If Jesus shed his blood once for all time in the fullness of time does this mean old testament Jews were saved by Grace and not by Law Archaic usage of "whomst" How can I write a function to remove FrameLabel and FrameTicks of a ListPlot? Young man upon graduating magic (Summoning)? school gets the worst creature affinity possible, A Worm. But the Fate has a surprise for him How long is ‘The Faerie Queene’ by Edmund Spenser? How does the mapping cone construction preserve cochain homotopy? Finding a PCB connector for this OLED display FPC interface Is the topology assigned to tangent bundle the initial topology from the projection map? Protonation of oxime on N or O? What are the oldest Aramaic, Hebrew, and Greek MSS of the Epistle to the Hebrews? Who is the robot holding the portal gun in the Portal 2 box art? Question feed By continuing to use this website, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy. By exiting this window, default cookies will be accepted. To reject cookies, select an option from below. Customize settings Cookie Consent Preference Center When you visit any of our websites, it may store or retrieve information on your browser, mostly in the form of cookies. This information might be about you, your preferences, or your device and is mostly used to make the site work as you expect it to. The information does not usually directly identify you, but it can give you a more personalized experience. Because we respect your right to privacy, you can choose not to allow some types of cookies. Click on the different category headings to find out more and manage your preferences. Please note, blocking some types of cookies may impact your experience of the site and the services we are able to offer. Cookie Policy Accept all cookies Manage Consent Preferences Strictly Necessary Cookies Always Active These cookies are necessary for the website to function and cannot be switched off in our systems. They are usually only set in response to actions made by you which amount to a request for services, such as setting your privacy preferences, logging in or filling in forms. You can set your browser to block or alert you about these cookies, but some parts of the site will not then work. These cookies do not store any personally identifiable information. Targeting Cookies Targeting Cookies These cookies are used to make advertising messages more relevant to you and may be set through our site by us or by our advertising partners. They may be used to build a profile of your interests and show you relevant advertising on our site or on other sites. They do not store directly personal information, but are based on uniquely identifying your browser and internet device. Performance Cookies Performance Cookies These cookies allow us to count visits and traffic sources so we can measure and improve the performance of our site. They help us to know which pages are the most and least popular and see how visitors move around the site. All information these cookies collect is aggregated and therefore anonymous. If you do not allow these cookies we will not know when you have visited our site, and will not be able to monitor its performance. Functional Cookies Functional Cookies These cookies enable the website to provide enhanced functionality and personalisation. They may be set by us or by third party providers whose services we have added to our pages. If you do not allow these cookies then some or all of these services may not function properly. Cookie List Clear checkbox label label Apply Cancel Consent Leg.Interest checkbox label label checkbox label label checkbox label label Necessary cookies only Confirm My Choices
    💬 Team Notes
    Article Info
    Source
    Quantum Computing SE
    Category
    ◌ Quantum Computing
    Published
    May 31, 2021
    Archived
    Apr 14, 2026
    Full Text
    ✓ Saved locally
    Open Original ↗