The key features of 5G, particularly URLLC and mMTC, are designed to achieve low latency and high scalability. To support these requirements, a proposed approach for random access scenarios, known as the GF scheme, eliminates handshakes between the BS and mobile users to reduce latency and accommodate a large number of devices. However, this introduces a new challenge known as AUD, where users send messages indicating their activity status, requiring the BS to detect and decode them. Decoding these messages, however, demands high computational complexity, which increases exponentially with the number of users. Several algorithms, such as ZF and CCR, have been proposed to mitigate this complexity, but they suffer from suboptimal performance. On the other hand, the optimal solution, known as ML, performs well but suffers from high complexity. To address this, quantum algorithms, like Grover's algorithm, have been proposed due to their ability to reduce search complexity while also keep detecting active users performance better. However, Grover's algorithm requires adaptation in this context, as the optimal number of iterations depends on the number of solutions, which is always unknown in the AUD case. To address this, the BBHT and DHA algorithms have been proposed to minimize complexity when the solution is unknown, but both still exhibit relatively high computational demands. In this paper, we propose an Enhanced BBHT that aims to reduce this complexity while maintaining detection performance. Our findings demonstrate that the Enhanced BBHT reduces computational complexity while keeping the performance stable.

The security of the Internet of Things has emerged as a critical concern in the age of interconnectivity. Quantum computers pose a threat to the public key-based Rivest-Shamir Adleman methods currently utilized in encryption. Quantum keys, which can create a Quantum Key Distribution network based security protection system for the quantum Internet of Things, can theoretically provide unconditional security. Among these technologies, Continuous Variable Quantum Key Distribution is currently experiencing rapid and significant growth. This can be attributed to its capacity to support multiple channels and its ease of integration into current optical communication networks. However, the absence of an efficient key allocation system may waste the generation of quantum keys and decrease the overall quality of service. As a result, this paper proposes a Quantum Key Management scheme based on continuous variable Quantum source and application scenarios. The scheme allocates quantum keys from the quantum source. Quantitatively weights the security requirements of key requests in proportion to the quantum key. Our findings indicate that the system successfully manages the keys; however, excessive network traffic can overwhelm the system’s capabilities, leading to increased errors. This underscores the importance of optimizing traffic load to ensure reliable Continuous Variable Quantum Key Distribution

This study focuses on the innovative field of quantum synchronization for satellite-based navigation systems including Global Navigation Satellite Systems (GNSSs) and the Non-Terrestrial Network (NTN) component of future 6G networks integrating both communication and navigation services. By combining a four-qubit system with the theoretical approach of the Lindblad master equation, we transcend the inherent limits of standard synchronization techniques. This achievement represents a quantum leap in satellite-based positioning, highlighting the scalability and cost-effectiveness of our technique for smaller satellites. The study demonstrates the possibility of reducing synchronization errors to less than one meter, significantly improving the reliability and precision of satellite-based navigation systems. The results of this study may contribute to the future development of both user-centric localization systems (typically GNSS systems) and network-centric localization systems (typically through the NTN component of 6G networks), leading to better positioning performance, more flexible multi-functional systems with the potential to limit both cost and size of satellites.

The key features of 5G, such as ultra-reliable low latency (URLLC) and massive machine-type communication (mMTC), are designed to address the need for low latency and the ability to connect a large number of devices in the IoT context. To support these constraints, mobile devices transmit information without previously establishing a connection with the base station (BS). This requires the Base Station to detect in real-time the active users (process known as Active User Detection (AUD)). With classical processors, one can employ the Maximum Likelihood (ML) method (the optimal detector, but suffers from high complexity and delay), or suboptimal ones (which are simpler, but less reliable). Meanwhile, quantum algorithms, particularly Durr and Hoyer (DHA) algorithm, addressing minimum searching problems, can significantly reduce complexity while keeping good performances. However, these algorithms were designed for generic problems, and their initialization and parameterization are blindly done. Nonetheless, we can have access to prior information on the system’s behavior. Therefore, in this paper, we aim to adapt and improve these quantum algorithms by using prior knowledge on the system for the AUD problem. We first propose a novel algorithm, the Improved Iterative Minimum Searching Algorithm (IIMSA) where we define more efficiently the parameters. Then, further enhancements of IIMSA are obtained thanks to a better initialization of the algorithms by exploiting classical preprocessing of the received signals with classical Conventional Correlation Receiver (CCR) or Zero Forcing (ZF). The obtained results show that these proposed algorithms operate more efficiently (i.e., less complexity with better accuracy).