arXiv subjects

Anindita Banerjee

Publications and source records attributed to Anindita Banerjee.

27 records · Page 2Linked to original sources

arXiv2012

On the group theoretic structure of a class of quantum dialogue protocols

Intrinsic symmetry of the existing protocols of quantum dialogue are explored. It is shown that if we have a set of mutually orthogonal $n$-qubit states {\normalsize $\{|ϕ_{0}>,|ϕ_{1}>,....,|ϕ_{i}<,...,|ϕ_{2^{n}-1}>\}$ and a set of $m-qubit$ ($m\leq n$) unitary operators $\{U_{0},U_{2},...,U_{2^{n}-1}\}:U_{i}|ϕ_{0}>=|ϕ_{i}>$ and $\{U_{0},U_{2},...,U_{2^{n}-1}\}$ forms a group under multiplication then it would be sufficient to construct a quantum dialogue protocol using this set of quantum states and this group of unitary operators}. The sufficiency condition is used to provide a generalized protocol of quantum dialogue. Further the basic concepts of group theory and quantum mechanics are used here to systematically generate several examples of possible groups of unitary operators that may be used for implementation of quantum dialogue. A large number of examples of quantum states that may be used to implement the generalized quantum dialogue protocol using these groups of unitary operators are also obtained. For example, it is shown that GHZ state, GHZ-like state, W state, 4 and 5 qubit Cluster states, Omega state, Brown state, $Q_{4}$ state and $Q_{5}$ state can be used for implementation of quantum dialogue protocol. The security and efficiency of the proposed protocol is appropriately analyzed. It is also shown that if a group of unitary operators and a set of mutually orthogonal states are found to be suitable for quantum dialogue then they can be used to provide solutions of socialist millionaire problem.

quant-ph↗

arXiv2012

Efficient protocols for deterministic secure quantum communication using GHZ-like states

Two protocols for deterministic secure quantum communication (DSQC) using GHZ-like states have been proposed. It is shown that one of these protocols can be modified to an equivalent but more efficient protocol of quantum secure direct communication (QSDC). Security and efficiency of the proposed protocols are analyzed in detail and are critically compared with the existing protocols. It is shown that the proposed protocols are highly efficient. It is also shown that all the physical systems where dense coding is possible can be used to design maximally efficient protocol of DSQC and QSDC. Further, it is shown that dense coding is sufficient but not essential for DSQC and QSDC protocols of the present kind. We have shown that there exist a large class of quantum state which can be used to design maximally efficient DSQC and QSDC protocols of the present kind. It is further, observed that maximally efficient QSDC protocols are more efficient than their DSQC counterparts. This additional efficiency arises at the cost of message transmission rate.

quant-ph↗

arXiv2010

Comment on Quantum teleportation via GHZ-like state

Recently Yang et al. [Int. J. Theo. Phys. 48 (2009) 516] have shown that an unknown qubit can be teleported by using a particular GHZ-like state as quantum channel. However, there are several errors in the calculation which lead to incorrect conclusions. The errors have been indicated and corrected. It is also noted that their scheme and the independently proposed teleportation scheme of Zhang et al. [Int. J. Theo. Phys. 48 (2009) 3331] uses quantum channel from the same family and any state of that family may be used for teleportation.

quant-ph↗

arXiv2010

Efficient quantum circuits for perfect and controlled teleportation of n-qubit non-maximally entangled states of generalized Bell-type

An efficient and economical scheme is proposed for the perfect quantum teleportation of n-qubit non-maximally entangled state of generalized Bell-type. A Bell state is used as the quantum channel in the proposed scheme. It is also shown that the controlled teleportation of this n-qubit state can be achieved by using a GHZ state or a GHZ-like state as quantum channel. The proposed schemes are economical because for the perfect and controlled teleportation of n-qubit non-maximally entangled state of generalized Bell-type we only need a Bell state and a tripartite entangled state respectively. It is also established that there exists a family of 12 orthogonal tripartite GHZ-like states which can be used as quantum channel for controlled teleportation. The proposed protocols are critically compared with the existing protocols.

