Related papers: Delegating Private Quantum Computations
Blind quantum computation (BQC) protocol allows a client having partially quantum ability to del- egate his quantum computation to a remote quantum server without leaking any information about the input, the output and the intended…
Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal…
Digital signatures are a powerful cryptographic tool widely employed across various industries for securely authenticating the identity of a signer during communication between signers and verifiers. While quantum digital signatures have…
Bit commitment is a fundamental cryptographic primitive in which Bob wishes to commit a secret bit to Alice. Perfectly secure bit commitment has been proven impossible through asynchronous exchange of classical and quantum information.…
To date, blind quantum computing demonstrations require clients to have weak quantum devices. Here we implement a proof-of-principle experiment for completely classical clients. Via classically interacting with two quantum servers that…
We present protocols for multiparty data hiding of quantum information that implement all possible threshold access structures. Closely related to secret sharing, data hiding has a more demanding security requirement: that the data remain…
Quantum secret sharing is a method for sharing a secret quantum state among a number of individuals such that certain authorized subsets of participants can recover the secret shared state by collaboration and other subsets cannot. In this…
Universal set of quantum gates are realized from the conduction-band electron spin qubits of quantum dots embedded in a microcavity via two-channel Raman interaction. All of the gate operations are independent of the cavity mode states,…
Blind quantum computation (BQC) protocols enable quantum algorithms to be executed on third-party quantum agents while keeping the data and algorithm confidential. The previous proposals for measurement-based BQC require preparing a highly…
A quantum cryptographic protocol based in public key cryptography combinations and private key cryptography is presented. Unlike the BB84 protocol [1] and its many variants [2,3] two quantum channels are used. The present research does not…
In the medium term, quantum computing must tackle two key challenges: fault tolerance and security. Fault tolerance will be solved with sufficiently high quality experiments on large numbers of qubits, but the scale and complexity of these…
Quantum key distribution (QKD) is a provably secure way for two distant parties to establish a common secret key, which then can be used in a classical cryptographic scheme. Using quantum entanglement, one can reduce the necessary…
We describe how any two-party quantum computation, specified by a unitary which simultaneously acts on the registers of both parties, can be privately implemented against a quantum version of classical semi-honest adversaries that we call…
We propose a quantum key distribution protocol with quantum based user authentication. Our protocol is the first one in which users can authenticate each other without previously shared secret and then securely distribute a key where the…
The delegating private quantum computation (DQC) protocol with the universal quantum gate set $\left\{ {X,Z,H,P,R,CNOT} \right\}$ was firstly proposed by Broadbent \emph{et al.}, and then Tan \emph{et al.} tried to put forward an half-blind…
We discuss how blind quantum computing generalizes to multi-level quantum systems (qudits), which offers advantages compared to the qubit approach. Here, a quantum computing task is delegated to an untrusted server while simultaneously…
Distributed quantum computing is motivated by the difficulty in building large-scale, individual quantum computers. To solve that problem, a large quantum circuit is partitioned and distributed to small quantum computers for execution.…
There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and 2-qubit CNOT gates. A CNOT gate is however…
We present authorized quantum computation, where only a user with a non-cloneable quantum authorization key can perform a unitary operation created by an authenticated programmer. The security of our authorized quantum computation is based…
The oblivious transfer primitive is sufficient to implement secure multiparty computation. However, secure multiparty computation based only on classical cryptography is severely limited by the security and efficiency of the oblivious…