Coherent versus Non-Coherent Quantum-Assisted Solutions in Wireless Systems

Each mobile phone transmits its own uplink information to the base station, which results in their superposition. Therefore, the base station has to determine which symbol each of the users has transmitted with (coherent), or without (non-coherent) the knowledge of the channels' estimates. In both scenarios, an optimization problem has to be addressed. Conventional, low-complexity solutions experience degraded performance when the number of receive antenna elements at the base station is lower than the number of mobile terminals. The optimal, full-search-based equivalent multi-level symbol detector offers the best bit error ratio performance, but at a potentially excessive complexity. Quantum search algorithms may be invoked for achieving near-optimal performance at low complexity.

[1]  Sandor Imre,et al.  Advanced Quantum Communications: An Engineering Approach , 2012 .

[2]  Soon Xin Ng,et al.  Low-Complexity Soft-Output Quantum-Assisted Multiuser Detection for Direct-Sequence Spreading and Slow Subcarrier-Hopping Aided SDMA-OFDM Systems , 2014, IEEE Access.

[3]  Lajos Hanzo,et al.  Quantum Search Algorithms, Quantum Wireless, and a Low-Complexity Maximum Likelihood Iterative Quantum Multi-User Detector Design , 2013, IEEE Access.

[4]  I. Chuang,et al.  Quantum Computation and Quantum Information: Introduction to the Tenth Anniversary Edition , 2010 .

[5]  Sándor Imre,et al.  Quantum communications: explained for communication engineers , 2013, IEEE Communications Magazine.

[6]  Gilles Brassard,et al.  Quantum Counting , 1998, ICALP.

[7]  Lajos Hanzo,et al.  Fixed-Complexity Quantum-Assisted Multi-User Detection for CDMA and SDMA , 2014, IEEE Transactions on Communications.

[8]  Lov K. Grover A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[9]  Lajos Hanzo,et al.  Coherent versus Non-coherent and Cooperative Turbo Transceivers , 2010 .

[10]  Sándor Imre,et al.  Quantum Existence Testing and Its Application for Finding Extreme Values in Unsorted Databases , 2007, IEEE Transactions on Computers.

[11]  Christoph Dürr,et al.  A Quantum Algorithm for Finding the Minimum , 1996, ArXiv.

[12]  Gilles Brassard,et al.  Tight bounds on quantum searching , 1996, quant-ph/9605034.

[13]  Lajos Hanzo,et al.  Iterative Quantum-Assisted Multi-User Detection for Multi-Carrier Interleave Division Multiple Access Systems , 2015, IEEE Transactions on Communications.

[14]  Sandor Imre,et al.  Quantum Computing and Communications: An Engineering Approach , 2005 .