SearcharxivSearch

arXiv subjects

Anindita Banerjee

Publications and source records attributed to Anindita Banerjee.

At least 19 recordsLinked to original sources

Quantum counterfactuality with identical particles

Quantum self-interference enables the counterfactual transmission of information, whereby the transmitted bits involve no particles traveling through the channel. In this work, we show how counterfactuality can be realized even when the self interference is replaced by interference between identical particles. Interestingly, the facet of indistinguishability called forth here is associated with first-order coherence, and is different from the usual notion of indistinguishability associated with the (anti-)commutation relations of mode operators. From an experimental perspective, the simplest implementation of the proposed idea can be realized by slight modifications to existing protocols for differential-phase-shift quantum key distribution or interaction-free measurement.

quant-ph

A Review on Practical Challenges of Aerial Quantum Communication

The increasing demand for the realization of global-scale quantum communication services necessitates critical investigation for a practical quantum secure communication network that relies on full-time all-location coverage. In this direction, the non-terrestrial quantum key distribution is expected to play an important role in providing agility, maneuverability, relay link, on-demand network, and last-mile coverage. In this work, we have summarized the research and development that has happened until now in the domain of quantum communication using non-terrestrial platforms with a specific focus on the associated challenges and the relevant models. Further, to extend the analysis beyond the existing know-how, a hybrid model involving the features of Vasylyev et al. model and Liorni et al. model is introduced here. The hybrid model entails us adapting a spherical beam to an elliptic beam approximation and effectively capturing the characteristics of transmittance in densely humid weather conditions and at low altitudes. Further, to understand the potential impact of the weather conditions of a region on atmospheric attenuation, as an example the average monthly visibility of Pune city was analyzed for the years 2021 and 2022. In addition, a simulation of a generic model is performed using a software-defined network paradigm where quantum teleportation is simulated between distant parties using a swarm of drones in NetSquid.

quant-ph

Experimental demonstration of high-entropy time of arrival based optical QRNG qualifying stringent statistical tests

We report a demonstration of a high-entropy optical quantum random number generator (QRNG) based on photon arrival time. We have implemented the scheme with high-speed and high-precision electronics with a time resolution of 1 ps generating 115 Mbps raw data. The random bit generation efficiency is 8 bits per detection. The experimental data is quite consistent with theoretical estimation showing minimum bias. We apply a real-time information-theoretic randomness extractor to generate a final data rate of 109 Mbps. The randomness is rigorously evaluated against well-known statistical test suites of NIST, ENT, Diehard, TU-01 and Dieharder.

quant-ph

Generation of 1 Gb full entropy random numbers with the enhanced-NRBG method

Random numbers have significant applications in fundamental science, high-level scientific research, cryptography, and several other areas where there is a pressing need for high-quality random numbers. We present an experimental demonstration of a non-deterministic random bit generator from a quantum entropy source and a deterministic random bit generator mechanism to provide high quality random numbers providing a throughput of 1 Gb. Quantum entropy is realized by a series of quantum chips based on radioactive isotope Americium-241. The extracted raw random numbers are further post-processed to generate a high-entropy seed for the hash based deterministic random bit generator. We discuss the implementation of randomness extraction algorithm and Hash-DRBG algorithm in detail. The random numbers pass all randomness measures provided in ENT and NIST test suites.

quant-ph

Unpredictable and Uniform RNG based on time of arrival using InGaAs Detectors

Quantum random number generators are becoming mandatory in a demanding technology world of high performing learning algorithms and security guidelines. Our implementation based on principles of quantum mechanics enable us to achieve the required randomness. We have generated high-quality quantum random numbers from a weak coherent source at telecommunication wavelength. The entropy is based on time of arrival of quantum states within a predefined time interval. The detection of photons by the InGaAs single-photon detectors and high precision time measurement of 5 ps enables us to generate 16 random bits per arrival time which is the highest reported to date. We have presented the theoretical analysis and experimental verification of the random number generation methodology. The method eliminates the requirement of any randomness extractor to be applied thereby, leveraging the principles of quantum physics to generate random numbers. The output data rate is on an average of 2.4 Mbps. The raw quantum random numbers are compared with NIST prescribed Blum-Blum-Shub pseudo random number generator and an in-house built hardware random number generator from FPGA, on the ENT and NIST Platform.

