PreprintarXiv licencearXiv
Blind Quantum Computation with a Small Quantum Server
Abstract
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.
Related
- High-Fidelity Remote Graph State Preparation for Blind Quantum Computation
- One-Way Quantum Symmetric Private Information Retrieval Protocol From A Single Database Server Using NISQ Devices
- Fault-tolerant quantum computation with static atomic buses
- Subdimensional linear-optical quantum computation: from qudit resource states to qubit quantum computation
- Entanglement cost in non-local quantum computation
BibTeX
@misc{lovsted2026blind,
title = {{Blind Quantum Computation with a Small Quantum Server}},
author = {Daniel Lovsted and Filipa C. R. Peres and Joshua Nevin and Selman Ipek and Anne Broadbent},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.20729},
eprint = {2609.20729},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.20729},
}
RIS
TY - UNPB
TI - Blind Quantum Computation with a Small Quantum Server
AU - Daniel Lovsted
AU - Filipa C. R. Peres
AU - Joshua Nevin
AU - Selman Ipek
AU - Anne Broadbent
PY - 2026
DA - 2026/09/17
PB - arXiv
DO - 10.48550/arxiv.2609.20729
UR - https://arxiv.org/abs/2609.20729
AB - 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.
ER -