Public verifiable measurement-only blind quantum computation based on entanglement witnesses
arXiv:2310.02922 · doi:10.1007/s11128-023-03859-9
Abstract
Recently, Sato et al. proposed an public verifiable blind quantum computation (BQC) protocol by inserting a third-party arbiter. However, it is not true public verifiable in a sense, because the arbiter is determined in advance and participates in the whole process. In this paper, a public verifiable protocol for measurement-only BQC is proposed. The fidelity between arbitrary states and the graph states of 2-colorable graphs is estimated by measuring the entanglement witnesses of the graph states,so as to verify the correctness of the prepared graph states. Compared with the previous protocol, our protocol is public verifiable in the true sense by allowing other random clients to execute the public verification. It also has greater advantages in the efficiency, where the number of local measurements is O(n^3*log {n}) and graph states' copies is O(n^2*log{n}).
arXiv comment17 pages, 5 figures
References in corpus (16)
- Entanglement detection
- Topological fault-tolerance in cluster state quantum computation
- Universal blind quantum computation
- Unconditionally verifiable blind computation
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Blind quantum computation protocol in which Alice only makes measurements
- Fault tolerant quantum computation with very high threshold for loss errors
- Quantum one-time programs
- Verification of Many-Qubit States
- Investigating three qubit entanglement with local measurements
- Self-guaranteed measurement-based quantum computation
- Resource-efficient verification of quantum computing using Serfling's bound
- Verifiable fault-tolerance in measurement-based quantum computation
- Delegating Private Quantum Computations
- Measurement-only verifiable blind quantum computing with quantum input verification
- Publicly Verifiable Blind Quantum Computation