{"ID":23586788,"CreatedAt":"2026-09-18T05:25:32.833479871Z","UpdatedAt":"2026-09-18T05:25:32.833479871Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2609.20729","arxiv_id":"2609.20729","title":"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.","short_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...","url_abs":"https://arxiv.org/abs/2609.20729","url_pdf":"https://arxiv.org/pdf/2609.20729v1","authors":"[\"Daniel Lovsted\",\"Filipa C. R. Peres\",\"Joshua Nevin\",\"Selman Ipek\",\"Anne Broadbent\"]","published":"2026-09-17T17:21:47Z","proceeding":"quant-ph","tasks":"[\"quant-ph\"]","methods":"[]","has_code":false}