Search Results (106)

Reliable transmission of high-quality video over wireless channels is challenged by fading and noise, which degrade visual quality and disrupt temporal continuity. To address these issues, this paper proposes a quantum communication framework that integrates quantum superposition with multi-input multi-output (MIMO) spatial diversity techniques to enhance robustness and efficiency in dynamic video transmission. The proposed method converts compressed videos into classical bitstreams, which are then channel-encoded and quantum-encoded into qubit superposition states. These states are transmitted over a $2\times 2$ MIMO system employing varied diversity schemes to mitigate the effects of multipath fading and noise. At the receiver, a quantum decoder reconstructs the classical information, followed by channel decoding to retrieve the video data, and the source decoder reconstructs the final video. Simulation results demonstrate that the quantum MIMO system significantly outperforms equivalent-bandwidth classical MIMO frameworks across diverse signal-to-noise ratio (SNR) conditions, achieving a peak signal-to-noise ratio (PSNR) up to 39.12 dB, structural similarity index (SSIM) up to 0.9471, and video multi-method assessment fusion (VMAF) up to 92.47, with improved error resilience across various group of picture (GOP) formats, highlighting the potential of quantum MIMO communication for enhancing the reliability and quality of video delivery in next-generation wireless networks. Full article

Smart cities necessitate ultra-secure and scalable communication frameworks to manage billions of interconnected IoT devices, particularly in the face of the emerging quantum computing threats. This paper proposes the QESIF, a novel Quantum-Enhanced Secure IoT Framework that integrates Quantum Key Distribution (QKD) with classical IoT infrastructures via a hybrid protocol stack and a quantum-aware intrusion detection system (Q-IDS). The QESIF achieves high resilience against eavesdropping by monitoring quantum bit error rate (QBER) and leveraging entropy-weighted key generation. The simulation results, conducted using datasets TON IoT, Edge-IIoTset, and Bot-IoT, demonstrate the effectiveness of the QESIF. The framework records an average QBER of 0.0103 under clean channels and discards over 95% of the compromised keys in adversarial settings. It achieves Attack Detection Rates (ADRs) of 98.1%, 98.7%, and 98.3% across the three datasets, outperforming the baselines by 4–9%. Moreover, the QESIF delivers the lowest average latency of 20.3 ms and the highest throughput of 868 kbit/s in clean scenarios while maintaining energy efficiency with 13.4 mJ per session. Full article

The rapid integration of the Internet of Medical Things (IoMT) into healthcare systems raises urgent demands for secure communication mechanisms capable of protecting sensitive patient data. Quantum key agreement (QKA), a collaborative approach to key generation based on quantum principles, provides an attractive alternative to traditional quantum key distribution (QKD), as it eliminates dependence on a trusted authority and ensures equal participation from all users. QKA demonstrates particular suitability for IoMT’s decentralized medical networks by eliminating trusted authority dependence while ensuring equitable participation among all participants. This addresses fundamental challenges where centralized trust models introduce vulnerabilities and asymmetric access patterns that compromise egalitarian principles essential for medical data sharing. However, practical QKA applications in IoMT remain limited, particularly for schemes that avoid complex entanglement operations and authenticated classical channels. Among the few QKA protocols employing Grover’s search algorithm (GSA), existing proposals potentially suffer from limitations in fairness and security. In this paper, the author proposes an improved GSA-based QKA protocol that ensures fairness, security, and correctness without requiring an authenticated classical communication channel. The proposed scheme guarantees that each participant’s input equally contributes to the final key, preventing manipulation by any user subgroup. The scheme combines Grover’s algorithm with the decoy photon technique to ensure secure quantum transmission. Security analysis confirms resistance to external attacks, including intercept-resend, entanglement probes, and device-level exploits, as well as insider threats such as parameter manipulation. Fairness is achieved through a symmetric protocol design rooted in quantum mechanical principles. Efficiency evaluation shows a theoretical efficiency of approximately 25%, while eliminating the need for quantum memory. These results position the proposed protocol as a practical and scalable solution for future secure quantum communication systems, particularly within distributed IoMT environments. Full article

Quantum information transmission is subject to imperfections in communication processes and systems. These phenomena alter the original content due to decoherence and noise. However, suitable communication architectures incorporating quantum and classical redundancy can selectively remove these errors, boosting destructive interference. In this work, a selection of architectures based on path superposition or indefinite causal order were analyzed under appropriate configurations, alongside traditional methods such as classical redundancy, thus enhancing transmission. For that purpose, we examined a broad family of decoherent channels associated with the qubit chain transmission by passing through tailored arrangements or composite architectures of imperfect channels. The outcomes demonstrated that, when combined with traditional redundancy, these configurations could significantly improve the transmission across a substantial subset of the channels. For quantum key distribution purposes, two alternative bases were considered to encode the information chain. Because a control system must be introduced in the proposed architectures, two strategies for its disposal at the end of the communication process were compared: tracing and measurement. In addition, eavesdropping was also explored under a representative scenario, to quantify its impact on the most promising architecture analyzed. Thus, in terms of transmission quality and security, the analysis revealed significant advantages over direct transmission schemes. Full article

