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… Expand

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.Expand

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.Expand

This Letter shows that it is possible to perform entanglement distillation in the double-server scheme without degrading the security of blind quantum computing.Expand

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.Expand

This work proposes a simple protocol for the verification of quantum computation after the computation has been performed that requires only a single prover, who is restricted to measuring qubits in the X or Z basis, while requiring only one way communication, from the prover to the verifier.Expand

This paper shows that a variety of many-qubit quantum states can be verified with only sequential single-qu bit measurements of Pauli operators, and introduces a protocol for verifying ground states of Hamiltonians and proposes an adaptive test of stabilizers.Expand

A new scheme for BQC is presented that uses the concept of the measurement based quantum computing with the novel resource state of Affleck-Kennedy-Lieb-Tasaki (AKLT) chains leading to more robust computation.Expand

It is shown that it is indeed possible to improve the multiplicative error hardness result to a constant total variation distance error one like other sub-universal quantum computing models such as the IQP model, the Boson Sampled model, and the Fourier Sampling model if the authors accept a modified version of the average case hardness conjecture.Expand

This work introduces a protocol of measurement-only verifiable blind quantum computing where the correctness of the quantum input is also verifiable.Expand