Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Acoustics Speech and Signal Processing

Finer-Grained Decomposition for Parallel Quantum Mimo Processing

Minsung Kim, Kyle Jamieson

Published May 5, 2023• 5 citations
Publisher

Abstract

Exploiting (near-)optimal MIMO signal processing algorithms in the next generation (NextG) cellular systems holds great promise in achieving significant wireless performance gains in spectral efficiency and device connectivity, to name a few. However, it is extremely difficult to enable optimal processing methods in the systems, since the required computational amount increases exponentially with more users and higher data rates, while available processing time is strictly limited. In this regard, quantum signal processing has been recently identified as a promising potential enabler of the (near-)optimal algorithms in the systems, since quantum computing could dramatically speed up the computation via non-conventional effects based on quantum mechanics. Given existing quantum decoherence and noise on quantum hardware, parallel quantum optimization could accelerate the process even further at the expense of more qubit usage. In this paper, we discuss the parallelization of quantum MIMO processing and investigate a spin-level preprocessing method for relatively finer-grained decomposition that can support more flexible parallel quantum signal processing, compared to the recently reported symbol-level decomposition method. We evaluate the method on the state-of-the-art analog D-Wave Advantage quantum processor.

DOI
10.1109/icassp49357.2023.10096503

Related papers

Quantum and Quantum-Inspired Computation for NextG MIMO Wireless Communications

M. S. Kim

This extended abstract outlines our research on quantum and emerging computing systems for next-generation wireless networks. The research aims to leverage quantum and quantum-inspired computation to expedite baseband processing at base stations. We introduce our system design directions and prototype systems that are implemented on analog quantum processors. The prototypes are designed for quantum-accelerated near-optimal multi-user detection processing in MIMO systems that could drastically increase wireless performance for tomorrow's NextG cellular networking standards, as well as in NextG wireless local area networks (LAN).

International Conference on Mobile Systems, Applications, and Services•Jun 3, 2024•0 citations

Hybrid Quantum-Classical Approaches to Optimize Signal Processing in Massive MIMO Arrays

Shaik Anjimoon, Baswaraju Swathi, Rajeev Sobti +3 more

This paper introduces a pioneering method in the realm of signal processing for Massive Multiple-Input Multiple-Output (MIMO) systems, leveraging the synergistic potential of hybrid quantum-classical computing paradigms. The escalating demand for high data rate communications necessitates the advancement of MIMO technologies. However, the computational complexity associated with signal processing in such systems, especially in scenarios involving large array sizes, presents a significant challenge. This study proposes an innovative framework that integrates quantum computing algorithms with traditional classical methods to address this challenge. The quantum algorithms are specifically designed to expedite matrix operations and optimization tasks that are central to MIMO signal processing, such as channel estimation and precoding. A comparative analysis with purely classical approaches demonstrates a substantial improvement in computational efficiency and latency reduction, while maintaining, and in certain aspects enhancing, the accuracy of signal detection and system throughput. Furthermore, this hybrid approach offers scalability and adaptability to varying channel conditions and system configurations, a crucial feature for next-generation wireless communication systems. The theoretical foundation is complemented by simulation results, showcasing the feasibility and effectiveness of this approach in practical scenarios. This research not only paves the way for advanced signal processing techniques in Massive MIMO systems but also opens new horizons in the application of quantum computing in telecommunications.

International Conference on Communication, Computer Sciences and Engineering (IC3SE)•May 9, 2024•4 citations

Quantum Annealing for Next-Generation MU-MIMO Detection: Evaluation and Challenges

J. C. De Luna Ducoing, Konstantinos Nikitopoulos

Multi-user (MU), multiple-input, multiple-output (MIMO) detection has been extensively investigated, and many techniques have been proposed. However, further performance improvements may be constrained by limitations in classical computation. The motivation for this work is to test whether a machine that exploits quantum principles can offer improved performance over conventional detection approaches. This paper presents an evaluation of MIMO detection based on quantum annealing (QA) when run on an actual QA quantum processing unit (QPU) and describes the challenges and potential improvements. The evaluations show promising results in some cases, such as near-optimality in a QPSK-modulated 8×8 MIMO case, but poor results in other cases, such as for larger systems or when using 16-QAM. We show that some challenges of QA detection include dealing with integrated control errors (ICE), the limited dynamic range of QA QPUs, an exponential increase in the number of qubits to the problem size, and a high computation overhead. Solving these challenges could make QA-based detection superior to conventional approaches and bring a new generation of MU-MIMO detection methods.

