Verifiable delegated quantum computation with χ-type entangled states

•Alice can verify the correctness of measurement outcomes. The task of preparing source states is assigned to Bob2.•χ-type entangled states are used as source states, because they have remarkable features.•The verifiable process uses the properties of blind brickwork states and topological entangled states. It is deceptive for three servers.

A delegated quantum computation protocol that includes three servers Bob1, Bob2 and Bob3 and a client Alice is proposed, which is with four-particle χ-type entangled states that have a good property is the other two particles can collapse into a certain Bell state if the first two particles are measured. Alice only needs to be capable of getting access to quantum channels and perform Pauli operation and also has a memory of two graph states brickwork state and blind topological entangled state, but she does not need to prepare any quantum state in this paper. Our protocol is without a trusted center which will save funds, sources and quantum devices, and can verify the correctness of measurement outcomes by quantum entanglement of |χij〉3124. At last, we also give blind analysis and proof rigorously.