arXiv subjects

Syed Emad Uddin Shubha

Publications and source records attributed to Syed Emad Uddin Shubha.

10 recordsLinked to original sources

arXiv2026

Distinguishing Coherent Crosstalk from Calibration Drift via Pauli-Transfer Signatures and Quantum Edge Detection

Multi-tenant quantum processors expose a pulse-level attack surface in which coherent crosstalk can mimic benign calibration drift at matched average gate infidelity. We present a structural verification and detection framework based on the residual Pauli transfer matrix (PTM). We prove that products of local unital, trace-preserving channels cannot mix weight-1 and weight-2 Pauli operators, even under coherent drift of arbitrary strength or axis. Building on established PTM-to-Hamiltonian relations, we prove that, for any specified qubit pair in an arbitrarily large system, the first-order map from its nine interaction coefficients to the antisymmetric cross-weight feature is an isometry up to scale. Thus, every interaction direction is locally observable near the identity. We also exhibit cancellation of this feature under large local rotations and prove that the full cross-weight norm is invariant under local unitary composition, providing a structural countermeasure. For calibrated small local rotations, shared randomized-Pauli measurements support periodic verification using the evaluated antisymmetric detector. In simulation, $16{,}384$ randomized settings yield a detection threshold of $λ_{\min}\approx0.13$ at a $5\%$ calibrated false-positive target, with approximately $M^{-1/2}$ scaling in the number of settings $M$. Further experiments characterize detection under relaxation, depolarization, native ZZ fluctuations, and time-dependent pulse dynamics. Finally, an FRQI encoding with Pauli-graph quantum Hadamard edge detection reproduces the classical structural edge score to numerical precision.

quant-ph↗

arXiv2026

Generalized State Discrimination for Tunable Quantum Key Distribution

We introduce a tunable framework for generalized quantum state discrimination (GSD) and apply it to quantum key distribution (QKD) through a protocol we call phiQKD. Building upon the two-state B92 protocol, phiQKD replaces the traditional unambiguous state discrimination (USD) measurement with a one-parameter family of hybrid POVMs characterized by a tilting angle $ϕ$. This allows for continuous control over the trade-off among correct, incorrect, and inconclusive outcomes. While offering improvement in key rate over B92, the primary practical advantage of phiQKD lies in its adaptability to noise and channel imperfections via measurement tunability. By evaluating the protocol under asymptotic, finite-key, and composable security models, we show that, treating quantum measurement as a tunable design parameter, rather than a fixed operation, enables flexible protocol optimization and improved performance under realistic constraints.

quant-ph↗

arXiv2025

Secure and Efficient n-Qubit Entangled State Teleportation Using Partially Entangled GHZ Channels and Optimal POVM

We introduce an efficient and versatile quantum teleportation protocol for specific types of n-qubit entangled states. By employing a partially entangled Greenberger-Horne-Zeilinger (GHZ) state as the quantum channel and an optimal Positive Operator-Valued Measure (POVM) based on an improved reciprocal state formulation, we achieve unambiguous state discrimination. The scheme has been generalized to support various entangled state configurations and demonstrates a notable reduction in classical communication costs for these states compared to standard Bell-basis teleportation. Its capacity for integration with conventional protocols is pivotal, enhancing quantum hop-by-hop communication security by allowing strategic choices in quantum channel and teleportation strategy

quant-ph↗

arXiv2025

Pulse-to-Circuit Characterization of Stealthy Crosstalk Attack on Multi-Tenant Superconducting Quantum Hardware

Hardware crosstalk in multi-tenant superconducting quantum computers constitutes a significant security threat, enabling adversaries to inject targeted errors across tenant boundaries. We present the first end-to-end framework for mapping physical pulse-level attacks to interpretable logical error channels, integrating density-matrix simulation, quantum process tomography (QPT), and a novel isometry-based circuit extraction method. Our pipeline reconstructs the complete induced error channel and fits an effective logical circuit model, revealing a fundamentally asymmetric attack mechanism: one adversarial qubit acts as a driver to set the induced logical rotation, while a second, the catalyst, refines the attack's coherence. Demonstrated on a linear three-qubit system, our approach shows that such attacks can significantly disrupt diverse quantum protocols, sometimes reducing accuracy to random guessing, while remaining effective and stealthy even under realistic hardware parameter variations. We further propose a protocol-level detection strategy based on observable attack signatures, showing that stealthy attacks can be exposed through targeted monitoring and providing a foundation for future defense-in-depth in quantum cloud platforms.

quant-ph↗

arXiv2025

Pulse-Level Simulation of Crosstalk Attacks on Superconducting Quantum Hardware

Hardware crosstalk in multi-tenant superconducting quantum computers poses a severe security threat, allowing adversaries to induce targeted errors across tenant boundaries by injecting carefully engineered pulses. We present a simulation-based study of active crosstalk attacks at the pulse level, analyzing how adversarial control of pulse timing, shape, amplitude, and coupling can disrupt a victim's computation. Our framework models the time-dependent dynamics of a three-qubit system in the rotating frame, capturing both always-on couplings and injected drive pulses. We examine two attack strategies: attacker-first (pulse before victim operation) and victim-first (pulse after), and systematically identify the pulse and coupling configurations that cause the largest logical errors. Protocol-level experiments on quantum coin flip and XOR classification circuits show that some protocols are highly vulnerable to these attacks, while others remain robust. Based on these findings, we discuss practical methods for detection and mitigation to improve security in quantum cloud platforms.

quant-ph↗

arXiv2025

Enhancing Quantum Dense Coding Robustness Using Information Entropy-Based Metrics

