pith. sign in

arxiv: quant-ph/0111046 · v2 · pith:EJN3WLX5new · submitted 2001-11-07 · 🪐 quant-ph

Secure assisted quantum computation

classification 🪐 quant-ph
keywords computationalicequantumcannothelplearnperformuniversal
0
0 comments X
read the original abstract

Suppose Alice wants to perform some computation that could be done quickly on a quantum computer, but she cannot do universal quantum computation. Bob can do universal quantum computation and claims he is willing to help, but Alice wants to be sure that Bob cannot learn her input, the result of her calculation, or perhaps even the function she is trying to compute. We describe a simple, efficient protocol by which Bob can help Alice perform the computation, but there is no way for him to learn anything about it. We also discuss techniques for Alice to detect whether Bob is honestly helping her or if he is introducing errors.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Modular Quantum Network Architecture for Integrating Network Scheduling with Local Program Execution

    quant-ph 2025-03 unverdicted novelty 5.0

    The paper introduces a modular, hardware-agnostic architecture using entanglement packets for scheduling network operations in quantum networks to enable end-to-end entanglement generation integrated with local progra...