Quantum Garbled Circuits

Understand

We present a garbling scheme for quantum circuits, thus achieving a decomposable randomized encoding scheme for quantum computation.

• Specifically, we show how to compute an encoding of a given quantum circuit and quantum input, from which it is possible to derive the output of the computation and nothing else.
• In the classical setting, garbled circuits (and randomized encodings in general) are a versatile cryptographic tool with many applications such as secure multiparty computation, delegated computation, depth-reduction of cryptographic primitives, complexity lower-bounds, and more.
• However, a quantum analogue for garbling general circuits was not known prior to this work.