quant-ph

A MATLAB based modeling and simulation package for DPS-QKD

Quantum key distribution (QKD) is an ingenious technology utilizing quantum information science for provable secure communication. However, owing to the technological limitations and device non-idealities it is important to analyze the system performance critically and carefully define the implementation security. With an acceleration in the commercial adoption of QKD, a simulation toolkit is requisite to evaluate the functional architecture of QKD protocols. We present a simulation framework to model optical and electrical components for implementing a QKD protocol. The present toolkit aims to model and simulate the optical path of the DPS-QKD protocol with its imperfections and eventually characterize the optical path. The detailed device-level modeling and analysis capabilities of the present toolkit based on Simulink and MATLAB have the potential to provide universal toolkit for practical design and implementation of generalized QKD protocols compared to earlier works. We report a novel work on the implementation of a QKD protocol on Simulink and MATLAB platform. Further, the absence of any modeling framework for DPS QKD and its simplistic optical schematic made it an obvious choice for the authors. We are hopeful that this work will pave way for simulating other QKD protocols from the DPR family.

quant-ph

Optimization of Circuits for IBM's five-qubit Quantum Computers

IBM has made several quantum computers available to researchers around the world via cloud services. Two architectures with five qubits, one with 16, and one with 20 qubits are available to run experiments. The IBM architectures implement gates from the Clifford+T gate library. However, each architecture only implements a subset of the possible CNOT gates. In this paper, we show how Clifford+T circuits can efficiently be mapped into the two IBM quantum computers with 5 qubits. We further present an algorithm and a set of circuit identities that may be used to optimize the Clifford+T circuits in terms of gate count and number of levels. It is further shown that the optimized circuits can considerably reduce the gate count and number of levels and thus produce results with better fidelity.

cs.ET

Experimental realization of quantum cheque using a five-qubit quantum computer

We demonstrate the implementation of quantum cheque, proposed by Roy Moulick and Panigrahi [Quantum Inf. Process (2016) 15: 2475], using the five-qubit IBM quantum computer. Appropriate single qubit, CNOT and Fredkin gates have been implemented for the realization of the quantum cheque transaction in a quantum networked banking system. Quantum state tomography reveals the accuracy of the implementation with comparable results from the theoretical and experimental density matrices.

quant-ph

Quantum Conference

A notion of quantum conference is introduced in analogy with the usual notion of a conference that happens frequently in today's world. Quantum conference is defined as a multiparty secure communication task that allows each party to communicate their messages simultaneously to all other parties in a secure manner using quantum resources. Two efficient and secure protocols for quantum conference have been proposed. The security and efficiency of the proposed protocols have been analyzed critically. It is shown that the proposed protocols can be realized using a large number of entangled states and group of operators. Further, it is shown that the proposed schemes can be easily reduced to protocol for multiparty quantum key distribution and some earlier proposed schemes of quantum conference, where the notion of quantum conference was different.

quant-ph

Asymmetric Quantum Dialogue in Noisy Environment

A notion of asymmetric quantum dialogue (AQD) is introduced. Conventional protocols of quantum dialogue are essentially symmetric as both the users (Alice and Bob) can encode the same amount of classical information. In contrast, the scheme for AQD introduced here provides different amount of communication powers to Alice and Bob. The proposed scheme, offers an architecture, where the entangled state and the encoding scheme to be shared between Alice and Bob depends on the amount of classical information they want to exchange with each other. The general structure for the AQD scheme has been obtained using a group theoretic structure of the operators introduced in (Shukla et al., Phys. Lett. A, 377 (2013) 518). The effect of different types of noises (e.g., amplitude damping and phase damping noise) on the proposed scheme is investigated, and it is shown that the proposed AQD is robust and uses optimized amount of quantum resources.

