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

Jisuanji gongcheng

Signal Detection of Communication Systems Based on Grover Algorithm

Li Fei

Published Jan 1, 2010• 1 citation
OpenAlex

Abstract

An investigation of the signal detection scheme with Grover algorithm in MIMO-OFDM system is developed,and Grover algorithm is applied to find the minimum value in order to decide the sending sequence.In order to test the efficiency and reliability of this algorithm,the analysis and comparison between Grover algorithm,improved Grover algorithm and other traditional algorithms are made by Matlab simulation.Experimental results show that it can reduce the complexity,while achieving the same performance of the traditional optimum detection algorithms.

Related papers

A quantum search based signal detection for MIMO-OFDM systems

Fei Li, Lizhi Zhou, Li Liu +1 more

Multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) is considered as candidates for future broadband wireless services. In this paper a novel signal detection scheme based on Grover's quantum search algorithm is proposed for MIMO-OFDM systems. Grover's quantum search algorithm is based on the concept and principles of quantum computing, such as quantum bit, quantum register and quantum parallelism. An analysis is given to the theoretical basis of Grover's algorithm and the performance of Grover's algorithm is evaluated. A novel signal detector based on Grover's algorithm (GD) for MIMO-OFDM system is proposed. The simulation results show that the proposed detector has more powerful properties in bit error rate than MMSE detector and VBLAST-MMSE detector. The performance of the proposed GD detector is close to optimal when the failure probability is 0.001. When the failure probability is 0.00001, the performance of GD detector declines. In this case, our proposed improved Grover's algorithm based detector is still close to the optimal ML detector. The complexity of GD and IGD is O(√N). It's much better than classical ML detector which complexity is O(N).

•May 1, 2011•4 citations

Grover's Quantum Search Based Data Detection Algorithm for MIMO System

Jing Shen, Muqing Wu, Linlin Luan

Abstract Maximum like-lihood (ML) algorithm is the optimal detection scheme for the data detection of multiple-input multiple-output (MIMO) communication systems, but it has a high complexity in its preprocessing. For good performance and low complexity, a new Grover’s Quantum Search (GS) based data detection algorithm for MIMO system is proposed. It can increase the probability amplitude of solutions while reducing the probability amplitude of non-solutions. By Grover’s iterative process, the probability amplitude of solutions can reach maximum. So it can get the solutions after measurement with a high probability. The simulation results show that the proposed data detection algorithm for MIMO system has a very close to ML based data detection in Bit Error Rate (BER) performance, but it has lower complexity than ML based data detection algorithm.

International Journal of Advancements in Computing Technology•Jan 31, 2012•7 citations

VBLAST system signal detection based on the Grover algorithm

Wang Mi

In the VBLAST system, linear detection has low computational complexity, but its detection performance is poor. Conversely, Maximum Likelihood(ML) detection achieves optimal detection performance, but its computational complexity grows exponentially with the number of transmit antennas and the signal modulation order. This is a typical NP problem. To reduce the computational complexity of ML detection in the VBLAST system, while at the same time retaining optimal detection performance, an improved ML detection method is proposed in this paper. Both the quantum Grover and Grover-Long algorithms are used in the ML detection algorithm for the VBLAST system, and the complexity and performance of the algorithm are simulated. The simulation results show that not only is the computational complexity of Grover algorithm detection square accelerated, but also that the detection performance of the algorithm is close to that of ML detection. Moreover,this is the first time that a quantum algorithm is used to solve an engineering problem.

Scientia Sinica Informationis•Jan 1, 2013•1 citation

Grover's Quantum Search for the Signal Detection of OFDMA Downlink and SC-FDMA Uplink

Swaraj Mondal, Nazmun Nahar Zarin, Mohammad Ismat Kadir

