NobleBlocks
Public

Quantum Sparse Coding

Published • Oct 6, 2022
Authors:
Romano Y
,
Primack H
,
Vaknin T

Abstract

The ultimate goal of any sparse coding method is to accurately recover from a few noisy linear measurements, an unknown sparse vector. Unfortunately, this estimation problem is NP-hard in general, and it is therefore always approached with an approximation method, such as lasso or orthogonal matchin...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!