Communication-Optimal Blind Quantum Protocols - REPO

Hi all, A little while ago, I mentioned our new paper describing how to perform communication-optimal blind quantum gate protocols. I’ve now put together a Jupyter notebook that lets you compute any communication-optimal blind quantum gate protocol, where Alice wants to blindly implement a gate from the set The notebook walks through a concrete example where Clifford circuit C That is, the first three qubits are cycled (0 → 1 → 2 → 0), and a Hadamard is applied to the fourth qubit (register 3). In this case, the minimum possible amount of quantum communication required by any blind gate protocol is 5 qubits — and the notebook constructs an explicit protocol achieving that bound. If Alice wants to implement the identity, she measures in the Z basis. If she wants to implement C, she measures in the X basis. At the end, there’s also a compact function that takes your own Clifford circuits (in Qiskit) and returns the corresponding blind optimal gate protocols (in Stim).

Optimal Blind Gate Protocol for C, Bob places his state in the bottom four registers, Alice receives the top five qubits and measures in either the Z or X basis. The notebook is still a work in progress — I plan to keep extending it. If there are features or examples you’d like to see added, I’d really appreciate any suggestions or feedback! Repo link: https://github.com/edaviesquantum/Communication-Optimal-Blind-Quantum-Computation submitted by /u/Blind_Quantum_Comp [link] [comments]