Compressive sensing is a signal processing technique that enables the reconstruction of sparse signals from a limited number of measurements, leveraging the signal's inherent sparsity to facilitate efficient recovery. Recent works on the Quantum Compressive Sensing (QCS) architecture, a quantum data-driven approach to compressive sensing where the state of the tensor network is represented by a quantum state over a set of entangled qubits, have shown promise in advancing quantum data-driven methods for compressive sensing. However, the QCS framework has remained largely untested on quantum computing resources or in the presence of quantum noise. In this work, we present a practical implementation of QCS on Amazon Braket, utilizing the Quantum Imaginary Time Evolution (QITE) projection technique to assess the framework's capabilities under quantum noise. We outline the necessary modifications to the QCS framework for deployment on Amazon Braket, followed by results under four types of quantum noise. Finally, we discuss potential long-term directions aimed at unlocking the full potential of quantum compressive sensing for applications such as signal recovery and image processing.
Compressive sensing is a signal processing technique that enables the reconstruction of sparse signals from a limited number of measurements, leveraging the signal's inherent sparsity to facilitate efficient recovery. Recent works on the Quantum Compressive Sensing (QCS) architecture, a quantum data-driven approach to compressive sensing where the state of the tensor network is represented by a quantum state over a set of entangled qubits, have shown promise in advancing quantum data-driven methods for compressive sensing. However, the QCS framework has remained largely untested on quantum computing resources or in the presence of quantum noise. In this work, we present a practical implementation of QCS on Amazon Braket, utilizing the Quantum Imaginary Time Evolution (QITE) projection technique to assess the framework's capabilities under quantum noise. We outline the necessary modifications to the QCS framework for deployment on Amazon Braket, followed by results under four types of quantum noise. Finally, we discuss potential long-term directions aimed at unlocking the full potential of quantum compressive sensing for applications such as signal recovery and image processing.
Compressive sensing is a sensing protocol that facilitates the reconstruction of large signals from relatively few measurements by exploiting known structures of signals of interest, typically manifested as signal sparsity. Compressive sensing’s vast repertoire of applications in areas such as communications and image reconstruction stems from the traditional approach of utilizing non-linear optimization to exploit the sparsity assumption by selecting the lowest-weight (i.e., maximum sparsity) signal consistent with all acquired measurements. Recent efforts in the literature consider instead a data-driven approach, training tensor networks to learn the structure of signals of interest. The trained tensor network is updated to “project” its state onto one consistent with the measurements taken, and is then sampled site by site to “guess” the original signal. In this paper, we take advantage of this computing protocol by formulating an alternative “quantum” protocol, in which the state of the tensor network is a quantum state over a set of entangled qubits. Accordingly, we present the associated algorithms and quantum circuits required to implement the training, projection, and sampling steps on a quantum computer. We supplement our theoretical results by simulating the proposed circuits with a small, qualitative model of LIDAR imaging of earth forests. Our results indicate that a quantum, data-driven approach to compressive sensing may have significant promise as quantum technology continues to make new leaps.
How many measurements are fundamentally required to capture a signal. Shannon's information theory established the bedrock of this question in 1948, the Nyquist Shannon theorem set the first answer, and compressed sensing (CS) rewrote it in 2006 by reducing the required measurement number to M = O(Klog(N/K)) for a K sparse signal. Here, we propose quantum compressed sensing (QCS), a paradigm that reframes signal acquisition as a unitary quantum evolution. By encoding high dimensional signal information into a single quantum probe state, then introducing domain-alignment evolution,a physically realizable unitary transformation that maps the sparse basis directly onto the measurement basis. QCS executes the support-set search at the quantum level without consuming measurement trials. The logarithmic penalty vanishes, compressing the required measurement number from the classical bound to M =O(K) and reducing reconstruction from ill posed optimization to linear estimation. We experimentally validate QCS using frequency and time domain sparse signals, confirming that the measurement number scales linearly with sparsity and decouples entirely from the signal dimension. Our work provides a physical pathway toward ultimate information acquisition efficiency, with broad implications for sensing, imaging, and communication.
Quantum state tomography (QST) is a crucial technique for characterizing the state of quantum systems. However, traditional QST requires a large number of measurements, leading to significant experimental overhead in terms of time, resources, and data acquisition. This work proposes a novel approach to QST by leveraging compressed sensing (CS) techniques. CS allows for accurate reconstruction of the quantum state from a significantly reduced set of measurements, thereby mitigating the experimental burden. We employ sparsity regularization, a key component of CS, to minimize the number of measurements needed. The theoretical framework and the underlying principles are presented, focusing on the mathematical formulation of the problem and the optimization strategies involved. This method offers a pathway to more efficient and cost-effective QST, particularly for complex quantum states or when limited experimental resources are available. We demonstrate the potential of this approach through a detailed mathematical analysis.
This thesis describes the application of compressive sensing to several challenging problems in quantum imaging with practical and fundamental implications. Compressive sensing is a measurement technique that compresses a signal during measurement such that it can be dramatically undersampled. Compressive sensing has been shown to be an extremely efficient measurement technique for imaging, particularly when detector arrays are not available. The thesis first reviews compressive sensing through the lens of quantum imaging and quantum measurement. Four important applications and their corresponding experiments are then described in detail. The first application is a compressive sensing, photon-counting lidar system. A novel depth mapping technique that uses standard, linear compressive sensing is described. Depth maps up to 256 x 256 pixel transverse resolution are recovered with depth resolution less than 2.54 cm. The first three-dimensional, photon counting video is recorded at 32 x 32 pixel resolution and 14 frames-per-second. The second application is the use of compressive sensing for complementary imaging--simultaneously imaging the transverse-position and transverse-momentum distributions of optical photons. This is accomplished by taking random, partial projections of position followed by imaging the momentum distribution on a cooled CCD camera. The projections are shown to not signicantly perturb the photons' momenta while allowing high resolution position images to be reconstructed using compressive sensing. A variety of objects and their diffraction patterns are imaged including the double slit, triple slit, alphanumeric characters, and the University of Rochester logo. The third application is the use of compressive sensing to characterize spatial entanglement of photon pairs produced by spontaneous parametric downconversion. The technique gives a theoretical speedup N2/log N for N-dimensional entanglement over the standard raster scanning technique. Entanglement imaging is demonstrated at 1024 dimensions-per-photon with channel capacities exceeding 8.4 bits-per-photon. In practice, the measurement time is reduced from 310 days for the standard technique to 8 hours for the compressive technique. An entropic steering inequality is violated to witness entanglement. The final application is a compressive wavefront sensor that unites compressive sensing with weak measurement. We show how a twisted-nematic spatial light modulator can be be used to weakly couple an optical field's position and polarization degrees of freedom. The complex nature of the weak value is used to directly measure random projections of the real and imaginary parts of the optical field, where polarization serves as an ancillary meter. We obtain 256 x 256 pixel wavefronts from only 10,000 random projections. Photon-counting detectors provide sub-picowatt sensitivity.
Compressive sensing utilizes sparsity to realize efficient image reconstruction. It is a valuable processing technique when cost, power, technology or computational overhead are limited or high. In the quantum domain technology usually limits efficient acquisition of weak or fragile signals. I will discuss the basics of information theory, compression, and compressive sensing. I will then discuss our recent work in compressive sensing. The topics of discussion include low-flux laser Radar, photonic phase transitions, high resolution biphoton ghost imaging, Ghost object tracking, 3D object tracking and high dimensional entanglement characterization. I will touch lightly on our current work of rapid wavefunction reconstruction and wavefront sensing. As an example (shown below), we were able efficiently and rapidly reconstruct high dimensional joint probability functions of biphotons in momentum and position. With conventional raster scanning this process would take approximately a year, but using double-pixel compressive sensing, the pictures were acquired in a few hours with modest flux.
Compressive sensing is a novel approach that linearly samples sparse or compressible signals at a rate much below the Nyquist-Shannon sampling rate and outperforms traditional signal processing techniques in acquiring and reconstructing such signals. Compressive sensing with matrix uncertainty is an extension of the standard compressive sensing problem that appears in various applications including but not limited to cognitive radio sensing, calibration of the antenna, and deconvolution. The original problem of compressive sensing is NP-hard so the traditional techniques, such as convex and nonconvex relaxations and greedy algorithms, apply stringent constraints on the measurement matrix to indirectly handle this problem in the realm of classical computing. We propose well-posed approaches for both binary compressive sensing and binary compressive sensing with matrix uncertainty problems that are tractable by quantum annealers. Our approach formulates an Ising model whose ground state represents a sparse solution for the binary compressive sensing problem and then employs an alternating minimization scheme to tackle the binary compressive sensing with matrix uncertainty problem. This setting only requires the solution uniqueness of the considered problem to have a successful recovery process, and therefore the required conditions on the measurement matrix are notably looser. As a proof of concept, we can demonstrate the applicability of the proposed approach on the D-Wave quantum annealers; however, we can adapt our method to employ other modern computing phenomena -like adiabatic quantum computers (in general), CMOS annealers, optical parametric oscillators, and neuromorphic computing.