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 Symposium on Circuits and Systems proceedings

Multiuser Detection Based on Grover's Algorithm

Shengmei Zhao, Jia Yao, Baoyu Zheng

Published Sep 22, 2006• 4 citations
Publisher

Abstract

The classical optimal solution of CDMA multi-user detection is consistent with the optimization of a quadratic function, and to find the optimum is a NP hard problem. Reducing the complexity of optimum based on quantum parallel computation is a new trend of multi-user detection techniques. In this paper, we propose a scheme based on Grover's searching algorithm to find the optimum. We give the relationship of bit error rate against signal-to-noise and correlation coefficient by numerical simulation, and simply evaluate the computational complexity of our proposed scheme. The results show that our solution has almost the same performance to the classical optimal one, however, with low complexity

DOI
10.1109/iscas.2006.1693688

Related papers

Grover's QSA based MC-CDMA Detector

Saif Hasan Abdulnabi, Saleem Mohammed Ridha Taha

Multi-Carrier Code Division Multiple Access (MC-CDMA) is considered as one of the major techniques used in 4G broadband wireless services.It combines the advantages of the OFDM systems, of robustness to the multi path effects, and the advantages of CDMA systems, which are high privacy and security.However, a problem appears in the detection of transmitted information because of the effect of noise, fading and other multipath effects.In this paper, Grover's quantum search algorithm based MC-CDMA detector is proposed as a solution for this problem.Grover's quantum search algorithm is based on the concepts of quantum computing, such as quantum bit, quantum register and quantum parallelism.The performance of the proposed detector was realized and compared with previous works.The simulation results showed the superiority of the proposed detector in BER performance.The performance of the proposed detector showed that it is very close to the optimum.

International Journal of Computer Applications•Apr 22, 2015•1 citation

Non-coherent multi-user detection based on quantum search

Sándor Imre, Ferenc Balázs

3G and 4G mobile systems are based on CDMA technology. In order to increase the efficiency of CDMA receivers a large amount of effort is invested to develop suitable multi-user detector techniques. However, at this moment there are only suboptimal solutions available because of the rather high complexity of optimal detectors. One of the possible receiver technologies can be the quantum assisted computing devices which allows high level parallelism in computation. The first commercial devices are estimated by 2004, which meets the advent of 3G and 4G systems. We introduce a novel quantum computation based quantum multi-user detection (QMUD), employing Grover's (see Bell Labs, April 1999)search algorithm, which provides optimal solution. The proposed algorithm is robust to any kind of noise/suboptimal solutions.

International Conference on Communications•Jun 25, 2003•25 citations

Quantum multi-user detection

Shengmei Zhao, Baoyu Zheng

Future wired and wireless communication system will employ multi-user detection techniques, however, at this moment there are only suboptimal solutions available because of the rather high complexity of optimal detectors. Quantum detection techniques promise efficient optimal solutions to this NP (non-polynomial) hard problem. In this paper, we propose a novel approach in the multi-access quantum channel based on the quantum rotation algorithm, by which the minimum average probability of error can be obtained. We evaluate the probability of error under various correlation coefficients and signal-to-interference ratio, and compare them to that of classical optimal solution and the quantum solution under quantum Bayesian minimum cost strategy. The simulation results illustrate that the performance of quantum multi-user detection can be improved greatly when quantum rotation algorithm is employed. Meanwhile, much less time overhead is involved in the calculation.

International Symposium on Signal Processing and Its Applications (ISSPA)•Oct 4, 2006•18 citations

An Improved Solution of Multiuser Detection Based on Quantum Square-Root Measurement

Shengmei Zhao, Baoyu Zheng

Multi-user detection is becoming one of the key techniques of future wired and wireless communication system. Quantum multi-user detection techniques promise an efficient solution to the NP (non-polynomial) hard problem in the conventional optimal solution of multi-user detection. In this paper, we propose an improved solution of quantum multiuser detection in multi-access quantum channel based on the quantum square-root measurement, by which the minimum square-root probability of error can be gathered. We evaluate the probability of symbol error under various correlation coefficients with PSK modulation, and compare them to that of square-root solution with OOK modulation. The simulation results illustrate that the performance of our method can be improved greatly, but with high computation complexity. Then, we design the threshold algorithm and develop a new quantum square-root measurement formula to reduce the computation complexity. It is shown that these methods can lower the complexity greatly in the numerical computation

International Conference on Communications, Circuits and Systems•Jun 1, 2006•0 citations

Multi-User Detection Based on Quantum Square-Root Measurement

Shengmei Zhao, Baoyu Zheng

