Faster implementation of RingArray
Nobody has claimed this yet.
- Dominant language
- Python
- Stars
- 255
- Forks
- 38
- Avg merge
- 11h 19m
- Merged PRs (30d)
- 9
Description
A qldpc.abstract.RingArray is a numpy array subclass whose entries are qldpc.abstract.RingMember-valued. In turn, a qldpc.abstract.RingMember represents an element of a group algebra. Unfortunately, multiplying RingArrays is quite slow, which is an issue for large lifted product codes.
One possibility to speed things up is to make something like a DenseRingMember that is represented by a galois.FieldArray, and collect these into a DenseRingArray.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start with qldpc.abstract.RingArray and qldpc.abstract.RingMember, then examine how RingArray multiplication is implemented for lifted product codes. Compare the proposed DenseRingMember and DenseRingArray approach using galois.FieldArray, and define completion by demonstrating faster multiplication while preserving the existing RingArray behavior.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- performance
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100