Equivalence of single-server and multiple-server blind quantum computation protocols

DOI10.1007/S11128-022-03812-2MaRDI QIDQ2686213zbMATH OpenOpenAlexFDO

Authors Yuichi Sano

Publication date 24 February 2023

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2106.05547

zbMATH Keywords

quantum blind computingquantum computationquantum encryptionsecurity of quantum computation

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Multi-server blind quantum computation protocol with limited classical communication among servers
• Multiple-server flexible blind quantum computation in networks
• Multi-server blind quantum computation over collective-noise channels
• Single-server blind quantum computation with quantum circuit model
• Universal blind quantum computation for hybrid system

Cites work

• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 7561499 (Why is no real title available?)
• Interactive proofs for \(\mathsf{BQP}\) via self-tested graph states
• Multi-server blind quantum computation protocol with limited classical communication among servers
• On hiding information from an oracle
• Secure assisted quantum computation
• Universal Blind Quantum Computation

Cited in

(2)

• Multi-server blind quantum computation protocol with limited classical communication among servers
• scientific article; zbMATH DE number 7561499 (Why is no real title available?)

This page was built for publication: Equivalence of single-server and multiple-server blind quantum computation protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2686213)