Search Results (217)

Quantum machine learning (QML) has emerged as a promising approach for enhancing image classification by exploiting quantum computational principles such as superposition and entanglement. However, practical applications on complex datasets like CIFAR-100 remain limited due to the low expressivity of shallow circuits and challenges in circuit optimization. In this study, we propose HQCNN–REGA—a novel hybrid quantum–classical convolutional neural network architecture that integrates data re-uploading and genetic algorithm optimization for improved performance. The data re-uploading mechanism allows classical inputs to be encoded multiple times into quantum states, enhancing the model’s capacity to learn complex visual features. In parallel, a genetic algorithm is employed to evolve the quantum circuit architecture by optimizing gate sequences, entanglement patterns, and layer configurations. This combination enables automatic discovery of efficient parameterized quantum circuits without manual tuning. Experiments on the MNIST and CIFAR-100 datasets demonstrate state-of-the-art performance for quantum models, with HQCNN–REGA outperforming existing quantum neural networks and approaching the accuracy of advanced classical architectures. In particular, we compare our model with classical convolutional baselines such as ResNet-18 to validate its effectiveness in real-world image classification tasks. Our results demonstrate the feasibility of scalable, high-performing quantum–classical systems and offer a viable path toward practical deployment of QML in computer vision applications, especially on noisy intermediate-scale quantum (NISQ) hardware. Full article

Quantum computing, with its foundational principles of superposition and entanglement, has the potential to provide significant quantum advantages, addressing challenges that classical computing may struggle to overcome. As data generation continues to grow exponentially and technological advancements accelerate, classical machine learning algorithms increasingly face difficulties in solving complex real-world problems. The integration of classical machine learning with quantum information processing has led to the emergence of quantum machine learning, a promising interdisciplinary field. This work provides the reader with a bottom-up view of quantum circuits starting from quantum data representation, quantum gates, the fundamental quantum algorithms, and more complex quantum processes. Thoroughly studying the mathematics behind them is a powerful tool to guide scientists entering this domain and exploring their connection to quantum machine learning. Quantum algorithms such as Shor’s algorithm, Grover’s algorithm, and the Harrow–Hassidim–Lloyd (HHL) algorithm are discussed in detail. Furthermore, real-world implementations of quantum machine learning and quantum deep learning are presented in fields such as healthcare, bioinformatics and finance. These implementations aim to enhance time efficiency and reduce algorithmic complexity through the development of more effective quantum algorithms. Therefore, a comprehensive understanding of the fundamentals of these algorithms is crucial. Full article

We investigate the dynamics of vector solitons in a two-component Bose–Einstein condensates governed by the system of Gross–Pitaevskii equations. Using a gauge-transformation approach, we construct a four-soliton solution and analyze their interactions, including superposition states, fission, and shape-preserving collisions. We explore the ability of time-dependent parameters, such as the intra- and intercomponent interaction coefficients and trapping potential, to control the soliton properties. In particular, we demonstrate controlled four-soliton fission, highlighting its potential applications to quantum data processing and coherent matter-wave transport. The results suggest experimental realization in BEC systems and provide insights into nonlinear wave interactions in multicomponent quantum fluids. Full article

The escalating sophistication of cyber threats underscores the critical need for intelligent and adaptive intrusion detection systems (IDSs) to identify known and novel attack vectors in real time. Feature selection is a key enabler of performance in machine learning-based IDSs, as it reduces the input dimensionality, enhances the detection accuracy, and lowers the computational latency. This paper introduces a novel optimization framework called Quantum Epigenetic Algorithm (QEA), which synergistically combines quantum-inspired probabilistic representation with biologically motivated epigenetic gene regulation to perform efficient and adaptive feature selection. The algorithm balances global exploration and local exploitation by leveraging quantum superposition for diverse candidate generation while dynamically adjusting gene expression through an epigenetic activation mechanism. A multi-objective fitness function guides the search process by optimizing the detection accuracy, false positive rate, inference latency, and model compactness. The QEA was evaluated across four benchmark datasets—UNSW-NB15, CIC-IDS2017, CSE-CIC-IDS2018, and TON_IoT—and consistently outperformed baseline methods, including Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Quantum Genetic Algorithm (QGA). Notably, QEA achieved the highest classification accuracy (up to 97.12%), the lowest false positive rates (as low as 1.68%), and selected significantly fewer features (e.g., 18 on TON_IoT) while maintaining near real-time latency. These results demonstrate the robustness, efficiency, and scalability of QEA for real-time intrusion detection in dynamic and resource-constrained cybersecurity environments. Full article

