Searcharxiv⌕ Search

arXiv subjects

Atul Kumar

Publications and source records attributed to Atul Kumar.

64 records · Page 4Linked to original sources
arXiv2015

Cu2ZnSnS4 Films using an Eco-friendly Direct Liquid Coating Approach for Solar Cell Applications

Cu2ZnSnS4 (CZTS) is a promising candidate as an absorber material for thin film solar cells. The reported wet chemical synthesis approaches often have a high environmental impact due to the usage of abrasive solvents such as hydrazines, hydroxylamines, etc. We report an eco-friendly solvent based approach for making CZTS thin films with desirable absorption characteristics for solar cell applications.

cond-mat.mtrl-sci↗
arXiv2015

Analysis Of SnS2 Buffer Layer And SnS Back Surface Layer Based CZTS Solar Cells Using SCAPS

A Copper-Zinc-Tin-Sulphide (CZTS)based solar cell with a modified ce3ll configuration of Mo/SnS/CZTS/SnS2/ZnO is simulated using SCAPS. An SnS2 buffer layer is used in simulation instead of the standard CdS layer. An additional back surface passivation layer of SnS is added in the modified cell configuration. An improvement in the solar cell efficiency compared to the standard CdS buffer based solar cell configuration Mo/CZTS/CdS/ZnO is found. The observations suggest the possibility of using SnS2 as a potential replacement of CdS. In addition, the use of a back surface passivation layer leads to improved solar cell performance.

cond-mat.mtrl-sci↗
arXiv2014

Upper Bound on Singlet Fraction of Two Qubit Mixed Entangled States

We demonstrate the possibility of achieving the maximum possible singlet fraction using a entangled mixed two-qubit state as a resource. For this, we establish a tight upper bound on singlet fraction and show that the maximal singlet fraction obtained in \cite{Verstraete} does not attain the obtained upper bound on the singlet fraction. Interestingly, we found that the required upper bound can in fact be achieved using local filtering operations.

quant-ph↗
arXiv2014

Controlled Secret Sharing Protocol using a Quantum Cloning Circuit

We demonstrate the possibility of controlling the success probability of a secret sharing protocol using a quantum cloning circuit. The cloning circuit is used to clone the qubits containing the encoded information and {\em en route} to the intended receipients. The success probability of the protocol depends on the cloning parameters used to clone the qubits. We also establish a relation between the concurrence of initially prepared state, entanglement of the mixed state received by the receivers after cloning scheme and the cloning parameters of cloning machine.

quant-ph↗
arXiv2013

Multiparty quantum communication using multiqubit entanglement and teleportation

We propose a 2N qubit entangled channel that can be used to teleport N qubits in a network to a single receiver. We describe the construction of this channel and explicitly demonstrate how the protocol works. The protocol is different from teleportation using $N$ Bell pairs shared between $N$ senders and a single receiver, as it ensures that all parties have to participate in order for the teleportation to be successful. This can be advantageous in various scenarios and we discuss potential application of this protocol to voting.

quant-ph↗
arXiv2013

Entanglement in the Grover's Search Algorithm

Quantum Algorithms have long captured the imagination of computer scientists and physicists primarily because of the speed up achieved by them over their classical counterparts using principles of quantum mechanics. Entanglement is believed to be the primary phenomena behind this speed up. However their precise role in quantum algorithms is yet unclear. In this article, we explore the nature of entanglement in the Grover's search algorithm. This algorithm enables searching of elements from an unstructured database quadratically faster than the best known classical algorithm. Geometric measure of entanglement has been used to quantify and analyse entanglement across iterations of the algorithm. We reveal how the entanglement varies with increase in the number of qubits and also with the number of marked or solution states. Numerically, it is seen that the behaviour of the maximum value of entanglement is monotonous with the number of qubits. Also, for a given value of the number of qubits, a change in the marked states alters the amount of entanglement. The amount of entanglement in the final state of the algorithm has been shown to depend solely on the nature of the marked states. Explicit analytical expressions are given showing the variation of entanglement with the number of iterations and the global maximum value of entanglement attained across all iterations of the algorithm.

quant-ph↗
arXiv2013

Generalized form of optimal teleportation witnesses

We propose a generalized form of optimal teleportation witness to demonstrate their importance in experimental detection of the larger set of entangled states useful for teleportation in higher dimensional systems. The interesting properties of our witness reveal that teleportation witness can be used to characterize mixed state entanglement using Schmidt numbers. Our results show that while every teleportation witness is also a entanglement witness, the converse is not true. Also, we show that a hermitian operator is a teleportation witness iff it is a decomposable entanglement witness. In addition, we analyze the practical significance of our study by decomposing our teleportation witness in terms of Pauli and Gell-Mann matrices, which are experimentally measurable quantities.

quant-ph↗
arXiv2009

Quantum entanglement and generalized information processing using entangled states with odd number of particles

We discuss and generalize multi-particle entanglement based on statistical correlations using Ursell-Mayer type of cluster coefficients. Cluster coefficients are used to distinguish different, independent entangled systems as well as those which are connected through local unitary transformations. We propose a genuinely and maximally entangled five-particle state for efficient information processing. The physical realization of entangled states and information processing protocols are analyzed using quantum gates and circuit diagrams. We show that the direct as well as controlled communication can be achieved using the state proposed here with certainty in the case of teleportation and with a high degree of optimity in the case of dense coding. In the case of dense coding the amount of information transferred from the sender to the receiver is always a maximum irrespective of the measurement basis used by the controller.

quant-ph↗
arXiv2007

Multi-particle entanglement and generalized N-particle teleportation using quantum statistical correlations

Construction of multi-particle entangled states and direct teleportation of N-(spin 1/2) particles are important areas of quantum information processing. A number of different schemes which have been presented already, address the problem through controlled teleportation. In this article, a criterion based on standard quantum statistical correlations employed in the many body virial expansions is used to determine maximum entanglement for a N-particle state. These states remain entangled through proper traces to states for a smaller number of particles and can be generalized for arbitrary number of particles. It is shown that they are quite useful in generalized, N-particle, direct teleportation. The corresponding quantum gates are also indicated for teleportation schemes from simple computational basis states.

quant-ph↗