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 Signal Processing

Quantum multi-user detection scheme with Discrete coherent states approximation

Shengmei Zhao, Feng Gao, Xiaoliang Dong, Baoyu Zheng

Published Oct 1, 2010• 3 citations
Publisher

Abstract

Multi-user detection (MUD) techniques will be adopted in the future wired and wireless communication system. It is known that quantum detection techniques promise efficient optimal solutions to this NP (non-polynomial) hard problem in classical domain. "Discrete coherent state"(DCS) approximation method is a practical model for solving the mixed-state detection problem. In this paper, we use DCS approximation model for the MUD problem. For a noisy quantum channel, it is feasible to consider the output states are mixed states, which are the input pure states corrupted by the noise when the pure states pass thought the noisy quantum channel. For simplicity and generality, we deduce the error probability of symbol against correlation coefficient in two users' fashion. By numerical simulations, we analyze and compare the performance of this representation. The simulation results show that the detection error will increase while the correlation coefficient increase, and the performance is also effected by the noise level. With less noise, the system will get better performance. The DCS approximation representation is a good detection scheme for quantum multi-user detection.

DOI
10.1109/icosp.2010.5656505

Related papers

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 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

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

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

Quantum detection of coherent-state signals in the presence of noise

Victor A. Vilnrotter, Chi-Wung Lau

A general method for solving an important class of quantum detection problems will be presented and evaluated. The quantum theory for detecting pure states for communications purposes has been developed over two decades ago, however the mixed state problem representing signal plus noise states has received little attention due to its great complexity. Here we develop a practical model for solving the mixed-state problem using a discrete approximation to the coherent-state representation of signal plus noise density operators.

•Jan 21, 2003•0 citations

Quantum-assisted multi-user wireless systems

Panagiotis Botsinis

The high complexity of numerous optimal classical communication schemes, such as the Maximum Likelihood (ML) and Maximum A posteriori Probability (MAP) Multi-User Detector (MUD) designed for coherent detection or the ML and MAP Multiple-Symbol Differential Detectors (MSDD) conceived for non-coherent receivers often prevents their practical implementation. In this thesis we commence with a review and tutorial on Quantum Search Algorithms (QSA) and propose a number of hard-output and iterative Quantum-assisted MUDs (QMUD) and MSDDs (QMSDD). We employ a QSA, termed as the Durr-Hyer Algorithm (DHA) that finds the minimum of a function in order to perform near-optimal detection with quadratic reduction in the computational complexity, when compared to that of the ML MUD / MSDD. Two further techniques conceived for reducing the complexity of the DHA-based Quantum-assisted MUD (QMUD) are also proposed. These novel QMUDs / QMSDDs are employed in the uplink of various multiple access systems, such as Direct Sequence Code Division Multiple Access systems, Space Division Multiple Access systems as well as in Direct-Sequence Spreading and Slow Subcarrier Hopping SDMA systems amalgamated with Orthogonal Frequency Division Multiplexing and Interleave Division Multiple Access systems. Furthermore, we follow a quantum approach to achieve the same performance as the optimal Soft Input Soft-Output (SISO) classical detectors by replacing them with a quantum algorithm, which estimates the weighted sum of all the evaluations of a function. We propose a SISO QMUD / QMSDD scheme, which is the quantum-domain equivalent of the MAP MUD / MSDD. Both our EXtrinsic Information Transfer (EXIT) charts and Bit Error Ratio (BER) curves show that the computational complexity of the proposed QMUD / QMSDD is significantly lower than that of the MAP MUD / MSDD, whilst their performance remains equivalent. Moreover, we propose two additional families of iterative DHA-based QMUD / QMSDDs for performing near-optimal MAP detection exhibiting an even lower tunable complexity than the QWSA QMUD. Several variations of the proposed QMUD / QMSDDs have been developed and they are shown to perform better than the state-of-the-art low-complexity MUDs / MSDDs at a given complexity. Their iterative decoding performance is investigated with the aid of non-Gaussian EXIT charts.

•Mar 1, 2015•0 citations
Multi-user detection (MUD) techniques will be adopted in the future wired and wireless communication system. It is known that quantum detection techniques promise efficient optimal solutions to this NP (non-polynomial) hard problem in classical domain. "Discrete coherent state"(DCS) approximation method is a practical model for solving the mixed-state detection problem. In this paper, we use DCS approximation model for the MUD problem. For a noisy quantum channel, it is feasible to consider the output states are mixed states, which are the input pure states corrupted by the noise when the pure states pass thought the noisy quantum channel. For simplicity and generality, we deduce the error probability of symbol against correlation coefficient in two users' fashion. By numerical simulations, we analyze and compare the performance of this representation. The simulation results show that the detection error will increase while the correlation coefficient increase, and the performance is also effected by the noise level. With less noise, the system will get better performance. The DCS approximation representation is a good detection scheme for quantum multi-user detection.
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.
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 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.
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
A general method for solving an important class of quantum detection problems will be presented and evaluated. The quantum theory for detecting pure states for communications purposes has been developed over two decades ago, however the mixed state problem representing signal plus noise states has received little attention due to its great complexity. Here we develop a practical model for solving the mixed-state problem using a discrete approximation to the coherent-state representation of signal plus noise density operators.
The high complexity of numerous optimal classical communication schemes, such as the Maximum Likelihood (ML) and Maximum A posteriori Probability (MAP) Multi-User Detector (MUD) designed for coherent detection or the ML and MAP Multiple-Symbol Differential Detectors (MSDD) conceived for non-coherent receivers often prevents their practical implementation. In this thesis we commence with a review and tutorial on Quantum Search Algorithms (QSA) and propose a number of hard-output and iterative Quantum-assisted MUDs (QMUD) and MSDDs (QMSDD). We employ a QSA, termed as the Durr-Hyer Algorithm (DHA) that finds the minimum of a function in order to perform near-optimal detection with quadratic reduction in the computational complexity, when compared to that of the ML MUD / MSDD. Two further techniques conceived for reducing the complexity of the DHA-based Quantum-assisted MUD (QMUD) are also proposed. These novel QMUDs / QMSDDs are employed in the uplink of various multiple access systems, such as Direct Sequence Code Division Multiple Access systems, Space Division Multiple Access systems as well as in Direct-Sequence Spreading and Slow Subcarrier Hopping SDMA systems amalgamated with Orthogonal Frequency Division Multiplexing and Interleave Division Multiple Access systems. Furthermore, we follow a quantum approach to achieve the same performance as the optimal Soft Input Soft-Output (SISO) classical detectors by replacing them with a quantum algorithm, which estimates the weighted sum of all the evaluations of a function. We propose a SISO QMUD / QMSDD scheme, which is the quantum-domain equivalent of the MAP MUD / MSDD. Both our EXtrinsic Information Transfer (EXIT) charts and Bit Error Ratio (BER) curves show that the computational complexity of the proposed QMUD / QMSDD is significantly lower than that of the MAP MUD / MSDD, whilst their performance remains equivalent. Moreover, we propose two additional families of iterative DHA-based QMUD / QMSDDs for performing near-optimal MAP detection exhibiting an even lower tunable complexity than the QWSA QMUD. Several variations of the proposed QMUD / QMSDDs have been developed and they are shown to perform better than the state-of-the-art low-complexity MUDs / MSDDs at a given complexity. Their iterative decoding performance is investigated with the aid of non-Gaussian EXIT charts.