2017/10/14 by Avinash Dash, Dash, Avinash, Sumit Rout +5 · 16 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Computer science #FOS: Physical sciences #IBM #Mathematics #Physics #Protocol (science) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #Quantum algorithm #Quantum computer #Quantum mechanics #Quantum superposition #Qubit #Realization (probability) #State (computer science) #Superposition principle #Theoretical computer science #quant-ph
paper · pdf · doi:10.48550/arxiv.1710.05196
published in arXiv (Cornell University) (Cornell University) · 20 pages, 7 figures
openalex publication_date 2017/10/14 · arxiv created 2018/05/09 · arxiv updated 2018/05/10 · openalex created_date 2018/05/17 · openalex updated_date 2026/07/28
It is well known that Grover's algorithm asymptotically transforms an equal superposition state into an eigenstate (of a given basis). Here, we demonstrate a verification algorithm based on weak measurement which can achieve the same purpose even if the qubit is not in an equal superposition state. The proposed algorithm highlights the distinguishability between any arbitrary single qubit superposition state and an eigenstate. We apply this algorithm to propose the scheme of a Quantum Locker, a protocol in which any legitimate party can verify his/her authenticity by using a newly developed quantum One-Time Password (OTP) and retrieve the necessary message from the locker. We formally explicate the working of quantum locker in association with the quantum OTP, which theoretically offers a much higher security against any adversary, as compared to any classical security device.