quant-ph

Excessive distribution of quantum entanglement

We classify protocols of entanglement distribution as excessive and non-excessive ones. In a non-excessive protocol, the gain of entanglement is bounded by the amount of entanglement being communicated between the remote parties, while excessive protocols violate such bound. We first present examples of excessive protocols that achieve a significant entanglement gain. Next we consider their use in noisy scenarios, showing that they improve entanglement achieved in other ways and for some situations excessive distribution is the only possibility of gaining entanglement.

quant-ph

Maximal entanglement concentration for $(n+1)$-qubit states

We propose two schemes for concentration of $(n+1)$-qubit entangled states that can be written in the form of $(α|φ_{0}\rangle|0\rangle+β|φ_{1}\rangle|1\rangle)_{n+1}$ where $|φ_{0}\rangle$ and $|φ_{1}\rangle$ are mutually orthogonal $n$-qubit states. The importance of this general form is that the entangled states like Bell, cat, GHZ, GHZ-like, $|Ω\rangle$, $|Q_{5}\rangle$, 4-qubit cluster states and specific states from the 9 SLOCC-nonequivalent families of 4-qubit entangled states can be expressed in this form. The proposed entanglement concentration protocol is based on the local operations and classical communications (LOCC). It is shown that the maximum success probability for ECP using quantum nondemolition (QND) technique is $2β^{2}$ for $(n+1)$-qubit states of the prescribed form. It is shown that the proposed schemes can be implemented optically. Further it is also noted that the proposed schemes can be implemented using quantum dot and microcavity systems.

quant-ph

Orthogonal-state-based cryptography in quantum mechanics and local post-quantum theories

We introduce the concept of cryptographic reduction, in analogy with a similar concept in computational complexity theory. In this framework, class $A$ of crypto-protocols reduces to protocol class $B$ in a scenario $X$, if for every instance $a$ of $A$, there is an instance $b$ of $B$ and a secure transformation $X$ that reproduces $a$ given $b$, such that the security of $b$ guarantees the security of $a$. Here we employ this reductive framework to study the relationship between security in quantum key distribution (QKD) and quantum secure direct communication (QSDC). We show that replacing the streaming of independent qubits in a QKD scheme by block encoding and transmission (permuting the order of particles block by block) of qubits, we can construct a QSDC scheme. This forms the basis for the \textit{block reduction} from a QSDC class of protocols to a QKD class of protocols, whereby if the latter is secure, then so is the former. Conversely, given a secure QSDC protocol, we can of course construct a secure QKD scheme by transmitting a random key as the direct message. Then the QKD class of protocols is secure, assuming the security of the QSDC class which it is built from. We refer to this method of deduction of security for this class of QKD protocols, as \textit{key reduction}. Finally, we propose an orthogonal-state-based deterministic key distribution (KD) protocol which is secure in some local post-quantum theories. Its security arises neither from geographic splitting of a code state nor from Heisenberg uncertainty, but from post-measurement disturbance.

quant-ph

Comment on "Teleportation of Three-Qubit State via Six-qubit Cluster State"

Recently Yu and Sun [Int. J. Theor. Phys. DOI 10.1007/s10773-014-2360-x] have presented probabilistic teleportation of 3-qubit cat state via 6-qubit cluster state. The success probability depends on absolute value of only two of the coefficients of cluster state i.e. |c|^2 + |d|^2. We have demonstrated the feasibility to teleport 3-qubit cat state via 2-qubit non maximally entangled Bell state instead of a complex state like 6-qubit non maximally entangled cluster state. In this comment we have prescribed an optimal protocol for teleportation of n-qubit state of the form (α|x> + β|\bar{x}>)_n via non maximally entangled Bell state a|00> + b|11> henceforth allowing teleportation of n-qubit state via 2-qubit Bell state. The success probability of the prescribed protocol is |b|^2.

quant-ph

Secure Quantum Communication with Orthogonal States

