▲ | abtinf 3 days ago | ||||||||||||||||
This seems like the kind of error an LLM would make. It is essentially impossible for a human to confuse error correction and “majority voting”/consensus. | |||||||||||||||||
▲ | GuB-42 3 days ago | parent | next [-] | ||||||||||||||||
I don't believe it is the result of a LLM, more like an oversimplification, or maybe a minor fuckup on the part of the author as simple majority voting is often used in redundant systems, just not for memories as there are better ways. And for a LLM result, this is what ChatGPT says when asked "How does memory error correction differ from quantum error correction?", among other things. > Relies on redundancy by encoding extra bits into the data using techniques like parity bits, Hamming codes, or Reed-Solomon codes. And when asked for a simplified answer > Classical memory error correction fixes mistakes in regular computer data (0s and 1s) by adding extra bits to check for and fix any errors, like a safety net catching flipped bits. Quantum error correction, on the other hand, protects delicate quantum bits (qubits), which can hold more complex information (like being 0 and 1 at the same time), from errors caused by noise or interference. Because qubits are fragile and can’t be directly measured without breaking their state, quantum error correction uses clever techniques involving multiple qubits and special rules of quantum physics to detect and fix errors without ruining the quantum information. Absolutely no mention of majority voting here. EDIT: GPT-4o mini does mention majority voting as an example of a memory error correction scheme but not as the way to do it. The explanation is overall more clumsy, but generally correct, I don't know enough about quantum error correction to fact-check. | |||||||||||||||||
▲ | mmooss 3 days ago | parent | prev | next [-] | ||||||||||||||||
People always have made bad assumptions or had misunderstandings. Maybe the author just doesn't understand ECC and always assumed it was consensus-based. I do things like that (I try not to write about them without verifying); I'm confident that so do you and everyone reading this. | |||||||||||||||||
| |||||||||||||||||
▲ | jc_92 2 days ago | parent | prev [-] | ||||||||||||||||
I've gone to lots of talks on quantum error correction, and most of them start out with explaining the repetition code. Not because it's widely used, but because it is very easy to explain to someone who knows nothing about classical coding theory. And because the surface code is essentially the product of two repetition codes, so if you want to understand surface code quantum error correction you don't need to understand any classical codes besides the repetition code. All that is to say that someone who had been to a few talks on quantum error correction but didn't directly work on that problem might reasonably believe that the repetition code is an important classical code. |