inverse implementation for all subtypes of AbstractCliffordOperator
Duration: July 2024 - August 2024
Description: LinearAlgebra.inv already has methods defined for some of the types in QuantumClifford library meant to represent a Clifford operation. This project implemented the missing inv methods for all other subtypes of AbstractCliffordOperator.
Reviewer: Prof. Stefan Krastanov, UMass Amherst
Tags: Clifford Operators, Stabilizer Formalism, Julia language
QuantumCliffordJuMPExt: compute the minimum distance of QLDPC using Mixed Integer Programming
Duration: November 2024 - Present
Description: This project implements a Mixed Integer Programming (MIP) approach to compute the minimum distance of Quantum Low-Density Parity-Check (QLDPC) codes. The implementation utilizes GNU's Linear Programming Kit (GLPK) and can be generalized to work with other independent MIP solvers. This method was initially proposed by Panteleev and Kalachev (https://arxiv.org/pdf/1904.02703) and later extended by Bravyi et al. (https://arxiv.org/pdf/2308.07915). The latter reference notes that the MIP-based approach was originally developed in 2011 (https://arxiv.org/pdf/1108.5738). This project allows the users to compute the minimum distance with ease and also provide the necessary documentation along with the relevant modern usecases.
Reviewer: Prof. Stefan Krastanov, UMass Amherst
Tags: Quantum Error Correcting codes, Mixed Integer Programming (MIP), Linear Programming, Julia language
QuantumCliffordOscarExt: Extending the capabilities of 2BGA codes via Oscar's Group Algebra
Duration: October 2024 - Present
Description: For researchers deeply involved in researching 2BGA codes, functionalities such as designing very specific group presentations, non-abelian groups, direct products of groups are currently not supported. This is well highlighted in this aforementioned paper, where specific presentations are the key ingredient for construction of Group Algebra of 2BGA with abelian and non-abelian groups. The goal is to extend the capabilities of 2BGA codes in three verticals: 1) specific group presentations for finitely presented groups 2) Direct product of two or more general groups 3) Semidirect product of two or more general groups
Collaborators: Prof. Tommy Hofmann, University of Siegen
Reviewer: Prof. Stefan Krastanov, UMass Amherst
Tags: Two Block Group Algebra codes, Quantum Error Correcting codes, Julia language, Group Algebra
Completing the non-Clifford capabilities
Duration: July 2024 - Present
Description: QuantumClifford library already has some nascent capabilities to represent non-Clifford states as a weighted sum of tableaux states. Such a representation is useful in settings where there is a small number of non-Clifford gates in a mostly Clifford circuit. The cost is still exponential in the number of non-Clifford gates, but manageable. We have simple state representation and gate application already done, expect is nearly implemented in this PR, and project! still needs to be implemented. The aforementioned features need to be completed, well tested, and well documented.
Reviewer: Prof. Stefan Krastanov, UMass Amherst
Tags: Stabilizer formalism, Generalized stabilizer formalism, Julia language, Magic states