Related papers: Verification for measurement-only blind quantum co…
Quantum tomography makes it possible to obtain comprehensive information about certain logical elements of a quantum computer. In this regard, it is a promising tool for debugging quantum computers. The practical application of tomography,…
In this paper, we propose a novel semiquantum proxy blind signature scheme with quantum teleportation based on X states, where the original message owner, the proxy signer and the third party are quantum participants with complete quantum…
A quantum metrology scheme can be decomposed into three quantum tasks: state preparation, parameter encoding and measurements. Consequently, it is imperative to have access to the technologies which can execute the aforementioned tasks to…
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify the quantum advantage of an untrusted prover. That is, a quantum prover can correctly answer the verifier's challenges and…
Secure multi-party computing, also called "secure function evaluation", has been extensively studied in classical cryptography. We consider the extension of this task to computation with quantum inputs and circuits. Our protocols are…
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…
Quantum computing has seen tremendous progress in the past years. Due to the implementation complexity and cost, the future path of quantum computation is strongly believed to delegate computational tasks to powerful quantum servers on…
The counterfactuality of recently proposed protocols is analyzed. A definition of `counterfactuality' is offered and it is argued that an interaction-free measurement of the presence of an opaque object can be named `counterfactual', while…
Randomized encoding is a powerful cryptographic primitive with various applications such as secure multiparty computation, verifiable computation, parallel cryptography, and complexity lower-bounds. Intuitively, randomized encoding…
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…
Oblivious transfer is a powerful cryptographic primitive that is complete for secure multi-party computation. In oblivious transfer protocols a user sends one or more messages to a receiver, while the sender remains oblivious as to which…
This paper devises a simple quantum bit commitment protocol that is just as easy to implement as any existing practical quantum bit commitment protocols but will be more secure. It will be infinitely close to being unconditionally fully…
Various techniques have been used in recent years for verifying quantum computers, that is, for determining whether a quantum computer/system satisfies a given formal specification of correctness. Barrier certificates are a recent novel…
In general, a quantum measurement yields an undetermined answer and alters the system to be consistent with the measurement result. This process maps multiple initial states into a single state and thus cannot be reversed. This has…
Quantum computing hardware has grown sufficiently complex that it often can no longer be simulated by classical computers, but its computational power remains limited by errors. These errors corrupt the results of quantum algorithms, and it…
Typically, the aim of quantum metrology is to sense target fields with high precision utilizing quantum properties. Unlike the typical aim, in this paper, we use quantum properties for adding a new functionality to quantum sensors. More…
A simple and efficient protocol for quantum oblivious transfer is proposed. The protocol can easily be implemented with present technology and is secure against cheaters with unlimited computing power provided the receiver does not have the…
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 present two verification protocols where the correctness of a "target" computation is checked by means of "trap" computations that can be efficiently simulated on a classical computer. Our protocols rely on a minimal set of noise-free…
We present a method to test quantum behavior of quantum information processing devices, such as quantum memories, teleportation devices, channels and quantum key distribution protocols. The test of quantum behavior can be phrased as the…