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

Journal of Xuzhou Normal University

The Application of Quantum POVM Algorithmin DS-CDMA Multiuser Detection

MA Xiu-fei, Wei Han

Published Jan 1, 2004• 0 citations
OpenAlex

Abstract

In this paper,we present a quantum computation based multiuser detector algorithm,which involves the Positive Operation Valued Measurement.QMUD provides optimal detection in finite time and complexity.The new method utilizes one of possible future receiver technologies of 3G and 4G mobile systems.

Related papers

Positive Operation Valued Measurement Based Multi-User Detection in DS-CDMA Systems

Sándor Imre, Ferenc Balázs

3G and 4G mobile are based on CDMA technology. In order to increase the effectiveness of CDMA receivers 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 advert of 3G and 4G systems. In this paper we introduce a novel quantum computation based Quantum Multi-user detection (QMUD) algorithm, employing simple Positive Operation Valued Measurement (POVM), which provides optimal solution. The proposed algorithm is robust to any kind of noise.

arXiv:quant-ph/0201039•Jan 10, 2002•2 citations

Performance evaluation of quantum based multi-user detector

Sándor Imre, Ferenc Balázs

Future wired and wireless communication systems will employ pure or combined code division multiple access (CDMA) techniques, such as in the European 3G mobile UMTS or power line communications system, but also several 4G proposals include, for example, multicarrier (MC) CDMA. Previous investigations discovered the drawbacks of single user detectors (SUD), which are widely employed in narrowband IS-95 CDMA systems, and were forced to develop suitable multiuser detection schemes to increase the efficiency against interference. However, at this moment there are only suboptimal solutions available became of the rather high complexity of optimal detectors. One of the possible receiver technologies may be quantum assisted computing devices which allow high level parallelism in computation. The first commercial devices are estimated for the next years, which meets the advent of 3G and 4G systems. We analyze the error probability and give tight bounds in a static and dynamically changing environment for a novel quantum computation based quantum multi-user detection (QMUD) algorithm, employing a quantum counting algorithm, which provides an optimal solution.

IEEE International Symposium on Spread Spectrum Techniques and Applications (ISSSTA)•Jun 25, 2003•6 citations

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

Multiuser Detection Based on Grover's Algorithm

Shengmei Zhao, Jia Yao, Baoyu Zheng

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

IEEE International Symposium on Circuits and Systems proceedings•Sep 22, 2006•4 citations

Quantum Search Algorithms, Quantum Wireless, and a Low-Complexity Maximum Likelihood Iterative Quantum Multi-User Detector Design

Panagiotis Botsinis, Soon Xin Ng, Lajos Hanzo

The high complexity of numerous optimal classic communication schemes, such as the maximum likelihood (ML) multiuser detector (MUD), often prevents their practical implementation. In this paper, we present an extensive review and tutorial on quantum search algorithms (QSA) and their potential applications, and we employ a QSA that finds the minimum of a function in order to perform optimal hard MUD with a quadratic reduction in the computational complexity when compared to that of the ML MUD. Furthermore, we follow a quantum approach to achieve the same performance as the optimal soft-input soft-output classic detectors by replacing them with a quantum algorithm, which estimates the weighted sum of a function's evaluations. We propose a soft-input soft-output quantum-assisted MUD (QMUD) scheme, which is the quantum-domain equivalent of the ML MUD. We then demonstrate its application using the design example of a direct-sequence code division multiple access system employing bit-interleaved coded modulation relying on iterative decoding, and compare it with the optimal ML MUD in terms of its performance and complexity. Both our extrinsic information transfer charts and bit error ratio curves show that the performance of the proposed QMUD and that of the optimal classic MUD are equivalent, but the QMUD's computational complexity is significantly lower.

IEEE Access•Jan 1, 2013•64 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
3G and 4G mobile are based on CDMA technology. In order to increase the effectiveness of CDMA receivers 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 advert of 3G and 4G systems. In this paper we introduce a novel quantum computation based Quantum Multi-user detection (QMUD) algorithm, employing simple Positive Operation Valued Measurement (POVM), which provides optimal solution. The proposed algorithm is robust to any kind of noise.
Future wired and wireless communication systems will employ pure or combined code division multiple access (CDMA) techniques, such as in the European 3G mobile UMTS or power line communications system, but also several 4G proposals include, for example, multicarrier (MC) CDMA. Previous investigations discovered the drawbacks of single user detectors (SUD), which are widely employed in narrowband IS-95 CDMA systems, and were forced to develop suitable multiuser detection schemes to increase the efficiency against interference. However, at this moment there are only suboptimal solutions available became of the rather high complexity of optimal detectors. One of the possible receiver technologies may be quantum assisted computing devices which allow high level parallelism in computation. The first commercial devices are estimated for the next years, which meets the advent of 3G and 4G systems. We analyze the error probability and give tight bounds in a static and dynamically changing environment for a novel quantum computation based quantum multi-user detection (QMUD) algorithm, employing a quantum counting algorithm, which provides an optimal solution.
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.
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
The high complexity of numerous optimal classic communication schemes, such as the maximum likelihood (ML) multiuser detector (MUD), often prevents their practical implementation. In this paper, we present an extensive review and tutorial on quantum search algorithms (QSA) and their potential applications, and we employ a QSA that finds the minimum of a function in order to perform optimal hard MUD with a quadratic reduction in the computational complexity when compared to that of the ML MUD. Furthermore, we follow a quantum approach to achieve the same performance as the optimal soft-input soft-output classic detectors by replacing them with a quantum algorithm, which estimates the weighted sum of a function's evaluations. We propose a soft-input soft-output quantum-assisted MUD (QMUD) scheme, which is the quantum-domain equivalent of the ML MUD. We then demonstrate its application using the design example of a direct-sequence code division multiple access system employing bit-interleaved coded modulation relying on iterative decoding, and compare it with the optimal ML MUD in terms of its performance and complexity. Both our extrinsic information transfer charts and bit error ratio curves show that the performance of the proposed QMUD and that of the optimal classic MUD are equivalent, but the QMUD's computational complexity is significantly lower.
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