Superdense Coding is a cornerstone in secure quantum communication, exploiting pre-shared entanglement to encode two classical bits within a single qubit. However, noise and decoherence deteriorate entanglement quality, restricting both fidelity and channel capacity in practical settings. Traditional methods, such as error correcting codes or entanglement distillation, are generally inadequate for dynamically varying noise conditions. Moreover, reliance on fidelity alone may fail to capture more subtle noise effects. This work introduces an adaptive protocol that integrates the five-qubit perfect code with a novel global adaptive purification that avoids discarding entangled pairs. By monitoring two information entropy-based metrics, quantum discord (QD) and entanglement of formation (EoF) from pilot pairs, we dynamically tune a global unitary to counteract noise. Our simulations, under both amplitude and phase damping, indicate that this integrated strategy could significantly enhance superdense coding robustness while preserving high throughput, thereby offering a scalable pathway toward a high-capacity quantum internet.

quant-ph↗

arXiv2024

Multi-Layered Security System: Integrating Quantum Key Distribution with Classical Cryptography to Enhance Steganographic Security

In this paper, we present a novel cryptographic system that integrates Quantum Key Distribution (QKD) with classical encryption techniques to secure steganographic images. Our approach leverages the E91 QKD protocol to generate a shared secret key between communicating parties, ensuring the highest level of security against eavesdropping through the principles of quantum mechanics. This key is then hashed using the Secure Hash Algorithm (SHA) to provide a fixedlength, high-entropy key, which is subsequently utilized in symmetric encryption. We explore the use of AES (Advanced Encryption Standard) algorithms for encrypting steganographic images, which hide sensitive information within digital images to provide an additional layer of security through obscurity. The combination of QKD, hashing, and symmetric encryption offers a robust security framework that mitigates various attack vectors, enhancing the confidentiality and integrity of the transmitted data. Our experimental results demonstrate the feasibility and efficiency of the proposed system, highlighting its performance in terms of key generation rates, encryption/decryption speeds, and the computational overhead introduced by the hashing and steganographic processes. By integrating quantum and classical cryptographic methods with steganography, this work provides a comprehensive security solution that is highly resistant to both quantum and classical attacks, making it suitable for applications requiring stringent security measures. This paper contributes to the ongoing research in cryptographic systems, offering insights into the practical implementation and potential benefits of hybrid quantumclassical security protocols.

quant-ph↗

arXiv2024

Edge Detection Quantumized: A Novel Quantum Algorithm For Image Processing

Quantum image processing is a research field that explores the use of quantum computing and algorithms for image processing tasks such as image encoding and edge detection. Although classical edge detection algorithms perform reasonably well and are quite efficient, they become outright slower when it comes to large datasets with high-resolution images. Quantum computing promises to deliver a significant performance boost and breakthroughs in various sectors. Quantum Hadamard Edge Detection (QHED) algorithm, for example, works at constant time complexity, and thus detects edges much faster than any classical algorithm. However, the original QHED algorithm is designed for Quantum Probability Image Encoding (QPIE) and mainly works for binary images. This paper presents a novel protocol by combining the Flexible Representation of Quantum Images (FRQI) encoding and a modified QHED algorithm. An improved edge outline method has been proposed in this work resulting in a better object outline output and more accurate edge detection than the traditional QHED algorithm.

quant-ph↗

arXiv2023

Enhancing the security of image transmission in Quantum era: A Chaos-Assisted QKD Approach using entanglement

The emergence of quantum computing has introduced unprecedented security challenges to conventional cryptographic systems, particularly in the domain of optical communications. This research addresses these challenges by innovatively combining quantum key distribution (QKD), specifically the E91 protocol, with logistic chaotic maps to establish a secure image transmission scheme. Our approach utilizes the unpredictability of chaotic systems alongside the robust security mechanisms inherent in quantum entanglement. The scheme is further fortified with an eavesdropping detection mechanism based on CHSH inequality, thereby enhancing its resilience against unauthorized access. Through quantitative simulations, we demonstrate the effectiveness of this scheme in encrypting images, achieving high entropy and sensitivity to the original images. The results indicate a significant improvement in encryption and decryption efficiency, showcasing the potential of the scheme as a viable solution against the vulnerabilities posed by quantum computing advancements. Our research offers a novel perspective in secure optical communications, blending the principles of chaos theory with QKD to create a more robust cryptographic framework.

quant-ph↗

arXiv2023

Immense Fidelity Enhancement of Encoded Quantum Bell Pairs at Short and Long-distance Communication along with Generalized Design of Circuit

Quantum entanglement is a unique criterion of the quantum realm and an essential tool to secure quantum communication. Ensuring high-fidelity entanglement has always been a challenging task owing to interaction with the hostile channel environment created due to quantum noise and decoherence. Though several methods have been proposed, achieving almost 100% error correction is still a gigantic task. As one of the main contributions of this work, a new model for large distance communication has been introduced, which can correct all bit flip errors or other errors quite extensively if proper encoding is used. To achieve this purpose, at the very first step, the idea of differentiating the long and short-distance applications has been introduced. Short-distance is determined by the maximum range of applying unitary control gates by the qubit technology. As far as we know, there is no previous work that distinguishes long and short distance applications. At the beginning, we have applied stabilizer formalism and Repetition Code for decoding to distinguish the error correcting ability in long and short distance communication. Particularly for short distance communication, it has been demonstrated that a properly encoded bell state can identify all the bit flip, or phase flip errors with 100% accuracy theoretically. In contrast, if the bell states are used in long distance communication, the error-detecting and correcting ability reduces at huge amounts. To increase the fidelity significantly and correct the errors quite extensively for long-distance communication, a new model based on classical communication protocol has been proposed. All the required circuits in these processes have been generalized during encoding. Proposed analytical results have also been verified with the Simulation results of IBM QISKIT QASM.

quant-ph↗