Compressed sensing enhanced by quantum approximate optimization algorithm
arXiv:2403.17399 · doi:10.1103/PhysRevA.110.062410
Abstract
We present a framework to deal with a range of large scale compressive sensing problems using a quantum subroutine. We apply a quantum approximate optimization algorithm (QAOA) to support detection in a sparse signal reconstruction algorithm: matching pursuit. The constrained optimization required in this algorithm is difficult to handle when the size of the problem is large and constraints are given by unstructured patterns. Our framework utilizes specially designed structured constraints that are easy to manipulate and reduce the optimization problem to the solution of an Ising model which can be found using Ising solvers. In this research, we test the performance of QAOA for this purpose on a simulator of quantum computer. We observe that our method can outperform reference classical methods. Our results explore a promising path of applying quantum computers in the compressive sensing field.
arXiv comment10 pages, 11 figures
References in corpus (40)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Computing
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Supervised learning with quantum enhanced feature spaces
- Quantum Annealing in the Transverse Ising Model
- Quantum computational advantage using photons
- Noisy intermediate-scale quantum (NISQ) algorithms
- Adiabatic Quantum Computing
- Quantum Chemistry in the Age of Quantum Computing
- Quantum Computing
- Trapped-Ion Quantum Computing: Progress and Challenges
- Strong quantum computational advantage using a superconducting quantum processor
- Parameterized quantum circuits as machine learning models
- Quantum state tomography via compressed sensing
- Quantum Computational Supremacy
- Quantum annealing with more than one hundred qubits
- Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
- Efficient quantum state tomography
- Photonic quantum information processing: a review
- Boson sampling with 20 input photons in 60-mode interferometers at state spaces
- Quantum advantage with shallow circuits
- Superconducting Quantum Computing: A Review
- Boson Sampling for Molecular Vibronic Spectra
- IBM Q Experience as a versatile experimental testbed for simulating open quantum systems
- Convex Optimization for Big Data
- Quantum Optimization of Fully-Connected Spin Glasses
- Demonstration of a scaling advantage for a quantum annealer over simulated annealing
- Quantum versus Classical Annealing of Ising Spin Glasses
- Computational advantage of quantum random sampling
- Exact Ising model simulation on a quantum computer
- Benchmarking the performance of portfolio optimization with QAOA
- On the practical usefulness of the Hardware Efficient Ansatz
- QAOA Performance in Noisy Devices: The Effect of Classical Optimizers and Ansatz Depth
- Matrix Product State and mean field solutions for one-dimensional systems can be found efficiently
- On Circuit Depth Scaling For Quantum Approximate Optimization
- Quantum-inspired classical algorithm for molecular vibronic spectra
- Classical simulation of boson sampling with sparse output
- Franck-Condon factors via compressive sensing