Near-field wavefront curvature enables joint angle-range localization, but exploiting it entails repeated covariance-eigenspace tests over a two-dimensional spherical manifold. We propose a quantum subspace-projection algorithm (Q-SPARSE) for super-resolution estimation of parameters in the near field, employing spectral signature similar to MUSIC. Q-SPARSE prepares each spherical steering hypothesis as a quantum state, applies quantum phase estimation (QPE) to covariance-generated evolution, and converts the resolved spectral mass into a localization spectrum. The proposed method does not need the full classical preparation of the eigenstates, which is a major bottleneck of the QPE algorithm, the main subroutine in quantum variants of MUSIC algorithms. Under an ideal signal-noise partition, its score equals the classical signal-subspace overlap exactly and thus preserves the maximizer of normalized near-field MUSIC. For a finite q number of qubit phase registers, we derive the score from the complete QPE kernel, and propose a nearest-bin selection scheme with soft-thresholding based on Marchenko-Pastur-calibrated logistic weighting decision criteria. Numerical results on IBM's QISKIT software platform are demonstrated for near-field array processing.
Comments
Part of a journal submission and submitted to ICASSP 2027. Content may be updated post-review. Subject to journal policies regarding preprint hosting
Near-field wavefront curvature enables joint angle-range localization, but exploiting it entails repeated covariance-eigenspace tests over a two-dimensional spherical manifold. We propose a quantum subspace-projection algorithm (Q-SPARSE) for super-resolution estimation of parameters in the near field, employing spectral signature similar to MUSIC. Q-SPARSE prepares each spherical steering hypothesis as a quantum state, applies quantum phase estimation (QPE) to covariance-generated evolution, and converts the resolved spectral mass into a localization spectrum. The proposed method does not need the full classical preparation of the eigenstates, which is a major bottleneck of the QPE algorithm, the main subroutine in quantum variants of MUSIC algorithms. Under an ideal signal-noise partition, its score equals the classical signal-subspace overlap exactly and thus preserves the maximizer of normalized near-field MUSIC. For a finite q number of qubit phase registers, we derive the score from the complete QPE kernel, and propose a nearest-bin selection scheme with soft-thresholding based on Marchenko-Pastur-calibrated logistic weighting decision criteria. Numerical results on IBM's QISKIT software platform are demonstrated for near-field array processing.
Quantum principal component analysis (qPCA) is commonly formulated as the extraction of eigenvalues and eigenvectors of a covariance-encoded density operator. Yet in many qPCA settings the practical goal is simpler: projection onto the dominant spectral subspace. Here we introduce a projection-first framework, the Filtered Spectral Projection Algorithm (FSPA), which bypasses explicit eigenvalue estimation while preserving the relevant spectral structure. FSPA amplifies any nonzero warm-start overlap with the leading subspace and remains robust in small-gap and near-degenerate regimes, without artificial symmetry breaking in the absence of bias. We show that FSPA achieves an oracle complexity O((log(1/ε)+log(1/∣a1∣2))/log(λ1/λ2)),which is tight by a matching lower bound, establishing it as an\emph{optimal} projection primitive. We derive a convergence rate for degenerate spectra, give a circuit resource analysis with n+O(1) qubit overhead independent of system dimension, and extend the method to threshold spectral projection, Threshold-FSPA, which converges in O(log(1/ε)) calls when the threshold lies between eigenvalues. In the density matrix exponentiation access model, FSPA gives an exponential copy-complexity advantage over classical methods. For classical datasets, we show that for amplitude-encoded centered data the ensemble density matrix ρ=∑ipi∣ψi⟩⟨ψi∣ equals the covariance matrix. Numerical tests on chemistry density matrices, noisy circuit outputs, Breast Cancer Wisconsin, handwritten Digits, and 1--4-qubit scalability confirm the theory. A minimal Qiskit implementation validates magnitude invariance, signal amplification, and no spurious symmetry breaking. These results establish FSPA as an optimal and deployable quantum spectral projection primitive.
The direction of arrival (DOA) estimation in array signal processing is an important research area. The effectiveness of the direction of arrival greatly determines the performance of multi-input multi-output (MIMO) antenna systems. The multiple signal classification (MUSIC) algorithm, which is the most canonical and widely used subspace-based method, has a moderate estimation performance of DOA. However, in hybrid massive MIMO systems, the received signals at the antennas are not sent to the receiver directly, and spatial covariance matrix, which is essential in MUSIC algorithm, is thus unavailable. Therefore, the spatial covariance matrix reconstruction is required for the application of MUSIC in hybrid massive MIMO systems. In this article, we present a quantum algorithm for MUSIC-based DOA estimation in hybrid massive MIMO systems. Compared with the best-known classical algorithm, our quantum algorithm can achieve an exponential speedup on some parameters and a polynomial speedup on others under some mild conditions. In our scheme, we first present the quantum subroutine for the beam sweeping based spatial covariance matrix reconstruction, where we implement a quantum singular vector transition process to avoid extending the steering vectors matrix into the Hermitian form. Second, a variational quantum density matrix eigensolver (VQDME) is proposed for obtaining signal and noise subspaces, where we design a novel objective function in the form of the trace of density matrices product. Finally, a quantum labeling operation is proposed for the direction of arrival estimation of the signal.
The direction of arrival (DOA) estimation in array signal processing is an important research area. The effectiveness of the direction of arrival greatly determines the performance of multi-input multi-output (MIMO) antennas. The multiple signal classification (MUSIC) algorithm, which is the most canonical and widely used subspace-based method for direction angle estimation, has a moderate estimation performance of DOA. In this article, we present a quantum algorithm for performing MUSIC. Compared with the best-known classical algorithm, quantum MUSIC can show a polynomial speedup. In our scheme, we first efficiently implement a non-Hermitian chain product subroutine for the matrix ${\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{R}}_{ss}\ensuremath{\in}{R}^{N\ifmmode\times\else\texttimes\fi{}N}$ with L snapshots, where the method is different from that of Cong and Duan [I. Cong and L. Duan, New J. Phys. 18, 073011 (2016)]. In this subroutine, we perform amplitude transduction [Y. R. Sanders, G. H. Low, A. Scherer, and D. W. Berry, Phys. Rev. Lett. 122, 020502 (2019)] by testing an inequality to neglect the calculation of the approximate arcsine function. Second, a quantum labeling operation based on the principal eigenvalues is proposed for preparing the coherent state of the principal eigenvectors. Finally, we generalize our results to some quantum algorithms with quantum principal component analysis subroutines and some existing quantum algorithms where the covariance matrices occur in the non-Hermitian chain product form.
A core task in quantum anomaly detection is to compute an anomaly score that quantifies how strongly a test quantum state deviates from a given quantum dataset assumed to be normal. Classically, principal component analysis (PCA) for centered data computes the anomaly score by evaluating the test sample relative to the subspace spanned by the selected leading eigenvectors. However, for quantum data that lack a standard centering, explicitly recovering principal eigenvectors, constructing full Gram matrices, or loading quantum-random-access-memory-style data can be more costly than estimating the anomaly score itself. To avoid these costs, we propose Quantum Spectral Anomaly Detection (QSPADE), which computes PCA-like anomaly scores directly from the spectrum of the average state of the normal dataset. By replacing hard PCA rank selection with a smooth, temperature-controlled spectral threshold, QSPADE makes near-threshold spectral components contribute partially to the anomaly score. This makes the score vary continuously rather than jump when a borderline component is included or excluded, and makes it less sensitive to noise or arbitrary hard cutoffs near the threshold. In the zero-temperature limit, QSPADE recovers the hard-projector PCA score. The proposed measurement-based quantum detector can be calibrated with a sample complexity independent of the data dimension. Numerical simulations show that QSPADE behaves like kernel-PCA on encoded classical data and detects changes across a transverse-field Ising transition without predefined order parameters. Consequently, QSPADE gives an efficient framework for both quantum-kernel anomaly detection on encoded classical data and the monitoring of quantum-native systems where diagnostic observables are unknown.
Abstract The multiple signal classification (MUSIC) algorithm is a well-established method to evaluate the direction of arrival (DOA) of signals. However, the construction and eigen-decomposition of the sample covariance matrix (SCM) are computationally costly for MUSIC in hybrid multiple input multiple output (MIMO) systems, which limits the application and advancement of the algorithm. In this paper, we present a novel quantum method for MUSIC in hybrid MIMO systems. Our scheme makes the following three contributions. First, the quantum subroutine for constructing the approximate SCM is designed, along with the quantum circuit for the steering vector and a proposal for quantum singular vector transformation. Second, the variational density matrix eigensolver is proposed to determine the signal and noise subspaces utilizing the destructive swap test. As a proof of principle, we conduct two numerical experiments using a quantum simulator. Finally, the quantum labelling procedure is explored to determine the DOA. The proposed quantum method can potentially achieve exponential speedup on certain parameters and polynomial speedup on others under specific moderate circumstances, compared with their classical counterparts.
Quantum computers provide new avenues to access ground and excited state properties of systems otherwise difficult to simulate on classical hardware. New approaches using subspaces generated by real-time evolution have shown efficiency in extracting eigenstate information, but the full capabilities of such approaches are still not understood. In recent work, we developed the variational quantum phase estimation (VQPE) method, a compact and efficient real-time algorithm to extract eigenvalues on quantum hardware. Here we build on that work by theoretically and numerically exploring a generalized Krylov scheme where the Krylov subspace is constructed through a parametrized real-time evolution, which applies to the VQPE algorithm as well as others. We establish an error bound that justifies the fast convergence of our spectral approximation. We also derive how the overlap with high energy eigenstates becomes suppressed from real-time subspace diagonalization and we visualize the process that shows the signature phase cancellations at specific eigenenergies. We investigate various algorithm implementations and consider performance when stochasticity is added to the target Hamiltonian in the form of spectral statistics. To demonstrate the practicality of such real-time evolution, we discuss its application to fundamental problems in quantum computation such as electronic structure predictions for strongly correlated systems.