Quantum search algorithms, quantum wireless, and a low-complexity maximum likelihood iterative quantum multi-user detector design

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

Simulación clásica de un algoritmo cuántico

Classical computing there are multiple algorithms to efficiently locate a certain element within a disorganized database; however, quantum computing can be applied more assertively in the face of problems in which it is complicated to verify a solution and at the same time to test multiple and possible solutions. Therefore, this article presents an introduction to Quantum Computing, developing some concepts of quantum formalism, and then approach Grover's algorithm which exploits the principle of superposition to the maximum. Finally, a classic simulation of this algorithm is performed, and the results obtained are compared with classical algorithms such as sequential search and binary search method. A 95% is obtained as a result of greater effectiveness in times -when solving the same search-, revealing the potential advantages of quantum computing.En la computación clásica existen múltiples algoritmos para localizar de manera eficiente un determinado elemento dentro de una base de datos desorganizada; sin embargo, la computación cuántica puede aplicarse de manera más asertiva frente a tales problemas cuando es complejo verificar una solución y a la vez probar múltiples y posibles soluciones. Por lo anterior, en este artículo se presenta una introducción a la Computación Cuántica -desarrollando algunos conceptos del formalismo cuántico-, y luego se aborda el algoritmo de Grover el cual explota al máximo el principio de superposición. Finalmente se realiza una simulación clásica de dicho algoritmo, y los resultados obtenidos se comparan con otros algoritmos clásicos como el método de búsqueda lineal y búsqueda binaria. Se obtiene como resultado un %95 de mayor efectividad en tiempos -a la hora de resolver la misma búsqueda- logrando poner de manifiesto las ventajas potenciales de la computación cuántica

Resource allocation for relay based green communication systems

The relay based cooperative network is one of the promising techniques for next generation wireless communications, which can help extend the cell coverage and enhance the diversity. To deploy relays efficiently with limited power and bandwidth under certain performance requirements, resource allocation (RA) plays an increasingly important role in the system design. In recent years, with the fast growth of the number of mobile phone users, great portion of CO2 emission is contributed by wireless communication systems. The combination of relay techniques and RA schemes reveals the solution to green communications, which aims to provide high data rate with low power consumption. In this thesis, RA is investigated for next generation relay based green wireless systems, including the long-range cellular systems, and the short-range point-to-point (P2P) systems. In the first contribution, an optimal asymmetric resource allocation (ARA) scheme is proposed for the decode-and-forward (DF) dual-hop multi-relay OFDMA cellular systems in the downlink. With this scheme, the time slots for the two hops via each of the relays are designed to be asymmetric, i.e., with K relays in a cell, a total of 2K time slots may be of different durations, which enhances the degree of freedom over the previous work. Also, a destination may be served by multiple relays at the same time to enhance the transmission diversity. Moreover, closed-form results for optimal resource allocation are derived, which require only limited amount of feedback information. Numerical results show that, due to the multi-time and multi-relay diversities, the proposed ARA scheme can provide a much better performance than the scheme with symmetric time allocation, as well as the scheme with asymmetric time allocation for a cell composed of independent single-relay sub-systems, especially when the relays are relatively close to the source. As a result, with the optimal relay location, the system can achieve high throughput in downlink with limited transmit power. In the second contribution, the power consumption in relay based 60 GHz cooperative networks is studied, which is based on three-terminal diversity amplify-and-forward (DAF) and diversity DF (DDF) relaying strategies. A total power consumption model including drive power, decoding power, and power consumption of power amplifier (PA) is proposed, excluding the transmit power, as it is relatively small compared to decoding power and PA power in the indoor environment. This model is formulated as a function of drive power, which gives an easy access to the system level power allocation. To minimise the system total power consumption, the optimal drive power can be allocated to the source node by numerical searching method while satisfying the data rate requirement. The impact of relay locations on the total power consumption is also investigated. It is shown that, with the same data rate requirement, in the small source-relay separation case, DAF consumes slightly less power than DDF; while with larger source-relay separation, DAF consumes much more power than DDF. In the future work, multiuser relay-based short-range communication systems will be considered for the 60 GHz communication in the fading channel scenario, which extends the proposed power consumption model in a more practical way. The power consumption model of other components, such as analog-to-digital converter, data buffer, modulation/demodulation could also be considered to provide more details about green P2P communications

Understanding Quantum Technologies 2022

Understanding Quantum Technologies 2022 is a creative-commons ebook that provides a unique 360 degrees overview of quantum technologies from science and technology to geopolitical and societal issues. It covers quantum physics history, quantum physics 101, gate-based quantum computing, quantum computing engineering (including quantum error corrections and quantum computing energetics), quantum computing hardware (all qubit types, including quantum annealing and quantum simulation paradigms, history, science, research, implementation and vendors), quantum enabling technologies (cryogenics, control electronics, photonics, components fabs, raw materials), quantum computing algorithms, software development tools and use cases, unconventional computing (potential alternatives to quantum and classical computing), quantum telecommunications and cryptography, quantum sensing, quantum technologies around the world, quantum technologies societal impact and even quantum fake sciences. The main audience are computer science engineers, developers and IT specialists as well as quantum scientists and students who want to acquire a global view of how quantum technologies work, and particularly quantum computing. This version is an extensive update to the 2021 edition published in October 2021.Comment: 1132 pages, 920 figures, Letter forma