Multi-server blind quantum computation protocol with limited classical communication among servers

DOI10.1007/S11128-022-03430-YMaRDI QIDQ2107013zbMATH OpenOpenAlexFDO

Authors Yuichi Sano

Publication date 29 November 2022

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

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

zbMATH Keywords

quantum computationcomputation complexityquantum applicationquantum blind computing

Mathematics Subject Classification ID

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

Recommendations

• Equivalence of single-server and multiple-server blind quantum computation protocols
• Multi-server blind quantum computation over collective-noise channels
• Multiple-server flexible blind quantum computation in networks
• Secure quantum computation with classical communication
• Measurement-based universal blind quantum computation with minor resources

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?)
• Both Toffoli and Controlled-NOT need little help to universal quantum computing
• Fully homomorphic encryption using ideal lattices
• Interactive proofs for \(\mathsf{BQP}\) via self-tested graph states
• Quantum computation and quantum information. 10th anniversary edition
• Secure assisted quantum computation
• Universal Blind Quantum Computation

Cited in

(4)

• Half-blind quantum computation with operation teleportation
• Multi-server blind quantum computation over collective-noise channels
• Secure quantum computation with classical communication
• Equivalence of single-server and multiple-server blind quantum computation protocols

This page was built for publication: Multi-server blind quantum computation protocol with limited classical communication among servers

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