Related papers: Perfect cheating is impossible for single-qubit po…
Self-testing is a promising approach to certifying quantum states or measurements. Originally, it relied solely on the outcome statistics of the measurements involved in a device-independent (DI) setup. Extra physical assumptions about the…
A proof of quantumness (PoQ) allows a classical verifier to efficiently test if a quantum machine is performing a computation that is infeasible for any classical machine. In this work, we propose a new approach for constructing PoQ…
We present a new simulation-secure quantum oblivious transfer (QOT) protocol based on one-way functions in the plain model. With a focus on practical implementation, our protocol surpasses prior works in efficiency, promising feasible…
Recently it has been shown how the use of quantum entanglement can lead to the creation of real-time communication channels whose viability can be made location dependent. Such functionality leads to new security paradigms that are not…
An important class of cryptographic applications of relativistic quantum information work as follows. B generates a random qudit and supplies it to A at point P. A is supposed to transmit it at near light speed c to to one of a number of…
In this letter we consider the problem of certification of quantum measurements with an arbitrary number of outcomes. We propose a simple scheme for certifying any set of $d$-outcome projective measurements which do not share any common…
Protocols for quantum position verification (QPV) which combine classical and quantum information are insecure in the presence of loss. We study the exact loss-tolerance of the most popular protocol for QPV, which is based on BB84 states,…
Efficient verification of pure quantum states in the adversarial scenario is crucial to many applications in quantum information processing, such as blind measurement-based quantum computation and quantum networks. However, little is known…
We present security proofs for a protocol for Quantum Key Distribution (QKD) based on encoding in finite high-dimensional Hilbert spaces. This protocol is an extension of Bennett's and Brassard's basic protocol from two bases, two state…
Quantum bit commitment has long been known to be impossible. Nevertheless, just as in the classical case, imposing certain constraints on the power of the parties may enable the construction of asymptotically secure protocols. Here, we…
We present the first experimental demonstration of the maximum confidence measurement strategy for quantum state discrimination. Applying this strategy to an arbitrary set of states assigns to each input state a measurement outcome which,…
Quantum state tomography is the standard tool in current experiments for verifying that a state prepared in the lab is close to an ideal target state, but up to now there were no rigorous methods for evaluating the precision of the state…
Verification of quantum computation is a task to efficiently check whether an output given from a quantum computer is correct. Existing verification protocols conducted between a quantum computer to be verified and a verifier necessitate…
A two-layer quantum protocol for secure transmission of data using qubits is presented. The protocol is an improvement over the BB84 QKD protocol. BB84, in conjunction with the one-time pad algorithm, has been shown to be unconditionally…
We use the entanglement sampling techniques developed by Dupuis, Fawzi and Wehner to find a lower bound on the entanglement needed by a coalition of cheater attacking the quantum position verification protocol using the four BB84 states in…
Entanglement-measurement attack is one of the most famous attacks against quantum cryptography. In quantum cryptography protocols, eavesdropping checking is an effective means to resist this attack. There are currently two commonly used…
Secret sharing and multiparty computation (also called "secure function evaluation") are fundamental primitives in modern cryptography, allowing a group of mutually distrustful players to perform correct, distributed computations under the…
The problem of reliably certifying the outcome of a computation performed by a quantum device is rapidly gaining relevance. We present two protocols for a classical verifier to verifiably delegate a quantum computation to two…
We present a novel protocol for high-fidelity qubit state preparation and measurement (SPAM) that combines standard SPAM methods with a series of in-sequence measurements to detect and remove errors. The protocol can be applied in any…
Unconditionally secure quantum bit commitment (QBC) was widely believed to be impossible for more than two decades. But recently, based on an anomalous behavior found in quantum steering, we proposed a QBC protocol which can be…