Blind and Verifiable Quantum Computation
summary
Delegation protocol encodes a measurement-based quantum computation on a brickwork state: the client prepares single-qubit rotations (plus random Z flips) and sends them; the server entangles into the brickwork, measures in the X,Y plane with client-supplied angles (deltas), and returns bits. Blindness holds except for circuit dimensions because each server-side qubit and angle is effectively maximally mixed. Verification inserts a random disentangled trap qubit (wraps the brickwork on a cylinder) yielding a detection probability at least 1/n (or 1/2n for quantum output).
AI-written summary · about
chapters (8)
- 0:00Introduction
- 4:28Graph states
- 6:37Brickwork state
- 11:30Blind protocol
- 17:36Formalizing blindness
- 22:25Verifiable computing
- 29:47Open problems
- 34:09Q&A session
related talks
23mSelf-testing of a single quantum device under computational assumptions
45mClassical Verification of Quantum Computational Advantage
16mQuantum Information Meets Cryptography
16mAsynchronous Multi-Party Quantum Computation
32mBeating Classical Impossibility of Position Verification
44mDevice-Independent Protocols From Computational Assumptions
01h 00mQuantum Physics for Software Developers
31mDemonstrating an Unconditional Separation Between Quantum and Classical Information Resources