Special Session SS1 on Quantum error correction: The quantum physics perspective Chairpersons: Bane Vasić (University of Arizona), Narayanan Rengaswamy (University of Arizona)The surface code and its topological cousins are currently the leading candidates for implementing quantum error correction in hardware, especially for technologies such as superconducting qubits.It is now well-known that these codes can be constructed from classical binary linear codes via the hypergraph product construction.However, the intuition and initial construction of the toric and surface codes came from Kitaev's fundamentally physics perspective.Before efficient decoders were built, the connection between statistical physics and the toric code also enabled the computation of its error correction threshold.While this is only one example, albeit a famous one, of the impact of taking a physics-based perspective towards quantum error correction, it shows how such an approach can span the wide spectrum of fundamental results to practical real-world implementation.In this session, we will hear from leading experts in the field about insights on quantum error correction gained from a physicist's point of view.13:55 -14:45 Keynote by K. Brown Quantum Error Correction and Machine Noise [1]Quantum error correction and fault-tolerant quantum computation promise to build reliable quantum devices from faulty components.Theoretical studies tend to focus on depolarizing and dephasing noise which can be simulated by the stochastic application of Pauli errors.In this talk, I will discuss quantum error correction in the context of a broader range of noise sources including coherent errors, leakage, and erasure.I will conclude by discussing how the co-design of hardware and faulttolerant procedures can lead to more efficient fault-tolerant quantum computation.14:45 -15:10 Abelian and non-abelian quantum two-block codes Renyu Wang, Hsiang-Ku Lin, and Leonid P Pryadko[2] 1570908406.pdfWe discuss quantum two-block codes, a large class of CSS codes constructed from two commuting square matrices.Interesting families of such codes are generalizedbicycle (GB) codes and two-block group-algebra (2BGA) codes, where a cyclic group is replaced with an arbitrary finite group, generally non-abelian.We present code construction and give several expressions for code dimension, applicable depending on whether the constituent group is cyclic, abelian, or non-abelian.This gives a simple criterion for an essentially non-abelian 2BGA code guaranteed not to be permutation-equivalent to such a code based on an abelian group.We also give a lower bound on the distance which, in particular, applies to the case when a 2BGA code reduces to a hypergraph-product code constructed from a pair of classical group codes.
International Symposium on Turbo Codes and Iterative Information Processing•Sep 4, 2023•0 citations