SearcharxivSearch

arXiv subjects

Sujan Vijayaraj

Publications and source records attributed to Sujan Vijayaraj.

4 recordsLinked to original sources

Improving device-independent quantum key distribution protocols through multiple routed Bell tests

Device-independent quantum key distribution (DI-QKD) offers security with the smallest possible set of assumptions about the experimental setup. The challenge posed by its implementation could be tackled using routed Bell tests with entanglement swapping, or distant Bell state measurement (BSM) units. However, practical distances still require local tests with close-to-ideal violations. We propose a DI-QKD protocol based on multiple sources and measurement devices where, in each round, routed tests are performed on randomly selected local devices. The violation of local Bell tests is checked even when a successful BSM projection is achieved. By requiring that such conditional tests remain consistent with the overall one, we achieve improvements in the critical detection efficiencies of about $4-12\%$ for high visibilities. Our approach enables long-distance DI-QKD, with access to highly efficient loophole-free routing setups, and multiple local tests (possibly imperfect) with very high local detection efficiencies. Finally, we extend the concept of routing to dimension witnesses, where qubit-bounded sources send states to the BSM. This can be seen as a semi-device-independent extension of the aforementioned protocol.

quant-ph

Quasi-deterministic secure quantum communication using non-maximally entangled states

Quantum communication in general helps deter potential eavesdropping in the course of transmission of bits to enable secure communication between two or more parties. In this paper, we propose a novel quasi-deterministic secure quantum communication scheme using non-maximally entangled states. The proposed scheme follows a simple procedure, and cases where the entanglement required can be significantly reduced to carry out the protocol successfully are discussed. Long sequences or the whole sequence of data can be sent after error checking for a potential eavesdropper. The maximum qubit efficiency of the proposed protocol is found to be 33.333%.

quant-ph

Can error in quantum deletion machines be beneficial for deletion?

In this paper, a generalized input state dependent deletion machine called probabilistic quantum deletion machine is proposed. Considering the Pati-Braunstein deletion machine as a benchmark, the machine is characterized by its deletion probability and the probability of error in deletion. It is observed that there are parameters for which increase in error in deletion can increase the fidelity of deletion. It is also shown that the Pati-Braunstein deletion machine is easily derivable for a certain value of deletion probability. Further the deletion machine can offer better fidelity of deletion than the Pati-Braunstein deletion machine for any input state with the right parameters.

quant-ph

Impartial binary decisions through qubits

Binary decisions are the simplest form of decisions that are made in our daily lives. Examples include choosing a two-way path in a maze, accepting or declining an offer, etc. These decisions are also made by computers, machines and various electronic components. But decisions made on these devices can be partial and deterministic, and hence compromised. In this paper, a simple framework to implement binary decisions using one or many qubits is presented. Such systems are based on a separate hardware infrastructure rather than computer codes. This helps enable true randomness and impartial decision making. The multi-armed bandit problem is used to highlight the decision making ability of qubits by predictive modelling based on quantum Bayesianism. Bipartite and multipartite entangled states are also used to solve specific cases of the problem.

quant-ph