• Knowledge tree for codes related to higher-dimensional quantum hypergraph product codes

    In classical information processing, the capacity-approaching codes can be constructed through lower-density-parity-check(LDPC) codes with random matrices. These include the protocols used in 4G and 5G technologies. Its quantum analog is a promising substitute for quantum topological code, where the former has finite code rate but the latter encodes zero qubit asymptotically. Precious few examples of quantum LDPC codes were known...

  • Belief Propagation

    Belief Propagation is a very efficient decoder for classical codes. Implementation of BP for quantum codes has been attempted for a while, with limited performance so far. Here I describe various forms of it.

  • Reduce circuit size

    It is a complicated task to find optimal ways of designing a quantum circuit. Here I discuss some handy techniques to reduce the size of a circuit, including utilizing additional ancilla qubits and modifing order of gates.

    See the description

  • QIP 2020

    Our group attended QIP 2020 at Shenzhen, China, with two posters

  • Subsystem Product Codes

    This document introduce a new class of subsystem CSS codes, called subsystem product codes. It is a relative of the concatenated codes.

  • QEC 2019

    The Fifth International Conference on Quantum Error Correction (QEC’19) was hosted at London July 29th - Aug 2nd. Our group presented two of our recent works.

    Here is a talk given by Prof Leonid Pryadko on Higher-dimensional quantum hypergraph-product & concatenated codes

    I presented a poster on Quantum convolutional data-syndrome codes....