# An Ensemble Approach for Compressive Sensing with Quantum

arXiv: https://arxiv.org/abs/2006.04682 · HTML: https://mlsanity.com/paper/2006.04682/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 8 Jun 2020.

## Built on by (most cited first, 4 of 4)

- [FrozenQubits: Boosting Fidelity of QAOA by Skipping Hotspot Nodes](https://mlsanity.com/paper/2210.17037/) (2022)
- [Quantum Sparse Coding](https://mlsanity.com/paper/2209.03788/) (2022)
- [Enigma: Application-Layer Privacy for Quantum Optimization on Untrusted Computers](https://mlsanity.com/paper/2311.13546/) (2023)
- [Skipper: Improving the Reach and Fidelity of Quantum Annealers by Skipping Long Chains](https://mlsanity.com/paper/2312.00264/) (2023)

## Abstract (arXiv)

We leverage the idea of a statistical ensemble to improve the quality of quantum annealing based binary compressive sensing. Since executing quantum machine instructions on a quantum annealer can result in an excited state, rather than the ground state of the given Hamiltonian, we use different penalty parameters to generate multiple distinct quadratic unconstrained binary optimization (QUBO) functions whose ground state(s) represent a potential solution of the original problem. We then employ the attained samples from minimizing all corresponding (different) QUBOs to estimate the solution of the problem of binary compressive sensing. Our experiments, on a D-Wave 2000Q quantum processor, demonstrated that the proposed ensemble scheme is notably less sensitive to the calibration of the penalty parameter that controls the trade-off between the feasibility and sparsity of recoveries.