Higher-dimensional communications in optical fiber enables new possibilities, including increased transmission capacity and hyper-entangled state transfer. However, mode coupling between channels during transmission causes interference between channels and limits detection. In classical optical communications, MIMO (modes in modes out) is a means to deal with this issue; however, it is not possible to utilize this technology in quantum communications due to power limitations. Principal mode transmission is another means to deal with mode coupling and signal interference between channels. Conceptually, this can be used in quantum communications with some limitations. In this study, we numerically simulated this process using the time delay method and show how it can be implemented using two and four higher-dimensional quantum states, such as W or GHZ states. These numerical simulations are very illustrative of how the implementation proceeds. Full article

To address the growing threat of quantum computing to classical cryptographic primitives, this study introduces NTRU-MCF, a novel lattice-based signature scheme that integrates multidimensional lattice structures with fractional-order chaotic systems. By extending the NTRU framework to multidimensional polynomial rings, NTRU-MCF exponentially expands the private key search space, achieving a key space size $\ge 2^{256}$ for dimensions $m\ge 2$ and rendering brute-force attacks infeasible. By incorporating fractional-order chaotic masks generated via a hyperchaotic Lü system, the scheme introduces nonlinear randomness and robust resistance to physical attacks. Fractional-order chaotic masks, generated via a hyperchaotic Lü system validated through NIST SP 800-22 randomness tests, replace conventional pseudorandom number generators (PRNGs). The sensitivity to initial conditions ensures cryptographic unpredictability, while the use of a fractional-order L hyperchaotic system—instead of conventional pseudorandom number generators (PRNGs)—leverages multiple Lyapunov exponents and initial value sensitivity to embed physically unclonable properties into key generation, effectively mitigating side-channel analysis. Theoretical analysis shows that NTRU-MCF’s security reduces to the Ring Learning with Errors (RLWE) problem, offering superior quantum resistance compared to existing NTRU variants. While its computational and storage complexity suits high-security applications like military and financial systems, it is less suitable for resource-constrained devices. NTRU-MCF provides robust quantum resistance and side-channel defense, advancing PQC for classical computing environments. Full article

The emergence of large-scale quantum computing presents an imminent threat to contemporary public-key cryptosystems, with quantum algorithms such as Shor’s algorithm capable of efficiently breaking RSA and elliptic curve cryptography (ECC). This vulnerability has catalyzed accelerated standardization efforts for post-quantum cryptography (PQC) by the U.S. National Institute of Standards and Technology (NIST) and global security stakeholders. While theoretical security analysis of these quantum-resistant algorithms has advanced considerably, comprehensive real-world performance benchmarks spanning diverse computing environments—from high-performance cloud infrastructure to severely resource-constrained IoT devices—remain insufficient for informed deployment planning. This paper presents the most extensive cross-platform empirical evaluation to date of NIST-selected PQC algorithms, including CRYSTALS-Kyber and NTRU for key encapsulation mechanisms (KEMs), alongside BIKE as a code-based alternative, and CRYSTALS-Dilithium and Falcon for digital signatures. Our systematic benchmarking framework measures computational latency, memory utilization, key sizes, and protocol overhead across multiple security levels (NIST Levels 1, 3, and 5) in three distinct hardware environments and various network conditions. Results demonstrate that contemporary server architectures can implement these algorithms with negligible performance impact (<5% additional latency), making immediate adoption feasible for cloud services. In contrast, resource-constrained devices experience more significant overhead, with computational demands varying by up to 12× between algorithms at equivalent security levels, highlighting the importance of algorithm selection for edge deployments. Beyond standalone algorithm performance, we analyze integration challenges within existing security protocols, revealing that naive implementation of PQC in TLS 1.3 can increase handshake size by up to 7× compared to classical approaches. To address this, we propose and evaluate three optimization strategies that reduce bandwidth requirements by 40–60% without compromising security guarantees. Our investigation further encompasses memory-constrained implementation techniques, side-channel resistance measures, and hybrid classical-quantum approaches for transitional deployments. Based on these comprehensive findings, we present a risk-based migration framework and algorithm selection guidelines tailored to specific use cases, including financial transactions, secure firmware updates, vehicle-to-infrastructure communications, and IoT fleet management. This practical roadmap enables organizations to strategically prioritize systems for quantum-resistant upgrades based on data sensitivity, resource constraints, and technical feasibility. Our results conclusively demonstrate that PQC is deployment-ready for most applications, provided that implementations are carefully optimized for the specific performance characteristics and security requirements of target environments. We also identify several remaining research challenges for the community, including further optimization for ultra-constrained devices, standardization of hybrid schemes, and hardware acceleration opportunities. Full article