Currently, quantum steganography schemes utilizing the least significant bit (LSB) approach are primarily optimized for fixed-point data processing, yet they encounter precision limitations when handling extended floating-point data structures owing to quantization error accumulation. To overcome precision constraints in quantum data hiding, the EPlsb-MFQS and MVlsb-MFQS quantum steganography algorithms are constructed based on the LSB approach in this study. The multichannel floating-point quantum representation of digital signals (MFQS) model enhances information hiding by augmenting the number of available channels, thereby increasing the embedding capacity of the LSB approach. Firstly, we analyze the limitations of fixed-point signals steganography schemes and propose the conventional quantum steganography scheme based on the LSB approach for the MFQS model, achieving enhanced embedding capacity. Moreover, the enhanced embedding efficiency of the EPlsb-MFQS algorithm primarily stems from the superposition probability adjustment of the LSB approach. Then, to prevent an unauthorized person easily extracting secret messages, we utilize channel qubits and position qubits as novel carriers during quantum message encoding. The secret message is encoded into the signal’s qubits of the transmission using a particular modulo value rather than through sequential embedding, thereby enhancing the security and reducing the time complexity in the MVlsb-MFQS algorithm. However, this algorithm in the spatial domain has low robustness and security. Therefore, an improved method of transferring the steganographic process to the quantum Fourier transformed domain to further enhance security is also proposed. This scheme establishes the essential building blocks for quantum signal processing, paving the way for advanced quantum algorithms. Compared with available quantum steganography schemes, the proposed steganography schemes achieve significant improvements in embedding efficiency and security. Finally, we theoretically delineate, in detail, the quantum circuit design and operation process. Full article

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

Aspect-Based Sentiment Analysis (ABSA) has gained significant popularity in recent years, which emphasizes the aspect-level sentiment representation of sentences. Current methods for ABSA often use pre-trained models and graph convolution to represent word dependencies. However, they struggle with long-range dependency issues in lengthy texts, resulting in averaging and loss of contextual semantic information. In this paper, we explore how richer semantic relationships can be encoded more efficiently. Inspired by quantum theory, we construct superposition states from text sequences and utilize them with quantum measurements to explicitly capture complex semantic relationships within word sequences. Specifically, we propose an attention-based semantic dependency fusion method for ABSA, which employs a quantum embedding module to create a superposition state of real-valued word sequence features in a complex-valued Hilbert space. This approach yields a word sequence density matrix representation that enhances the handling of long-range dependencies. Furthermore, we introduce a quantum cross-attention mechanism to integrate sequence features with dependency relationships between specific word pairs, aiming to capture the associations between particular aspects and comments more comprehensively. Our experiments on the SemEval-2014 and Twitter datasets demonstrate the effectiveness of the quantum-inspired attention-based semantic dependency fusion model for the ABSA task. Full article

We propose Observer-Linked Branching (OLB), a mathematically rigorous extension of quantum theory in which an observer’s cognitive commitment actively modulates collapse dynamics at macroscopic scales. The OLB framework rests on four axioms, employing a norm-preserving nonlinear Schrödinger evolution and Lüders-type projection triggered by crossing a cognitive commitment threshold. Our expanded formalism provides five main contributions: (1) deriving Lie symmetries of the observer–environment interaction Hamiltonian; (2) embedding OLB into the Consistent Histories and path-integral formalisms; (3) multi-agent network simulations demonstrating intentional synchronisation toward shared macroscopic outcomes; (4) detailed statistical power analyses predicting measurable biases (up to ~5%) in practical experiments involving traffic delays, quantum random number generators, and financial market sentiment; and (5) examining the conceptual, ethical, and neuromorphic implications of intent-driven reality selection. Full reproducibility is ensured via the provided code notebooks and raw data tables in the appendices. While the theoretical predictions are precisely formulated, empirical validation is ongoing, and no definitive field results are claimed at this stage. OLB thus offers a rigorous, norm-preserving and falsifiable framework to empirically test whether cognitive engagement modulates macroscopic quantum outcomes in ways consistent with—but extending—standard quantum predictions. Full article

This paper introduces a novel theoretical framework that reformulates optimal control as a quantum search problem using Grover’s algorithm, leveraging its quadratic speedup. Specifically, the method encodes all possible control inputs into a quantum superposition state and uses a reference value interpreted as a candidate minimum to evaluate which inputs yield a lower control cost. To guide the search, we integrate a quantum comparator circuit to identify the inputs below this reference, and quantum counting to estimate their number. The reference is iteratively updated using a sigmoid-based rule until only one input satisfies the condition, thereby ensuring convergence to the global minimum within the discretized control space. Although full quantum implementation is currently infeasible due to oracle complexity and hardware limitations, we simulate the process using a classical controller as a pseudo-oracle to illustrate the algorithmic structure. This work does not aim to demonstrate performance gains but rather to establish a foundational method for embedding control synthesis within Grover-based quantum circuits. The framework paves the way for scalable quantum control systems once hardware resources permit full realization. Full article

