Efficient Synthesis of Universal Probabilistic Quantum Circuits

Techniques to efficiently compile high-level quantum algorithms into lower-level fault-tolerant cicuits are crucial for the implementation of a scalable quantum computer.

Several universal gate sets can be used for compilation, including Clifford+T, Clifford+K, and Clifford+V.

Date:
Speakers:
Krysta M. Svore
Affiliation:
Microsoft Research