Related papers: On the impossibility of non-static quantum bit com…
A novel no-go theorem is presented which sets a bound upon the extent to which '\Psi-epistemic' interpretations of quantum theory are able to explain the overlap between non-orthogonal quantum states in terms of an experimenter's ignorance…
In this perspective article, we revisit and critically evaluate prevailing viewpoints on the capabilities and limitations of near-term quantum computing and its potential transition toward fully fault-tolerant quantum computing. We examine…
A one way partial quantum bit commitment protocol is developed, using states with built-in classical correlation, completely independent of entanglement. It involves concealing information in a set of mutually non-orthogonal states and…
Since unconditionally secure quantum two-party computations are known to be impossible, most existing quantum private comparison (QPC) protocols adopted a third party. Recently, we proposed a QPC protocol which involves two parties only,…
In this work, we reveal a new type of impossibility discovered in our recent research which forbids comparing the closeness of multiple unknown quantum states with any non-trivial threshold in a perfect or an unambiguous way. This…
In this paper, we mainly study the local distinguishable multipartite quantum states by local operations and classical communication (LOCC) in $m_1\otimes m_2\otimes\ldots\otimes m_n$ , where the quantum system $m_1$ belongs to Alice, $m_2$…
The linear superposition principle in quantum mechanics is essential for several no-go theorems such as the no-cloning theorem, the no-deleting theorem and the no-superposing theorem. It remains an open problem of finding general forbidden…
Photonic quantum systems are among the most promising architectures for quantum computers. It is well known that for dual-rail photons effective non-linearities and near-deterministic non-trivial two-qubit gates can be achieved via the…
Bit commitment is a fundamental cryptographic primitive and a cornerstone for numerous two-party cryptographic protocols, including zero-knowledge proofs. However, it has been proven that unconditionally secure bit commitment, both…
Bit commitment is a fundamental cryptographic task that guarantees a secure commitment between two mutually mistrustful parties and is a building block for many cryptographic primitives, including coin tossing, zero-knowledge proofs,…
We consider the implementation of two-party cryptographic primitives based on the sole assumption that no large-scale reliable quantum storage is available to the cheating party. We construct novel protocols for oblivious transfer and bit…
After formulating a no-go theorem for perfect quantum-classical hybrid systems, a new consistency requirement based on standard statistical considerations is noted. It is shown that such requirement is not fulfilled by the mean-field…
Symmetries of both closed and open-system dynamics imply many significant constraints. These generally have instantiations in both classical and quantum dynamics (Noether's theorem, for instance, applies to both sorts of dynamics). We here…
A simple un-entanglement based quantum bit commitment scheme is presented. Although commitment is unconditionally secure but concealment is not.
A collapse-free version of quantum theory is examined to systematically study the role of the projection postulate. This foil theory assumes "passive" measurements that do not update quantum states although measurement outcomes still occur…
Quantum coin flipping (QCF) is an essential primitive for quantum cryptography. Unconditionally secure strong QCF with an arbitrarily small bias was widely believed to be impossible. But basing on a problem which cannot be solved without…
Unconditionally secure non-relativistic bit commitment is known to be impossible in both the classical and the quantum world. However, when committing to a string of n bits at once, how far can we stretch the quantum limits? In this letter,…
The quantum logic gates used in the design of a quantum computer should be both universal, meaning arbitrary quantum computations can be performed, and fault-tolerant, meaning the gates keep errors from cascading out of control. A number of…
The renowned Local Friendliness no-go theorem demonstrates the incompatibility of quantum theory with the combined assumptions of Absoluteness of Observed Events - the idea that observed outcomes are singular and objective - and Local…
Recently, it has been argued that quantum mechanics is a complete theory, and that different quantum states do necessarily correspond to different elements of reality, under the assumptions that quantum mechanics is correct and that…