International Conference on Communications•May 16, 2022•19 citations

Quantum-Based Maximum Likelihood Detection in MIMO-NOMA Systems for 6G Networks

Helen Urgelles, David García‐Roger, José F. Monserrat

As wireless networks advance toward the Sixth Generation (6G), which will support highly heterogeneous scenarios and massive data traffic, conventional computing methods may struggle to meet the immense processing demands in a resource-efficient manner. This paper explores the potential of quantum computing (QC) to address these challenges, specifically by enhancing the efficiency of Maximum-Likelihood detection in Multiple-Input Multiple-Output (MIMO) Non-Orthogonal Multiple Access (NOMA) communication systems, an essential technology anticipated for 6G. The study proposes the use of the Quantum Approximate Optimization Algorithm (QAOA), a variational quantum algorithm known for providing quantum advantages in certain combinatorial optimization problems. While current quantum systems are not yet capable of managing millions of physical qubits or performing high-fidelity, long gate sequences, the results indicate that QAOA is a promising QC approach for radio signal processing tasks. This research provides valuable insights into the potential transformative impact of QC on future wireless networks. This sets the stage for discussions on practical implementation challenges, such as constrained problem sizes and sensitivity to noise, and opens pathways for future research aimed at fully harnessing the potential of QC for 6G and beyond.

Quantum Reports•Oct 22, 2024•11 citations

A Study of Quantum-Inspired Signal Processing for Future Communication Systems

Balaiah Miska

Networks built to sixth-generation (6G) targets will have to hold sub-millisecond latency, push spectral efficiency past what today's massive MIMO deployments achieve, and manage resources across highly heterogeneous nodes with little human supervision. Those targets place a hard demand on the optimizer. Channel estimation, adaptive modulation, beamforming and decoding all involve searching large, non-convex parameter spaces, and the search has to finish inside a coherence interval that may last only a few hundred microseconds. This paper surveys quantum-inspired signal processing (QISP), a family of classical algorithms that borrow structure from quantum computation, including amplitude-weighted superposition sampling, quantum-walk-style exploration, Ising-model formulations and tensor-network compression, but that run entirely on conventional processors. We group the literature under four headings: algorithmic foundations, communication-system architectures, optimization strategies, and implementation constraints. We then propose a reference architecture in which a quantum-inspired optimization engine sits beside a conventional OFDM/MIMO transmit-receive chain and reconfigures modulation, beam-selection and decoding parameters from channel-state feedback. An illustrative simulation grounds the discussion: a representative QISP optimizer is compared against a conventional adaptive baseline over a 4×4 MIMO, QPSK, AWGN-channel OFDM link at signal-to-noise ratios (SNR) from 0 to 20 dB. These numbers demonstrate methodology and are not measurements taken from physical hardware. Within that caveat, the QISP optimizer achieves a lower biterror rate (BER) at low and moderate SNR, and the throughput and latency trends are consistent with the parameter-search efficiency reported in the wider literature. The paper concludes with open problems such as scalability, algorithmic complexity, explainability and standardized benchmarking, and research directions on hybrid quantum-classical processors, reconfigurable intelligent surfaces (RIS), semantic communications, and edge-native QISP inference.

Ci-STEM Journal of Digital Technologies and Expert Systems•Jan 1, 2025•0 citations

Compiler Estimation of Parallelism and Communication for Quantum Computation

Jeffrey P. Heckey

