SearcharxivSearch

arXiv subjects

Farnaz Farman

Publications and source records attributed to Farnaz Farman.

3 recordsLinked to original sources

Enhancing the security of coherent one-way quantum key distribution using CHSH correlations

The coherent one-way (COW) protocol is a quantum key distribution scheme that has attracted significant attention, leading to the development and commercialization of practical implementations. Despite this progress, the security of the COW protocol has remained a fundamental challenge since its introduction. Numerous studies have investigated its security, and several security proofs have been proposed over the years. More recently, a number of works have questioned the security of this protocol. In particular, one of the latest studies introduced an attack that severely limits the security of COW-QKD and reported a maximum secure distance of less than 20km. In this work, we introduce minimal alteration to the COW protocol that can enhance its security. Specifically, instead of monitoring the coherence between successive pulses, we propose to monitor quantum correlations through the violation of Bell inequalities. This approach enables the detection of a broader class of potential attacks. Our simulation results indicate that, by employing this method, the maximum secure distance of the protocol can be extended to approximately 259km.

quant-ph

Quantum Multiplication Algorithm Based on the Convolution Theorem

The problem of efficient multiplication of large numbers has been a long-standing challenge in classical computation and has been extensively studied for centuries. It appears that the existing classical algorithms are close to their theoretical limit and offer little room for further enhancement. However, with the advent of quantum computers and the need for quantum algorithms that can perform multiplication on quantum hardware, a new paradigm emerges. In this paper, inspired by convolution theorem and quantum amplitude amplification paradigm we propose a quantum algorithms for integer multiplication with time complexity $O(\sqrt{n}\log^2 n)$ which outperforms the best-known classical algorithm, the Harvey algorithm with time complexity of $O(n \log n)$. Unlike the Harvey algorithm, our algorithm does not have the restriction of being applicable solely to extremely large numbers, making it a versatile choice for a wide range of integer multiplication tasks. The paper also reviews the history and development of classical multiplication algorithms and motivates us to explore how quantum resources can provide new perspectives and possibilities for this fundamental problem.

quant-ph

Effect of laser phase noise on the fidelity of optomechanical quantum memory

Optomechanical and electromechanical cavities have been widely used in quantum memories and quantum transducers. We theoretically investigate the robustness of opto(electro)-mechanical quan- tum memories against the noise of the control laser. By solving the Langevin equations and using the covariance matrix formalism in the presence of laser noise, the storing fidelity of Gaussian states is obtained. It is shown that, the destructive effect of phase noise is more significant in higher values of coupling laser amplitude and optomechanical coupling strength G. However, by further increasing coupling coefficient, the interaction time between photons and phonons decreases below the coherence time of laser frequency noise and the destructive effect of laser phase noise on the storing fidelity drops as well.

quant-ph