Quantum computing promises to offer significant computational advantages over classical computing, leveraging principles such as superposition and entanglement. This necessitates effective metrics and measurement techniques for evaluating quantum systems, aiding in their development and performance optimization. However, due to fundamental differences in computing paradigms and current immaturity of quantum software abstractions, classical software and hardware metrics may not directly apply to quantum computing, where the distinction between software and hardware can still be somewhat indiscernible compared to classical computing. This paper provides a comprehensive review of existing quantum software and hardware metrics in the scientific literature, highlighting key challenges in the field. Additionally, it investigates the application of Functional Size Measurement (FSM), based on the COSMIC ISO 19761 FSM Method, to measure quantum software. Three FSM approaches are analyzed by applying them to Shor’s and Grover’s algorithms, with measurement results compared to assess their effectiveness. A comparative analysis highlights the strengths and limitations of each approach, emphasizing the need for further refinement. The insights from this study contribute to the advancement of quantum metrics, especially software metrics and measurement, paving the way for the development of a unified and standardized approach to quantum software measurement and assessment. 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

We discuss a formalism where a universe is identified with the support of a wave function propagating through space–time. The dynamics is of a squeezing type, with shrinking in time and expanding in space. As opposed to classical cosmology, the resulting universe is not a spacelike section of some space–time but a hyperlayer of a finite timelike width, a set which is not a three-dimensional submanifold of space–time. The universe is in superposition of different localizations in both space and time so that $x^0=ct$ has the same formal status of a position operator as the remaining three coordinates. We test the formalism on the example of a universe that contains a single harmonic oscillator, a generalization of the curvature-dependent Cariñena–Rañada–Santander (CRS) model. As opposed to the original CRS formulation, here, the curvature is not a parameter but a quantum observable, a function of the world-position operator. It is shown that asymptotically, for large values of the invariant evolution parameter $\tau$, one reconstructs the standard quantum results, with one modification: The effective (renormalized) mass of the oscillator decreases with $\tau$. The effect does not seem to be a peculiarity of harmonic oscillators, so one may speculate that masses of distant elementary quantum systems are greater than the values known from our quantum mechanical measurements. Full article

Currently, the main focus in the automation of technological processes is on developing control systems that enhance the quality of the control process. Because the systems being controlled are often complex, multidimensional, and nonlinear, quantum computing algorithms offer an effective solution. Although there are several intelligent control methods available to improve the quality of technological processes, each has certain drawbacks. Quantum algorithms, which rely on the principles of quantum correlation and superposition, are designed to optimize control while minimizing energy and resource consumption. This article discusses the diesel fuel hydrotreating process, a critical step in oil refining. The primary goal of hydrotreating is to enhance fuel quality by removing sulfur, nitrogen, and oxygen compounds. To accurately model this process, it is essential to consider not only the external factors affecting it but also its physical characteristics. By doing so, the mathematical model becomes more precise. Based on this approach, a quantum fuzzy control system for the diesel fuel hydrotreating process was developed using quantum algorithms. These algorithms can rapidly analyze large amounts of data and make decisions. At the same time, a computer model of a fuzzy quantum control system for the process of hydrotreating diesel fuel was constructed, and a number of computational experiments were carried out. As a result, a 1.8% reduction in energy costs for the diesel fuel hydrotreating process was achieved. Full article

We review quantum architectures for engineering the N00N state, a bipartite maximally entangled state essential in quantum metrology. These schemes transform the initial state $|N⟩\otimes |0⟩$ into the N00N state, ${\displaystyle \frac{1}{\sqrt{2}}}\left(\right|N⟩\otimes |0⟩+|0⟩\otimes |N⟩),$ where $|N⟩$ and $|0⟩$ are Fock states with N and 0 excitations, respectively. We demonstrate that this state can be generated through superpositions of quantum light modes, hybrid light–matter interactions, or spin ensembles. Our approach also enables the creation of mesoscopic and macroscopic entangled states, including entangled coherent and squeezed states. Furthermore, we show that a broad class of maximally entangled states can be realized within this framework. Extensions to multi-mode state engineering are also explored. Full article

The Quantum Snowflake Algorithm (QSA) is a novel metaheuristic for both continuous and discrete optimization problems, combining collision-based diversity, quantum-inspired tunneling, superposition-based partial solution sharing, and local refinement steps. The QSA embeds candidate solutions in a continuous auxiliary space, where collision operators ensure that agents—snowflakes—reject each other and remain diverse. This approach is inspired by snowflakes which prevent collisions while retaining unique crystalline patterns. Large leaps to escape deep local minima are simultaneously provided by quantum tunneling, which is particularly useful in highly multimodal environments. Tests on challenging functions like Lévy and HyperSphere showed that the QSA can more reliably obtain very low objective values in continuous domains than conventional swarm or evolutionary approaches. A 200-city Traveling Salesman Problem (TSP) confirmed the excellent tour quality of the QSA for discrete optimization. It drastically reduces the route length compared to Artificial Bee Colony (ABC), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Simulated Annealing (SA), Quantum Particle Swarm Optimization (QPSO), and Cuckoo Search (CS). These results show that quantum tunneling accelerates escape from local traps, superposition and local search increase exploitation, and collision-based repulsion maintains population diversity. Together, these elements provide a well-rounded search method that is easy to adapt to different problem areas. In order to establish the QSA as a versatile solution framework for a range of large-scale optimization challenges, future research could investigate multi-objective extensions, adaptive parameter control, and more domain-specific hybridisations. Full article