Quantum Algorithm for DOA Estimation in Hybrid Massive MIMO

• URL: http://arxiv.org/abs/2102.03963v1
• Date: Mon, 8 Feb 2021 02:15:07 GMT
• Title: Quantum Algorithm for DOA Estimation in Hybrid Massive MIMO
• Authors: Fanxu Meng
• Abstract summary: Direction of arrival (DOA) estimation in array signal processing is an important research area. In this article, we present a quantum algorithm for MUSIC-based DOA estimation. Our algorithm can achieve an exponential speedup on some parameters and a speedup on others under mild conditions.
• Score: 1.7404865362620803
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Downlink MIMO Channel Estimation from Bits: Recoverability and Algorithm [47.7091447096969]
  A major challenge lies in acquiring the downlink channel state information (CSI) at the base station (BS) from limited feedback sent by the user equipment (UE) In this paper, a simple feedback framework is proposed, where a compression and Gaussian dithering-based quantization strategy is adopted at the UE side, and then a maximum likelihood estimator (MLE) is formulated at the BS side. The algorithm is carefully designed to integrate a sophisticated harmonic retrieval (HR) solver as subroutine, which turns out to be the key of effectively tackling this hard MLE problem.
  arXiv  Detail & Related papers  (2024-11-25T02:15:01Z)
• A Quantum Approximate Optimization Method For Finding Hadamard Matrices [0.0]
  We propose a novel qubit-efficient method by implementing the Hadamard matrix searching algorithm on a gate-based quantum computer. We present the formulation of the method, construction of corresponding quantum circuits, and experiment results in both a quantum simulator and a real gate-based quantum computer.
  arXiv  Detail & Related papers  (2024-08-15T06:25:50Z)
• Optimal Algorithms for the Inhomogeneous Spiked Wigner Model [89.1371983413931]
  We derive an approximate message-passing algorithm (AMP) for the inhomogeneous problem. We identify in particular the existence of a statistical-to-computational gap where known algorithms require a signal-to-noise ratio bigger than the information-theoretic threshold to perform better than random.
  arXiv  Detail & Related papers  (2023-02-13T19:57:17Z)
• A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity [3.965473736150699]
  We develop a density-matrix renormalization group (DMRG) algorithm for the simulation of quantum circuits. For small circuit depths, the technique is exact and equivalent to other matrix product state (MPS) based techniques.
  arXiv  Detail & Related papers  (2022-07-12T15:28:55Z)
• Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection [80.28858481461418]
  Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices. Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2021-07-11T10:56:24Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Joint Deep Reinforcement Learning and Unfolding: Beam Selection and Precoding for mmWave Multiuser MIMO with Lens Arrays [54.43962058166702]
  millimeter wave (mmWave) multiuser multiple-input multiple-output (MU-MIMO) systems with discrete lens arrays have received great attention. In this work, we investigate the joint design of a beam precoding matrix for mmWave MU-MIMO systems with DLA.
  arXiv  Detail & Related papers  (2021-01-05T03:55:04Z)
• Variational Quantum Algorithms for Trace Distance and Fidelity Estimation [7.247285982078057]
  We introduce hybrid quantum-classical algorithms for two distance measures on near-term quantum devices. First, we introduce the Variational Trace Distance Estimation (VTDE) algorithm. Second, we introduce the Variational Fidelity Estimation (VFE) algorithm.
  arXiv  Detail & Related papers  (2020-12-10T15:56:58Z)
• Hybrid quantum variational algorithm for simulating open quantum systems with near-term devices [0.0]
  Hybrid quantum-classical (HQC) algorithms make it possible to use near-term quantum devices supported by classical computational resources. We develop an HQC algorithm using an efficient variational optimization approach to simulate open system dynamics.
  arXiv  Detail & Related papers  (2020-08-12T13:49:29Z)
• Iterative Algorithm Induced Deep-Unfolding Neural Networks: Precoding Design for Multiuser MIMO Systems [59.804810122136345]
  We propose a framework for deep-unfolding, where a general form of iterative algorithm induced deep-unfolding neural network (IAIDNN) is developed. An efficient IAIDNN based on the structure of the classic weighted minimum mean-square error (WMMSE) iterative algorithm is developed. We show that the proposed IAIDNN efficiently achieves the performance of the iterative WMMSE algorithm with reduced computational complexity.
  arXiv  Detail & Related papers  (2020-06-15T02:57:57Z)
• Quantum inspired K-means algorithm using matrix product states [4.846953392700506]
  Matrix product state has become the algorithm of choice when studying one-dimensional interacting quantum many-body systems. We propose a quantum inspired K-means clustering algorithm which first maps the classical data into quantum states represented as matrix product states. We show that this algorithm could reach higher prediction accuracies and that it is less likely to be trapped in local minima compared to the classical K-means algorithm.
  arXiv  Detail & Related papers  (2020-06-11T03:00:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.