The quantum multi-user detection technique with quantum detection under quantum multiple-access channel is a promising field in communications, it has promised an efficient solution to the NP hard problem in conventional optimal solution of multi-user detection. In this paper, a solution of multi-user detection in multi-access quantum channel based on the quantum square-root measurement is proposed, by which the minimum square-root probability of error can be gathered, and the probability of symbol error under various correlation coefficients with OOK and PSK modulation is evaluated. Compared with OOK modulation, the performance of PSK modulation can be improved greatly, but with high computation complexity. Then, a threshold algorithm and a new quantum square-root measurement formula are developed to reduce the computation complexity. The numerical experiments show that these methods can lower the complexity greatly.

International Conference on Wireless Communications, Networking and Mobile Computing•Sep 1, 2007•4 citations

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
The classical optimal solution of CDMA multi-user detection is consistent with the optimization of a quadratic function, and to find the optimum is a NP hard problem. Reducing the complexity of optimum based on quantum parallel computation is a new trend of multi-user detection techniques. In this paper, we propose a scheme based on Grover's searching algorithm to find the optimum. We give the relationship of bit error rate against signal-to-noise and correlation coefficient by numerical simulation, and simply evaluate the computational complexity of our proposed scheme. The results show that our solution has almost the same performance to the classical optimal one, however, with low complexity
Multi-Carrier Code Division Multiple Access (MC-CDMA) is considered as one of the major techniques used in 4G broadband wireless services.It combines the advantages of the OFDM systems, of robustness to the multi path effects, and the advantages of CDMA systems, which are high privacy and security.However, a problem appears in the detection of transmitted information because of the effect of noise, fading and other multipath effects.In this paper, Grover's quantum search algorithm based MC-CDMA detector is proposed as a solution for this problem.Grover's quantum search algorithm is based on the concepts of quantum computing, such as quantum bit, quantum register and quantum parallelism.The performance of the proposed detector was realized and compared with previous works.The simulation results showed the superiority of the proposed detector in BER performance.The performance of the proposed detector showed that it is very close to the optimum.
3G and 4G mobile systems are based on CDMA technology. In order to increase the efficiency of CDMA receivers a large amount of effort is invested to develop suitable multi-user detector techniques. However, at this moment there are only suboptimal solutions available because of the rather high complexity of optimal detectors. One of the possible receiver technologies can be the quantum assisted computing devices which allows high level parallelism in computation. The first commercial devices are estimated by 2004, which meets the advent of 3G and 4G systems. We introduce a novel quantum computation based quantum multi-user detection (QMUD), employing Grover's (see Bell Labs, April 1999)search algorithm, which provides optimal solution. The proposed algorithm is robust to any kind of noise/suboptimal solutions.
Future wired and wireless communication system will employ multi-user detection techniques, however, at this moment there are only suboptimal solutions available because of the rather high complexity of optimal detectors. Quantum detection techniques promise efficient optimal solutions to this NP (non-polynomial) hard problem. In this paper, we propose a novel approach in the multi-access quantum channel based on the quantum rotation algorithm, by which the minimum average probability of error can be obtained. We evaluate the probability of error under various correlation coefficients and signal-to-interference ratio, and compare them to that of classical optimal solution and the quantum solution under quantum Bayesian minimum cost strategy. The simulation results illustrate that the performance of quantum multi-user detection can be improved greatly when quantum rotation algorithm is employed. Meanwhile, much less time overhead is involved in the calculation.
Multi-user detection is becoming one of the key techniques of future wired and wireless communication system. Quantum multi-user detection techniques promise an efficient solution to the NP (non-polynomial) hard problem in the conventional optimal solution of multi-user detection. In this paper, we propose an improved solution of quantum multiuser detection in multi-access quantum channel based on the quantum square-root measurement, by which the minimum square-root probability of error can be gathered. We evaluate the probability of symbol error under various correlation coefficients with PSK modulation, and compare them to that of square-root solution with OOK modulation. The simulation results illustrate that the performance of our method can be improved greatly, but with high computation complexity. Then, we design the threshold algorithm and develop a new quantum square-root measurement formula to reduce the computation complexity. It is shown that these methods can lower the complexity greatly in the numerical computation
The quantum multi-user detection technique with quantum detection under quantum multiple-access channel is a promising field in communications, it has promised an efficient solution to the NP hard problem in conventional optimal solution of multi-user detection. In this paper, a solution of multi-user detection in multi-access quantum channel based on the quantum square-root measurement is proposed, by which the minimum square-root probability of error can be gathered, and the probability of symbol error under various correlation coefficients with OOK and PSK modulation is evaluated. Compared with OOK modulation, the performance of PSK modulation can be improved greatly, but with high computation complexity. Then, a threshold algorithm and a new quantum square-root measurement formula are developed to reduce the computation complexity. The numerical experiments show that these methods can lower the complexity greatly.
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.