Blind Quantum Computation with a Small Quantum Server

Blind quantum computation (BQC) allows low-resource clients to securely delegate computations to a quantum server, but server resource costs scale with the computation size, posing a bottleneck for implementations. By leveraging Pauli-based computation (PBC), we achieve BQC with a server whose size depends only on the non-Clifford gate count. Our protocol inherits fault tolerance and qubit virtualization from PBC and reveals that classical-client BQC is possible even in the absence of classical simulability. Finally, we present an entanglement-based dual protocol that performs a resource state computation with a dramatically reduced execution cost.

Source: arXiv:2609.20729v1 - http://arxiv.org/abs/2609.20729v1 PDF: https://arxiv.org/pdf/2609.20729v1 Original Link: http://arxiv.org/abs/2609.20729v1