Quantum computing promises to speed up scientific and computationally intensive operations. However, the power of quantum computing is limited by the relatively small window of time where the quantum state and be maintained (coherent). To achieve maximum efficiency, not merely to keep this state coherent but to increase computational productivity, maximizing the parallelism of the system is important. The architectural model that is explored here attempts to exploit the relatively small number of operations that are actually performed within a quantum computer to maximize fine-grained, data level parallelism, as opposed to the more common coarse-grained, task level parallelism. This model represents a Multi-SIMD processor design, where multiple SIMD cores are used to boost data level parallelism, but allows for limited task indepence.The purpose of this work is to explore the effectiveness of parallel processing in a Multi-SIMD quantum architecture. It examines the ability to speedup computation using a combination of parallel processing scheduling and communication awareness, showing up to 7.8X speedup. This information is then used to extract theoretical requirements for bandwidth (>8000 qubits/cycle peak) and throughput (3 qubits/cycle sustained). This research leverages the ScaffCC compiler toolchain [26], which provides a logical-level (i.e., implicitly error-corrected) quantum assembly output as the input to be scheduled and analyzed.

•Jan 1, 2014•0 citations
Exploiting (near-)optimal MIMO signal processing algorithms in the next generation (NextG) cellular systems holds great promise in achieving significant wireless performance gains in spectral efficiency and device connectivity, to name a few. However, it is extremely difficult to enable optimal processing methods in the systems, since the required computational amount increases exponentially with more users and higher data rates, while available processing time is strictly limited. In this regard, quantum signal processing has been recently identified as a promising potential enabler of the (near-)optimal algorithms in the systems, since quantum computing could dramatically speed up the computation via non-conventional effects based on quantum mechanics. Given existing quantum decoherence and noise on quantum hardware, parallel quantum optimization could accelerate the process even further at the expense of more qubit usage. In this paper, we discuss the parallelization of quantum MIMO processing and investigate a spin-level preprocessing method for relatively finer-grained decomposition that can support more flexible parallel quantum signal processing, compared to the recently reported symbol-level decomposition method. We evaluate the method on the state-of-the-art analog D-Wave Advantage quantum processor.
This extended abstract outlines our research on quantum and emerging computing systems for next-generation wireless networks. The research aims to leverage quantum and quantum-inspired computation to expedite baseband processing at base stations. We introduce our system design directions and prototype systems that are implemented on analog quantum processors. The prototypes are designed for quantum-accelerated near-optimal multi-user detection processing in MIMO systems that could drastically increase wireless performance for tomorrow's NextG cellular networking standards, as well as in NextG wireless local area networks (LAN).
This paper introduces a pioneering method in the realm of signal processing for Massive Multiple-Input Multiple-Output (MIMO) systems, leveraging the synergistic potential of hybrid quantum-classical computing paradigms. The escalating demand for high data rate communications necessitates the advancement of MIMO technologies. However, the computational complexity associated with signal processing in such systems, especially in scenarios involving large array sizes, presents a significant challenge. This study proposes an innovative framework that integrates quantum computing algorithms with traditional classical methods to address this challenge. The quantum algorithms are specifically designed to expedite matrix operations and optimization tasks that are central to MIMO signal processing, such as channel estimation and precoding. A comparative analysis with purely classical approaches demonstrates a substantial improvement in computational efficiency and latency reduction, while maintaining, and in certain aspects enhancing, the accuracy of signal detection and system throughput. Furthermore, this hybrid approach offers scalability and adaptability to varying channel conditions and system configurations, a crucial feature for next-generation wireless communication systems. The theoretical foundation is complemented by simulation results, showcasing the feasibility and effectiveness of this approach in practical scenarios. This research not only paves the way for advanced signal processing techniques in Massive MIMO systems but also opens new horizons in the application of quantum computing in telecommunications.
Multi-user (MU), multiple-input, multiple-output (MIMO) detection has been extensively investigated, and many techniques have been proposed. However, further performance improvements may be constrained by limitations in classical computation. The motivation for this work is to test whether a machine that exploits quantum principles can offer improved performance over conventional detection approaches. This paper presents an evaluation of MIMO detection based on quantum annealing (QA) when run on an actual QA quantum processing unit (QPU) and describes the challenges and potential improvements. The evaluations show promising results in some cases, such as near-optimality in a QPSK-modulated 8×8 MIMO case, but poor results in other cases, such as for larger systems or when using 16-QAM. We show that some challenges of QA detection include dealing with integrated control errors (ICE), the limited dynamic range of QA QPUs, an exponential increase in the number of qubits to the problem size, and a high computation overhead. Solving these challenges could make QA-based detection superior to conventional approaches and bring a new generation of MU-MIMO detection methods.
As wireless networks advance toward the Sixth Generation (6G), which will support highly heterogeneous scenarios and massive data traffic, conventional computing methods may struggle to meet the immense processing demands in a resource-efficient manner. This paper explores the potential of quantum computing (QC) to address these challenges, specifically by enhancing the efficiency of Maximum-Likelihood detection in Multiple-Input Multiple-Output (MIMO) Non-Orthogonal Multiple Access (NOMA) communication systems, an essential technology anticipated for 6G. The study proposes the use of the Quantum Approximate Optimization Algorithm (QAOA), a variational quantum algorithm known for providing quantum advantages in certain combinatorial optimization problems. While current quantum systems are not yet capable of managing millions of physical qubits or performing high-fidelity, long gate sequences, the results indicate that QAOA is a promising QC approach for radio signal processing tasks. This research provides valuable insights into the potential transformative impact of QC on future wireless networks. This sets the stage for discussions on practical implementation challenges, such as constrained problem sizes and sensitivity to noise, and opens pathways for future research aimed at fully harnessing the potential of QC for 6G and beyond.
Networks built to sixth-generation (6G) targets will have to hold sub-millisecond latency, push spectral efficiency past what today's massive MIMO deployments achieve, and manage resources across highly heterogeneous nodes with little human supervision. Those targets place a hard demand on the optimizer. Channel estimation, adaptive modulation, beamforming and decoding all involve searching large, non-convex parameter spaces, and the search has to finish inside a coherence interval that may last only a few hundred microseconds. This paper surveys quantum-inspired signal processing (QISP), a family of classical algorithms that borrow structure from quantum computation, including amplitude-weighted superposition sampling, quantum-walk-style exploration, Ising-model formulations and tensor-network compression, but that run entirely on conventional processors. We group the literature under four headings: algorithmic foundations, communication-system architectures, optimization strategies, and implementation constraints. We then propose a reference architecture in which a quantum-inspired optimization engine sits beside a conventional OFDM/MIMO transmit-receive chain and reconfigures modulation, beam-selection and decoding parameters from channel-state feedback. An illustrative simulation grounds the discussion: a representative QISP optimizer is compared against a conventional adaptive baseline over a 4×4 MIMO, QPSK, AWGN-channel OFDM link at signal-to-noise ratios (SNR) from 0 to 20 dB. These numbers demonstrate methodology and are not measurements taken from physical hardware. Within that caveat, the QISP optimizer achieves a lower biterror rate (BER) at low and moderate SNR, and the throughput and latency trends are consistent with the parameter-search efficiency reported in the wider literature. The paper concludes with open problems such as scalability, algorithmic complexity, explainability and standardized benchmarking, and research directions on hybrid quantum-classical processors, reconfigurable intelligent surfaces (RIS), semantic communications, and edge-native QISP inference.
Quantum computing promises to speed up scientific and computationally intensive operations. However, the power of quantum computing is limited by the relatively small window of time where the quantum state and be maintained (coherent). To achieve maximum efficiency, not merely to keep this state coherent but to increase computational productivity, maximizing the parallelism of the system is important. The architectural model that is explored here attempts to exploit the relatively small number of operations that are actually performed within a quantum computer to maximize fine-grained, data level parallelism, as opposed to the more common coarse-grained, task level parallelism. This model represents a Multi-SIMD processor design, where multiple SIMD cores are used to boost data level parallelism, but allows for limited task indepence.The purpose of this work is to explore the effectiveness of parallel processing in a Multi-SIMD quantum architecture. It examines the ability to speedup computation using a combination of parallel processing scheduling and communication awareness, showing up to 7.8X speedup. This information is then used to extract theoretical requirements for bandwidth (>8000 qubits/cycle peak) and throughput (3 qubits/cycle sustained). This research leverages the ScaffCC compiler toolchain [26], which provides a logical-level (i.e., implicitly error-corrected) quantum assembly output as the input to be scheduled and analyzed.