Quantum-Compatible Dictionary Learning via Doubly Sparse Models
QML
Citing this entry? Use this QCR ID
Uploaded by
QCR Librarian
Overview
AngshulMajumdar/quantum-dsdl-kaczmarz
README.md
Quantum-Compatible Doubly Sparse Dictionary Learning (DSDL)
This repository contains a flat, minimal implementation of a quantum-compatible doubly sparse dictionary learning (DSDL) algorithm.
There is no package structure and no paper material here by design. This repo exists only to host working code that demonstrates the algorithmic idea.
What this code does
- Uses a doubly sparse model: D = Phi A
- Solves both sparse coding and dictionary update via ridge-stabilized randomized Kaczmarz
- Uses Qiskit only for quantum inner products
- No OMP, no SVD, no QRAM assumptions
- Fully hybrid quantum–classical, NISQ-compatible
Files
dsdl_qiskit.py: main algorithm (paste the final Block 5 here)requirements.txt: minimal dependenciesLICENSE: MIT
Dependencies
- numpy
- qiskit
Install with:
pip install -r requirements.txt
Philosophy
This is a structural algorithmic demonstration, not a benchmarking suite and not a paper repository.
This entry was created automatically from publicly available records. QCR links to public sources and only stores repository content where the license permits redistribution.
Publication
doi:10.48550/arxiv.2601.07210 Quantum-Compatible Dictionary Learning via Doubly Sparse Models
Angshul Majumdar
Versions
v1 Latest
Apr 14, 2026Cite all versions? Use the base QCR ID to always reference the latest version of this entry.
You may also like5
qcr:2604.15215 80 2 Generative modeling with Gaussian Boson Sampling: classically trainable Bosonic Born Machines qcr:2606.94562 76 3 Quantum GAN with PyTorch and Qiskit qcr:2604.58800 59 0 Cutting is All You Need: Execution of Large-Scale Quantum Neural Networks on Limited-Qubit Devices qcr:2604.69779 53 0 Quantum Deep Equilibrium Models qcr:2604.97904 48 0 QuGAN: A Quantum State Fidelity based Generative Adversarial Network
Join the Discussion
Comments (0)
No comments yet. Be the first to share your thoughts!