Related papers: Dilemma that cannot be resolved by biased quantum …
Quantum Fourier transform (QFT) is a key function to realize quantum computers. A QFT followed by measurement was demonstrated on a simple circuit based on fiber-optics. The QFT was shown to be robust against imperfections in the rotation…
String commitment schemes are similar to the well studied bit commitment schemes in cryptography with the difference that the committing party, say Alice, is supposed to commit a long string instead of a single bit, to another party say…
We discuss the security implications of noise for quantum coin tossing protocols. We find that if quantum error correction can be used, so that noise levels can be made arbitrarily small, then reasonable security conditions for coin tossing…
Quantum key distribution (QKD) can be used to establish a secret key between trusted parties. Many practical use-cases in communication networks, however, involve parties who do not trust each other. A fundamental cryptographic building…
In the task cryptographers call bit commitment, one party encrypts a prediction in a way that cannot be decrypted until they supply a key, but has only one valid key. Bit commitment has many applications, and has been much studied, but…
After quantum computers come out, governments and rich companies will have the abilities to buy these useful quantum computers, meanwhile they are familiar with these technologies proficiently. If a client wants to perform quantum computing…
Security trade-offs have been established for one-way bit commitment in quant-ph/0106019. We study this trade-off in two superselection settings. We show that for an `abelian' superselection rule (exemplified by particle conservation) the…
The fidelity of quantum cloning is very often limited by the accompanying unwanted transitions. We show how the fidelity can be improved by using a coherent field to cycle away the unwanted transitions. We demonstrate this explicitly in the…
The nature and scope of various impossibility proofs as they relate to real-world situations are discussed. In particular, it is shown in words without technical symbols how secure quantum bit commitment protocols may be obtained with…
The realization of devices which harness the laws of quantum mechanics represents an exciting challenge at the interface of modern technology and fundamental science. An exemplary paragon of the power of such quantum primitives is the…
One of the earliest cryptographic applications of quantum information was to create quantum digital cash that could not be counterfeited. In this paper, we describe a new type of quantum money: quantum coins, where all coins of the same…
It is widely believed that quantum key distribution (QKD) has been proved unconditionally secure for realistic models applicable to various current experimental schemes. Here we summarize briefly why this is not the case, from both the…
The counterfeit coin problem requires us to find all false coins from a given bunch of coins using a balance scale. We assume that the balance scale gives us only ``balanced'' or ``tilted'' information and that we know the number k of false…
Quantum computation can be performed by encoding logical qubits into the states of two or more physical qubits, and controlling a single effective exchange interaction and possibly a global magnetic field. This "encoded universality"…
Getting an unbiased result is a remarkably long standing problem of collective observation/measurement. It is pointed out that quantum coin tossing can generate unbiased result defeating dishonesty.
Unknown quantum information cannot be perfectly copied (cloned). This statement is the bedrock of quantum technologies and quantum cryptography, including the seminal scheme of Wiesner's quantum money, which was the first…
Forty years ago, Wiesner proposed using quantum states to create money that is physically impossible to counterfeit, something that cannot be done in the classical world. However, Wiesner's scheme required a central bank to verify the…
Recent results of Kaplan et al., building on previous work by Kuwakado and Morii, have shown that a wide variety of classically-secure symmetric-key cryptosystems can be completely broken by quantum chosen-plaintext attacks (qCPA). In such…
This paper addresses the controversy between Mayers, Lo and Chau on one side, and Yuen on the opposite side, on whether there exist or not unconditionally secure protocols. For such purpose, a complete classification of all possible bit…
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…