Related papers: Quantum Cryptography with Orthogonal States?
A recent publication by the NSA assessing the usability of quantum cryptography has generated significant attention, concluding that this technology is not recommended for use. Here, we reply to this criticism and argue that some of the…
We show that a secure quantum protocol for coin tossing exist. The existence of quantum coin tossing support the conjecture of D.Mayers [Phys.Rev.Lett. 78, 3414(1997)] that only asymmetrical tasks as quantum bit commitment are impossible.
The concept of asymptotic correctability of Bell-diagonal quantum states is generalised to elementary quantum systems of higher dimensions. Based on these results basic properties of quantum state purification protocols are investigated…
We present a number of schemes that use quantum mechanics to preserve privacy, in particular, we show that entangled quantum states can be useful in maintaining privacy. We further develop our original proposal [see Phys. Lett. A 349, 75…
In this expository article we present an overview of the current state-of-the-art in post-quantum group-based cryptography. We describe several families of groups that have been proposed as platforms, with special emphasis in polycyclic…
We show an eavesdropping scheme, by which the eavesdropper can achieve the full information of the key against the protocol [Kye et al., PRL 95 040501 (2005)] with a probability of unity and will not be discovered by the the legitimate…
We reply to the Comment made in arXiv:1107.4435v1 [quant-ph] (Phys. Lett. A \textbf{374} (2010) 1097) by noting some erroneous considerations therein resulting in a misleading view of the quantum key distribution protocol in question. We…
We propose an approach to optical quantum computation in which a deterministic entangling quantum gate may be performed using, on average, a few hundred coherently interacting optical elements (beamsplitters, phase shifters, single photon…
The quantum computing scheme described in Phys. Rev. Lett. 98, 190504 (2007), when viewed as a cluster state computation, features a 3-D cluster state, novel adjustable strength error correction capable of correcting general errors through…
I'm grateful to Oded Goldreich for inviting me to the 2005 Oberwolfach Meeting on Complexity Theory. In this extended abstract, which is based on a talk that I gave there, I demonstrate that gratitude by explaining why Goldreich's views…
We present a generalized tomographic quantum key distribution protocol in which the two parties share a Bell diagonal mixed state of two qubits. We show that if an eavesdropper performs a coherent measurement on many quantum ancilla states…
We consider two quantum cryptographic schemes relying on encoding the key into qudits, i.e. quantum states in a d-dimensional Hilbert space. The first cryptosystem uses two mutually unbiased bases (thereby extending the BB84 scheme), while…
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…
We reply to Comment by J. Gemmer, L. Knipschild, R. Steinigeweg (arXiv:1712.02128) on our paper Phys. Rev. Lett. 119, 100601 (2017).
Graph states have been used for quantum error correction by Schlingemann et al. [Physical Review A 65.1 (2001): 012308]. Hypergraph states [Physical Review A 87.2 (2013): 022311] are generalizations of graph states and they have been used…
Quantum cryptography is a rapidly-developing area which leverages quantum information to accomplish classically-impossible tasks. In many of these protocols, quantum states are used as long-term cryptographic keys. Typically, this is to…
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is "secure" against any polynomial-time quantum adversary. Our problem,…
A Comment on the Letter by B. Kraus {\it Phys. Rev. Lett.}{\bf 104}, 020504 (2010).
Comment on the Letter ``Polynomial-Time Simulation of Pairing Models on a Quantum Computer'', L. A. Wu, M. S. Byrd and D. A. Lidar, Phys. Rev. Lett. 89, 057904 (2002).
On July 5, 2022, the National Institute of Standards and Technology announced four possible post-quantum cryptography standards, three of them are based on lattice theory and the other one is based on Hash function. It is well-known that…