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

International Conference on Communications, Circuits and Systems

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

Shengmei Zhao, Baoyu Zheng

Published Jun 1, 2006• 0 citations
Publisher

Abstract

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

DOI
10.1109/icccas.2006.284762

Related papers

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

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

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

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

Detection scheme for quantum multiple access channel with noisy coherent state

Shengmei Zhao, Feng Gao, Xiaoliang Dong +1 more

Quantum detection techniques based on multi-access quantum channel promise efficient quantum optimal solutions to quantum multi-user detection. "Discrete coherent state"(DCS) approximation method is a practical model for solving the mixed-state detection problem. Generally, the input states are pure states, while the output states are turned out to be mixed states corrupted by the noise in quantum channel. In this paper, we consider the detection scheme with DCS approximation in a quantum multiple access channel. We deduce the error probability of symbol rate of the detection algorithm with DCS detection scheme in multi-user detection fashion. By numerical simulations, we analyze and compare the performance of this detection scheme with different degree approximation. It is shown that this detection scheme is available for the quantum multi-user detection. For a normal noise, say jV=0.1, we will get the 10-3when number of photons Ns go to 18.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2010•1 citation

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
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.
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.
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
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.
Quantum detection techniques based on multi-access quantum channel promise efficient quantum optimal solutions to quantum multi-user detection. "Discrete coherent state"(DCS) approximation method is a practical model for solving the mixed-state detection problem. Generally, the input states are pure states, while the output states are turned out to be mixed states corrupted by the noise in quantum channel. In this paper, we consider the detection scheme with DCS approximation in a quantum multiple access channel. We deduce the error probability of symbol rate of the detection algorithm with DCS detection scheme in multi-user detection fashion. By numerical simulations, we analyze and compare the performance of this detection scheme with different degree approximation. It is shown that this detection scheme is available for the quantum multi-user detection. For a normal noise, say jV=0.1, we will get the 10-3when number of photons Ns go to 18.
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.