Hybrid quantum–classical (HQC) computing refers to the approach of executing algorithms coherently on both quantum and classical resources. This approach makes the best use of current or near-term quantum computers by sharing the workload with classical high-performance computing. However, HQC algorithms often require a back-and-forth exchange of data between quantum and classical processors, causing system bottlenecks and leading to high latency in applications. The objective of this study is to investigate novel frameworks that unify quantum and reconfigurable resources for HQC and mitigate system bottleneck and latency issues. In this paper, we propose a reconfigurable framework for hybrid quantum–classical computing. The proposed framework integrates field-programmable gate arrays (FPGAs) with quantum processing units (QPUs) for deploying HQC algorithms. The classical subroutines of the algorithms are accelerated on FPGA fabric using a high-throughput processing pipeline, while quantum subroutines are executed on the QPUs. High-level software is used to seamlessly facilitate data exchange between classical and quantum workloads through high-performance channels. To evaluate the proposed framework, an HQC algorithm, namely variational quantum classification, and the MNIST dataset are used as a test case. We present a quantitative comparison of the proposed framework with a state-of-the-art quantum software framework running on a server-grade CPU. The results demonstrate that the FPGA pipeline achieves up to $8\times$ improvement in runtime compared to the CPU baseline. Full article

We present a detailed analysis of the effect of quantum loss and decoherence in the Bell-CHSH scenario. Adopting a device-independent approach, we study the change in the bipartite conditional probability distribution, i.e., the behavior of the realized nonlocal box pair when the elements of the entangled qubit pair subjected to independent noisy quantum channels modeled by completely positive maps. As the verification of Bell inequalities is crucial in device-independent quantum cryptography, our considerations are instructive from the perspective of quantum realizations of nonlocal box pairs. We find that the impact of quantum channels cannot be described by an equivalent classical noise channel. Full article

Quantum illumination (QI) is an entanglement-based protocol for improving LiDAR/radar detection of unresolved targets beyond what a classical LiDAR/radar of the same average transmitted energy can do. Originally proposed by Seth Lloyd as a discrete-variable quantum LiDAR, it was soon shown that his proposal offered no quantum advantage over its best classical competitor. Continuous-variable, specifically Gaussian-state, QI has been shown to offer a true quantum advantage, both in theory and in table-top experiments. Moreover, despite its considerable drawbacks, the microwave version of Gaussian-state QI continues to attract research attention. A recent QI study by Armanpreet Pannu, Amr Helmy, and Hesham El Gamal (PHE), however, has: (i) combined the entangled state from Lloyd’s QI with the channel models from Gaussian-state QI; (ii) proposed a new positive operator-valued measurement for that composite setup; and (iii) claimed that, unlike Gaussian-state QI, PHE QI achieves the Nair–Gu lower bound on QI target-detection error probability at all noise brightnesses. PHE’s analysis was asymptotic, i.e., it presumed infinite-dimensional entanglement. The current paper works out the finite-dimensional performance of PHE QI. It shows that there is a threshold value for the entangled-state dimensionality below which there is no quantum advantage, and above which the Nair–Gu bound is approached asymptotically. Moreover, with both systems operating with error-probability exponents 1 dB lower than the Nair–Gu bound, PHE QI requires enormously higher entangled-state dimensionality than does Gaussian-state QI to achieve useful error probabilities in both high-brightness (100 photons/mode) and moderate-brightness (1 photon/mode) noise. Furthermore, neither system has an appreciable quantum advantage in low-brightness (much less than 1 photon/mode) noise. Full article

Classical mixtures of quantum states often give rise to decoherence and are generally considered detrimental to quantum processing. However, in the framework of sequential measurement, such mixtures can be beneficial for state discrimination. We investigate the sequential discrimination of mixed states and compare the results with those of pure states under the condition of equal fidelity. It is found that the successful probability of the mixed-state protocol is superior to the pure one under the equal-fidelity condition. It is shown that the difference between the sequential discrimination of pure and mixed states is more reliable under the equal-fidelity condition than under single-shot discrimination, and this difference increases with the mixability of the initial mixed states. For scenarios in which classical communication is allowed, the optimal successful probability of pure-state discriminations is larger than that for mixed states on the contrary. We also show that the classical mixture of basic vectors from quantum decoherence has a subtle impact on the communication channel induced by the coincidence of the maximal mutual information and optimal successful probability of sequential discrimination for pure states. Full article

