Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Learn about quantum LDPC codes achieving almost linear distance through iterated homological products in this 28-minute conference talk. Explore the theoretical foundations and construction methods for quantum low-density parity-check codes that achieve distance scaling almost linearly with code length. Discover how iterated homological products can be used as a powerful tool for constructing these codes, examining the mathematical framework that enables this breakthrough in quantum error correction. Gain insights into the collaborative research between UC Berkeley and the broader quantum coding theory community, understanding how these advances contribute to the development of more efficient quantum error correction schemes.
