Efficient Synthesis of Universal Probabilistic Quantum Circuits
- Krysta M. Svore | Microsoft Research
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.
-
-
Krysta M. Svore
General Manager
-
-
Regardez suivant
-
Assisted Algorithms
- Yuri Gurevich,
- Nikolaj Bjørner
-
Aegon: Self-Auditable Key Transparency
- Hossein Hafezi,
- Kim Laine
-
-
KITE: a Kinesthetic Interface for Tangible Exploration
- Elizabeth Childs,
- Sumit Basu,
- Scott Saponas
-
-
-
Sparrow Studio Tutorial - Ep 1. - What is Sparrow Studio?
- Carl Chalmers,
- Bruno Demuro Segundo,
- Zhongqi Miao
-
-
-
