More than two multipartite orthogonal states cannot always be discriminated (with certainty) if o... more More than two multipartite orthogonal states cannot always be discriminated (with certainty) if only local operations and classical communication (LOCC) are allowed. Using an existing inequality among the measures of entanglement, we show that any three Bell states cannot be discriminated by LOCC. Exploiting the inequality, we calculate the distillable entanglement of a certain class of (4\otimes 4) mixed states
Non existence of Universal NOT gate for arbitrary quantum mechanical states is a fundamental cons... more Non existence of Universal NOT gate for arbitrary quantum mechanical states is a fundamental constraint on the allowed operations performed on physical systems. The largest set of states that can be flipped by using a single NOT gate is the set of states lying on a great circle of the Bloch-sphere. In this paper, we show the impossibility of universal exact-flipping operation, first by using the fact that no faster than light communication is possible and then by using the principle of “non-increase of entanglement under LOCC”. Interestingly, in both the cases, there is no violation of the two principles if and only if the set of states to be flipped, form a great circle. PACS number(s): 03.67.Mn, 03.67.Hk
Hardy's non-locality theorem for multiple two-level systems is explored in the context of gen... more Hardy's non-locality theorem for multiple two-level systems is explored in the context of generalized non-local theory. We find non-local but non-signaling probabilities satisfying Hardy's argument for two two-level and three two-level systems. Maximum probability of success of Hardy's argument is obtained for three two-level systems in quantum theory as well as in a more generalized theory. Interestingly, the maximum in the generalized non-local theory for both the two two-level systems and three two-level systems turns out to be the same.
Anonymous Veto (AV) and Dining cryptographers (DC) are two basic primitives for the cryptographic... more Anonymous Veto (AV) and Dining cryptographers (DC) are two basic primitives for the cryptographic problems where the main aim is to hide the identity of the senders of the messages. These can be achieved by classical methods where the security is based either on computational hardness or on shared private keys. In this regard, we present a secure quantum protocol for both DC and AV by exploiting the GHZ correlations. We first solve a generalized version of the DC problem with the help of multiparty GHZ state. This allow us to provide a secure quantum protocol for the AV. Securities for both the protocols rely on some novel and fundamental features of GHZ correlations related to quantum nonlocality.
Quantum mechanics is compatible with scenarios where the relative order between two events can be... more Quantum mechanics is compatible with scenarios where the relative order between two events can be indefinite. Here we show that two independent instances of a noisy process can behave as a perfect quantum communication channel when used in a coherent superposition of two alternative orders. This phenomenon occurs even if the original process has zero capacity to transmit quantum information. In contrast, perfect quantum communication does not occur when the message is sent directly from the sender to the receiver through a superposition of alternative paths, with an independent noise process acting on each path. The possibility of perfect quantum communication through independent noisy channels highlights a fundamental difference between the superposition of orders in time and the superposition of paths in space.
International Journal of Quantum Information, 2016
In 1935, Albert Einstein and two colleagues, Boris Podolsky and Nathan Rosen (EPR) developed a th... more In 1935, Albert Einstein and two colleagues, Boris Podolsky and Nathan Rosen (EPR) developed a thought experiment to demonstrate what they felt was a lack of completeness in quantum mechanics (QM). EPR also postulated the existence of more fundamental theory where physical reality of any system would be completely described by the variables/states of that fundamental theory. This variable is commonly called hidden variable and the theory is called hidden variable theory (HVT). In 1964, John Bell proposed an empirically verifiable criterion to test for the existence of these HVTs. He derived an inequality, which must be satisfied by any theory that fulfill the conditions of locality and reality. He also showed that QM, as it violates this inequality, is incompatible with any local-realistic theory. Later it has been shown that Bell’s inequality (BI) can be derived from different set of assumptions and it also find applications in useful information theoretic protocols. In this review...
Anonymous Veto (AV) and Dining cryptographers (DC) are two basic primitives for the cryptographic... more Anonymous Veto (AV) and Dining cryptographers (DC) are two basic primitives for the cryptographic problems that can hide the identity of the sender(s) of classical information. They can be achieved by classical methods and the security is based on computational hardness or requires pairwise shared private keys. In this regard, we present a secure quantum protocol for both DC and AV problems by exploiting the GHZ correlation. We first solve a generalized version of the DC problem with the help of multiparty GHZ state. This allow us to provide a secure quantum protocol for the AV problem. Security of both the protocols rely on some novel and fundamental features of the GHZ correlation known as GHZ paradox.
John Bell taught us that quantum mechanics can not be reproduced by non-contextual and local Hidd... more John Bell taught us that quantum mechanics can not be reproduced by non-contextual and local Hidden variable theory. The impossibility of replacing quantum mechanics by non-contextual Hidden Variable Theory can be turned to a impossible coloring pseudo-telepathy game to be played by two distant players. The game can not be won without communication in the classical world. But if the
More than two multipartite orthogonal states cannot always be discriminated (with certainty) if o... more More than two multipartite orthogonal states cannot always be discriminated (with certainty) if only local operations and classical communication (LOCC) are allowed. Using an existing inequality among the measures of entanglement, we show that any three Bell states cannot be discriminated by LOCC. Exploiting the inequality, we calculate the distillable entanglement of a certain class of (4\otimes 4) mixed states
Non existence of Universal NOT gate for arbitrary quantum mechanical states is a fundamental cons... more Non existence of Universal NOT gate for arbitrary quantum mechanical states is a fundamental constraint on the allowed operations performed on physical systems. The largest set of states that can be flipped by using a single NOT gate is the set of states lying on a great circle of the Bloch-sphere. In this paper, we show the impossibility of universal exact-flipping operation, first by using the fact that no faster than light communication is possible and then by using the principle of “non-increase of entanglement under LOCC”. Interestingly, in both the cases, there is no violation of the two principles if and only if the set of states to be flipped, form a great circle. PACS number(s): 03.67.Mn, 03.67.Hk
Hardy's non-locality theorem for multiple two-level systems is explored in the context of gen... more Hardy's non-locality theorem for multiple two-level systems is explored in the context of generalized non-local theory. We find non-local but non-signaling probabilities satisfying Hardy's argument for two two-level and three two-level systems. Maximum probability of success of Hardy's argument is obtained for three two-level systems in quantum theory as well as in a more generalized theory. Interestingly, the maximum in the generalized non-local theory for both the two two-level systems and three two-level systems turns out to be the same.
Anonymous Veto (AV) and Dining cryptographers (DC) are two basic primitives for the cryptographic... more Anonymous Veto (AV) and Dining cryptographers (DC) are two basic primitives for the cryptographic problems where the main aim is to hide the identity of the senders of the messages. These can be achieved by classical methods where the security is based either on computational hardness or on shared private keys. In this regard, we present a secure quantum protocol for both DC and AV by exploiting the GHZ correlations. We first solve a generalized version of the DC problem with the help of multiparty GHZ state. This allow us to provide a secure quantum protocol for the AV. Securities for both the protocols rely on some novel and fundamental features of GHZ correlations related to quantum nonlocality.
Quantum mechanics is compatible with scenarios where the relative order between two events can be... more Quantum mechanics is compatible with scenarios where the relative order between two events can be indefinite. Here we show that two independent instances of a noisy process can behave as a perfect quantum communication channel when used in a coherent superposition of two alternative orders. This phenomenon occurs even if the original process has zero capacity to transmit quantum information. In contrast, perfect quantum communication does not occur when the message is sent directly from the sender to the receiver through a superposition of alternative paths, with an independent noise process acting on each path. The possibility of perfect quantum communication through independent noisy channels highlights a fundamental difference between the superposition of orders in time and the superposition of paths in space.
International Journal of Quantum Information, 2016
In 1935, Albert Einstein and two colleagues, Boris Podolsky and Nathan Rosen (EPR) developed a th... more In 1935, Albert Einstein and two colleagues, Boris Podolsky and Nathan Rosen (EPR) developed a thought experiment to demonstrate what they felt was a lack of completeness in quantum mechanics (QM). EPR also postulated the existence of more fundamental theory where physical reality of any system would be completely described by the variables/states of that fundamental theory. This variable is commonly called hidden variable and the theory is called hidden variable theory (HVT). In 1964, John Bell proposed an empirically verifiable criterion to test for the existence of these HVTs. He derived an inequality, which must be satisfied by any theory that fulfill the conditions of locality and reality. He also showed that QM, as it violates this inequality, is incompatible with any local-realistic theory. Later it has been shown that Bell’s inequality (BI) can be derived from different set of assumptions and it also find applications in useful information theoretic protocols. In this review...
Anonymous Veto (AV) and Dining cryptographers (DC) are two basic primitives for the cryptographic... more Anonymous Veto (AV) and Dining cryptographers (DC) are two basic primitives for the cryptographic problems that can hide the identity of the sender(s) of classical information. They can be achieved by classical methods and the security is based on computational hardness or requires pairwise shared private keys. In this regard, we present a secure quantum protocol for both DC and AV problems by exploiting the GHZ correlation. We first solve a generalized version of the DC problem with the help of multiparty GHZ state. This allow us to provide a secure quantum protocol for the AV problem. Security of both the protocols rely on some novel and fundamental features of the GHZ correlation known as GHZ paradox.
John Bell taught us that quantum mechanics can not be reproduced by non-contextual and local Hidd... more John Bell taught us that quantum mechanics can not be reproduced by non-contextual and local Hidden variable theory. The impossibility of replacing quantum mechanics by non-contextual Hidden Variable Theory can be turned to a impossible coloring pseudo-telepathy game to be played by two distant players. The game can not be won without communication in the classical world. But if the
Uploads
Papers