Related papers: Comment on "Quantum identification schemes with en…

We propose a decision procedure for analysing security of quantum cryptographic protocols, combining a classical algebraic rewrite system for knowledge with an operational semantics for quantum distributed computing. As a test case, we use…

Starting from Barnum's recent proposal to use entanglement and catalysis for quantum secure identification [quant-ph/9910072], we describe a protocol for quantum authentication and authenticated quantum key distribution. We argue that our…

This study introduces a hybrid cryptographic framework for quantum communication that integrates entanglement-assisted decryption with phase-based physical obfuscation. While conventional quantum protocols often rely on explicit…

In a recent Letter (Phys. Rev. Lett. 95 (2005) 010503) Barrett, Hardy and Kent (BHK) considered a very interesting question which of the fundamental laws of physics ensure security of quantum cryptographic protocols. In particular, they…

We use an alternative approach to show that quantum entanglement-like correlations cannot be reproduced for any classical protocol. In our proposal, quantum geometric restrictions are impose over the physical system related to the existence…

In the paper [Zhang, Li and Guo, Phys. Rev. A 64, 024302 (2001)], a quantum key distribution protocol based on quantum encryption was proposed, in which the quantum key can be reused. However, it is shown that, if Eve employs a special…

The following paper presents a holistic approach to the processing of entangled links within entanglement based quantum key distribution protocols, whose security relies on the Bell inequality. We investigate the interactions, and the…

Quantum communication represents a revolutionary advancement over classical information theory, which leverages unique quantum mechanics properties like entanglement to achieve unprecedented capabilities in secure and efficient information…

The differential-phase-shift quantum key distribution protocol is formalised as a prepare-and-measure scheme and translated into an equivalent entanglement-based protocol. A necessary condition for security is that Bob's measurement can…

Bit commitment schemes are at the basis of modern cryptography. Since information-theoretic security is impossible both in the classical and the quantum regime, we need to look at computationally secure commitment schemes. In this paper, we…

The study of quantum cryptography and quantum non-locality have traditionnally been based on two-level quantum systems (qubits). In this paper we consider a generalisation of Ekert's cryptographic protocol [Ekert] where qubits are replaced…

Quantum entanglement, as the strictly non-classical phenomena, is the kernel of quantum computing and quantum simulation, and has been widely applied ranging from fundamental tests of quantum physics to quantum information processing. The…

Recent experimental tests of Bell inequalities confirm that entangled quantum systems cannot be described by local classical theories but still do not answer the question whether or not quantum systems could in principle be modelled by…

Sequences of commuting quantum operators can be parallelized using entanglement. This transformation is behind some optimal quantum metrology protocols and recent results on quantum circuit complexity. We show that dephasing quantum maps in…

We make remarks on the paper of Du et al (quant-ph/0011078) by pointing out that the quantum strategy proposed by the paper is trivial to the card game and proposing a simple classical strategy to make the game in classical sense fair too.

In [M. Piani et al., arXiv:1103.4032 (2011)] an activation protocol was introduced which maps the general non-classical (multipartite) correlations between given systems into bipartite entanglement between the systems and local ancillae by…

We argue that entanglement is the essential non-classical ingredient which provides the computational speed-up in quantum algorithms as compared to algorithms based on the processes of classical physics.

The frame of classical probability theory can be generalized by enlarging the usual family of random variables in order to encompass nondeterministic ones: this leads to a frame in which two kinds of correlations emerge: the classical…

We consider quantum computing with pseudo-pure states. This framework arises in certain implementations of quantum computing using NMR. We analyze quantum computational protocols which aim to solve exponential classical problems with…

It is shown how the evidence state space in quantum bit commitment may be made to depend on the bit value 0 or 1 with split entangled pairs. As a consequence, one can obtain a protocol that is perfectly concealing, but is also…