Compatibility with noisy intermediate-scale quantum (NISQ) devices is crucial for the realistic implementation of quantum cryptographic protocols. We investigate a cryptographic scheme based on discrete-time quantum walks (DTQWs) on cyclic graphs that exploits Parrondo dynamics, wherein periodic evolution emerges from a deterministic sequence of individually chaotic coin operators. We construct an explicit quantum circuit realization tailored to NISQ architectures and analyze its performance through numerical simulations in Qiskit under both ideal and noisy conditions. Protocol performance is quantified using probability distributions, Hellinger fidelity, and total variation distance. To assess security at the circuit level, we model intercept-resend and man-in-the- middle attacks and evaluate the resulting quantum bit error rate. In the absence of adversarial intervention, the protocol enables reliable message recovery, whereas eavesdropping induces characteristic disturbances that disrupt the periodic reconstruction mechanism. We further examine hardware feasibility on contemporary NISQ processors, specifically ibm_torino, incorporating qubit connectivity and state-transfer constraints into the circuit design. Our analysis demonstrates that communication between spatially separated logical modules increases circuit depth via SWAP operations, leading to cumulative noise effects. By exploring hybrid state-transfer strategies, we show that qubit selection and connectivity play a decisive role in determining fidelity and overall protocol performance, highlighting hardware-dependent trade-offs in NISQ implementations.
Compatibility with noisy intermediate-scale quantum (NISQ) devices is crucial for the realistic implementation of quantum cryptographic protocols. We investigate a cryptographic scheme based on discrete-time quantum walks (DTQWs) on cyclic graphs that exploits Parrondo dynamics, wherein periodic evolution emerges from a deterministic sequence of individually chaotic coin operators. We construct an explicit quantum circuit realization tailored to NISQ architectures and analyze its performance through numerical simulations in Qiskit under both ideal and noisy conditions. Protocol performance is quantified using probability distributions, Hellinger fidelity, and total variation distance. To assess security at the circuit level, we model intercept-resend and man-in-the- middle attacks and evaluate the resulting quantum bit error rate. In the absence of adversarial intervention, the protocol enables reliable message recovery, whereas eavesdropping induces characteristic disturbances that disrupt the periodic reconstruction mechanism. We further examine hardware feasibility on contemporary NISQ processors, specifically ibm_torino, incorporating qubit connectivity and state-transfer constraints into the circuit design. Our analysis demonstrates that communication between spatially separated logical modules increases circuit depth via SWAP operations, leading to cumulative noise effects. By exploring hybrid state-transfer strategies, we show that qubit selection and connectivity play a decisive role in determining fidelity and overall protocol performance, highlighting hardware-dependent trade-offs in NISQ implementations.
Advancements in noisy intermediate-scale quantum (NISQ) computing are steadily pushing these systems toward outperforming classical supercomputers on specific well-defined computational tasks. In this work we explore and control quantum chaos in NISQ systems using discrete-time quantum walks (DTQWs) on cyclic graphs. To efficiently implement quantum walks on NISQ hardware, we employ the quantum Fourier transform to diagonalize the conditional shift operator, optimizing circuit depth and fidelity. We experimentally realize the transition from quantum chaos to order via DTQW dynamics on both odd and even cyclic graphs, specifically 3- and 4-cycle graphs, using the counterintuitive Parrondo paradox strategy across three different NISQ devices. While the 4-cycle graphs exhibit high-fidelity quantum evolution, the 3-cycle implementation shows significant fidelity improvement when augmented with dynamical decoupling pulses. Our results demonstrate a practical approach to probing and harnessing controlled chaotic dynamics on real quantum hardware, laying the groundwork for future quantum algorithms and cryptographic protocols based on quantum walks.
We propose a quantum circuit design for implementing coined quantum walks on complex networks. In complex networks, the coin and shift operators depend on the varying degrees of the nodes, which makes circuit construction more challenging than for regular networks. To address this issue, we use a dual-register encoding to enable a simplified shift operator and reduces the resource overhead. We implement the circuit using Qmod, a high-level quantum programming language, and evaluated the performance through numerical simulations on Erdős-Rényi, Watts-Strogatz, and Barabási-Albert models. The results show that the circuit depth scales as approximately N1.9 regardless of the network topology. Furthermore, we execute the proposed circuits on the ibm\_torino superconducting quantum processor for Watts-Strogatz models with N=4 and N=8. The experiments show that hardware-aware optimization slightly improved the variation distance and Hellinger fidelity for the larger network, whereas connectivity constraints imposed overhead for the smaller one. These results indicate that while current NISQ devices are limited to small-scale validations, the polynomial scaling of our framework makes it suitable for larger-scale implementations in the fault-tolerant quantum computing era.
Abstract This research investigates the critical role of quantum measurement reliability in the performance and security of quantum cryptography protocols, specifically focusing on the impact of noisy intermediate-scale quantum (NISQ) devices. Through a series of experimental studies conducted using quantum gates on IBM quantum computers (ibm_brisbane and ibm_torino), we analyze how measurement errors affect key performance indicators such as Quantum Bit Error Rate (QBER) and state fidelity. Our findings demonstrate that even minor inaccuracies in quantum measurements can significantly compromise the security and efficiency of quantum key distribution (QKD) protocols. We provide a comprehensive statistical analysis of the experimental data, including confidence intervals and error propagation, to quantify these effects. Furthermore, we delve into potential attack models, such as intercept-resend and Trojan-horse attacks, and discuss their susceptibility to measurement imperfections. This study highlights the urgent need for robust error mitigation and correction techniques to ensure the practical viability and cryptographic strength of quantum communication systems in the evolving quantum era.
Noisy Intermediate-Scale Quantum (NISQ) computers impose severe architectural constraints that prevent direct execution of logical quantum circuits. As a result, quantum circuit mapping—transforming ideal circuits into hardware-compatible forms—has become a critical task in quantum software toolchains. This paper presents a comparative study of key mapping techniques, focusing on circuit depth, SWAP gate overhead, and fidelity awareness. Through a case analysis on a 5-qubit Quantum Fourier Transform (QFT) circuit, we demonstrate the performance trade-offs of several prominent mapping strategies, including naive greedy routing, Qiskit’s SABRE, and CQC’s t|ket>. Our findings reveal that mapping technique selection has a profound impact on circuit quality and feasibility on real NISQ hardware.
Quantum computers provide a promising platform to understand and control the dynamics of quantum many-body systems, yet current devices operate in the noisy intermediate-scale quantum (NISQ) regime, where decoherence caused by interactions with the environment severely limit their ability to accurately carry out computations. This thesis investigates how these limitations affect the simulation of quantum many-body systems, and explores strategies to design efficient quantum algorithms that can operate under realistic experimental constraints. In the first part, we assess the performance of currently available quantum hardware using lattice gauge theory as a challenging testbed. We study digital quantum simulations of a one-dimensional discretization of quantum electrodynamics on Rydberg atom and superconducting platforms, combining classical simulations with realistic noise models and quantum simulations on actual cloud-accessible devices, and analyze the impact of decoherence and gate errors on the accurate reconstruction of dynamical observables. Our findings show that, for the hardware available at the time of the study, reliable simulations without high quality error mitigation are restricted to short circuit depths or small system sizes. These limitations motivate the second part of the work, where we focus on constructing resource-efficient quantum algorithms by exploiting physical insight from quantum many-body physics. First, we introduce an approximate inversion protocol for classical shadows that enables the efficient estimation of global properties of quantum states using shallow quantum circuits. Then, we propose an algorithm for the preparation of short-range correlated quantum states, based on reconstructing the global state by learning local reduced density matrices through classical variational optimization. Taken together, the results of this thesis provide insight into the capabilities of currently available quantum devices and demonstrate how structure inherent to quantum many-body systems can be leveraged to design algorithms compatible with current hardware.
This study investigates the crossover dynamics of a one-dimensional discrete-time quantum walk (DTQW) in noisy environments using the density matrix formalism and Kraus operator representation of quantum operations. Decoherence is modeled by bit-flip, dephasing, and bit-phase noise channels, while dissipation is represented by generalized amplitude damping channels. The analysis of crossover dynamics involves examining the probability distribution, scaling exponent of variance, coherence measures, and entropy metrics such as Shannon and von Neumann entropy. The DTQW produces a symmetrical probability distribution of displacement under decoherence, with distinct features in scaling exponents of mean squared displacement or variance. Under dissipation, DTQW produces a non-symmetric probability distribution and spreads faster than classical walk under extreme decoherence. These suggest a broad class of crossover transport behavior, which can be classified as pure quantum walk, quantum-like walk, semi-classical-like walk, and classical-like walk. Remarkably, maximum Shannon entropy is achieved at lower degrees of decoherence. This study also analyzes the effect of temporal disorder in the coin operator modeled using fractional Gaussian noise (fGn). The crossover dynamic occurs in the form of weak localization, followed by enhanced entanglement and information backflow. Notably, the correlation of fGn is transferred to the coin's degree of entanglement and transpires in the two-point correlation of the von Neumann entropy fluctuation. These findings can be useful for implementing DTQW-based protocols in quantum error correction, quantum cryptography, and quantum memory on the noisy intermediate-scale quantum (NISQ) platform.