Asynchronous Multi-Party Quantum Computation
summary
Claims an asynchronous multi‑party quantum computation protocol that achieves statistical security and guaranteed output delivery up to a tight <1/4 corruption threshold, and proves impossibility above it. Construction builds verifiable quantum secret sharing from a new Weak Quantum Secret Sharing with weak termination, using EPR/teleportation on verifiably shared zero states, two‑layer polynomial sharing, authenticated shares and an expanded classical trusted‑party functionality that supports late checking so reconstruction can wait for n−t honest contributors and recombine at n−2t.
AI-written summary · about
chapters (4)
- 0:00Start
- 4:11Feasibility Outline: Secret Sharing
- 4:55Verifiable Quantum Secret Sharing (VQSS)
- 9:55Weak Quantum Secret Sharing with weak termination
related talks
12mOne-Way Functions Imply Secure Computation in a Quantum World
39mDelegated Quantum Computation from Sequential Games
41mOne-Way Functions Imply Secure Computation in a Quantum World
21mQuantum versus Randomized Communication Complexity, with Efficient Players
20mDistributed Quantum Proofs for Replicated Data
45mClassical Verification of Quantum Computational Advantage
39mBlind and Verifiable Quantum Computation
01h 06mQuantum Advantage Without Structure