There are different access systems proposed for next-generation wireless communications. As the number of users in wireless systems increases, the challenge of reliable communications can be faced with the aid of exhaustive search-based signal detection. However, exhaustive maximum-likelihood searches impose a high complexity. In classical communication systems, performance improvement is achieved at the cost of substantially increased computational complexity. In this study, we consider an OFDMA downlink and SC-FDMA uplink scenario. We propose the employment of quantum search methods for signal detection. Specifically, we employ Grover's algorithm for database search in signal detection. We observe from our simulations that the error performance provided by the classical ML search is attainable by our method. As a benefit of using quantum search, the complexity imposed is substantially reduced compared to using classical ML detectors. We also compare the performance of the proposed scheme with Grover's search-based MC-CDMA detector. We investigate with multiple users as well and find that the quantum search-based scheme is effective in improving performance, while the computational burden is very low.

International Conference on Electrical Engineering and Information Communication Technology•May 2, 2024•1 citation

ML Criterion Based Signal Detection of a MIMO-OFDM System Using Quantum and Semi-Quantum Assisted Modified DHA/BBHT Search Algorithm

Subhadeep Mondal, Mostafizur Rahaman Laskar, Amit Kumar Dutta

The quantum search algorithm (QSA) is one of the most recent developments in the era of quantum signal processing (QSP) and quantum information theory (QIT). It shows a faster performance in finding the solutions of system such as multiple-input multiple-output (MIMO) communication system, quantum error correction and others with a polynomial order over the classical one. Grover's algorithm is one of the first proposed QSA in identifying the index number of the solution of a system, whose solutions are known to the oracle. A further improved QSA called Boyer-Brassard-Høyer-Tapp (BBHT) is followed by the Durr-Hoyer algorithm (DHA), which proposes to find the solutions, while the exact number of the solutions is not known. In this treatise, we propose two modifications to the existing DHA and BBHT algorithms. In DHA, we propose a semi-quantum framework, where after each iteration in DHA, the non-solution points are removed in classical framework. This makes the data set iteratively shorter. In the case of BBHT algorithm, we propose to choose the Grover search number based on the Gamma distribution instead of the uniform one, which gives more chances to the new larger values to improve probability of success. The performance of the proposed QSAs demonstrates plausible improvement in search success performance as compared to their existing BBHT and DHA counterparts. Numerical simulations are conducted with the proposed QSA algorithms on a MIMO orthogonal frequency division multiplexing (OFDM) system to demonstrate the performance improvement.

IEEE Transactions on Vehicular Technology•Jan 29, 2021•21 citations

MIMO Detection Based on Grover's Algorithm

Li Fei

The MLD is the best detection algorithm in MIMO system.However,the computation complication of MLD emerges exponential increase.This is NP hard problem.Applying the quantum searching algorithm into MIMO system based quantum parallel computation can solve the problem efficiently.In this paper,a scheme based on Grover's algorithm is proposed with a discussion of its performances.

Computer Knowledge and Technology•Jan 1, 2007•0 citations
An investigation of the signal detection scheme with Grover algorithm in MIMO-OFDM system is developed,and Grover algorithm is applied to find the minimum value in order to decide the sending sequence.In order to test the efficiency and reliability of this algorithm,the analysis and comparison between Grover algorithm,improved Grover algorithm and other traditional algorithms are made by Matlab simulation.Experimental results show that it can reduce the complexity,while achieving the same performance of the traditional optimum detection algorithms.
Multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) is considered as candidates for future broadband wireless services. In this paper a novel signal detection scheme based on Grover's quantum search algorithm is proposed for MIMO-OFDM systems. Grover's quantum search algorithm is based on the concept and principles of quantum computing, such as quantum bit, quantum register and quantum parallelism. An analysis is given to the theoretical basis of Grover's algorithm and the performance of Grover's algorithm is evaluated. A novel signal detector based on Grover's algorithm (GD) for MIMO-OFDM system is proposed. The simulation results show that the proposed detector has more powerful properties in bit error rate than MMSE detector and VBLAST-MMSE detector. The performance of the proposed GD detector is close to optimal when the failure probability is 0.001. When the failure probability is 0.00001, the performance of GD detector declines. In this case, our proposed improved Grover's algorithm based detector is still close to the optimal ML detector. The complexity of GD and IGD is O(√N). It's much better than classical ML detector which complexity is O(N).
Abstract Maximum like-lihood (ML) algorithm is the optimal detection scheme for the data detection of multiple-input multiple-output (MIMO) communication systems, but it has a high complexity in its preprocessing. For good performance and low complexity, a new Grover’s Quantum Search (GS) based data detection algorithm for MIMO system is proposed. It can increase the probability amplitude of solutions while reducing the probability amplitude of non-solutions. By Grover’s iterative process, the probability amplitude of solutions can reach maximum. So it can get the solutions after measurement with a high probability. The simulation results show that the proposed data detection algorithm for MIMO system has a very close to ML based data detection in Bit Error Rate (BER) performance, but it has lower complexity than ML based data detection algorithm.
In the VBLAST system, linear detection has low computational complexity, but its detection performance is poor. Conversely, Maximum Likelihood(ML) detection achieves optimal detection performance, but its computational complexity grows exponentially with the number of transmit antennas and the signal modulation order. This is a typical NP problem. To reduce the computational complexity of ML detection in the VBLAST system, while at the same time retaining optimal detection performance, an improved ML detection method is proposed in this paper. Both the quantum Grover and Grover-Long algorithms are used in the ML detection algorithm for the VBLAST system, and the complexity and performance of the algorithm are simulated. The simulation results show that not only is the computational complexity of Grover algorithm detection square accelerated, but also that the detection performance of the algorithm is close to that of ML detection. Moreover,this is the first time that a quantum algorithm is used to solve an engineering problem.
There are different access systems proposed for next-generation wireless communications. As the number of users in wireless systems increases, the challenge of reliable communications can be faced with the aid of exhaustive search-based signal detection. However, exhaustive maximum-likelihood searches impose a high complexity. In classical communication systems, performance improvement is achieved at the cost of substantially increased computational complexity. In this study, we consider an OFDMA downlink and SC-FDMA uplink scenario. We propose the employment of quantum search methods for signal detection. Specifically, we employ Grover's algorithm for database search in signal detection. We observe from our simulations that the error performance provided by the classical ML search is attainable by our method. As a benefit of using quantum search, the complexity imposed is substantially reduced compared to using classical ML detectors. We also compare the performance of the proposed scheme with Grover's search-based MC-CDMA detector. We investigate with multiple users as well and find that the quantum search-based scheme is effective in improving performance, while the computational burden is very low.
The quantum search algorithm (QSA) is one of the most recent developments in the era of quantum signal processing (QSP) and quantum information theory (QIT). It shows a faster performance in finding the solutions of system such as multiple-input multiple-output (MIMO) communication system, quantum error correction and others with a polynomial order over the classical one. Grover's algorithm is one of the first proposed QSA in identifying the index number of the solution of a system, whose solutions are known to the oracle. A further improved QSA called Boyer-Brassard-Høyer-Tapp (BBHT) is followed by the Durr-Hoyer algorithm (DHA), which proposes to find the solutions, while the exact number of the solutions is not known. In this treatise, we propose two modifications to the existing DHA and BBHT algorithms. In DHA, we propose a semi-quantum framework, where after each iteration in DHA, the non-solution points are removed in classical framework. This makes the data set iteratively shorter. In the case of BBHT algorithm, we propose to choose the Grover search number based on the Gamma distribution instead of the uniform one, which gives more chances to the new larger values to improve probability of success. The performance of the proposed QSAs demonstrates plausible improvement in search success performance as compared to their existing BBHT and DHA counterparts. Numerical simulations are conducted with the proposed QSA algorithms on a MIMO orthogonal frequency division multiplexing (OFDM) system to demonstrate the performance improvement.