Multi-agent blind quantum computation without universal cluster states
arXiv:2206.13330 · doi:10.1088/1367-2630/acfab6
Abstract
Blind quantum computation (BQC) protocols enable quantum algorithms to be executed on third-party quantum agents while keeping the data and algorithm confidential. The previous proposals for measurement-based BQC require preparing a highly entangled cluster state. In this paper, we show that such a requirement is not necessary. Our protocol only requires pre-shared bell pairs between delegated quantum agents, and there is no requirement for any classical or quantum information exchange between agents during the execution. Our proposal requires fewer quantum resources than previous proposals by eliminating the need for a universal cluster state.
References in corpus (9)
- Prospects for Spin-Based Quantum Computing
- Measurement-based quantum computation beyond the one-way model
- Generalized Flow and Determinism in Measurement-based Quantum Computation
- Tensor Networks in a Nutshell
- Benchmarking gate-based quantum computers
- There and back again: A circuit extraction tale
- The ZX-calculus is incomplete for quantum mechanics
- Complete Flow-Preserving Rewrite Rules for MBQC Patterns with Pauli Measurements
- Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation