Flow ambiguity: A path towards classically driven blind quantum computation

@article{Mantri2016FlowAA,
  title={Flow ambiguity: A path towards classically driven blind quantum computation},
  author={A. N. Mantri and Tommaso F. Demarie and Nicolas C. Menicucci and Joseph Fitzsimons},
  journal={ArXiv},
  year={2016},
  volume={abs/1608.04633}
}
Blind quantum computation protocols allow a user to delegate a computation to a remote quantum computer in such a way that the privacy of their computation is preserved, even from the device implementing the computation. To date, such protocols are only known for settings involving at least two quantum devices: either a user with some quantum capabilities and a remote quantum server or two or more entangled but noncommunicating servers. In this work, we take the first step towards the… 

Figures from this paper

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).
Impossibility of blind quantum sampling for classical client
TLDR
If a completely classical client can blindly delegate sampling of subuniversal models, such as the DQC1 model and the IQP model, then the polynomial-time hierarchy collapses to the third level.
Classical Verification and Blind Delegation of Quantum Computations
TLDR
This dissertation gives the first protocol for provable classical verifica- tion of efficient quantum computations, depending only on the assumption that the learning with errors problem is post-quantum secure.
Delegating Multi-Party Quantum Computations vs. Dishonest Majority in Two Quantum Rounds
TLDR
The main technical ingredient of the paper is the bootstraping of the MPQC construction by Double Blind Quantum Computation, a new composable resource for blind multiparty quantum computation, that demonstrates the surprising fact that the full protocol does not require verifiability of all components to achieve security.
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.
Delegated Pseudo-Secret Random Qubit Generator
TLDR
Using the functionality of delegated pseudo-secret random qubit generator (PSRQG), one could achieve for the first time a purely classical-client computational secure verifiable delegated universal quantum computing (also referred to as verifiable blind quantum computation).
Robust verification of quantum computation
TLDR
This work considers a single-prover verification protocol developed by Fitzsimons and Kashefi and shows that this protocol is indeed robust with respect to deviations on the quantum state prepared by the verifier, and proves a rigidity result for a type of quantum correlations known as steering correlations.
Private quantum computation: an introduction to blind quantum computing and related protocols
TLDR
A review of the progress to date in quantum cryptography protocols addressing the task of securely delegating quantum computation to an untrusted device while maintaining the privacy, and in some instances the integrity, of the computation.
Self-guaranteed measurement-based quantum computation
TLDR
A "self-guaranteed" protocol for verification of quantum computation under the scheme of measurement-based quantum computation where no prior-trusted devices (measurement basis nor entangled state) are needed.
...
1
2
3
...

References

SHOWING 1-10 OF 73 REFERENCES
Blind quantum computing with two almost identical states
TLDR
This work identifies sufficient criteria on the powers of the client, which still allow for secure blind quantum computation, in a universally composable framework, and provides a series of protocols, where each step reduces the number of differing states the client needs to be able to prepare.
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.
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.
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).
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.
Blind quantum computation protocol in which Alice only makes measurements
TLDR
This work proposes another type of blind computing protocol where Alice does only measurements, such as the polarization measurements with a threshold detector, and the security of the protocol is based on the no-signaling principle, which is more fundamental than quantum physics.
Unconditionally verifiable blind quantum computation
TLDR
It is rigorously proved that the probability of failing to detect an incorrect output is exponentially small in a security parameter, while resource overhead remains polynomial in this parameter, which allows entangling gates to be performed between arbitrary pairs of logical qubits with only constant overhead.
Iterated Gate Teleportation and Blind Quantum Computation.
TLDR
This work shows that a bound based on the no-programming theorem only holds in limited scenarios, and shows how to overcome it using a novel method of iterated gate teleportations, which enables drastic reductions in the communication required for distributed quantum protocols, extending beyond the blind computation setting.
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.
...
1
2
3
4
5
...