 |
Center for Nonlinear Studies |
Error correction is an essential ingredient for quantum communication and computation. To achieve good error suppression, current coding techniques typically encode each logical qubit in a very large number of physical qubits. It is possible to suppress errors with much less resources, for instance by encoding into a random code space, but decoding such codes is typically an NP-complete problem. In this talk, I will present some of our efforts at constructing good, efficiently decodable quantum codes, including turbo and sparse codes. I will also discuss the current bottlenecks in constructing provably good probabilistic quantum coding schemes.
Host: Mathew Hastings, T-13