An Ensemble Approach for Compressive Sensing with Quantum
Not on the map. Why?
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.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 8 Jun 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 2.
4 papers.
- 2022FrozenQubits: Boosting Fidelity of QAOA by Skipping Hotspot Nodescited by 4
- 2022Quantum Sparse Codingcited by 3
- 2023Enigma: Application-Layer Privacy for Quantum Optimization on Untrusted Computerscited by 2
- 2023Skipper: Improving the Reach and Fidelity of Quantum Annealers by Skipping Long Chainscited by 0
- 2023Skipper: Improving the Reach and Fidelity of Quantum Annealers by Skipping Long Chains1 Dec 2023
- 2023Enigma: Application-Layer Privacy for Quantum Optimization on Untrusted Computers22 Nov 2023
- 2022FrozenQubits: Boosting Fidelity of QAOA by Skipping Hotspot Nodes31 Oct 2022
- 2022Quantum Sparse Coding8 Sep 2022