Work

Blind Quantum Computation with a Small Quantum Server

Year: 2026

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2609.20729

Authors: Lovsted, Daniel, Peres, Filipa C. R., Nevin, Joshua, Ipek, Selman, Broadbent, Anne

Institutions: University of Ottawa, Johannes Kepler University of Linz, Universidad de Granada, Kepler Universitätsklinikum, Leibniz University Hannover, Bilkent University

Language: English

Topic: Quantum Information and Cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Canada Research Chairs, Niedersächsisches Ministerium für Wissenschaft und Kultur, Natural Sciences and Engineering Research Council of Canada, Agencia Estatal de Investigación, HORIZON EUROPE European Research Council

Awards: G1175115578, quantum-enhanced shadows: scalable quantum-to-classical converters, G2262748287, G294895050, G300979063, G3480869486, G4124119072, G425668148, G4420308643, G5080475149, G7084143925, G72467074, G8522895693

OpenAlex ID: W7213578224

Cites:

Cited by:

Related to: 10