quant-ph↗

arXiv2010

An algorithm for minimization of quantum cost

A new algorithm for minimization of quantum cost of quantum circuits has been designed. The quantum cost of different quantum circuits of particular interest (eg. circuits for EPR, quantum teleportation, shor code and different quantum arithmetic operations) are computed by using the proposed algorithm. The quantum costs obtained using the proposed algorithm is compared with the existing results and it is found that the algorithm has produced minimum quantum cost in all cases.

quant-ph↗

arXiv2009

New designs of reversible sequential devices

A clear protocol for synthesis of sequential reversible circuits from any particular gate library has been provided. Using that protocol, reversible circuits for SR latch, D latch, JK latch and T latch are designed from NCT gate library. All the circuits have been optimized with the help of existing local optimization algorithms (e.g. template matching, moving rule and deletion rule). It has been shown that the present proposals have lower gate complexities, lower number of garbage bits, lower quantum cost and lower number of feedback loops compared to the earlier proposals. For a fair comparison, the optimized sequential circuits have been compared with the earlier proposals for the same after converting the earlier proposed circuits into equivalent NCT circuits. Further, we have shown that the advantage in gate count obtained in some of the earlier proposals by introduction of New gates is an artifact and if it is allowed then every reversible circuit block can be reduced to a single gate. In this context, some important conceptual issues related to the designing and optimization of sequential reversible circuits have been addressed. A protocol for minimization of quantum cost of reversible circuit has also been proposed here.

quant-ph↗

arXiv2009

An analysis of reversible multiplier circuits

Multiplier circuits play an important role in reversible computation, which is helpful in diverse areas such as low power CMOS design, optical computing, DNA computing and bioinformatics. Here we propose a new reversible multiplier circuit with optimized hardware complexity. The optimized multiplier circuit is compared with the earlier proposals. We have shown that the quantum cost of earlier proposals can be further reduced with the help of existing local optimization algorithms (e.g. template matching, moving rule and deletion rule). A systematic protocol for reduction of quantum cost has been proposed. It has also been shown that the advantage in gate count obtained in some of the earlier proposals by introduction of new reversible gates is an artifact and if it is allowed then every circuit block can be reduced to a single gate. Further, it is shown that the 4x4 reversible gates proposed for designing of a component of multiplier circuit (full adder) is neither unique nor special and many such 4x4 gates may be proposed. As example three such new gates have been presented here and it is shown that the proposed gates are universal. It is also shown that the total cost of our design is minimum.

quant-ph↗

arXiv2009

Probabilistic model of fault detection in quantum circuits

It is shown that the fault testing for quantum circuits does not follow conventional classical techniques. If probabilistic gate like Hadamard gate is included in a circuit then the classical notion of test vector is shown to fail. We have reported several new and distinguishing features of quantum fault and also presented a general methodology for detection of functional faults in a quantum circuit. The technique can generate test vectors for detection of different kinds of fault. Specific examples are given and time complexity of the proposed quantum fault detection algorithm is reported.

quant-ph↗

arXiv2007

On the Synthesis of Sequential Reversible Circuit

Reversible circuits for SR flip flop, JK flip flop, D flip flop, T flip flop, Master Slave D flip flop and Master Slave JK flip flop have been provided with three different logical approaches. All the circuits have been optimized with the help of existing local optimization algorithms (e.g. template matching, moving rule and deletion rule) and the optimized sequential circuits have been compared with the earlier proposals for the same. It has been shown that the present proposals have lower gate complexities and lower number of garbage bits compared to the earlier proposals. It has also been shown that the advantage in gate count obtained in some of the earlier proposals by introduction of New gates is an \textcolor{black}{artifact} and if it is allowed then every circuit block (unless there is a measurement) can be reduced to a single gate. Further, it is shown that a reversible flip flop can be constructed even without a feedback. In this context, some important conceptual issues related to the designing and optimization of sequential reversible circuits have also been addressed.

quant-ph↗