Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 40 min ago
PreprintCC BY 4.0arXiv

The Entire Quantum Computer on a Classical Leash

Abstract

We show that a classical client with no quantum hardware can use a single untrusted and potentially malicious quantum server as if it were its own trusted quantum computer. Through the server, the client can privately choose and run quantum computations, prepare quantum states, and process quantum states supplied by other parties. It can also keep quantum memory on the server, hidden from the server itself, and use that memory in later computations so its quantum state persists across rounds of interaction. Together, these capabilities let a purely classical party act as a quantum party in a variety of interactive protocols. We expect this virtual quantum computer to be a broadly useful tool. As immediate applications, we resolve two known open problems: (1) classical verification of quantum sampling with negligible computational soundness error, and (2) remote state preparation of arbitrary efficiently preparable quantum states. Underlying all of these results is a general-purpose, maliciously secure two-party computation protocol between a classical client and a quantum server, which we construct assuming only the post-quantum hardness of learning with errors.

Related

  1. On recent measurements of toponium threshold enhancement in entire-function-regulated nonlocal quantum field theory
    Ellis Thompson
    The European Physical Journal CPeer-reviewedCC BYFull text8 citedHigh-energy & particle physicsOpenAlex
  2. A collider as a quantum computer
    Wei Xie, Ji-Chong Yang
    Physics Letters BPeer-reviewedCC BY 4.0High-energy & particle physicsCrossref
  3. Discretisation of quantum feedback networks for implementation on a quantum computer
    Luc Bouten, John Gough
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  4. Quantum computers will not be that different: A blueprint for quantum computer architecture at scale
    Torsten Hoefler, Matthias Troyer
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  5. Dynamical Mean-Field Theory for Real Materials using Variational Quantum Compressed Time Evolution on a Quantum Computer
    Stefan Wolf, Johannes Selisko, Timo Eckstein +6
    arXivPreprintCC BY-NC-ND 4.0Full textCondensed matterQuantum physics & quantum informationarXiv
BibTeX
@misc{kalai2026entire,
  title = {{The Entire Quantum Computer on a Classical Leash}},
  author = {Yael Tauman Kalai and Dakshita Khurana and Justin Raizes},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.31775},
  eprint = {2610.31775},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.31775},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - The Entire Quantum Computer on a Classical Leash
AU  - Yael Tauman Kalai
AU  - Dakshita Khurana
AU  - Justin Raizes
PY  - 2026
DA  - 2026/10/22
PB  - arXiv
DO  - 10.48550/arxiv.2610.31775
UR  - https://arxiv.org/abs/2610.31775
AB  - We show that a classical client with no quantum hardware can use a single untrusted and potentially malicious quantum server as if it were its own trusted quantum computer. Through the server, the client can privately choose and run quantum computations, prepare quantum states, and process quantum states supplied by other parties. It can also keep quantum memory on the server, hidden from the server itself, and use that memory in later computations so its quantum state persists across rounds of interaction. Together, these capabilities let a purely classical party act as a quantum party in a variety of interactive protocols. We expect this virtual quantum computer to be a broadly useful tool. As immediate applications, we resolve two known open problems: (1) classical verification of quantum sampling with negligible computational soundness error, and (2) remote state preparation of arbitrary efficiently preparable quantum states. Underlying all of these results is a general-purpose, maliciously secure two-party computation protocol between a classical client and a quantum server, which we construct assuming only the post-quantum hardness of learning with errors.
ER  -