In majority of protocols of secure quantum communication (such as, BB84, B92, etc.), the unconditional security of the protocols are obtained by using conjugate coding (two or more mutually unbiased bases). Initially all the conjugate-coding-based protocols of secure quantum communication were restricted to quantum key distribution (QKD), but later on they were extended to other cryptographic tasks (such as, secure direct quantum communication and quantum key agreement). In contrast to the conjugate-coding-based protocols, a few completely orthogonal-state-based protocols of unconditionally secure QKD (such as, Goldenberg-Vaidman (GV) and N09) were also proposed. However, till the recent past orthogonal-state-based protocols were only a theoretical concept and were limited to QKD. Only recently, orthogonal-state-based protocols of QKD are experimentally realized and extended to cryptographic tasks beyond QKD. This paper aims to briefly review the orthogonal-state-based protocols of secure quantum communication that are recently introduced by our group and other researchers.

quant-ph

Protocols and quantum circuits for implementing entanglement concentration in cat state, GHZ-like state and 9 families of 4-qubit entangled states

Three entanglement concentration protocols (ECPs) are proposed. The first ECP and a modified version of that are shown to be useful for the creation of maximally entangled cat and GHZ-like states from their non-maximally entangled counterparts. The last two ECPs are designed for the creation of maximally entangled $(n+1)$-qubit state $\frac{1}{\sqrt{2}}\left(|Ψ_{0}\rangle|0\rangle+|Ψ_{1}\rangle|1\rangle\right)$ from the partially entangled $(n+1)$-qubit normalized state $α|Ψ_{0}\rangle|0\rangle+β|Ψ_{1}\rangle|1\rangle$, where $\langleΨ_{1}|Ψ_{0}\rangle=0$ and $|α|\neq\frac{1}{\sqrt{2}}$. It is also shown that W, GHZ, GHZ-like, Bell and cat states and specific states from the 9 SLOCC-nonequivalent families of 4-qubit entangled states can be expressed as $\frac{1}{\sqrt{2}}\left(|Ψ_{0}\rangle|0\rangle+|Ψ_{1}\rangle|1\rangle\right)$ and consequently the last two ECPs proposed here are applicable to all these states. Quantum circuits for implementation of the proposed ECPs are provided and it is shown that the proposed ECPs can be realized using linear optics. Efficiency of the ECPs are studied using a recently introduced quantitative measure (Phys. Rev. A $\textbf{85}$, 012307 (2012)). Limitations of the measure are also reported.

quant-ph

Bidirectional controlled teleportation by using 5-qubit states: A generalized view

Recently bidirectional controlled perfect teleportation using 5-qubit states are reported in (Int. J. Theor. Phys. (2013) DOI 10.1007/s10773-013-1484-8 and ibid, (2013) DOI 10.1007/s10773-012-1208-5). In this paper we have shown that there exists a class of 5-qubit quantum states that can be used for bidirectional controlled teleportation. Two out of the three reported cases are the special cases of the proposed class of 5-qubit quantum states and one of them is not strictly a case of controlled bidirectional quantum teleportation. Further, we have shown that one can in principle, construct infinitely many 5-qubit quantum states for this purpose. We have also shown that the idea can be extended to bidirectional controlled probabilistic teleportation. Some potential applications of the proposed scheme and its modified versions are also discussed in relation with the implementation of quantum remote control and quantum cryptography.

quant-ph

Improved protocols of secure quantum communication using W states

Recently, Hwang et al. [Eur. Phys. J. D. 61, 785 (2011)] and Yuan et al. [Int. J. Theo. Phys. 50, 2403 (2011)] have proposed two efficient protocols of secure quantum communication using 3-qubit and 4-qubit symmetric W state respectively. These two dense coding based protocols are generalized and their efficiencies are considerably improved. Simple bounds on the qubit efficiency of deterministic secure quantum communication (DSQC) and quantum secure direct communication (QSDC) protocols are obtained and it is shown that dense coding is not essential for designing of maximally efficient DSQC and QSDC protocols. This fact is used to design maximally efficient protocols of DSQC and QSDC using 3-qubit and 4-qubit W states.

quant-ph