Experimental Blind Quantum Computing for a Classical Client.

@article{Huang2017ExperimentalBQ,
  title={Experimental Blind Quantum Computing for a Classical Client.},
  author={He-Liang Huang and Qi Zhao and Xiongfeng Ma and Chang Liu and Zu-En Su and Xi-Lin Wang and Li Li and Nai-Le Liu and Barry C. Sanders and Chaoyang Lu and Jian-Wei Pan},
  journal={Physical review letters},
  year={2017},
  volume={119 5},
  pages={
          050503
        }
}
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 share entanglement, the client accomplishes the task of having the number 15 factorized by servers who are denied information about the computation itself. This concealment is accompanied by a verification protocol that tests servers' honesty and correctness. Our… 

Figures from this paper

Single-server blind quantum computation with quantum circuit model
TLDR
A single-server BQC protocol with quantum circuit model is proposed by replacing any quantum gate with the combination of rotation operators, such that the server is unknown about quantum algorithms.
A hybrid universal blind quantum computation
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.
Gate Teleportation-based Universal Blind Quantum Computation
TLDR
The blindness and correctness of GTUBQC are proved, and the approach is applied to other types of computational tasks, such as quantum Fourier transform, to solve the challenge to directly encrypt quantum algorithms in circuits model.
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.
Blinding quantum computation using alternative sources
TLDR
This analysis shows that a heralded single-photon source can significantly improve the transmitted distance of UBQC and a modified coherent source can reduce the required transmitted number of pulses, and the finite-data-size effect is studied, which is a crucial for real-world applications.
Remote Blind State Preparation with Weak Coherent Pulses in the Field.
TLDR
The results prove the feasibility of UBQC over long distances, and thus serves as a key milestone towards secure cloud quantum computing.
Ju l 2 01 9 Gate Teleportation-based Universal Blind Quantum Computation
TLDR
It is proved the blindness and correctness of GTUBQC, the first gate teleportation-based universal BQC protocol, and the approach is applied to other types of computational tasks, such as quantum Fourier transform.
Remote-controlled quantum computing by quantum entanglement.
TLDR
A model of remote-controlled quantum computing and an optical scheme to realize this model for a single qubit is proposed and three Pauli operators are implemented, contributing to secure remote quantum information processing.
Measurement-based universal blind quantum computation with minor resources
TLDR
This paper proposes a universal BQC protocol based on measurement with minor resources, where the trap technology is adopted to verify correctness of the server's measurement outcomes during computation and testing process, and analyzes and proves the blindness, correctness, universality and verifiability of this protocol.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 54 REFERENCES
Demonstration of measurement-only blind quantum computing
TLDR
A proof-of-principle implementation of this measurement-only blind quantum computing, exploiting a photonic setup to generate four-qubit cluster states for computation and verification.
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.
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.
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.
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.
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.
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.
Robustness and device independence of verifiable blind quantum computing
TLDR
The robustness of the single server verifiable universal blind quantum computing protocol of Fitzsimons and Kashefi is proved in the most general scenario and the composition of this protocol with a device-independent state tomography protocol that is based on the rigidity of CHSH games as proposed by Reichardt et al.
Experimental verification of quantum computation
TLDR
A protocol for testing a quantum computer using minimum quantum resources has been proposed and demonstrated and Alice can verify the result of a quantum computation that she has delegated to Bob without using a quantumComputer.
Verifiable Measurement-Only Blind Quantum Computing with Stabilizer Testing.
We introduce a simple protocol for verifiable measurement-only blind quantum computing. Alice, a client, can perform only single-qubit measurements, whereas Bob, a server, can generate and store
...
1
2
3
4
5
...