• Corpus ID: 1679267

Blind quantum computing with two almost identical states

@article{Dunjko2016BlindQC,
  title={Blind quantum computing with two almost identical states},
  author={Vedran Dunjko and Elham Kashefi},
  journal={ArXiv},
  year={2016},
  volume={abs/1604.01586}
}
The question of whether a fully classical client can delegate a quantum computation to an untrusted quantum server while fully maintaining privacy (blindness) is one of the big open questions in quantum cryptography. Both yes and no answers have important practical and theoretical consequences, and the question seems genuinely hard. The state-of-the-art approaches to securely delegating quantum computation, without exception, rely on granting the client modest quantum powers, or on additional… 
Garbled Quantum Computation
TLDR
This contribution explores the possibility of extending the verifiable UBQC, and presents a “Yao”-type protocol for secure two-party quantum computation that is secure against a specious (quantum honest-but-curious) garbler, but in this case, against a (fully) malicious evaluator.
Explorer Garbled Quantum Computation
TLDR
This contribution presents a “Yao”-type protocol for secure two-party quantum computation, which is secure against a specious (quantum honest-but-curious) garbler, but in this case, against a (fully) malicious evaluator.
Extending the delegated verifiable blind quantum computation functionality
TLDR
This contribution explores the asymmetric nature of UBQC and presents a "Yao" type protocol for secure two party quantum computation, which is secure against a specious (quantum honest-but-curious) garbler but in this case, against a (fully) malicious evaluator.
On the Possibility of Classical Client Blind Quantum Computing
TLDR
Using the functionality of delegated pseudo-secret random qubit generator (PSRQG), a classical client can instruct the preparation of a sequence of random qubits at some distant party, one could achieve a purely classical-client computational secure verifiable delegated universal quantum computing (also referred to as verifiable blind quantum computation).
On the implausibility of classical client blind quantum computing
TLDR
Using the functionality of delegated pseudo-secret random qubit generator (PSRQG), a classical client can instruct the preparation of a sequence of random qubits at some distant party, one could achieve a purely classical-client computational secure verifiable delegated universal quantum computing (also referred to as verifiable blind quantum computation).
Flow ambiguity: A path towards classically driven blind quantum computation
TLDR
This work shows how a classical client can exploit the ambiguity in the flow of information in measurement-based quantum computing to construct a protocol for hiding critical aspects of a computation delegated to a remote quantum computer.
Blind quantum computing can always be made verifiable
TLDR
A plug-in is proposed that makes any universal blind quantum computing protocol automatically verifiable and blindly generates Feynman-Kitaev history states corresponding to the quantum circuit that solves client's problem and its complement circuit.
Universal single-server blind quantum computation for classical clients
TLDR
An analysis of this protocol is presented and a new ‘Cloud + Certificate Authority (CA)’ style is proposed for the BQC, which is modified to a universal single-server and fully-classical-client BZC protocol by improving the ability of the trusted center.
Universal blind quantum computation for hybrid system
TLDR
Here, the first step is taken to construct a framework of blind quantum computation for the hybrid system, which provides a more feasible way for scalableblind quantum computation.
Complexity-Theoretic Limitations on Blind Delegated Quantum Computation
TLDR
This paper shows that if an ITS-BQC protocol exists with polynomial classical communication and which allows the client to delegate quantum sampling problems, then there exist non-uniform circuits of size that make polynomially-sized queries to an oracle.
...
1
2
3
...

References

SHOWING 1-10 OF 47 REFERENCES
Universal Blind Quantum Computation
TLDR
The protocol is the first universal scheme which detects a cheating server, as well as the first protocol which does not require any quantum computation whatsoever on the client's side.
Demonstration of Blind Quantum Computing
TLDR
An experimental demonstration of blind quantum computing in which the input, computation, and output all remain unknown to the computer is presented and the conceptual framework of measurement-based quantum computation that enables a client to delegate a computation to a quantum server is exploited.
Ideal quantum protocols in the non-ideal physical world
TLDR
This thesis introduces approximate blindness quantifying any compromise to privacy, and proposes a protocol which enables arbitrary levels of security despite imperfections, and investigates the adaptability of UBQC to alternative implementations with practical advantages.
Continuous-variable blind quantum computation.
  • T. Morimae
  • Computer Science, Physics
    Physical review letters
  • 2012
TLDR
It is shown that blind quantum computation is possible for the infinite squeezing case and that the finite squeezing causes no additional problem in the blind setup apart from the one inherent to the continuous-variable measurement-based quantum computation.
Blind topological measurement-based quantum computation
TLDR
This work shows that fault-tolerant blind quantum computation is possible in a topologically protected manner using the Raussendorf–Harrington–Goyal scheme, and implies that secure cloud quantum computations is within reach.
Verification for measurement-only blind quantum computing
TLDR
This paper proposes a protocol of verification for the measurement-only blind quantum computing, a new secure quantum computing protocol where a client who does not have any sophisticated quantum technlogy can delegate her quantum computing to a server without leaking any privacy.
Blind quantum computing with weak coherent pulses.
TLDR
The concept of ϵ blindness for UBQC is introduced, in analogy to the concept ofπ security developed for other cryptographic protocols, allowing us to characterize the robustness and security properties of the protocol under possible imperfections.
Optimal Blind Quantum Computation
TLDR
This work presents general techniques for upper and lower bounding the quantum communication necessary to perform blind quantum computation, and uses these techniques to establish concrete bounds for common choices of the client's quantum capabilities.
Unconditionally verifiable blind computation
TLDR
This paper rigorously proves that the probability of detecting an incorrect output is exponentially small in a security parameter, while resource overhead remains polynomial in this parameter, which is a significant improvement on the original BQC scheme, which required that all computations to be performed must first be put into a nearest neighbour form.
Quantum computing on encrypted data.
TLDR
It is proved that an untrusted server can implement a universal set of quantum gates on encrypted quantum bits (qubits) without learning any information about the inputs, while the client, knowing the decryption key, can easily decrypt the results of the computation.
...
1
2
3
4
5
...