feat(Computability): quantum computing foundations
Nobody has claimed this yet.
- Dominant language
- Lean
- Stars
- 709
- Forks
- 200
- Avg merge
- 3d 6h
- Merged PRs (30d)
- 45
Description
Motivation
The CSLib whitepaper lists quantum computation as an in-scope model of computation, but CSLib currently has no quantum computing definitions. The Computability/ directory covers automata, Turing machines, and URMs — quantum computing is a natural next entry.
Proposal
Add foundational definitions for the quantum circuit model under Cslib/Computability/Quantum/:
- Quantum registers — finite-dimensional basis type (qubits as the standard case)
- Pure states — unit vectors in a complex Hilbert space over a register
- Unitary gates — norm-preserving operators that evolve quantum states
Together these define the quantum circuit model — the standard framework for describing quantum algorithms.
Contributor guide
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 by reading the existing definitions under Cslib/Computability/, especially the automata, Turing machine, and URM entries, then inspect the proposed Cslib/Computability/Quantum/ namespace. Define quantum registers, pure states, and unitary gates so they together express the quantum circuit model; done means the foundational definitions are added and consistent with the library’s existing style.
Written by the indexing model from the issue text.
Assessment
- Domain
- quantum-computing
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Quiet
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100