This experimental study introduces a hybrid quantum-classical framework aiming to improve the noise robustness of Shor’s algorithm. By incorporating a novel hybrid logic gate into the modular exponentiation phase, the framework stabilizes qubit interactions and decreases decoherence in a noisy environment simulated by IBM Qiskit. Performance evaluation is accomplished by fidelity and entropy analysis across varied noise levels. Comparative benchmarking with conventional techniques, including Shor’s code, Bacon-Shor code, dynamical decoupling, and zero noise extrapolation, demonstrates that the proposed hybrid gate achieves higher fidelity (0.90) and lower entropy (0.33), while preserving minimal resource overhead. These findings highlight the framework’s effectiveness as a hardware-independent, scalable solution for Noisy Intermediate-Scale Quantum (NISQ) devices. Instead, the study offers an approach toward a scalable, error-resilient model to avoid exaggerating scalability. Despite its promising outcomes, study is presently limited to simulations and a single noise model. Future work will explore implementation on real quantum hardware and extend the framework to incorporate a broader range of noise profiles, contributing to the evolution of fault-tolerant quantum computation.
This experimental study introduces a hybrid quantum-classical framework aiming to improve the noise robustness of Shor’s algorithm. By incorporating a novel hybrid logic gate into the modular exponentiation phase, the framework stabilizes qubit interactions and decreases decoherence in a noisy environment simulated by IBM Qiskit. Performance evaluation is accomplished by fidelity and entropy analysis across varied noise levels. Comparative benchmarking with conventional techniques, including Shor’s code, Bacon-Shor code, dynamical decoupling, and zero noise extrapolation, demonstrates that the proposed hybrid gate achieves higher fidelity (0.90) and lower entropy (0.33), while preserving minimal resource overhead. These findings highlight the framework’s effectiveness as a hardware-independent, scalable solution for Noisy Intermediate-Scale Quantum (NISQ) devices. Instead, the study offers an approach toward a scalable, error-resilient model to avoid exaggerating scalability. Despite its promising outcomes, study is presently limited to simulations and a single noise model. Future work will explore implementation on real quantum hardware and extend the framework to incorporate a broader range of noise profiles, contributing to the evolution of fault-tolerant quantum computation.
Abstract The practical application of Noisy Intermediate-Scale Quantum (NISQ) hardware is fundamentally limited by gate-level noise, which corrupts computational results. This research addresses this challenge through the development and validation of a modular software framework for Quantum Error Mitigation (QEM). We implement and compare two leading QEM strategies: Zero-Noise Extrapolation (ZNE) and Probabilistic Error Cancellation (PEC). The framework is built using the Qiskit library and is validated using a realistic, hardware-calibrated noisy simulator that mimics the error characteristics of a real IBM Quantum device. Our methodology focuses on a robust implementation of ZNE via unitary folding and a proof-of-concept demonstration of the PEC algorithm. The framework's effectiveness is demonstrated on a simulated noisy backend where, for a 3-qubit Greenberger-Horne-Zeilinger (GHZ) state, the baseline state fidelity was increased from 93.5% to 97.3% via ZNE, corresponding to a 59% reduction in the state's infidelity. This work provides a practical demonstration of how software-based error mitigation can enhance the reliability of quantum computations on current noisy hardware.
Quantum One-Time Pad (QOTP) offers information-theoretic security but its realization on Noisy Intermediate-Scale Quantum (NISQ) devices is challenged by decoherence and hardware imperfections. This work presents a noise-aware QOTP framework that integrates adaptive error mitigation, lightweight 3-qubit repetition coding, and hybrid quantum-classical feedback. The methodology incorporates assumptions such as ideal Pauli gates and i.i.d. noise, and validates feasibility through Qiskit Aer simulations with 1024 shots. Results show that QBER is reduced from0.21±0.02to0.13±0.01under30%depolarizing noise, demonstrating improved robustness without requiring full quantum error correction. While non-Markovian modeling is introduced conceptually, simulations primarily evaluate Markovian noise scenarios. The findings indicate that adaptive, lightweight strategies can enhance QOTP feasibility on current quantum hardware, although scalability to larger systems remains an open challenge.
The literature indicates that the qubit requirements for factoring RSA-2048 remain on the order of 1 million, under commonly assumed architectures and error-correction models, leaving a substantial gap between current resource estimates and near-term practical feasibility. Reducing this requirement to the low-thousand-qubit regime therefore remains an important open research objective. This work proposes a hybrid classical–quantum algorithm that uses a classical modular exponentiation subroutine with a Quantum Number Theoretic Transform (QNTT) circuit to increase the speed and reduce the required quantum resources relative to Shor’s algorithm for integer factorization, which underpins cryptographic systems like RSA and ECC. We evaluate multiple coprime numbers, the result of multiplication of two primes, in both simulation and real quantum hardware, using IBM’s reference Shor implementation as the baseline. Because Shor and proposed Jesse–Victor–Gharabaghi (JVG) use different register sizes for the same coprime N, the reported gate/depth reductions should be interpreted as end-to-end quantum-resource budgets for factoring the same N, rather than a per-qubit or transform-only efficiency claim. In simulation, the JVG algorithm achieved substantial practical reductions in computational resources, decreasing runtime from 174.1 s to 5.4 s, memory usage from 12.5 GB to 0.27 GB, and quantum gate counts by approximately 99%. On quantum hardware, JVG reduced the required runtime from 67.8 s to 2 s, and the quantum gate counts by over 98%. We showed that the proposed algorithm can address the relevant RSA-1024 case scenario, establishing that this method can provide validation for large-scale situations. Furthermore, extrapolation to RSA-2048 indicates that the JVG algorithm significantly outperforms Shor’s approach, requiring a projected quantum runtime of 29 h for ten thousand runs for factorization under identical scaling assumptions. Overall, these results support JVG as a more hardware-compatible and robust noise-tolerant substitute for Shor’s framework, offering a viable research direction toward practical quantum integer factorization on near-term Noisy Intermediate-Scale Quantum (NISQ) devices.
Noisy Intermediate-Scale Quantum (NISQ) devices are promising platforms for practical quantum computing, but their performance is significantly affected by limited qubit availability, gate errors, decoherence, circuit depth, and hardware-dependent noise. Conventional quantum circuits are generally designed and optimized before execution and may not respond effectively to changing hardware conditions during computation. This research proposes a Self-Adaptive Quantum Circuit framework that dynamically modifies quantum circuits according to the current computational resources and noise characteristics of NISQ devices. The proposed framework monitors parameters such as qubit fidelity, gate error rates, circuit depth, execution time, and resource availability, and automatically selects suitable circuit configurations to improve computational performance. Adaptive mechanisms can be employed to reduce unnecessary gates, optimize qubit utilization, and mitigate the impact of hardware noise while maintaining the required computational accuracy. The framework will be evaluated using simulation platforms and available NISQ quantum hardware, comparing adaptive circuits with conventional static circuits using metrics such as accuracy, fidelity, circuit depth, gate count, execution time, and error rate. The expected outcome is a resource-efficient and noise-aware quantum circuit optimization approach capable of improving the reliability and performance of quantum applications on near-term quantum hardware. The proposed research aims to contribute toward more practical, flexible, and hardware-aware quantum computing systems for NISQ-era applications. Keywords: NISQ Computing, Self-Adaptive Quantum Circuits, Quantum Circuit Optimization, Quantum Error Mitigation, Quantum Noise, Quantum Computing.
Quantum Neural Networks (QNNs) represent a promising direction within Quantum Machine Learning (QML), yet their realization on noisy intermediate-scale quantum (NISQ) devices remains constrained by decoherence, gate imperfections, crosstalk, and readout errors. This study provides a systematic evaluation of noise effects and mitigation strategies in hybrid quantum neural networks (HQNNs). Zero-Noise Extrapolation (ZNE), Digital Dynamical Decoupling (DDD), and Layerwise Richardson Extrapolation (LRE) are incorporated into end-to-end QNN training pipelines developed with PennyLane, simulated using Qiskit Aer noise models, and integrated with the Mitiq framework, while Probabilistic Error Cancellation (PEC) is evaluated separately under depolarizing noise due to its computational cost. Experiments conducted on the Iris dataset with five representative noise channels show that the impact of noise and the effect of mitigation are strongly dependent on the noise model and its strength. The model maintains comparatively strong performance under phase-flip and phase-damping noise, while substantial degradation is observed under high depolarizing and amplitude-damping noise. Across the evaluated mitigation methods, the observed benefits remain limited and noise-dependent: ZNE, DDD, and LRE generally follow the same degradation trends as the unmitigated baseline, while PEC shows limited gains only in the low-noise depolarizing regime. These findings highlight the need for context-specific mitigation strategies to improve the robustness of QNNs in practical NISQ settings.
Classical database join operations are a significant performance bottleneck in data-intensive applications, typically requiring quadratic time proportional to the size of the input. Quantum search algorithms, such as Grover’s algorithm, promise asymptotic speedups for unstructured search and can be adapted to accelerate equality-based joins. In this paper, we present a systematic simulation study of a Grover-based quantum join primitive and a hybrid classical-quantum join scheme, comparing them with a baseline classical nested-loop join. Parameterised Grover circuits have been implemented for marked-item search, together with resource estimation (qubit count, circuit depth, and gate counts), using the Qiskit Aer simulator. The classical join is modelled as a nested-loop equality join over two arrays, while the hybrid scheme uses a classical Bloom filter to reduce the candidate space, followed by a Grover search over the remaining items. To approximate near term hardware, we incorporate depolarizing gate noise and readout noise via Aer noise models and investigate two mitigation techniques: readout error calibration and zero noise extrapolation. Our simulations, conducted in a Python environment without GPU acceleration, demonstrate that the Grover based and hybrid joins exhibit the expected sub-quadratic scaling in runtime compared to the classical nested-loop join for problem sizes up to N = 215. We additionally observe that realistic noise significantly degrades the raw success probability of the quantum join, while combining readout mitigation with zero noise extrapolation partially restores accuracy. These results provide a resource-aware and noise-aware baseline for evaluating quantum-accelerated joins on future fault-tolerant or high-fidelity noisy intermediate-scale quantum (NISQ) devices.