Classical and quantum fiber-optic communication channels are vulnerable to possible intrusions. Quantum key distribution (QKD) provides a physically fundamental and theoretically secure communication method, but the key rate decays over long distances. Recently proposed by our group, a quantum communication protocol based on the physical estimation of an eavesdropper’s influence shows extreme efficiency even at distances of thousands of kilometers. In this paper, we investigate the physical limits of eavesdropper detection using optical time domain reflectometry (OTDR) and demonstrate the successful detection of a 0.01 dB leakage over a distance of 1009 km. Full article

Quantum information has emerged as a frontier in scientific research and is transitioning to real-world technologies and applications. In this work, we explore the integration of quantum secure direct communication (QSDC) with time-sensitive networking (TSN) for the first time, proposing a novel framework to address the security and latency challenges of Ethernet-based networks. Because our QSDC-TSN protocol inherits all the advantages from QSDC, it will enhance the security of the classical communications both in the traditional TSN- and QKD-based TSN by the quantum principle and reduce the communication latency by transmitting information directly via quantum channels without using keys. By analyzing the integration of QSDC and TSN in terms of time synchronization, flow control, security mechanisms, and network management, we show how QSDC enhances the real-time performance and security of TSN. These advantages enable our QSDC-TSN to keep the balance between and meet the requirements of both high security and real-time performance in industrial control, in a digital twin of green power and green hydrogen systems in distributed energy networks, etc., showing its potential applications in future quantum-classical-hybrid systems. Full article

Purpose: The impact of hybrid quantum-classical neural network (NN) architectures with multiple backbones and quantum transformation as a data augmentation (DA) technique on image classification tasks was investigated using the CIFAR-10 and MedMNIST (DermaMNIST) datasets. These datasets were chosen for their relevance in general-purpose and medical-specific small-scale image classification, respectively. Methods: A series of quanvolutional transformations, utilizing random quantum circuits based on single-qubit rotation quantum gates (Y-axis, X-axis, and combined XY-axis transformations), were applied to create multiple quantum channels (QC) for input augmentation. By integrating these QCs with baseline convolutional NN architectures (LCNet050) and scalable hybrid NN architectures with multiple (n) backbones and separate QC (n) inputs (HNN-QCn), the scalability and performance enhancements offered by quantum-inspired data augmentation were evaluated. The proposed cross-validation workflow ensured reproducibility and systematic performance evaluation of hybrid models by mean and standard deviation values of metrics (such as accuracy and area under the curve (AUC) for the receiver operating characteristic). Results: The results demonstrated consistent performance improvements by AUC and accuracy in HNN-QCn models with the number n (where $n\in \{4,5,9,10,17,18\}$) of backbones and QC inputs across both datasets. The different improvement rates were observed for the smaller increase in AUC and the larger increase in accuracy as input complexity (number of backbones and QCs inputs) increases. It is assumed that the prediction probability distribution is becoming sharpened with the addition of backbones and QC inputs, leading to larger improvements in accuracy. At the same time, AUC reflects these changes more slowly unless the model’s ranking ability improves substantially. Conclusion: The findings highlight the scalability, robustness, and adaptability of HNN-QCn architectures, with superior performance by AUC (micro and macro) and accuracy across diverse datasets and potential for applications in high-stakes domains like medical imaging. These results underscore the utility of quantum transformations as a form of DA, paving the way for further exploration into the scalability and efficiency of hybrid architectures in complex datasets and real-world scenarios. Full article

This manuscript aims to illustrate a quantum-classical dissipative theory (suited to be converted to effective algorithms for numerical simulations) within the long-term project of studying molecular processes in the brain. Other approaches, briefly sketched in the text, have advocated the need to deal with both quantum and classical dynamic variables when studying the brain. At variance with these other frameworks, the manuscript’s formalism allows us to explicitly treat the classical dynamical variables. The theory must be dissipative not because of formal requirements but because brain processes appear to be dissipative at the molecular, physiological, and high functional levels. We discuss theoretically that using Brownian dynamics or the Nosè-Hoover-Chain thermostat to perform computer simulations provides an effective way to introduce an arrow of time for open quantum systems in a classical environment. In the future, We plan to study classical models of neurons and astrocytes, as well as their networks, coupled to quantum dynamical variables describing, e.g., nuclear and electron spins, HOMO and LUMO orbitals of phenyl and indole rings, ion channels, and tunneling protons. Full article